{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:GRZJZBTPMONP653LOOFMS63BCR","short_pith_number":"pith:GRZJZBTP","schema_version":"1.0","canonical_sha256":"34729c866f639aff776b738ac97b61145f76c7238db663c35ff512186f4694dc","source":{"kind":"arxiv","id":"1105.0479","version":1},"attestation_state":"computed","paper":{"title":"Faster Gossiping in Bidirectional Radio Networks with Large Labels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Shailesh Vaya","submitted_at":"2011-05-03T06:06:15Z","abstract_excerpt":"We consider unknown ad-hoc radio networks, when the underlying network is bidirectional and nodes can have polynomially large labels. For this model, we present a deterministic protocol for gossiping which takes $O(n \\lg^2 n \\lg \\lg n)$ rounds. This improves upon the previous best result for deterministic gossiping for this model by [Gasienec, Potapov, Pagourtizis, Deterministic Gossiping in Radio Networks with Large labels, ESA (2002)], who present a protocol of round complexity $O(n \\lg^3 n \\lg \\lg n)$ for this problem. This resolves open problem posed in [Gasienec, Efficient gossiping in ra"},"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":"1105.0479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-05-03T06:06:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e964f2a0768f0a7e76922627ac6753e4a7a126bb08d99a09b131e61991544323","abstract_canon_sha256":"c64693c5807d379d1c0a89d07102628a7c09731a2222d2ac14f79e26c9bebf81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:11.202876Z","signature_b64":"t2dZticc8IBynVA6vZzJu6tb+edc/tCrpogoHu+Q2/F2DQqOZHadVI7yKoqqQuSlQADk41HR5aizK1AG+8HaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34729c866f639aff776b738ac97b61145f76c7238db663c35ff512186f4694dc","last_reissued_at":"2026-05-18T04:23:11.202453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:11.202453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Gossiping in Bidirectional Radio Networks with Large Labels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Shailesh Vaya","submitted_at":"2011-05-03T06:06:15Z","abstract_excerpt":"We consider unknown ad-hoc radio networks, when the underlying network is bidirectional and nodes can have polynomially large labels. For this model, we present a deterministic protocol for gossiping which takes $O(n \\lg^2 n \\lg \\lg n)$ rounds. This improves upon the previous best result for deterministic gossiping for this model by [Gasienec, Potapov, Pagourtizis, Deterministic Gossiping in Radio Networks with Large labels, ESA (2002)], who present a protocol of round complexity $O(n \\lg^3 n \\lg \\lg n)$ for this problem. This resolves open problem posed in [Gasienec, Efficient gossiping in ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0479","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1105.0479","created_at":"2026-05-18T04:23:11.202526+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.0479v1","created_at":"2026-05-18T04:23:11.202526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0479","created_at":"2026-05-18T04:23:11.202526+00:00"},{"alias_kind":"pith_short_12","alias_value":"GRZJZBTPMONP","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"GRZJZBTPMONP653L","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"GRZJZBTP","created_at":"2026-05-18T12:26:30.835961+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/GRZJZBTPMONP653LOOFMS63BCR","json":"https://pith.science/pith/GRZJZBTPMONP653LOOFMS63BCR.json","graph_json":"https://pith.science/api/pith-number/GRZJZBTPMONP653LOOFMS63BCR/graph.json","events_json":"https://pith.science/api/pith-number/GRZJZBTPMONP653LOOFMS63BCR/events.json","paper":"https://pith.science/paper/GRZJZBTP"},"agent_actions":{"view_html":"https://pith.science/pith/GRZJZBTPMONP653LOOFMS63BCR","download_json":"https://pith.science/pith/GRZJZBTPMONP653LOOFMS63BCR.json","view_paper":"https://pith.science/paper/GRZJZBTP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.0479&json=true","fetch_graph":"https://pith.science/api/pith-number/GRZJZBTPMONP653LOOFMS63BCR/graph.json","fetch_events":"https://pith.science/api/pith-number/GRZJZBTPMONP653LOOFMS63BCR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GRZJZBTPMONP653LOOFMS63BCR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GRZJZBTPMONP653LOOFMS63BCR/action/storage_attestation","attest_author":"https://pith.science/pith/GRZJZBTPMONP653LOOFMS63BCR/action/author_attestation","sign_citation":"https://pith.science/pith/GRZJZBTPMONP653LOOFMS63BCR/action/citation_signature","submit_replication":"https://pith.science/pith/GRZJZBTPMONP653LOOFMS63BCR/action/replication_record"}},"created_at":"2026-05-18T04:23:11.202526+00:00","updated_at":"2026-05-18T04:23:11.202526+00:00"}