{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KI7JXBOQKXG4DAAOIDLT7AN4TH","short_pith_number":"pith:KI7JXBOQ","canonical_record":{"source":{"id":"2607.01770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-02T06:42:14Z","cross_cats_sorted":[],"title_canon_sha256":"680f04ea82b32e338da05c8179b358b684effaf42deabff2cc78971446944539","abstract_canon_sha256":"0be58f9a20e54a5deb5c2f71c16a2aa65b4383a105b15e0d9539fa6f022ad83e"},"schema_version":"1.0"},"canonical_sha256":"523e9b85d055cdc1800e40d73f81bc99c574e8d485634a16f7a64b3303f5f9e2","source":{"kind":"arxiv","id":"2607.01770","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.01770","created_at":"2026-07-03T01:17:29Z"},{"alias_kind":"arxiv_version","alias_value":"2607.01770v1","created_at":"2026-07-03T01:17:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01770","created_at":"2026-07-03T01:17:29Z"},{"alias_kind":"pith_short_12","alias_value":"KI7JXBOQKXG4","created_at":"2026-07-03T01:17:29Z"},{"alias_kind":"pith_short_16","alias_value":"KI7JXBOQKXG4DAAO","created_at":"2026-07-03T01:17:29Z"},{"alias_kind":"pith_short_8","alias_value":"KI7JXBOQ","created_at":"2026-07-03T01:17:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KI7JXBOQKXG4DAAOIDLT7AN4TH","target":"record","payload":{"canonical_record":{"source":{"id":"2607.01770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-02T06:42:14Z","cross_cats_sorted":[],"title_canon_sha256":"680f04ea82b32e338da05c8179b358b684effaf42deabff2cc78971446944539","abstract_canon_sha256":"0be58f9a20e54a5deb5c2f71c16a2aa65b4383a105b15e0d9539fa6f022ad83e"},"schema_version":"1.0"},"canonical_sha256":"523e9b85d055cdc1800e40d73f81bc99c574e8d485634a16f7a64b3303f5f9e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-03T01:17:29.153696Z","signature_b64":"WlsOFyKIniSgp3FCWRpuRWZlF6QnXnoq5G/KltZxscRu77RQfM69VVlQgirnyQGW7i1vejcugRACKoZ22kIkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"523e9b85d055cdc1800e40d73f81bc99c574e8d485634a16f7a64b3303f5f9e2","last_reissued_at":"2026-07-03T01:17:29.153280Z","signature_status":"signed_v1","first_computed_at":"2026-07-03T01:17:29.153280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.01770","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-07-03T01:17:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TvryLl/ee/r3wTuviSXtRu9AkiZc82Z+aYkWroHA83HHsmtSV/8YasKXIf69MzMMGiIOUyKpIa+5cufgv68QAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T03:56:47.105655Z"},"content_sha256":"d943898e28a03afa81ee677fe85e758f81c9a71d9145d12a5dac15a1ac58ce18","schema_version":"1.0","event_id":"sha256:d943898e28a03afa81ee677fe85e758f81c9a71d9145d12a5dac15a1ac58ce18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KI7JXBOQKXG4DAAOIDLT7AN4TH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Parameterized Broadcasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Carl Feghali, \\'Edouard Bonnet, Manolis Vasilakis","submitted_at":"2026-07-02T06:42:14Z","abstract_excerpt":"Given a connected graph $G$ and a source $s \\in V(G)$, what is the smallest number of rounds necessary for all vertices of $G$ to receive a message initially only held by $s$, where at each round every informed vertex passes the message to one of its neighbors? This problem is called Telephone Broadcast and is suprisingly hard: it remains NP-hard on cycles intersecting at a single shared vertex, in particular, graphs of pathwidth 2 with a linear feedback vertex set of size 1, as well as on graphs with treedepth at most 6 [Egami et al.; MFCS '25]. Vertex cover number, vertex integrity, and dist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01770","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/2607.01770/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-07-03T01:17:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nw+PfFsCYccD6XkOtKMFFSImW16jFLjZxwPWOrkUgcJyi+XN3lf9zocIKB3kG/7vgQ2M8G1XXoY6p1FV8iKxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T03:56:47.106023Z"},"content_sha256":"488ff4a8c90146f23f7d1a3a543a7773a45973ec89dc59823f8d3efbc25fecaf","schema_version":"1.0","event_id":"sha256:488ff4a8c90146f23f7d1a3a543a7773a45973ec89dc59823f8d3efbc25fecaf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KI7JXBOQKXG4DAAOIDLT7AN4TH/bundle.json","state_url":"https://pith.science/pith/KI7JXBOQKXG4DAAOIDLT7AN4TH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KI7JXBOQKXG4DAAOIDLT7AN4TH/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-07-05T03:56:47Z","links":{"resolver":"https://pith.science/pith/KI7JXBOQKXG4DAAOIDLT7AN4TH","bundle":"https://pith.science/pith/KI7JXBOQKXG4DAAOIDLT7AN4TH/bundle.json","state":"https://pith.science/pith/KI7JXBOQKXG4DAAOIDLT7AN4TH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KI7JXBOQKXG4DAAOIDLT7AN4TH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KI7JXBOQKXG4DAAOIDLT7AN4TH","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":"0be58f9a20e54a5deb5c2f71c16a2aa65b4383a105b15e0d9539fa6f022ad83e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-02T06:42:14Z","title_canon_sha256":"680f04ea82b32e338da05c8179b358b684effaf42deabff2cc78971446944539"},"schema_version":"1.0","source":{"id":"2607.01770","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.01770","created_at":"2026-07-03T01:17:29Z"},{"alias_kind":"arxiv_version","alias_value":"2607.01770v1","created_at":"2026-07-03T01:17:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01770","created_at":"2026-07-03T01:17:29Z"},{"alias_kind":"pith_short_12","alias_value":"KI7JXBOQKXG4","created_at":"2026-07-03T01:17:29Z"},{"alias_kind":"pith_short_16","alias_value":"KI7JXBOQKXG4DAAO","created_at":"2026-07-03T01:17:29Z"},{"alias_kind":"pith_short_8","alias_value":"KI7JXBOQ","created_at":"2026-07-03T01:17:29Z"}],"graph_snapshots":[{"event_id":"sha256:488ff4a8c90146f23f7d1a3a543a7773a45973ec89dc59823f8d3efbc25fecaf","target":"graph","created_at":"2026-07-03T01:17:29Z","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/2607.01770/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a connected graph $G$ and a source $s \\in V(G)$, what is the smallest number of rounds necessary for all vertices of $G$ to receive a message initially only held by $s$, where at each round every informed vertex passes the message to one of its neighbors? This problem is called Telephone Broadcast and is suprisingly hard: it remains NP-hard on cycles intersecting at a single shared vertex, in particular, graphs of pathwidth 2 with a linear feedback vertex set of size 1, as well as on graphs with treedepth at most 6 [Egami et al.; MFCS '25]. Vertex cover number, vertex integrity, and dist","authors_text":"Carl Feghali, \\'Edouard Bonnet, Manolis Vasilakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-02T06:42:14Z","title":"Faster Parameterized Broadcasting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.01770","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:d943898e28a03afa81ee677fe85e758f81c9a71d9145d12a5dac15a1ac58ce18","target":"record","created_at":"2026-07-03T01:17:29Z","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":"0be58f9a20e54a5deb5c2f71c16a2aa65b4383a105b15e0d9539fa6f022ad83e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-02T06:42:14Z","title_canon_sha256":"680f04ea82b32e338da05c8179b358b684effaf42deabff2cc78971446944539"},"schema_version":"1.0","source":{"id":"2607.01770","kind":"arxiv","version":1}},"canonical_sha256":"523e9b85d055cdc1800e40d73f81bc99c574e8d485634a16f7a64b3303f5f9e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"523e9b85d055cdc1800e40d73f81bc99c574e8d485634a16f7a64b3303f5f9e2","first_computed_at":"2026-07-03T01:17:29.153280Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-03T01:17:29.153280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WlsOFyKIniSgp3FCWRpuRWZlF6QnXnoq5G/KltZxscRu77RQfM69VVlQgirnyQGW7i1vejcugRACKoZ22kIkCw==","signature_status":"signed_v1","signed_at":"2026-07-03T01:17:29.153696Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.01770","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d943898e28a03afa81ee677fe85e758f81c9a71d9145d12a5dac15a1ac58ce18","sha256:488ff4a8c90146f23f7d1a3a543a7773a45973ec89dc59823f8d3efbc25fecaf"],"state_sha256":"8ba5594b0df3a654f0e7c7213ca61231a2fb1a437aec073081f29bfa88f38530"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8+bzmQp7v5AMBpVS84UlZ9dWyRNXVC69RcxAeKA1rEtlKD+eryddfE+l2S1Q/3/DBf58m7e9UOGQJqDeVXDRAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T03:56:47.108012Z","bundle_sha256":"b7f1a70c409a7e411d8a026ba9d6b0d661ae06de20ec0c7189360c3fa34f5aaa"}}