{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:YTNXBAFJZRTFHWORUU5GZJ7FB6","short_pith_number":"pith:YTNXBAFJ","canonical_record":{"source":{"id":"1102.3016","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-15T09:55:38Z","cross_cats_sorted":[],"title_canon_sha256":"50d4e0f386945c347e5f9ac81fe5cc0cb793d8c1af09ae907638f9f39b82abc0","abstract_canon_sha256":"f8058598c48ce5021b3eec1af18aa50f52c7c69aebcb7d4a1ceaad8d857e233d"},"schema_version":"1.0"},"canonical_sha256":"c4db7080a9cc6653d9d1a53a6ca7e50f8eeea9e96db88f8cdc3f1b5e7a011376","source":{"kind":"arxiv","id":"1102.3016","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3016","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3016v4","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3016","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"pith_short_12","alias_value":"YTNXBAFJZRTF","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YTNXBAFJZRTFHWOR","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YTNXBAFJ","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:YTNXBAFJZRTFHWORUU5GZJ7FB6","target":"record","payload":{"canonical_record":{"source":{"id":"1102.3016","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-15T09:55:38Z","cross_cats_sorted":[],"title_canon_sha256":"50d4e0f386945c347e5f9ac81fe5cc0cb793d8c1af09ae907638f9f39b82abc0","abstract_canon_sha256":"f8058598c48ce5021b3eec1af18aa50f52c7c69aebcb7d4a1ceaad8d857e233d"},"schema_version":"1.0"},"canonical_sha256":"c4db7080a9cc6653d9d1a53a6ca7e50f8eeea9e96db88f8cdc3f1b5e7a011376","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:35.333797Z","signature_b64":"Vx3sN8qagEJ9KrSDvM4TWENAR4DASB0bb9524rrRFzhFgGxjA3QYt/hIZhwXbiTgU8vx4Tga/+DwLoJuaWD7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4db7080a9cc6653d9d1a53a6ca7e50f8eeea9e96db88f8cdc3f1b5e7a011376","last_reissued_at":"2026-05-18T03:25:35.333000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:35.333000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.3016","source_version":4,"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-18T03:25:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9OAFf+zc7pcDQyxszjyQo6n2u6UJ59w5Uf7sCKu4vwBCPmxzWhFr1V6NDO5BvCg/rgBOI2SG+1QUk/1Ii1QmBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:55:03.514770Z"},"content_sha256":"1a90e796104e81146a5c12ac723a3cc1994b88883271248a43a6a57afbd59c2b","schema_version":"1.0","event_id":"sha256:1a90e796104e81146a5c12ac723a3cc1994b88883271248a43a6a57afbd59c2b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:YTNXBAFJZRTFHWORUU5GZJ7FB6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fire Containment in Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"F\\'elix Sipma, Fr\\'ed\\'eric Maffray, Jan van den Heuvel, Louis Esperet","submitted_at":"2011-02-15T09:55:38Z","abstract_excerpt":"In a graph $G$, a fire starts at some vertex. At every time step, firefighters can protect up to $k$ vertices, and then the fire spreads to all unprotected neighbours. The $k$-surviving rate $\\rho_k(G)$ of $G$ is the expectation of the proportion of vertices that can be saved from the fire, if the starting vertex of the fire is chosen uniformly at random. For a given class of graphs $\\cG$ we are interested in the minimum value $k$ such that $\\rho_k(G)\\ge\\epsilon$ for some constant $\\epsilon>0$ and all $G\\in\\cG$ i.e., such that linearly many vertices are expected to be saved in every graph from"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3016","kind":"arxiv","version":4},"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-18T03:25:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"97ERA2vflH68Ozi5a9LMinq7TVYGLCy4qavPXDIc1S94h8E0ZqkSprNJC+pCCqW3ecVN0AZkGovd3PdAK8dbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:55:03.515111Z"},"content_sha256":"d48f766785ce96af06a3666ff78025a62a8bfb19f37f2f7116e447937d59cbb0","schema_version":"1.0","event_id":"sha256:d48f766785ce96af06a3666ff78025a62a8bfb19f37f2f7116e447937d59cbb0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YTNXBAFJZRTFHWORUU5GZJ7FB6/bundle.json","state_url":"https://pith.science/pith/YTNXBAFJZRTFHWORUU5GZJ7FB6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YTNXBAFJZRTFHWORUU5GZJ7FB6/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-05-31T03:55:03Z","links":{"resolver":"https://pith.science/pith/YTNXBAFJZRTFHWORUU5GZJ7FB6","bundle":"https://pith.science/pith/YTNXBAFJZRTFHWORUU5GZJ7FB6/bundle.json","state":"https://pith.science/pith/YTNXBAFJZRTFHWORUU5GZJ7FB6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YTNXBAFJZRTFHWORUU5GZJ7FB6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:YTNXBAFJZRTFHWORUU5GZJ7FB6","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":"f8058598c48ce5021b3eec1af18aa50f52c7c69aebcb7d4a1ceaad8d857e233d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-15T09:55:38Z","title_canon_sha256":"50d4e0f386945c347e5f9ac81fe5cc0cb793d8c1af09ae907638f9f39b82abc0"},"schema_version":"1.0","source":{"id":"1102.3016","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.3016","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"arxiv_version","alias_value":"1102.3016v4","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.3016","created_at":"2026-05-18T03:25:35Z"},{"alias_kind":"pith_short_12","alias_value":"YTNXBAFJZRTF","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"YTNXBAFJZRTFHWOR","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"YTNXBAFJ","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:d48f766785ce96af06a3666ff78025a62a8bfb19f37f2f7116e447937d59cbb0","target":"graph","created_at":"2026-05-18T03:25:35Z","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":"In a graph $G$, a fire starts at some vertex. At every time step, firefighters can protect up to $k$ vertices, and then the fire spreads to all unprotected neighbours. The $k$-surviving rate $\\rho_k(G)$ of $G$ is the expectation of the proportion of vertices that can be saved from the fire, if the starting vertex of the fire is chosen uniformly at random. For a given class of graphs $\\cG$ we are interested in the minimum value $k$ such that $\\rho_k(G)\\ge\\epsilon$ for some constant $\\epsilon>0$ and all $G\\in\\cG$ i.e., such that linearly many vertices are expected to be saved in every graph from","authors_text":"F\\'elix Sipma, Fr\\'ed\\'eric Maffray, Jan van den Heuvel, Louis Esperet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-15T09:55:38Z","title":"Fire Containment in Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.3016","kind":"arxiv","version":4},"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:1a90e796104e81146a5c12ac723a3cc1994b88883271248a43a6a57afbd59c2b","target":"record","created_at":"2026-05-18T03:25:35Z","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":"f8058598c48ce5021b3eec1af18aa50f52c7c69aebcb7d4a1ceaad8d857e233d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-15T09:55:38Z","title_canon_sha256":"50d4e0f386945c347e5f9ac81fe5cc0cb793d8c1af09ae907638f9f39b82abc0"},"schema_version":"1.0","source":{"id":"1102.3016","kind":"arxiv","version":4}},"canonical_sha256":"c4db7080a9cc6653d9d1a53a6ca7e50f8eeea9e96db88f8cdc3f1b5e7a011376","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4db7080a9cc6653d9d1a53a6ca7e50f8eeea9e96db88f8cdc3f1b5e7a011376","first_computed_at":"2026-05-18T03:25:35.333000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:35.333000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vx3sN8qagEJ9KrSDvM4TWENAR4DASB0bb9524rrRFzhFgGxjA3QYt/hIZhwXbiTgU8vx4Tga/+DwLoJuaWD7Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:35.333797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.3016","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a90e796104e81146a5c12ac723a3cc1994b88883271248a43a6a57afbd59c2b","sha256:d48f766785ce96af06a3666ff78025a62a8bfb19f37f2f7116e447937d59cbb0"],"state_sha256":"099fde219cb9f9f1be06008ab9c261a2e6bad1b5a2a6a47d7424d622e7df056e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2QS0mrsbr2yFeJFXqJVbbn6WZdNaDI68oHkA2oy6S5SdajrgrMvowHv/o9h8FskVLR7dJty2VXQkZyZhQAl+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:55:03.517026Z","bundle_sha256":"4739f028d72abd7700362ce6e4e9628015648e1ebf28001ee589bcbdb2d87425"}}