{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:3HWXLBPCY7VIBR55VMXXTQ7UZD","short_pith_number":"pith:3HWXLBPC","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"},"canonical_sha256":"d9ed7585e2c7ea80c7bdab2f79c3f4c8d476a84a3d0169cca646381174d3107d","source":{"kind":"arxiv","id":"2607.07260","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07260","created_at":"2026-07-09T01:20:19Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07260v1","created_at":"2026-07-09T01:20:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07260","created_at":"2026-07-09T01:20:19Z"},{"alias_kind":"pith_short_12","alias_value":"3HWXLBPCY7VI","created_at":"2026-07-09T01:20:19Z"},{"alias_kind":"pith_short_16","alias_value":"3HWXLBPCY7VIBR55","created_at":"2026-07-09T01:20:19Z"},{"alias_kind":"pith_short_8","alias_value":"3HWXLBPC","created_at":"2026-07-09T01:20:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:3HWXLBPCY7VIBR55VMXXTQ7UZD","target":"record","payload":{"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"},"canonical_sha256":"d9ed7585e2c7ea80c7bdab2f79c3f4c8d476a84a3d0169cca646381174d3107d","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"},"source_kind":"arxiv","source_id":"2607.07260","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-09T01:20:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g1ebF1GMwOAKkmQ4V95JAHHRde4VwTIjEKdsTJ09gmE0pMHTU8NESSvlbqJDaflOYaV0ubWwf2OPvaeb1KCJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:31:42.067611Z"},"content_sha256":"6c2eaf69d7fb86b7837611dd72925132ec3ef5a2f10b293313880aaa6bb67a33","schema_version":"1.0","event_id":"sha256:6c2eaf69d7fb86b7837611dd72925132ec3ef5a2f10b293313880aaa6bb67a33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:3HWXLBPCY7VIBR55VMXXTQ7UZD","target":"graph","payload":{"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"},"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-09T01:20:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NuyDkTSYkqX0Y8omI3NhYMprFBhR/UwixGQN4nQLAZ+v5E2MGUwiWPMMydkvOMZq2vs48NaD3j0OyXJsQyMCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T02:31:42.068097Z"},"content_sha256":"46d360ca6a27a8c570441680021b5b9ed6c6f77825cd20543ca088cd4655f8f3","schema_version":"1.0","event_id":"sha256:46d360ca6a27a8c570441680021b5b9ed6c6f77825cd20543ca088cd4655f8f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3HWXLBPCY7VIBR55VMXXTQ7UZD/bundle.json","state_url":"https://pith.science/pith/3HWXLBPCY7VIBR55VMXXTQ7UZD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3HWXLBPCY7VIBR55VMXXTQ7UZD/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-08-11T02:31:42Z","links":{"resolver":"https://pith.science/pith/3HWXLBPCY7VIBR55VMXXTQ7UZD","bundle":"https://pith.science/pith/3HWXLBPCY7VIBR55VMXXTQ7UZD/bundle.json","state":"https://pith.science/pith/3HWXLBPCY7VIBR55VMXXTQ7UZD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3HWXLBPCY7VIBR55VMXXTQ7UZD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3HWXLBPCY7VIBR55VMXXTQ7UZD","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":"3e1a567b5883bdf2d2eb0a73840afe0fddad6ccfd1cebc245a969fac07f048c3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-07-08T10:47:56Z","title_canon_sha256":"d00938ba14d7ad5348864fbe9ddbf48c4fce5a655cb8b8a2da1221918876f7c2"},"schema_version":"1.0","source":{"id":"2607.07260","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07260","created_at":"2026-07-09T01:20:19Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07260v1","created_at":"2026-07-09T01:20:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07260","created_at":"2026-07-09T01:20:19Z"},{"alias_kind":"pith_short_12","alias_value":"3HWXLBPCY7VI","created_at":"2026-07-09T01:20:19Z"},{"alias_kind":"pith_short_16","alias_value":"3HWXLBPCY7VIBR55","created_at":"2026-07-09T01:20:19Z"},{"alias_kind":"pith_short_8","alias_value":"3HWXLBPC","created_at":"2026-07-09T01:20:19Z"}],"graph_snapshots":[{"event_id":"sha256:46d360ca6a27a8c570441680021b5b9ed6c6f77825cd20543ca088cd4655f8f3","target":"graph","created_at":"2026-07-09T01:20:19Z","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.07260/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Hovhannes Harutyunyan, Pierre Fraigniaud","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-07-08T10:47:56Z","title":"Sparse Relaxed Broadcast Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07260","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:6c2eaf69d7fb86b7837611dd72925132ec3ef5a2f10b293313880aaa6bb67a33","target":"record","created_at":"2026-07-09T01:20:19Z","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":"3e1a567b5883bdf2d2eb0a73840afe0fddad6ccfd1cebc245a969fac07f048c3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2026-07-08T10:47:56Z","title_canon_sha256":"d00938ba14d7ad5348864fbe9ddbf48c4fce5a655cb8b8a2da1221918876f7c2"},"schema_version":"1.0","source":{"id":"2607.07260","kind":"arxiv","version":1}},"canonical_sha256":"d9ed7585e2c7ea80c7bdab2f79c3f4c8d476a84a3d0169cca646381174d3107d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9ed7585e2c7ea80c7bdab2f79c3f4c8d476a84a3d0169cca646381174d3107d","first_computed_at":"2026-07-09T01:20:19.149878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-09T01:20:19.149878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NCHYrJH/gXO8F8aZ7OfeH3euUfITFIE6gJe++DziLXb1Z42EN0JHwsM05eaWVN7HSuyKfV+IqEitWqoYXiJNCg==","signature_status":"signed_v1","signed_at":"2026-07-09T01:20:19.150270Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.07260","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c2eaf69d7fb86b7837611dd72925132ec3ef5a2f10b293313880aaa6bb67a33","sha256:46d360ca6a27a8c570441680021b5b9ed6c6f77825cd20543ca088cd4655f8f3"],"state_sha256":"297d2cde57b9a48dc218f51883af2454d8422e2f6f839e3ab6a1b7511c86039d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VhvmjgQy0UCrNzDP4UvMSDDf9+fdjoQA+Z2jnh0Aw+rnsKVlQeABwKHZ+KQTAvzmJkb5ufgstN74MUQyYvmfCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T02:31:42.073156Z","bundle_sha256":"a49a095abcdc36be032547c24e12e5d3b60f4e6f76bcd933602a3c1054e80f1c"}}