{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4KMVE3OYCFNKYWTKSP3ZQTBAVL","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":"29cd7e1dcc29fc25fa94862953410593158b62d66f7ae054b81991c46317935f","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T14:31:51Z","title_canon_sha256":"55ae2be069046db68c3acdbafe8616cbf610035c0bdad7bddd18279522c577a6"},"schema_version":"1.0","source":{"id":"2605.16001","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16001","created_at":"2026-05-20T00:01:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16001v1","created_at":"2026-05-20T00:01:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16001","created_at":"2026-05-20T00:01:48Z"},{"alias_kind":"pith_short_12","alias_value":"4KMVE3OYCFNK","created_at":"2026-05-20T00:01:48Z"},{"alias_kind":"pith_short_16","alias_value":"4KMVE3OYCFNKYWTK","created_at":"2026-05-20T00:01:48Z"},{"alias_kind":"pith_short_8","alias_value":"4KMVE3OY","created_at":"2026-05-20T00:01:48Z"}],"graph_snapshots":[{"event_id":"sha256:dc016fa06cc4bfdfdca7b58eb4984c6cec10ad9870c114726e91dd0b5a42ffb4","target":"graph","created_at":"2026-05-20T00:01:48Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove that Broadcast Independence and Broadcast Packing are FPT parameterized by the treewidth plus the diameter of G, with a family of dynamic-programming algorithms over nice tree decompositions."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The input graph admits a nice tree decomposition of width equal to the treewidth parameter and the eccentricity function can be precomputed in polynomial time for the DP states; this is invoked when the authors state the DP runs over nice tree decompositions in the FPT algorithm section."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Broadcast Independence and Broadcast Packing are FPT parameterized by treewidth plus diameter via DP on nice tree decompositions, W[1]-hard for pathwidth, and admit a constant-factor approximation parameterized by treewidth."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Broadcast Independence and Broadcast Packing are FPT when parameterized by treewidth plus diameter."}],"snapshot_sha256":"dcb17ce59f9ca5f4d89dcfb858b1360aabca3c641b5d0115cff9b6b621577ab9"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T19:01:37.360789Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T19:01:18.994197Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:42.174137Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T17:01:55.657610Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.16001/integrity.json","findings":[],"snapshot_sha256":"d173101f1774a6853d5b9f105606aa65487f64c305042bcae1c9515a88f1724f","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A broadcast on a connected graph is a function f that assigns each vertex v an integer f(v) with 0 <= f(v) <= ecc(v) where ecc(v) denotes the eccentricity of v. A vertex u hears a broadcasting vertex v (with f(v)>0) if u is at distance at most f(v) from v. Beyond the classical broadcast domination problem, where every vertex is required to hear at least one vertex, two variants raise intriguing combinatorial and algorithmic questions. In an independent broadcast, no broadcasting vertex hears another broadcasting vertex, while a broadcast packing requires that every vertex hears at most one bro","authors_text":"Anthony Perez, Edouard Nemery, Florian Sikora, Joanne Dumont","cross_cats":["cs.CC","cs.DM"],"headline":"Broadcast Independence and Broadcast Packing are FPT when parameterized by treewidth plus diameter.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T14:31:51Z","title":"On the parameterized complexity of Broadcast Independence and Broadcast Packing"},"references":{"count":24,"internal_anchors":1,"resolved_work":24,"sample":[{"cited_arxiv_id":"","doi":"10.1016/j.dam.2020.01.030","is_internal_anchor":false,"ref_index":1,"title":"Broadcasts on paths and cycles , journal =","work_id":"7be3dbb5-13bc-479e-a59d-bd519f370ead","year":2020},{"cited_arxiv_id":"","doi":"10.1007/s10878-012-9594-4","is_internal_anchor":false,"ref_index":2,"title":"Hiroshi Eto and Fengrui Guo and Eiji Miyano , title =. J. Comb. Optim. , volume =. 2014 , url =. doi:10.1007/S10878-012-9594-4 , timestamp =","work_id":"d3c54549-f143-4ea4-b1c9-ee45cedc4e38","year":2014},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"arXiv preprint arXiv:2305.03516 , year=","work_id":"2146c546-29ff-44b9-a3ff-044af030b156","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Journal of Combinatorial Optimization , volume=","work_id":"10106ded-f352-419c-afb8-8c0d32ff8718","year":2014},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"International Workshop on Graph-Theoretic Concepts in Computer Science , pages=","work_id":"db00ed0c-a6bd-49e4-83f2-3ae808c6b5b4","year":2016}],"snapshot_sha256":"ed6d3dcaead0dcdc07040c21022d3f683bc0ed7a39f9792996c4fc76c9a1a21a"},"source":{"id":"2605.16001","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T18:51:59.575631Z","id":"4bc4e6e4-aa13-4727-bb3a-6b9915a913e2","model_set":{"reader":"grok-4.3"},"one_line_summary":"Broadcast Independence and Broadcast Packing are FPT parameterized by treewidth plus diameter via DP on nice tree decompositions, W[1]-hard for pathwidth, and admit a constant-factor approximation parameterized by treewidth.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Broadcast Independence and Broadcast Packing are FPT when parameterized by treewidth plus diameter.","strongest_claim":"We prove that Broadcast Independence and Broadcast Packing are FPT parameterized by the treewidth plus the diameter of G, with a family of dynamic-programming algorithms over nice tree decompositions.","weakest_assumption":"The input graph admits a nice tree decomposition of width equal to the treewidth parameter and the eccentricity function can be precomputed in polynomial time for the DP states; this is invoked when the authors state the DP runs over nice tree decompositions in the FPT algorithm section."}},"verdict_id":"4bc4e6e4-aa13-4727-bb3a-6b9915a913e2"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:98d316e937987254b697a8a1f12bf18d02d793291bc73a327dd8c1f03b48d00c","target":"record","created_at":"2026-05-20T00:01:48Z","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":"29cd7e1dcc29fc25fa94862953410593158b62d66f7ae054b81991c46317935f","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-15T14:31:51Z","title_canon_sha256":"55ae2be069046db68c3acdbafe8616cbf610035c0bdad7bddd18279522c577a6"},"schema_version":"1.0","source":{"id":"2605.16001","kind":"arxiv","version":1}},"canonical_sha256":"e299526dd8115aac5a6a93f7984c20aaca8e723d1af4f855401c94f65d7db55a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e299526dd8115aac5a6a93f7984c20aaca8e723d1af4f855401c94f65d7db55a","first_computed_at":"2026-05-20T00:01:48.436920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:48.436920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TN3tMzNNKBk+jbNycExX+RQMjyIDzQJao1RYZ0AOmGbnEv7s0qNLKB+OR0yfaLdQrTQdHCz4r7SqJZpuKkV7AA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:48.437568Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16001","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98d316e937987254b697a8a1f12bf18d02d793291bc73a327dd8c1f03b48d00c","sha256:dc016fa06cc4bfdfdca7b58eb4984c6cec10ad9870c114726e91dd0b5a42ffb4"],"state_sha256":"315266654f80c526b2f257b04959823d01786e6cc5b5821c2641830e7a5dd76c"}