{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2G4NYJWLL3PASRB6IJM7ZMIUIJ","short_pith_number":"pith:2G4NYJWL","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"},"canonical_sha256":"d1b8dc26cb5ede09443e4259fcb114427ae63523372fa88b75ea0d4d85c05506","source":{"kind":"arxiv","id":"1606.07614","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07614","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07614v1","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07614","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"2G4NYJWLL3PA","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2G4NYJWLL3PASRB6","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2G4NYJWL","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2G4NYJWLL3PASRB6IJM7ZMIUIJ","target":"record","payload":{"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"},"canonical_sha256":"d1b8dc26cb5ede09443e4259fcb114427ae63523372fa88b75ea0d4d85c05506","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"},"source_kind":"arxiv","source_id":"1606.07614","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"94ibnecdNlzGIWoubkixVC1UDd5j4nhG5YgZuLhgChVdYfZ/3WkZAAsquT5U+rdaOy82WA/PQqYe/g/00KdtBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:34:02.102044Z"},"content_sha256":"abd825e25e4699898fa67b7bd57c3f5f83ff18906511c8c03d05c73752b4c828","schema_version":"1.0","event_id":"sha256:abd825e25e4699898fa67b7bd57c3f5f83ff18906511c8c03d05c73752b4c828"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2G4NYJWLL3PASRB6IJM7ZMIUIJ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:11:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/4l4zPzRcvd3Ds/cJ5eV3P2B4WWEDZoN5Hw+ls3+JmBbb/UByg/SWSBHAKTmo2iNtY56dCbGgC5Q73s0Lw/9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:34:02.102405Z"},"content_sha256":"bf3fe1ad52fdaa8c9e8b929e88ded7315ca9061b52fefb7c4eac3da672e9ea6c","schema_version":"1.0","event_id":"sha256:bf3fe1ad52fdaa8c9e8b929e88ded7315ca9061b52fefb7c4eac3da672e9ea6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2G4NYJWLL3PASRB6IJM7ZMIUIJ/bundle.json","state_url":"https://pith.science/pith/2G4NYJWLL3PASRB6IJM7ZMIUIJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2G4NYJWLL3PASRB6IJM7ZMIUIJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T12:34:02Z","links":{"resolver":"https://pith.science/pith/2G4NYJWLL3PASRB6IJM7ZMIUIJ","bundle":"https://pith.science/pith/2G4NYJWLL3PASRB6IJM7ZMIUIJ/bundle.json","state":"https://pith.science/pith/2G4NYJWLL3PASRB6IJM7ZMIUIJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2G4NYJWLL3PASRB6IJM7ZMIUIJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2G4NYJWLL3PASRB6IJM7ZMIUIJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"27c5f83ebfc905c02c2cfbe6e9156f0d4d5e216b34cac7081e1c9f8c97cc2520","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-24T09:24:41Z","title_canon_sha256":"98646900793246505242f8a73d27ee99088e50962527e4b1a55e7dd167ba56ca"},"schema_version":"1.0","source":{"id":"1606.07614","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07614","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07614v1","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07614","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"2G4NYJWLL3PA","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2G4NYJWLL3PASRB6","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2G4NYJWL","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:bf3fe1ad52fdaa8c9e8b929e88ded7315ca9061b52fefb7c4eac3da672e9ea6c","target":"graph","created_at":"2026-05-18T01:11:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Linyuan Lu, Max Land","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-24T09:24:41Z","title":"An Upper Bound on Burning Number of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07614","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:abd825e25e4699898fa67b7bd57c3f5f83ff18906511c8c03d05c73752b4c828","target":"record","created_at":"2026-05-18T01:11:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"27c5f83ebfc905c02c2cfbe6e9156f0d4d5e216b34cac7081e1c9f8c97cc2520","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-24T09:24:41Z","title_canon_sha256":"98646900793246505242f8a73d27ee99088e50962527e4b1a55e7dd167ba56ca"},"schema_version":"1.0","source":{"id":"1606.07614","kind":"arxiv","version":1}},"canonical_sha256":"d1b8dc26cb5ede09443e4259fcb114427ae63523372fa88b75ea0d4d85c05506","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1b8dc26cb5ede09443e4259fcb114427ae63523372fa88b75ea0d4d85c05506","first_computed_at":"2026-05-18T01:11:57.121122Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:57.121122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9uIkJ7jJ1JcLGcaOpf3pQUH82ObjAEknLHE2/F2Qn5m5EePnByIpNRS3HCX7XA7JDSYTbkehWWivIMDu0hMEDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:57.121472Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.07614","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abd825e25e4699898fa67b7bd57c3f5f83ff18906511c8c03d05c73752b4c828","sha256:bf3fe1ad52fdaa8c9e8b929e88ded7315ca9061b52fefb7c4eac3da672e9ea6c"],"state_sha256":"6e5d0b1fde2f9aa9e12c9394f5dc74b106ea9e37ff3fc194dda8e61083d8db7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C5e1hzUlZkxJiH0WhxWG/eO/rJdPGKxGBPPi/rk9Ehfc2W9TWw/lHWntOFtUH5JKz3wZdGjjAP/uhCUlpkxAAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T12:34:02.104365Z","bundle_sha256":"40a844d38c5c2f2782759be294a8644befd7c73cf9f55d4b4ea0535355ef22a8"}}