{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VQTGDS4VQADKSSL6PH4QPBVNGD","short_pith_number":"pith:VQTGDS4V","schema_version":"1.0","canonical_sha256":"ac2661cb958006a9497e79f90786ad30e05f5f183f49c834947899974b84f0ca","source":{"kind":"arxiv","id":"1511.06023","version":2},"attestation_state":"computed","paper":{"title":"Bounds on the Burning Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anthony Bonato, Dieter Rautenbach, Jeannette Janssen, St\\'ephane Bessy","submitted_at":"2015-11-18T23:30:01Z","abstract_excerpt":"Motivated by a graph theoretic process intended to measure the speed of the spread of contagion in a graph, Bonato, Janssen, and Roshanbin [Burning a Graph as a Model of Social Contagion, Lecture Notes in Computer Science 8882 (2014) 13-22] define the burning number $b(G)$ of a graph $G$ as the smallest integer $k$ for which there are vertices $x_1,\\ldots,x_k$ such that for every vertex $u$ of $G$, there is some $i\\in \\{ 1,\\ldots,k\\}$ with ${\\rm dist}_G(u,x_i)\\leq k-i$, and ${\\rm dist}_G(x_i,x_j)\\geq j-i$ for every $i,j\\in \\{ 1,\\ldots,k\\}$.\n  For a connected graph $G$ of order $n$, they prove "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1511.06023","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-18T23:30:01Z","cross_cats_sorted":[],"title_canon_sha256":"e3859e71936dc5c72d35ee8ba4471a6ab62c5585906d94ba1a03722a720b28d4","abstract_canon_sha256":"f3bf0fc1f6e30bd74e6291e75900fdb0f888a62639fa94208de123b900dbab7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:40.131849Z","signature_b64":"6PrrqC8X+2isY+V95TXhNSBdytaiLflgZr+mc+UISajCOnB0KahhCszckyUq/iN57FqqZ2esK5IvxTE/Inp+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac2661cb958006a9497e79f90786ad30e05f5f183f49c834947899974b84f0ca","last_reissued_at":"2026-05-18T01:00:40.131269Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:40.131269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on the Burning Number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anthony Bonato, Dieter Rautenbach, Jeannette Janssen, St\\'ephane Bessy","submitted_at":"2015-11-18T23:30:01Z","abstract_excerpt":"Motivated by a graph theoretic process intended to measure the speed of the spread of contagion in a graph, Bonato, Janssen, and Roshanbin [Burning a Graph as a Model of Social Contagion, Lecture Notes in Computer Science 8882 (2014) 13-22] define the burning number $b(G)$ of a graph $G$ as the smallest integer $k$ for which there are vertices $x_1,\\ldots,x_k$ such that for every vertex $u$ of $G$, there is some $i\\in \\{ 1,\\ldots,k\\}$ with ${\\rm dist}_G(u,x_i)\\leq k-i$, and ${\\rm dist}_G(x_i,x_j)\\geq j-i$ for every $i,j\\in \\{ 1,\\ldots,k\\}$.\n  For a connected graph $G$ of order $n$, they prove "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06023","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.06023","created_at":"2026-05-18T01:00:40.131366+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.06023v2","created_at":"2026-05-18T01:00:40.131366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06023","created_at":"2026-05-18T01:00:40.131366+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQTGDS4VQADK","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQTGDS4VQADKSSL6","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQTGDS4V","created_at":"2026-05-18T12:29:47.479230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VQTGDS4VQADKSSL6PH4QPBVNGD","json":"https://pith.science/pith/VQTGDS4VQADKSSL6PH4QPBVNGD.json","graph_json":"https://pith.science/api/pith-number/VQTGDS4VQADKSSL6PH4QPBVNGD/graph.json","events_json":"https://pith.science/api/pith-number/VQTGDS4VQADKSSL6PH4QPBVNGD/events.json","paper":"https://pith.science/paper/VQTGDS4V"},"agent_actions":{"view_html":"https://pith.science/pith/VQTGDS4VQADKSSL6PH4QPBVNGD","download_json":"https://pith.science/pith/VQTGDS4VQADKSSL6PH4QPBVNGD.json","view_paper":"https://pith.science/paper/VQTGDS4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.06023&json=true","fetch_graph":"https://pith.science/api/pith-number/VQTGDS4VQADKSSL6PH4QPBVNGD/graph.json","fetch_events":"https://pith.science/api/pith-number/VQTGDS4VQADKSSL6PH4QPBVNGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQTGDS4VQADKSSL6PH4QPBVNGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQTGDS4VQADKSSL6PH4QPBVNGD/action/storage_attestation","attest_author":"https://pith.science/pith/VQTGDS4VQADKSSL6PH4QPBVNGD/action/author_attestation","sign_citation":"https://pith.science/pith/VQTGDS4VQADKSSL6PH4QPBVNGD/action/citation_signature","submit_replication":"https://pith.science/pith/VQTGDS4VQADKSSL6PH4QPBVNGD/action/replication_record"}},"created_at":"2026-05-18T01:00:40.131366+00:00","updated_at":"2026-05-18T01:00:40.131366+00:00"}