{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KI7JXBOQKXG4DAAOIDLT7AN4TH","short_pith_number":"pith:KI7JXBOQ","schema_version":"1.0","canonical_sha256":"523e9b85d055cdc1800e40d73f81bc99c574e8d485634a16f7a64b3303f5f9e2","source":{"kind":"arxiv","id":"2607.01770","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.01770","created_at":"2026-07-03T01:17:29.153345+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.01770v1","created_at":"2026-07-03T01:17:29.153345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.01770","created_at":"2026-07-03T01:17:29.153345+00:00"},{"alias_kind":"pith_short_12","alias_value":"KI7JXBOQKXG4","created_at":"2026-07-03T01:17:29.153345+00:00"},{"alias_kind":"pith_short_16","alias_value":"KI7JXBOQKXG4DAAO","created_at":"2026-07-03T01:17:29.153345+00:00"},{"alias_kind":"pith_short_8","alias_value":"KI7JXBOQ","created_at":"2026-07-03T01:17:29.153345+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/KI7JXBOQKXG4DAAOIDLT7AN4TH","json":"https://pith.science/pith/KI7JXBOQKXG4DAAOIDLT7AN4TH.json","graph_json":"https://pith.science/api/pith-number/KI7JXBOQKXG4DAAOIDLT7AN4TH/graph.json","events_json":"https://pith.science/api/pith-number/KI7JXBOQKXG4DAAOIDLT7AN4TH/events.json","paper":"https://pith.science/paper/KI7JXBOQ"},"agent_actions":{"view_html":"https://pith.science/pith/KI7JXBOQKXG4DAAOIDLT7AN4TH","download_json":"https://pith.science/pith/KI7JXBOQKXG4DAAOIDLT7AN4TH.json","view_paper":"https://pith.science/paper/KI7JXBOQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.01770&json=true","fetch_graph":"https://pith.science/api/pith-number/KI7JXBOQKXG4DAAOIDLT7AN4TH/graph.json","fetch_events":"https://pith.science/api/pith-number/KI7JXBOQKXG4DAAOIDLT7AN4TH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KI7JXBOQKXG4DAAOIDLT7AN4TH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KI7JXBOQKXG4DAAOIDLT7AN4TH/action/storage_attestation","attest_author":"https://pith.science/pith/KI7JXBOQKXG4DAAOIDLT7AN4TH/action/author_attestation","sign_citation":"https://pith.science/pith/KI7JXBOQKXG4DAAOIDLT7AN4TH/action/citation_signature","submit_replication":"https://pith.science/pith/KI7JXBOQKXG4DAAOIDLT7AN4TH/action/replication_record"}},"created_at":"2026-07-03T01:17:29.153345+00:00","updated_at":"2026-07-03T01:17:29.153345+00:00"}