{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:EFIBDRPTNY4H3FSF6Y5BSDCFZV","short_pith_number":"pith:EFIBDRPT","schema_version":"1.0","canonical_sha256":"215011c5f36e387d9645f63a190c45cd66a5d52c9562a0da09091ce764605a1e","source":{"kind":"arxiv","id":"2412.04389","version":1},"attestation_state":"computed","paper":{"title":"Hypergraph burning, matchings, and zero forcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anthony Bonato, Caleb Jones, Teddy Mishura, Trent G. Marbach, Zhiyuan Zhang","submitted_at":"2024-12-05T18:04:35Z","abstract_excerpt":"Lazy burning is a recently introduced variation of burning where only one set of vertices is chosen to burn in the first round. In hypergraphs, lazy burning spreads when all but one vertex in a hyperedge is burned. The lazy burning number is the minimum number of initially burned vertices that eventually burns all vertices. We give several equivalent characterizations of lazy burning on hypergraphs using matchings and zero forcing, and then apply these to give new bounds and complexity results.\n  We prove that the lazy burning number of a hypergraph $H$ equals its order minus the maximum cardi"},"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":"2412.04389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-12-05T18:04:35Z","cross_cats_sorted":[],"title_canon_sha256":"97903d569052108c98d6412ad54cc14343880bbd09678fd37b9fba0814457ff7","abstract_canon_sha256":"395b312e3e86eff5a170ea55fa874fb479243247d004ec55124b1b7eac2b06c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:45:03.167615Z","signature_b64":"27SNQV+jhT+IXHv8QHHpL3KPgmNcllP9rnWzWnoJtINSdaE+GauF66M272A/+SQy/lJJhULJmIbPObOy4KheAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"215011c5f36e387d9645f63a190c45cd66a5d52c9562a0da09091ce764605a1e","last_reissued_at":"2026-07-05T09:45:03.167151Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:45:03.167151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph burning, matchings, and zero forcing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anthony Bonato, Caleb Jones, Teddy Mishura, Trent G. Marbach, Zhiyuan Zhang","submitted_at":"2024-12-05T18:04:35Z","abstract_excerpt":"Lazy burning is a recently introduced variation of burning where only one set of vertices is chosen to burn in the first round. In hypergraphs, lazy burning spreads when all but one vertex in a hyperedge is burned. The lazy burning number is the minimum number of initially burned vertices that eventually burns all vertices. We give several equivalent characterizations of lazy burning on hypergraphs using matchings and zero forcing, and then apply these to give new bounds and complexity results.\n  We prove that the lazy burning number of a hypergraph $H$ equals its order minus the maximum cardi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.04389","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.04389/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":"2412.04389","created_at":"2026-07-05T09:45:03.167203+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.04389v1","created_at":"2026-07-05T09:45:03.167203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.04389","created_at":"2026-07-05T09:45:03.167203+00:00"},{"alias_kind":"pith_short_12","alias_value":"EFIBDRPTNY4H","created_at":"2026-07-05T09:45:03.167203+00:00"},{"alias_kind":"pith_short_16","alias_value":"EFIBDRPTNY4H3FSF","created_at":"2026-07-05T09:45:03.167203+00:00"},{"alias_kind":"pith_short_8","alias_value":"EFIBDRPT","created_at":"2026-07-05T09:45:03.167203+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/EFIBDRPTNY4H3FSF6Y5BSDCFZV","json":"https://pith.science/pith/EFIBDRPTNY4H3FSF6Y5BSDCFZV.json","graph_json":"https://pith.science/api/pith-number/EFIBDRPTNY4H3FSF6Y5BSDCFZV/graph.json","events_json":"https://pith.science/api/pith-number/EFIBDRPTNY4H3FSF6Y5BSDCFZV/events.json","paper":"https://pith.science/paper/EFIBDRPT"},"agent_actions":{"view_html":"https://pith.science/pith/EFIBDRPTNY4H3FSF6Y5BSDCFZV","download_json":"https://pith.science/pith/EFIBDRPTNY4H3FSF6Y5BSDCFZV.json","view_paper":"https://pith.science/paper/EFIBDRPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.04389&json=true","fetch_graph":"https://pith.science/api/pith-number/EFIBDRPTNY4H3FSF6Y5BSDCFZV/graph.json","fetch_events":"https://pith.science/api/pith-number/EFIBDRPTNY4H3FSF6Y5BSDCFZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EFIBDRPTNY4H3FSF6Y5BSDCFZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EFIBDRPTNY4H3FSF6Y5BSDCFZV/action/storage_attestation","attest_author":"https://pith.science/pith/EFIBDRPTNY4H3FSF6Y5BSDCFZV/action/author_attestation","sign_citation":"https://pith.science/pith/EFIBDRPTNY4H3FSF6Y5BSDCFZV/action/citation_signature","submit_replication":"https://pith.science/pith/EFIBDRPTNY4H3FSF6Y5BSDCFZV/action/replication_record"}},"created_at":"2026-07-05T09:45:03.167203+00:00","updated_at":"2026-07-05T09:45:03.167203+00:00"}