{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3HWXLBPCY7VIBR55VMXXTQ7UZD","short_pith_number":"pith:3HWXLBPC","schema_version":"1.0","canonical_sha256":"d9ed7585e2c7ea80c7bdab2f79c3f4c8d476a84a3d0169cca646381174d3107d","source":{"kind":"arxiv","id":"2607.07260","version":1},"attestation_state":"computed","paper":{"title":"Sparse Relaxed Broadcast Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Hovhannes Harutyunyan, Pierre Fraigniaud","submitted_at":"2026-07-08T10:47:56Z","abstract_excerpt":"Broadcasting in graphs refers to the information dissemination problem in which a source node has an atomic piece of information to be distributed to all the nodes of a graph. In the standard telephone model, broadcasting proceeds as a sequence of synchronous rounds, where, at each round, every informed node can transfer the information to at most one of its neighbors. The broadcast time of a graph $G$ is the maximum, taken over every node $v\\in V(G)$, of the minimum number of rounds required for broadcasting from $v$ in $G$. We study the network design problem that, for every $\\epsilon> 0$, a"},"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.07260","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-07-08T10:47:56Z","cross_cats_sorted":[],"title_canon_sha256":"d00938ba14d7ad5348864fbe9ddbf48c4fce5a655cb8b8a2da1221918876f7c2","abstract_canon_sha256":"3e1a567b5883bdf2d2eb0a73840afe0fddad6ccfd1cebc245a969fac07f048c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T01:20:19.150270Z","signature_b64":"NCHYrJH/gXO8F8aZ7OfeH3euUfITFIE6gJe++DziLXb1Z42EN0JHwsM05eaWVN7HSuyKfV+IqEitWqoYXiJNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9ed7585e2c7ea80c7bdab2f79c3f4c8d476a84a3d0169cca646381174d3107d","last_reissued_at":"2026-07-09T01:20:19.149878Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T01:20:19.149878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Relaxed Broadcast Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Hovhannes Harutyunyan, Pierre Fraigniaud","submitted_at":"2026-07-08T10:47:56Z","abstract_excerpt":"Broadcasting in graphs refers to the information dissemination problem in which a source node has an atomic piece of information to be distributed to all the nodes of a graph. In the standard telephone model, broadcasting proceeds as a sequence of synchronous rounds, where, at each round, every informed node can transfer the information to at most one of its neighbors. The broadcast time of a graph $G$ is the maximum, taken over every node $v\\in V(G)$, of the minimum number of rounds required for broadcasting from $v$ in $G$. We study the network design problem that, for every $\\epsilon> 0$, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07260","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.07260/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.07260","created_at":"2026-07-09T01:20:19.149935+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.07260v1","created_at":"2026-07-09T01:20:19.149935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07260","created_at":"2026-07-09T01:20:19.149935+00:00"},{"alias_kind":"pith_short_12","alias_value":"3HWXLBPCY7VI","created_at":"2026-07-09T01:20:19.149935+00:00"},{"alias_kind":"pith_short_16","alias_value":"3HWXLBPCY7VIBR55","created_at":"2026-07-09T01:20:19.149935+00:00"},{"alias_kind":"pith_short_8","alias_value":"3HWXLBPC","created_at":"2026-07-09T01:20:19.149935+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/3HWXLBPCY7VIBR55VMXXTQ7UZD","json":"https://pith.science/pith/3HWXLBPCY7VIBR55VMXXTQ7UZD.json","graph_json":"https://pith.science/api/pith-number/3HWXLBPCY7VIBR55VMXXTQ7UZD/graph.json","events_json":"https://pith.science/api/pith-number/3HWXLBPCY7VIBR55VMXXTQ7UZD/events.json","paper":"https://pith.science/paper/3HWXLBPC"},"agent_actions":{"view_html":"https://pith.science/pith/3HWXLBPCY7VIBR55VMXXTQ7UZD","download_json":"https://pith.science/pith/3HWXLBPCY7VIBR55VMXXTQ7UZD.json","view_paper":"https://pith.science/paper/3HWXLBPC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.07260&json=true","fetch_graph":"https://pith.science/api/pith-number/3HWXLBPCY7VIBR55VMXXTQ7UZD/graph.json","fetch_events":"https://pith.science/api/pith-number/3HWXLBPCY7VIBR55VMXXTQ7UZD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3HWXLBPCY7VIBR55VMXXTQ7UZD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3HWXLBPCY7VIBR55VMXXTQ7UZD/action/storage_attestation","attest_author":"https://pith.science/pith/3HWXLBPCY7VIBR55VMXXTQ7UZD/action/author_attestation","sign_citation":"https://pith.science/pith/3HWXLBPCY7VIBR55VMXXTQ7UZD/action/citation_signature","submit_replication":"https://pith.science/pith/3HWXLBPCY7VIBR55VMXXTQ7UZD/action/replication_record"}},"created_at":"2026-07-09T01:20:19.149935+00:00","updated_at":"2026-07-09T01:20:19.149935+00:00"}