{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LXS7FYAEELYQ6UOPZVEL3XYA4M","short_pith_number":"pith:LXS7FYAE","schema_version":"1.0","canonical_sha256":"5de5f2e00422f10f51cfcd48bddf00e308ed09e83ee9ba0e64c3519223b3776f","source":{"kind":"arxiv","id":"1901.07842","version":2},"attestation_state":"computed","paper":{"title":"The Firebreak Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrea C. Burgess, Brady Ryan, David A. Pike, Jared Howell, Jessica Enright, Kathleen D. Barnetson","submitted_at":"2019-01-23T12:16:41Z","abstract_excerpt":"Suppose we have a network that is represented by a graph $G$. Potentially a fire (or other type of contagion) might erupt at some vertex of $G$. We are able to respond to this outbreak by establishing a firebreak at $k$ other vertices of $G$, so that the fire cannot pass through these fortified vertices. The question that now arises is which $k$ vertices will result in the greatest number of vertices being saved from the fire, assuming that the fire will spread to every vertex that is not fully behind the $k$ vertices of the firebreak. This is the essence of the {\\sc Firebreak} decision proble"},"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":"1901.07842","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-01-23T12:16:41Z","cross_cats_sorted":[],"title_canon_sha256":"3fadf840b24fcbdc7e2896279c3041d829a2934bd1bf23a1c02caff49e0612c6","abstract_canon_sha256":"1db99f6904cb14e5354e9a56ab80c553ef344d49f8a364e0ddc1a51623afcd3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:28:59.344633Z","signature_b64":"tj/Z/dXI8A9hL5hdXUfDFsQaXfkQSgdXCo8jY1mkWTU8egdkxxK4C6w1awsWDv7NM4nRCp6ID1ZYlqcWvllmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5de5f2e00422f10f51cfcd48bddf00e308ed09e83ee9ba0e64c3519223b3776f","last_reissued_at":"2026-07-05T01:28:59.344222Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:28:59.344222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Firebreak Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrea C. Burgess, Brady Ryan, David A. Pike, Jared Howell, Jessica Enright, Kathleen D. Barnetson","submitted_at":"2019-01-23T12:16:41Z","abstract_excerpt":"Suppose we have a network that is represented by a graph $G$. Potentially a fire (or other type of contagion) might erupt at some vertex of $G$. We are able to respond to this outbreak by establishing a firebreak at $k$ other vertices of $G$, so that the fire cannot pass through these fortified vertices. The question that now arises is which $k$ vertices will result in the greatest number of vertices being saved from the fire, assuming that the fire will spread to every vertex that is not fully behind the $k$ vertices of the firebreak. This is the essence of the {\\sc Firebreak} decision proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07842","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1901.07842/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1901.07842","created_at":"2026-07-05T01:28:59.344278+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.07842v2","created_at":"2026-07-05T01:28:59.344278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07842","created_at":"2026-07-05T01:28:59.344278+00:00"},{"alias_kind":"pith_short_12","alias_value":"LXS7FYAEELYQ","created_at":"2026-07-05T01:28:59.344278+00:00"},{"alias_kind":"pith_short_16","alias_value":"LXS7FYAEELYQ6UOP","created_at":"2026-07-05T01:28:59.344278+00:00"},{"alias_kind":"pith_short_8","alias_value":"LXS7FYAE","created_at":"2026-07-05T01:28:59.344278+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/LXS7FYAEELYQ6UOPZVEL3XYA4M","json":"https://pith.science/pith/LXS7FYAEELYQ6UOPZVEL3XYA4M.json","graph_json":"https://pith.science/api/pith-number/LXS7FYAEELYQ6UOPZVEL3XYA4M/graph.json","events_json":"https://pith.science/api/pith-number/LXS7FYAEELYQ6UOPZVEL3XYA4M/events.json","paper":"https://pith.science/paper/LXS7FYAE"},"agent_actions":{"view_html":"https://pith.science/pith/LXS7FYAEELYQ6UOPZVEL3XYA4M","download_json":"https://pith.science/pith/LXS7FYAEELYQ6UOPZVEL3XYA4M.json","view_paper":"https://pith.science/paper/LXS7FYAE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.07842&json=true","fetch_graph":"https://pith.science/api/pith-number/LXS7FYAEELYQ6UOPZVEL3XYA4M/graph.json","fetch_events":"https://pith.science/api/pith-number/LXS7FYAEELYQ6UOPZVEL3XYA4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LXS7FYAEELYQ6UOPZVEL3XYA4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LXS7FYAEELYQ6UOPZVEL3XYA4M/action/storage_attestation","attest_author":"https://pith.science/pith/LXS7FYAEELYQ6UOPZVEL3XYA4M/action/author_attestation","sign_citation":"https://pith.science/pith/LXS7FYAEELYQ6UOPZVEL3XYA4M/action/citation_signature","submit_replication":"https://pith.science/pith/LXS7FYAEELYQ6UOPZVEL3XYA4M/action/replication_record"}},"created_at":"2026-07-05T01:28:59.344278+00:00","updated_at":"2026-07-05T01:28:59.344278+00:00"}