{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SCSM7PVYGZ4BLUB6N7W2OQRHKB","short_pith_number":"pith:SCSM7PVY","canonical_record":{"source":{"id":"2605.20526","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-19T21:54:58Z","cross_cats_sorted":[],"title_canon_sha256":"f242fcf5e6d518726b13121d8cddf5723db00132e955623e702b5b9517b5bf01","abstract_canon_sha256":"89fe73f9921b1aa62854041103fe97eed379ef50272eed79550d3ac5708405f4"},"schema_version":"1.0"},"canonical_sha256":"90a4cfbeb8367815d03e6feda74227507810369399dfd6fab8bcae7cbb5ec491","source":{"kind":"arxiv","id":"2605.20526","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20526","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20526v1","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20526","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"pith_short_12","alias_value":"SCSM7PVYGZ4B","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"pith_short_16","alias_value":"SCSM7PVYGZ4BLUB6","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"pith_short_8","alias_value":"SCSM7PVY","created_at":"2026-05-21T01:04:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SCSM7PVYGZ4BLUB6N7W2OQRHKB","target":"record","payload":{"canonical_record":{"source":{"id":"2605.20526","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-19T21:54:58Z","cross_cats_sorted":[],"title_canon_sha256":"f242fcf5e6d518726b13121d8cddf5723db00132e955623e702b5b9517b5bf01","abstract_canon_sha256":"89fe73f9921b1aa62854041103fe97eed379ef50272eed79550d3ac5708405f4"},"schema_version":"1.0"},"canonical_sha256":"90a4cfbeb8367815d03e6feda74227507810369399dfd6fab8bcae7cbb5ec491","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:41.067641Z","signature_b64":"EMJ9lvb+6XqinzvQWku1e/zTWnZUL6X9LLivzoWo68D4PaBLs8Bu9/t1My2gwnAwGZrQeHM5WfYoHpsg8oYcAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90a4cfbeb8367815d03e6feda74227507810369399dfd6fab8bcae7cbb5ec491","last_reissued_at":"2026-05-21T01:04:41.067146Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:41.067146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.20526","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-21T01:04:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vDGW6u54bc4BHDaAv0sidThrxl12Lj4QNTHZ1h6+QlPOdY/RBpIo9qQLzwN2d96m6M82JEP8SrX29pew48gHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:47:42.982456Z"},"content_sha256":"6574b4fca36288bc544c2ea063fe0b90871723e9db98f17c6ed7eb42a95945ef","schema_version":"1.0","event_id":"sha256:6574b4fca36288bc544c2ea063fe0b90871723e9db98f17c6ed7eb42a95945ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SCSM7PVYGZ4BLUB6N7W2OQRHKB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An $O(n^5)$-Time Algorithm for Optimal Broadcast Domination","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kleitos Papadopoulos","submitted_at":"2026-05-19T21:54:58Z","abstract_excerpt":"Broadcast domination assigns a nonnegative integer power to every vertex of a graph so that every vertex is within the assigned power of some broadcasting vertex, and the objective is to minimize the sum of the powers. Heggernes and Lokshtanov proved that the problem is polynomial-time solvable on arbitrary connected unweighted graphs by showing that some optimal efficient broadcast has a domination graph that is a path or a cycle, and by reducing the general case to an $O(n^6)$-time algorithm. This paper gives an efficient algorithm of the path-case. Instead of building one auxiliary acyclic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20526","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/2605.20526/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"},"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-21T01:04:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5V6/HSmfC/5FTSqeDhKQZPwiRYCfE9b7szZ6bXTOOf+Ei4XV378foKXaQd/taH2i7OeJ+D0cfpPjZcBJlMr4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:47:42.983172Z"},"content_sha256":"3e7d1a761a522b1da93bd7bd77ade983ece8d22b4b47e596eaf623e55814b10e","schema_version":"1.0","event_id":"sha256:3e7d1a761a522b1da93bd7bd77ade983ece8d22b4b47e596eaf623e55814b10e"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:SCSM7PVYGZ4BLUB6N7W2OQRHKB","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/s00453-021-00828-5.14) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"F. Foucaud, B. Gras, A. Perez, and F. Sikora. On the complexity of broadcast domination and multipacking in digraphs.Algorithmica, 83:2651–2677, 2021. doi:10.1007/s00453-021- 00828-5. 14","arxiv_id":"2605.20526","detector":"doi_compliance","evidence":{"ref_index":7,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"F. Foucaud, B. Gras, A. Perez, and F. Sikora. On the complexity of broadcast domination and multipacking in digraphs.Algorithmica, 83:2651–2677, 2021. doi:10.1007/s00453-021- 00828-5. 14","reconstructed_doi":"10.1007/s00453-021-00828-5.14"},"severity":"advisory","ref_index":7,"audited_at":"2026-05-21T06:43:33.809191Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s00453-021-00828-5.14","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"d3dd2f07dbfb74140f1d6d1499992c758cc44854a2b733ad14aa8fb8ad1ac690","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":5805,"payload_sha256":"c07759807ebd457d81f787e5729a35d4df65af0cda00d00ee65b0e2d4b18745f","signature_b64":"B61ynVgKybfIZr0FkiLiIAeSylOW7JTr9hCp3LUcS+T/0z2K7eE3oarJDGCNoXhhBy51Qf6B57l7KtgBjiKJCg==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-21T06:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jPOZMwxMvAgN36SwfijwWXfyLwWUa0SEmZXiuqmeusFcVOhaMQufiZ9PHm0OprQTAW+/pxnJSwyWm1RidQ/ACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:47:42.984946Z"},"content_sha256":"c3945150a4b53af7dfb2e578e30d81f829b8f7b62c5eb521ed69f9fa24cd7f96","schema_version":"1.0","event_id":"sha256:c3945150a4b53af7dfb2e578e30d81f829b8f7b62c5eb521ed69f9fa24cd7f96"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:SCSM7PVYGZ4BLUB6N7W2OQRHKB","target":"integrity","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-030-58892-22) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"M. A. Henning, G. MacGillivray, and F. Yang. Broadcast domination in graphs. In T. W. Haynes, S. T. Hedetniemi, and M. A. Henning, editors,Structures of Domination in Graphs, Developments in Mathematics 66, pages 15–46. Springer, Cham, 2021","arxiv_id":"2605.20526","detector":"doi_compliance","evidence":{"ref_index":6,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"M. A. Henning, G. MacGillivray, and F. Yang. Broadcast domination in graphs. In T. W. Haynes, S. T. Hedetniemi, and M. A. Henning, editors,Structures of Domination in Graphs, Developments in Mathematics 66, pages 15–46. Springer, Cham, 2021","reconstructed_doi":"10.1007/978-3-030-58892-22"},"severity":"advisory","ref_index":6,"audited_at":"2026-05-21T06:43:33.809191Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-030-58892-22","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"c289883c9cb57591382796ac8408068ffd6e8248a861b283965dadb05ae5b8a1","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":5804,"payload_sha256":"9024b2ccbdd8e1f8d6143fa183fed06d518f6ed753405ba788262e2ffbac0def","signature_b64":"Xob21dxXCSLstFa3XV6z5G5HMINKk6D145vzdD2b7sqsKUuScerVCK9K/oSCiGHoRdVsw0pWG2/xYVQ90CfdDw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-21T06:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7bAnIVYb4JJ3s5L5HAikqQp/YjzRr9LnFSvgd49BMS9gAlCZFkErJGOUxZ55FLmj0VRT6bQzFRLQyWr/459EDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T20:47:42.985597Z"},"content_sha256":"e8842258a9d3888a3a81aeae75b38a801482b4802c635643ec2c9858f63c5904","schema_version":"1.0","event_id":"sha256:e8842258a9d3888a3a81aeae75b38a801482b4802c635643ec2c9858f63c5904"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SCSM7PVYGZ4BLUB6N7W2OQRHKB/bundle.json","state_url":"https://pith.science/pith/SCSM7PVYGZ4BLUB6N7W2OQRHKB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SCSM7PVYGZ4BLUB6N7W2OQRHKB/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-24T20:47:42Z","links":{"resolver":"https://pith.science/pith/SCSM7PVYGZ4BLUB6N7W2OQRHKB","bundle":"https://pith.science/pith/SCSM7PVYGZ4BLUB6N7W2OQRHKB/bundle.json","state":"https://pith.science/pith/SCSM7PVYGZ4BLUB6N7W2OQRHKB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SCSM7PVYGZ4BLUB6N7W2OQRHKB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SCSM7PVYGZ4BLUB6N7W2OQRHKB","merge_version":"pith-open-graph-merge-v1","event_count":4,"valid_event_count":4,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"89fe73f9921b1aa62854041103fe97eed379ef50272eed79550d3ac5708405f4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-19T21:54:58Z","title_canon_sha256":"f242fcf5e6d518726b13121d8cddf5723db00132e955623e702b5b9517b5bf01"},"schema_version":"1.0","source":{"id":"2605.20526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20526","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20526v1","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20526","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"pith_short_12","alias_value":"SCSM7PVYGZ4B","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"pith_short_16","alias_value":"SCSM7PVYGZ4BLUB6","created_at":"2026-05-21T01:04:41Z"},{"alias_kind":"pith_short_8","alias_value":"SCSM7PVY","created_at":"2026-05-21T01:04:41Z"}],"graph_snapshots":[{"event_id":"sha256:3e7d1a761a522b1da93bd7bd77ade983ece8d22b4b47e596eaf623e55814b10e","target":"graph","created_at":"2026-05-21T01:04:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.20526/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Broadcast domination assigns a nonnegative integer power to every vertex of a graph so that every vertex is within the assigned power of some broadcasting vertex, and the objective is to minimize the sum of the powers. Heggernes and Lokshtanov proved that the problem is polynomial-time solvable on arbitrary connected unweighted graphs by showing that some optimal efficient broadcast has a domination graph that is a path or a cycle, and by reducing the general case to an $O(n^6)$-time algorithm. This paper gives an efficient algorithm of the path-case. Instead of building one auxiliary acyclic ","authors_text":"Kleitos Papadopoulos","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-19T21:54:58Z","title":"An $O(n^5)$-Time Algorithm for Optimal Broadcast Domination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20526","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:6574b4fca36288bc544c2ea063fe0b90871723e9db98f17c6ed7eb42a95945ef","target":"record","created_at":"2026-05-21T01:04:41Z","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":"89fe73f9921b1aa62854041103fe97eed379ef50272eed79550d3ac5708405f4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-19T21:54:58Z","title_canon_sha256":"f242fcf5e6d518726b13121d8cddf5723db00132e955623e702b5b9517b5bf01"},"schema_version":"1.0","source":{"id":"2605.20526","kind":"arxiv","version":1}},"canonical_sha256":"90a4cfbeb8367815d03e6feda74227507810369399dfd6fab8bcae7cbb5ec491","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90a4cfbeb8367815d03e6feda74227507810369399dfd6fab8bcae7cbb5ec491","first_computed_at":"2026-05-21T01:04:41.067146Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:04:41.067146Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EMJ9lvb+6XqinzvQWku1e/zTWnZUL6X9LLivzoWo68D4PaBLs8Bu9/t1My2gwnAwGZrQeHM5WfYoHpsg8oYcAQ==","signature_status":"signed_v1","signed_at":"2026-05-21T01:04:41.067641Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.20526","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:c3945150a4b53af7dfb2e578e30d81f829b8f7b62c5eb521ed69f9fa24cd7f96","sha256:e8842258a9d3888a3a81aeae75b38a801482b4802c635643ec2c9858f63c5904"]}],"invalid_events":[],"applied_event_ids":["sha256:6574b4fca36288bc544c2ea063fe0b90871723e9db98f17c6ed7eb42a95945ef","sha256:3e7d1a761a522b1da93bd7bd77ade983ece8d22b4b47e596eaf623e55814b10e"],"state_sha256":"5fe0f6e16f9176b0821682cc36a96e73f3d916c3b27fa779505b349b4369be67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2JcSaM2BgVrVjfbu4iRiBvnOUeAnm57I0njDL3CewO+MqSEAAZ3miCZNA9CDRBc/vfYzodWRAsCkpPze2xEgBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T20:47:42.989938Z","bundle_sha256":"075d1f625b6c0063114b3d5019b1bd6bc701dfbb08c933d4350a22aa75e7865c"}}