{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2G4NYJWLL3PASRB6IJM7ZMIUIJ","short_pith_number":"pith:2G4NYJWL","schema_version":"1.0","canonical_sha256":"d1b8dc26cb5ede09443e4259fcb114427ae63523372fa88b75ea0d4d85c05506","source":{"kind":"arxiv","id":"1606.07614","version":1},"attestation_state":"computed","paper":{"title":"An Upper Bound on Burning Number of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Linyuan Lu, Max Land","submitted_at":"2016-06-24T09:24:41Z","abstract_excerpt":"The burning number $b(G)$ of a graph $G$ was introduced by Bonato, Janssen, and Roshanbin [Lecture Notes in Computer Science 8882 (2014)] for measuring the speed of the spread of contagion in a graph. They proved for any connected graph $G$ of order $n$, $b(G)\\leq 2\\lceil \\sqrt{n} \\rceil-1$, and conjectured that $b(G)\\leq \\lceil \\sqrt{n} \\rceil$. In this paper, we proved $b(G)\\leq \\lceil\\frac{-3+\\sqrt{24n+33}}{4}\\rceil$, which is roughly $\\frac{\\sqrt{6}}{2}\\sqrt{n}$. We also settled the following conjecture of Bonato-Janssen-Roshanbin: $b(G)b(\\bar G)\\leq n+4$ provided both $G$ and $\\bar G$ are"},"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":"1606.07614","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-24T09:24:41Z","cross_cats_sorted":[],"title_canon_sha256":"98646900793246505242f8a73d27ee99088e50962527e4b1a55e7dd167ba56ca","abstract_canon_sha256":"27c5f83ebfc905c02c2cfbe6e9156f0d4d5e216b34cac7081e1c9f8c97cc2520"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:57.121472Z","signature_b64":"9uIkJ7jJ1JcLGcaOpf3pQUH82ObjAEknLHE2/F2Qn5m5EePnByIpNRS3HCX7XA7JDSYTbkehWWivIMDu0hMEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1b8dc26cb5ede09443e4259fcb114427ae63523372fa88b75ea0d4d85c05506","last_reissued_at":"2026-05-18T01:11:57.121122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:57.121122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Upper Bound on Burning Number of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Linyuan Lu, Max Land","submitted_at":"2016-06-24T09:24:41Z","abstract_excerpt":"The burning number $b(G)$ of a graph $G$ was introduced by Bonato, Janssen, and Roshanbin [Lecture Notes in Computer Science 8882 (2014)] for measuring the speed of the spread of contagion in a graph. They proved for any connected graph $G$ of order $n$, $b(G)\\leq 2\\lceil \\sqrt{n} \\rceil-1$, and conjectured that $b(G)\\leq \\lceil \\sqrt{n} \\rceil$. In this paper, we proved $b(G)\\leq \\lceil\\frac{-3+\\sqrt{24n+33}}{4}\\rceil$, which is roughly $\\frac{\\sqrt{6}}{2}\\sqrt{n}$. We also settled the following conjecture of Bonato-Janssen-Roshanbin: $b(G)b(\\bar G)\\leq n+4$ provided both $G$ and $\\bar G$ are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07614","kind":"arxiv","version":1},"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":"1606.07614","created_at":"2026-05-18T01:11:57.121182+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.07614v1","created_at":"2026-05-18T01:11:57.121182+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07614","created_at":"2026-05-18T01:11:57.121182+00:00"},{"alias_kind":"pith_short_12","alias_value":"2G4NYJWLL3PA","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2G4NYJWLL3PASRB6","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2G4NYJWL","created_at":"2026-05-18T12:29:55.572404+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/2G4NYJWLL3PASRB6IJM7ZMIUIJ","json":"https://pith.science/pith/2G4NYJWLL3PASRB6IJM7ZMIUIJ.json","graph_json":"https://pith.science/api/pith-number/2G4NYJWLL3PASRB6IJM7ZMIUIJ/graph.json","events_json":"https://pith.science/api/pith-number/2G4NYJWLL3PASRB6IJM7ZMIUIJ/events.json","paper":"https://pith.science/paper/2G4NYJWL"},"agent_actions":{"view_html":"https://pith.science/pith/2G4NYJWLL3PASRB6IJM7ZMIUIJ","download_json":"https://pith.science/pith/2G4NYJWLL3PASRB6IJM7ZMIUIJ.json","view_paper":"https://pith.science/paper/2G4NYJWL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.07614&json=true","fetch_graph":"https://pith.science/api/pith-number/2G4NYJWLL3PASRB6IJM7ZMIUIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/2G4NYJWLL3PASRB6IJM7ZMIUIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2G4NYJWLL3PASRB6IJM7ZMIUIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2G4NYJWLL3PASRB6IJM7ZMIUIJ/action/storage_attestation","attest_author":"https://pith.science/pith/2G4NYJWLL3PASRB6IJM7ZMIUIJ/action/author_attestation","sign_citation":"https://pith.science/pith/2G4NYJWLL3PASRB6IJM7ZMIUIJ/action/citation_signature","submit_replication":"https://pith.science/pith/2G4NYJWLL3PASRB6IJM7ZMIUIJ/action/replication_record"}},"created_at":"2026-05-18T01:11:57.121182+00:00","updated_at":"2026-05-18T01:11:57.121182+00:00"}