{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:GPHCU6AUQTVQRYYGTNA5W5ZATQ","short_pith_number":"pith:GPHCU6AU","canonical_record":{"source":{"id":"1312.1523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-05T12:41:45Z","cross_cats_sorted":[],"title_canon_sha256":"be9e70fbed522764bf1e29bef498be043bca41f8ed78bc0aef1cda07881fa8d3","abstract_canon_sha256":"d631bc36f8b7f56aea6c338e86dd52ab6c551eae14ecb0d58d61e03c93bdea83"},"schema_version":"1.0"},"canonical_sha256":"33ce2a781484eb08e3069b41db77209c1e4766af3802ebacbaa37a538e198a46","source":{"kind":"arxiv","id":"1312.1523","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1523","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1523v1","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1523","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"pith_short_12","alias_value":"GPHCU6AUQTVQ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GPHCU6AUQTVQRYYG","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GPHCU6AU","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:GPHCU6AUQTVQRYYGTNA5W5ZATQ","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1523","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-05T12:41:45Z","cross_cats_sorted":[],"title_canon_sha256":"be9e70fbed522764bf1e29bef498be043bca41f8ed78bc0aef1cda07881fa8d3","abstract_canon_sha256":"d631bc36f8b7f56aea6c338e86dd52ab6c551eae14ecb0d58d61e03c93bdea83"},"schema_version":"1.0"},"canonical_sha256":"33ce2a781484eb08e3069b41db77209c1e4766af3802ebacbaa37a538e198a46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:27.031462Z","signature_b64":"cRHk21rYf1YawM4Ts7OD4fHeuDePhUBcIxU7huFRbsyZrzOHA1/3EoMF4I0WAxSfqZnUY98/OJ7Sa9wAAalLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33ce2a781484eb08e3069b41db77209c1e4766af3802ebacbaa37a538e198a46","last_reissued_at":"2026-05-18T03:05:27.030912Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:27.030912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1523","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-18T03:05:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"83cotVHhKoFL5+ye5CrF3GmDA009AY6yZbKFo9n/fxKPyl6bynJj0S8YPxsdqvQhFkkL1zSDGivuHMw7WnCVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T06:45:49.027601Z"},"content_sha256":"35a16ab41566ee81e2a5b10a8316cb107cd37a871c2e439e5e15aee872a38eeb","schema_version":"1.0","event_id":"sha256:35a16ab41566ee81e2a5b10a8316cb107cd37a871c2e439e5e15aee872a38eeb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:GPHCU6AUQTVQRYYGTNA5W5ZATQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient construction of broadcast graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"A. Averbuch, R. Hollander Shabtai, Y. Roditty","submitted_at":"2013-12-05T12:41:45Z","abstract_excerpt":"A broadcast graph is a connected graph, $G=(V,E)$, $ |V |=n$, in which each vertex can complete broadcasting of one message within at most $t=\\lceil \\log n\\rceil$ time units. A minimum broadcast graph on $n$ vertices is a broadcast graph with the minimum number of edges over all broadcast graphs on $n$ vertices. The cardinality of the edge set of such a graph is denoted by $B(n)$. In this paper we construct a new broadcast graph with\n  $B(n) \\le (k+1)N -(t-\\frac{k}{2}+2)2^{k}+t-k+2$, for $n=N=(2^{k}-1)2^{t+1-k}$ and\n  $B(n) \\le (k+1-p)n -(t-\\frac{k}{2}+p+2)2^{k}+t-k -(p-2)2^{p}$, for $2^{t} < "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1523","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":""},"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-18T03:05:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lpD4Cdn3Xmpe6upmYZJLt86s0t3WlU0unU8kHW+eVEWgnPGXyv18T2JLZCiYGKtU59sFJrroxODFvxU/DxqNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T06:45:49.027936Z"},"content_sha256":"7daa6c7849370ee03f99415b4582b75d056cfab26d3a2b88da16fcdecc1dbe06","schema_version":"1.0","event_id":"sha256:7daa6c7849370ee03f99415b4582b75d056cfab26d3a2b88da16fcdecc1dbe06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPHCU6AUQTVQRYYGTNA5W5ZATQ/bundle.json","state_url":"https://pith.science/pith/GPHCU6AUQTVQRYYGTNA5W5ZATQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPHCU6AUQTVQRYYGTNA5W5ZATQ/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-06-29T06:45:49Z","links":{"resolver":"https://pith.science/pith/GPHCU6AUQTVQRYYGTNA5W5ZATQ","bundle":"https://pith.science/pith/GPHCU6AUQTVQRYYGTNA5W5ZATQ/bundle.json","state":"https://pith.science/pith/GPHCU6AUQTVQRYYGTNA5W5ZATQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPHCU6AUQTVQRYYGTNA5W5ZATQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:GPHCU6AUQTVQRYYGTNA5W5ZATQ","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":"d631bc36f8b7f56aea6c338e86dd52ab6c551eae14ecb0d58d61e03c93bdea83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-05T12:41:45Z","title_canon_sha256":"be9e70fbed522764bf1e29bef498be043bca41f8ed78bc0aef1cda07881fa8d3"},"schema_version":"1.0","source":{"id":"1312.1523","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1523","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1523v1","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1523","created_at":"2026-05-18T03:05:27Z"},{"alias_kind":"pith_short_12","alias_value":"GPHCU6AUQTVQ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"GPHCU6AUQTVQRYYG","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"GPHCU6AU","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:7daa6c7849370ee03f99415b4582b75d056cfab26d3a2b88da16fcdecc1dbe06","target":"graph","created_at":"2026-05-18T03:05:27Z","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"},"paper":{"abstract_excerpt":"A broadcast graph is a connected graph, $G=(V,E)$, $ |V |=n$, in which each vertex can complete broadcasting of one message within at most $t=\\lceil \\log n\\rceil$ time units. A minimum broadcast graph on $n$ vertices is a broadcast graph with the minimum number of edges over all broadcast graphs on $n$ vertices. The cardinality of the edge set of such a graph is denoted by $B(n)$. In this paper we construct a new broadcast graph with\n  $B(n) \\le (k+1)N -(t-\\frac{k}{2}+2)2^{k}+t-k+2$, for $n=N=(2^{k}-1)2^{t+1-k}$ and\n  $B(n) \\le (k+1-p)n -(t-\\frac{k}{2}+p+2)2^{k}+t-k -(p-2)2^{p}$, for $2^{t} < ","authors_text":"A. Averbuch, R. Hollander Shabtai, Y. Roditty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-05T12:41:45Z","title":"Efficient construction of broadcast graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1523","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:35a16ab41566ee81e2a5b10a8316cb107cd37a871c2e439e5e15aee872a38eeb","target":"record","created_at":"2026-05-18T03:05:27Z","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":"d631bc36f8b7f56aea6c338e86dd52ab6c551eae14ecb0d58d61e03c93bdea83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-05T12:41:45Z","title_canon_sha256":"be9e70fbed522764bf1e29bef498be043bca41f8ed78bc0aef1cda07881fa8d3"},"schema_version":"1.0","source":{"id":"1312.1523","kind":"arxiv","version":1}},"canonical_sha256":"33ce2a781484eb08e3069b41db77209c1e4766af3802ebacbaa37a538e198a46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33ce2a781484eb08e3069b41db77209c1e4766af3802ebacbaa37a538e198a46","first_computed_at":"2026-05-18T03:05:27.030912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:27.030912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cRHk21rYf1YawM4Ts7OD4fHeuDePhUBcIxU7huFRbsyZrzOHA1/3EoMF4I0WAxSfqZnUY98/OJ7Sa9wAAalLBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:27.031462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1523","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35a16ab41566ee81e2a5b10a8316cb107cd37a871c2e439e5e15aee872a38eeb","sha256:7daa6c7849370ee03f99415b4582b75d056cfab26d3a2b88da16fcdecc1dbe06"],"state_sha256":"0b187bccea25adff7d29835f2ede7cc8cb014e47ec822508b276bf5064e319b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6neELqFDi+JLuH/0h/AIuhZ3Og1g/+wAgNbrEPEnU+6EAo8ZHk/o5OzyZzGYciexXN21C5KVvhV0m80D+LkRDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T06:45:49.029713Z","bundle_sha256":"b8443ee5604252d6ae2029d83eaea0e0c6466ee71a9db5c04832d912a2c68c8a"}}