SPB Git

spb/wp32_uqo

Public

WP32: drop 'Sharp' from the title

Co-Authored-By: Claude Fable 5.1 <noreply@anthropic.com>
Simon-Pierre Boucher committed (Oct 31, 2026) parent e6146f9 Browse files

4 changed files +6 −6

modified CITATION.cff +1 −1
@@ -1,6 +1,6 @@
1 cff-version: 1.2.0 1 cff-version: 1.2.0
2 message: "If you use this paper, code or certificates, please cite it as below." 2 message: "If you use this paper, code or certificates, please cite it as below."
3−title: "Sharp Zero-Forcing Bounds for Generalized Petersen Graphs: Computational Discovery and Certified Proofs for P(n,5) (UQO Working Paper 32)" 3+title: "Zero-Forcing Bounds for Generalized Petersen Graphs: Computational Discovery and Certified Proofs for P(n,5) (UQO Working Paper 32)"
4 authors: 4 authors:
5 - family-names: Boucher 5 - family-names: Boucher
6 given-names: Simon-Pierre 6 given-names: Simon-Pierre
modified README.md +2 −2
@@ -1,5 +1,5 @@
1 <!-- Author: Simon-Pierre Boucher — simon-pierre.boucher@uqo.ca --> 1 <!-- Author: Simon-Pierre Boucher — simon-pierre.boucher@uqo.ca -->
2−# 🔗 Sharp Zero-Forcing Bounds for Generalized Petersen Graphs 2+# 🔗 Zero-Forcing Bounds for Generalized Petersen Graphs
3 3
4 **UQO Working Paper No. 32** — *Computational Discovery and Certified Proofs for P(n,5)* 4 **UQO Working Paper No. 32** — *Computational Discovery and Certified Proofs for P(n,5)*
5 5
@@ -138,7 +138,7 @@ Tables (`paper/tables/`): `tab_paths` (lower-bound paths per n), `tab_brute_forc
138 ```bibtex 138 ```bibtex
139 @techreport{boucher2026zeroforcing, 139 @techreport{boucher2026zeroforcing,
140 author = {Boucher, Simon-Pierre}, 140 author = {Boucher, Simon-Pierre},
141− title = {Sharp Zero-Forcing Bounds for Generalized Petersen Graphs: Computational Discovery and Certified Proofs for $P(n,5)$}, 141+ title = {Zero-Forcing Bounds for Generalized Petersen Graphs: Computational Discovery and Certified Proofs for $P(n,5)$},
142 institution = {Universit\'e du Qu\'ebec en Outaouais, D\'epartement des sciences administratives}, 142 institution = {Universit\'e du Qu\'ebec en Outaouais, D\'epartement des sciences administratives},
143 type = {Working Paper}, 143 type = {Working Paper},
144 number = {32}, 144 number = {32},
modified paper/main.pdf +0 −0

Binary file not shown.

modified paper/main.tex +3 −3
@@ -1,5 +1,5 @@
1 % ============================================================================ 1 % ============================================================================
2−% UQO Working Paper 32 — Sharp Zero-Forcing Bounds for Generalized Petersen Graphs 2+% UQO Working Paper 32 — Zero-Forcing Bounds for Generalized Petersen Graphs
3 % Retypeset from AutoScholar Working Paper AS-WP-2026-0001 (v1, 2026-10-30) 3 % Retypeset from AutoScholar Working Paper AS-WP-2026-0001 (v1, 2026-10-30)
4 % ============================================================================ 4 % ============================================================================
5 \documentclass[12pt,letterpaper]{article} 5 \documentclass[12pt,letterpaper]{article}
@@ -41,7 +41,7 @@
41 % --- Colors & Links --- 41 % --- Colors & Links ---
42 \usepackage[dvipsnames]{xcolor} 42 \usepackage[dvipsnames]{xcolor}
43 \usepackage[colorlinks=true,linkcolor=NavyBlue,citecolor=NavyBlue,urlcolor=NavyBlue,breaklinks=true]{hyperref} 43 \usepackage[colorlinks=true,linkcolor=NavyBlue,citecolor=NavyBlue,urlcolor=NavyBlue,breaklinks=true]{hyperref}
44−\hypersetup{pdftitle={Sharp Zero-Forcing Bounds for Generalized Petersen Graphs: Computational Discovery and Certified Proofs for P(n,5)},pdfauthor={Simon-Pierre Boucher}} 44+\hypersetup{pdftitle={Zero-Forcing Bounds for Generalized Petersen Graphs: Computational Discovery and Certified Proofs for P(n,5)},pdfauthor={Simon-Pierre Boucher}}
45 \makeatletter\g@addto@macro{\UrlBreaks}{\UrlOrds}\makeatother % line breaks inside file paths 45 \makeatletter\g@addto@macro{\UrlBreaks}{\UrlOrds}\makeatother % line breaks inside file paths
46 46
47 % --- Bibliography --- 47 % --- Bibliography ---
@@ -104,7 +104,7 @@
104 % METADATA 104 % METADATA
105 % ============================================================================ 105 % ============================================================================
106 \newcommand{\WPnumber}{32} 106 \newcommand{\WPnumber}{32}
107−\newcommand{\WPtitle}{Sharp Zero-Forcing Bounds for Generalized Petersen Graphs} 107+\newcommand{\WPtitle}{Zero-Forcing Bounds for Generalized Petersen Graphs}
108 \newcommand{\WPsubtitle}{Computational Discovery and Certified Proofs for $P(n,5)$} 108 \newcommand{\WPsubtitle}{Computational Discovery and Certified Proofs for $P(n,5)$}
109 \newcommand{\WPdate}{October 2026} 109 \newcommand{\WPdate}{October 2026}
110 \newcommand{\WPversion}{1.0} 110 \newcommand{\WPversion}{1.0}
111 111
Menu

Theme