{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WRS7LZSEJZCPMRPK47NB3EU5XP","short_pith_number":"pith:WRS7LZSE","canonical_record":{"source":{"id":"1603.08393","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-28T14:55:10Z","cross_cats_sorted":[],"title_canon_sha256":"c23d986b574c30592418bd005d4e20e8d3cf89acc6f1bcf773bb12773c78ef17","abstract_canon_sha256":"5c39f61f009c7c201bd02cab1134cf5d0316738fa99be28433bba7d5da67e2c7"},"schema_version":"1.0"},"canonical_sha256":"b465f5e6444e44f645eae7da1d929dbbd20aa7a36edfcae5f9d4fa0002582da3","source":{"kind":"arxiv","id":"1603.08393","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08393","created_at":"2026-05-18T01:18:10Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08393v1","created_at":"2026-05-18T01:18:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08393","created_at":"2026-05-18T01:18:10Z"},{"alias_kind":"pith_short_12","alias_value":"WRS7LZSEJZCP","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WRS7LZSEJZCPMRPK","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WRS7LZSE","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WRS7LZSEJZCPMRPK47NB3EU5XP","target":"record","payload":{"canonical_record":{"source":{"id":"1603.08393","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-28T14:55:10Z","cross_cats_sorted":[],"title_canon_sha256":"c23d986b574c30592418bd005d4e20e8d3cf89acc6f1bcf773bb12773c78ef17","abstract_canon_sha256":"5c39f61f009c7c201bd02cab1134cf5d0316738fa99be28433bba7d5da67e2c7"},"schema_version":"1.0"},"canonical_sha256":"b465f5e6444e44f645eae7da1d929dbbd20aa7a36edfcae5f9d4fa0002582da3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:10.891930Z","signature_b64":"93f2O2FbZslTNFtM/3OfOgczjxFv4feZ+VKH2ntiKforIPL6XT5DaBXOuL7vmtLZtorrdh8maMlfhAGzUXObBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b465f5e6444e44f645eae7da1d929dbbd20aa7a36edfcae5f9d4fa0002582da3","last_reissued_at":"2026-05-18T01:18:10.891479Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:10.891479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.08393","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:18:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M3VUys23M+fAnNSlUHHLI8mgWIo1BQz0Tsa0qijx2SavvsO7GIRGbY9rgfY3gXr8PwRkBwNrf7fnhegg8Yf9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:29:48.426903Z"},"content_sha256":"82998975b686d10bf3ffb5753e120994964fe014b9205271f3e8f6f9fd5801ab","schema_version":"1.0","event_id":"sha256:82998975b686d10bf3ffb5753e120994964fe014b9205271f3e8f6f9fd5801ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WRS7LZSEJZCPMRPK47NB3EU5XP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$k$-shot Broadcasting in Ad Hoc Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aris Pagourtzis, Dimitris Sakavalas, Paraschos Koutris, Sushanta Karmakar","submitted_at":"2016-03-28T14:55:10Z","abstract_excerpt":"We study distributed broadcasting protocols with few transmissions (`shots') in radio networks where the topology is unknown. In particular, we examine the case in which a bound $k$ is given and a node may transmit at most $k$ times during the broadcasting protocol. Initially, we focus on oblivious algorithms for $k$-shot broadcasting, that is, algorithms where each node decides whether to transmit or not with no consideration of the transmission history. Our main contributions are (a) a lower bound of $\\Omega(n^2/k)$ on the broadcasting time of any oblivious $k$-shot broadcasting algorithm an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08393","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:18:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RTk+2IlddwT3pE06rKvRpaPtf7iDuQS3L293NWkzWjQOjOf0SbpS7u4Y66L8BxNykS+I4QSUOIJ0Er0JcN3wDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:29:48.427245Z"},"content_sha256":"ae711b190c61f54988b3c70435ce150a50ff70a8c9c2078dab463b3c306dbace","schema_version":"1.0","event_id":"sha256:ae711b190c61f54988b3c70435ce150a50ff70a8c9c2078dab463b3c306dbace"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WRS7LZSEJZCPMRPK47NB3EU5XP/bundle.json","state_url":"https://pith.science/pith/WRS7LZSEJZCPMRPK47NB3EU5XP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WRS7LZSEJZCPMRPK47NB3EU5XP/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-25T20:29:48Z","links":{"resolver":"https://pith.science/pith/WRS7LZSEJZCPMRPK47NB3EU5XP","bundle":"https://pith.science/pith/WRS7LZSEJZCPMRPK47NB3EU5XP/bundle.json","state":"https://pith.science/pith/WRS7LZSEJZCPMRPK47NB3EU5XP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WRS7LZSEJZCPMRPK47NB3EU5XP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WRS7LZSEJZCPMRPK47NB3EU5XP","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":"5c39f61f009c7c201bd02cab1134cf5d0316738fa99be28433bba7d5da67e2c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-28T14:55:10Z","title_canon_sha256":"c23d986b574c30592418bd005d4e20e8d3cf89acc6f1bcf773bb12773c78ef17"},"schema_version":"1.0","source":{"id":"1603.08393","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.08393","created_at":"2026-05-18T01:18:10Z"},{"alias_kind":"arxiv_version","alias_value":"1603.08393v1","created_at":"2026-05-18T01:18:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.08393","created_at":"2026-05-18T01:18:10Z"},{"alias_kind":"pith_short_12","alias_value":"WRS7LZSEJZCP","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WRS7LZSEJZCPMRPK","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WRS7LZSE","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:ae711b190c61f54988b3c70435ce150a50ff70a8c9c2078dab463b3c306dbace","target":"graph","created_at":"2026-05-18T01:18:10Z","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 distributed broadcasting protocols with few transmissions (`shots') in radio networks where the topology is unknown. In particular, we examine the case in which a bound $k$ is given and a node may transmit at most $k$ times during the broadcasting protocol. Initially, we focus on oblivious algorithms for $k$-shot broadcasting, that is, algorithms where each node decides whether to transmit or not with no consideration of the transmission history. Our main contributions are (a) a lower bound of $\\Omega(n^2/k)$ on the broadcasting time of any oblivious $k$-shot broadcasting algorithm an","authors_text":"Aris Pagourtzis, Dimitris Sakavalas, Paraschos Koutris, Sushanta Karmakar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-28T14:55:10Z","title":"$k$-shot Broadcasting in Ad Hoc Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.08393","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:82998975b686d10bf3ffb5753e120994964fe014b9205271f3e8f6f9fd5801ab","target":"record","created_at":"2026-05-18T01:18:10Z","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":"5c39f61f009c7c201bd02cab1134cf5d0316738fa99be28433bba7d5da67e2c7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-03-28T14:55:10Z","title_canon_sha256":"c23d986b574c30592418bd005d4e20e8d3cf89acc6f1bcf773bb12773c78ef17"},"schema_version":"1.0","source":{"id":"1603.08393","kind":"arxiv","version":1}},"canonical_sha256":"b465f5e6444e44f645eae7da1d929dbbd20aa7a36edfcae5f9d4fa0002582da3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b465f5e6444e44f645eae7da1d929dbbd20aa7a36edfcae5f9d4fa0002582da3","first_computed_at":"2026-05-18T01:18:10.891479Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:10.891479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"93f2O2FbZslTNFtM/3OfOgczjxFv4feZ+VKH2ntiKforIPL6XT5DaBXOuL7vmtLZtorrdh8maMlfhAGzUXObBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:10.891930Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.08393","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82998975b686d10bf3ffb5753e120994964fe014b9205271f3e8f6f9fd5801ab","sha256:ae711b190c61f54988b3c70435ce150a50ff70a8c9c2078dab463b3c306dbace"],"state_sha256":"ddd02f2d57162650ab8557af5d857b622e32a87aba4a77c75c7b8720cbe3b6e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aqbupQxVFEDfm564vziLC2P6c3J0nC08p5DIAT1Uu+Q67JzN2m3Xc/y71oWMcKsW8H4PcOUIlxgowcr3TxuTCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:29:48.429210Z","bundle_sha256":"8f9bc260b61f01daca9a50aa5353a255d0016ba930c0a5054363127d86a61921"}}