{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:5QOS7DARLFEPU4EVOOLSKRXHU4","short_pith_number":"pith:5QOS7DAR","canonical_record":{"source":{"id":"1512.02179","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-07T19:21:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8f94ab1e610a51abae8d0c01f283b37e655c7e4fec0d12a7b38c02883b20632c","abstract_canon_sha256":"86173745b5d904704d5e24807062c61a84ca8ad88996661e6b4d96920a3613ec"},"schema_version":"1.0"},"canonical_sha256":"ec1d2f8c115948fa709573972546e7a72ab40e1c2dffe0d9f81e1e258e80893f","source":{"kind":"arxiv","id":"1512.02179","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02179","created_at":"2026-05-18T01:25:09Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02179v1","created_at":"2026-05-18T01:25:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02179","created_at":"2026-05-18T01:25:09Z"},{"alias_kind":"pith_short_12","alias_value":"5QOS7DARLFEP","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5QOS7DARLFEPU4EV","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5QOS7DAR","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:5QOS7DARLFEPU4EVOOLSKRXHU4","target":"record","payload":{"canonical_record":{"source":{"id":"1512.02179","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-07T19:21:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8f94ab1e610a51abae8d0c01f283b37e655c7e4fec0d12a7b38c02883b20632c","abstract_canon_sha256":"86173745b5d904704d5e24807062c61a84ca8ad88996661e6b4d96920a3613ec"},"schema_version":"1.0"},"canonical_sha256":"ec1d2f8c115948fa709573972546e7a72ab40e1c2dffe0d9f81e1e258e80893f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:09.450732Z","signature_b64":"1mrjWAlyvfjEz9WhKlQ09JmAIfN6X62w2Q2rSj5BBs/Ln9VGSU6j0fDKWiaaIlbDfKl2m65V+B7r3+E6qnVCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec1d2f8c115948fa709573972546e7a72ab40e1c2dffe0d9f81e1e258e80893f","last_reissued_at":"2026-05-18T01:25:09.450090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:09.450090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.02179","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-18T01:25:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vfzepblOJYhQOAwySr693e0IuVQNHL8ie4trZfyKU5pqNJN1935TYcEP/1CXagxY9oQ6PsUX3wiqQYi42i3ZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:25:09.917383Z"},"content_sha256":"17f47e81a12562aed72196fad9517c4acdc392e9dabb954310c3985fbd06aa29","schema_version":"1.0","event_id":"sha256:17f47e81a12562aed72196fad9517c4acdc392e9dabb954310c3985fbd06aa29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:5QOS7DARLFEPU4EVOOLSKRXHU4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Information Gathering in Ad-Hoc Radio Tree Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Kevin P. Costello, Marek Chrobak","submitted_at":"2015-12-07T19:21:59Z","abstract_excerpt":"We study information gathering in ad-hoc radio networks. Initially, each node of the network has a piece of information called a rumor, and the overall objective is to gather all these rumors in the designated target node. The ad-hoc property refers to the fact that the topology of the network is unknown when the computation starts. Aggregation of rumors is not allowed, which means that each node may transmit at most one rumor in one step.\n  We focus on networks with tree topologies, that is we assume that the network is a tree with all edges directed towards the root, but, being ad-hoc, its a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02179","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-18T01:25:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PS3uQzOQfV9Yvg7H+aOjQLZ57+VmftoqbdJUBzi4qPqqXR8NOT+hKwHujlPaDnIDDMPLMGzI0S2DtloxqS8pCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T20:25:09.917746Z"},"content_sha256":"3ee47a0cdfd17d4e896fb6ba4733afd5626111a4edb9048782b0a7c18e509039","schema_version":"1.0","event_id":"sha256:3ee47a0cdfd17d4e896fb6ba4733afd5626111a4edb9048782b0a7c18e509039"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5QOS7DARLFEPU4EVOOLSKRXHU4/bundle.json","state_url":"https://pith.science/pith/5QOS7DARLFEPU4EVOOLSKRXHU4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5QOS7DARLFEPU4EVOOLSKRXHU4/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-23T20:25:09Z","links":{"resolver":"https://pith.science/pith/5QOS7DARLFEPU4EVOOLSKRXHU4","bundle":"https://pith.science/pith/5QOS7DARLFEPU4EVOOLSKRXHU4/bundle.json","state":"https://pith.science/pith/5QOS7DARLFEPU4EVOOLSKRXHU4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5QOS7DARLFEPU4EVOOLSKRXHU4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:5QOS7DARLFEPU4EVOOLSKRXHU4","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":"86173745b5d904704d5e24807062c61a84ca8ad88996661e6b4d96920a3613ec","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-07T19:21:59Z","title_canon_sha256":"8f94ab1e610a51abae8d0c01f283b37e655c7e4fec0d12a7b38c02883b20632c"},"schema_version":"1.0","source":{"id":"1512.02179","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02179","created_at":"2026-05-18T01:25:09Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02179v1","created_at":"2026-05-18T01:25:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02179","created_at":"2026-05-18T01:25:09Z"},{"alias_kind":"pith_short_12","alias_value":"5QOS7DARLFEP","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"5QOS7DARLFEPU4EV","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"5QOS7DAR","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:3ee47a0cdfd17d4e896fb6ba4733afd5626111a4edb9048782b0a7c18e509039","target":"graph","created_at":"2026-05-18T01:25:09Z","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":"We study information gathering in ad-hoc radio networks. Initially, each node of the network has a piece of information called a rumor, and the overall objective is to gather all these rumors in the designated target node. The ad-hoc property refers to the fact that the topology of the network is unknown when the computation starts. Aggregation of rumors is not allowed, which means that each node may transmit at most one rumor in one step.\n  We focus on networks with tree topologies, that is we assume that the network is a tree with all edges directed towards the root, but, being ad-hoc, its a","authors_text":"Kevin P. Costello, Marek Chrobak","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-07T19:21:59Z","title":"Faster Information Gathering in Ad-Hoc Radio Tree Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02179","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:17f47e81a12562aed72196fad9517c4acdc392e9dabb954310c3985fbd06aa29","target":"record","created_at":"2026-05-18T01:25:09Z","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":"86173745b5d904704d5e24807062c61a84ca8ad88996661e6b4d96920a3613ec","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-07T19:21:59Z","title_canon_sha256":"8f94ab1e610a51abae8d0c01f283b37e655c7e4fec0d12a7b38c02883b20632c"},"schema_version":"1.0","source":{"id":"1512.02179","kind":"arxiv","version":1}},"canonical_sha256":"ec1d2f8c115948fa709573972546e7a72ab40e1c2dffe0d9f81e1e258e80893f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec1d2f8c115948fa709573972546e7a72ab40e1c2dffe0d9f81e1e258e80893f","first_computed_at":"2026-05-18T01:25:09.450090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:09.450090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1mrjWAlyvfjEz9WhKlQ09JmAIfN6X62w2Q2rSj5BBs/Ln9VGSU6j0fDKWiaaIlbDfKl2m65V+B7r3+E6qnVCAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:09.450732Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.02179","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17f47e81a12562aed72196fad9517c4acdc392e9dabb954310c3985fbd06aa29","sha256:3ee47a0cdfd17d4e896fb6ba4733afd5626111a4edb9048782b0a7c18e509039"],"state_sha256":"a8117904a6b6620e1c8040c3bce8adabe17970992f2965b4b390e37433af3ca7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AiOgk9zGtTVvgHb1+R8/fLzwbmZuyBPtOH5rITzOcbcltjR/fB35dQ004DadFixb04M2J9dh2VDtVC7n+wQ8BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T20:25:09.919814Z","bundle_sha256":"460925fc1562d20c37ee0da006d3a846228a3f477b2e7467d61053e7e5797c96"}}