{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2TLY5CXHBK2DSNQ5RLKKILC4RR","short_pith_number":"pith:2TLY5CXH","schema_version":"1.0","canonical_sha256":"d4d78e8ae70ab439361d8ad4a42c5c8c66ac2fced80636df937f6c5e5f664914","source":{"kind":"arxiv","id":"1811.03278","version":1},"attestation_state":"computed","paper":{"title":"Approximate Neighbor Counting in Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Calvin Newport, Chaodong Zheng","submitted_at":"2018-11-08T05:21:10Z","abstract_excerpt":"For many distributed algorithms, neighborhood size is an important parameter. In radio networks, however, obtaining this information can be difficult due to ad hoc deployments and communication that occurs on a collision-prone shared channel. This paper conducts a comprehensive survey of the approximate neighbor counting problem, which requires nodes to obtain a constant factor approximation of the size of their network neighborhood. We produce new lower and upper bounds for three main variations of this problem in the radio network model: (a) the network is single-hop and every node must obta"},"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":"1811.03278","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-08T05:21:10Z","cross_cats_sorted":[],"title_canon_sha256":"5098a0011e9f0538860119e44865590af9b85ff722f013bc67bb814ee4d71876","abstract_canon_sha256":"9563840115bf41bc4bdd4923794c8b666860f7d7f767b624c10e36cae57dacaf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:17.058825Z","signature_b64":"f/nB7flaKVPRRKNdEvE2KPRkFBCHmnZs70v/vNjlt27rV9YIINPcXPz5mb0cT69qA4qK5XvUFZI2JV7SvZvcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4d78e8ae70ab439361d8ad4a42c5c8c66ac2fced80636df937f6c5e5f664914","last_reissued_at":"2026-05-18T00:01:17.058435Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:17.058435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Neighbor Counting in Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Calvin Newport, Chaodong Zheng","submitted_at":"2018-11-08T05:21:10Z","abstract_excerpt":"For many distributed algorithms, neighborhood size is an important parameter. In radio networks, however, obtaining this information can be difficult due to ad hoc deployments and communication that occurs on a collision-prone shared channel. This paper conducts a comprehensive survey of the approximate neighbor counting problem, which requires nodes to obtain a constant factor approximation of the size of their network neighborhood. We produce new lower and upper bounds for three main variations of this problem in the radio network model: (a) the network is single-hop and every node must obta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03278","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":"1811.03278","created_at":"2026-05-18T00:01:17.058494+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03278v1","created_at":"2026-05-18T00:01:17.058494+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03278","created_at":"2026-05-18T00:01:17.058494+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TLY5CXHBK2D","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TLY5CXHBK2DSNQ5","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TLY5CXH","created_at":"2026-05-18T12:32:02.567920+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/2TLY5CXHBK2DSNQ5RLKKILC4RR","json":"https://pith.science/pith/2TLY5CXHBK2DSNQ5RLKKILC4RR.json","graph_json":"https://pith.science/api/pith-number/2TLY5CXHBK2DSNQ5RLKKILC4RR/graph.json","events_json":"https://pith.science/api/pith-number/2TLY5CXHBK2DSNQ5RLKKILC4RR/events.json","paper":"https://pith.science/paper/2TLY5CXH"},"agent_actions":{"view_html":"https://pith.science/pith/2TLY5CXHBK2DSNQ5RLKKILC4RR","download_json":"https://pith.science/pith/2TLY5CXHBK2DSNQ5RLKKILC4RR.json","view_paper":"https://pith.science/paper/2TLY5CXH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03278&json=true","fetch_graph":"https://pith.science/api/pith-number/2TLY5CXHBK2DSNQ5RLKKILC4RR/graph.json","fetch_events":"https://pith.science/api/pith-number/2TLY5CXHBK2DSNQ5RLKKILC4RR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TLY5CXHBK2DSNQ5RLKKILC4RR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TLY5CXHBK2DSNQ5RLKKILC4RR/action/storage_attestation","attest_author":"https://pith.science/pith/2TLY5CXHBK2DSNQ5RLKKILC4RR/action/author_attestation","sign_citation":"https://pith.science/pith/2TLY5CXHBK2DSNQ5RLKKILC4RR/action/citation_signature","submit_replication":"https://pith.science/pith/2TLY5CXHBK2DSNQ5RLKKILC4RR/action/replication_record"}},"created_at":"2026-05-18T00:01:17.058494+00:00","updated_at":"2026-05-18T00:01:17.058494+00:00"}