{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:I7LDZPIWQSGVAWFBVBXHTLHISG","short_pith_number":"pith:I7LDZPIW","schema_version":"1.0","canonical_sha256":"47d63cbd16848d5058a1a86e79ace891aa3987b825da6a816170fccb9c164320","source":{"kind":"arxiv","id":"1012.1007","version":4},"attestation_state":"computed","paper":{"title":"Neighbor Discovery for Wireless Networks via Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Dongning Guo, Jun Luo, Lei Zhang","submitted_at":"2010-12-05T16:09:51Z","abstract_excerpt":"This paper studies the problem of neighbor discovery in wireless networks, namely, each node wishes to discover and identify the network interface addresses (NIAs) of those nodes within a single hop. A novel paradigm, called compressed neighbor discovery is proposed, which enables all nodes to simultaneously discover their respective neighborhoods with a single frame of transmission, which is typically of a few thousand symbol epochs. The key technique is to assign each node a unique on-off signature and let all nodes simultaneously transmit their signatures. Despite that the radios are half-d"},"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":"1012.1007","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-12-05T16:09:51Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"082dc140776184f4b09342505a8262c984fce5f334c748d3395e1abe03285291","abstract_canon_sha256":"d49810013750e76e86763b7297b520113795108f51d2bfb03bc2b39702ba48a1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:15.734975Z","signature_b64":"Cdpt/sHg/zqC0hsf1O6Su3cgGRrAhGlYAXSKax3lL6gDkxjeAvcfdIB8xcnvemVsiTcRnEoRgc0Ed/05aQ2ZAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47d63cbd16848d5058a1a86e79ace891aa3987b825da6a816170fccb9c164320","last_reissued_at":"2026-05-18T02:23:15.734310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:15.734310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neighbor Discovery for Wireless Networks via Compressed Sensing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Dongning Guo, Jun Luo, Lei Zhang","submitted_at":"2010-12-05T16:09:51Z","abstract_excerpt":"This paper studies the problem of neighbor discovery in wireless networks, namely, each node wishes to discover and identify the network interface addresses (NIAs) of those nodes within a single hop. A novel paradigm, called compressed neighbor discovery is proposed, which enables all nodes to simultaneously discover their respective neighborhoods with a single frame of transmission, which is typically of a few thousand symbol epochs. The key technique is to assign each node a unique on-off signature and let all nodes simultaneously transmit their signatures. Despite that the radios are half-d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1007","kind":"arxiv","version":4},"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":"1012.1007","created_at":"2026-05-18T02:23:15.734419+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.1007v4","created_at":"2026-05-18T02:23:15.734419+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1007","created_at":"2026-05-18T02:23:15.734419+00:00"},{"alias_kind":"pith_short_12","alias_value":"I7LDZPIWQSGV","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"I7LDZPIWQSGVAWFB","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"I7LDZPIW","created_at":"2026-05-18T12:26:07.630475+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/I7LDZPIWQSGVAWFBVBXHTLHISG","json":"https://pith.science/pith/I7LDZPIWQSGVAWFBVBXHTLHISG.json","graph_json":"https://pith.science/api/pith-number/I7LDZPIWQSGVAWFBVBXHTLHISG/graph.json","events_json":"https://pith.science/api/pith-number/I7LDZPIWQSGVAWFBVBXHTLHISG/events.json","paper":"https://pith.science/paper/I7LDZPIW"},"agent_actions":{"view_html":"https://pith.science/pith/I7LDZPIWQSGVAWFBVBXHTLHISG","download_json":"https://pith.science/pith/I7LDZPIWQSGVAWFBVBXHTLHISG.json","view_paper":"https://pith.science/paper/I7LDZPIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.1007&json=true","fetch_graph":"https://pith.science/api/pith-number/I7LDZPIWQSGVAWFBVBXHTLHISG/graph.json","fetch_events":"https://pith.science/api/pith-number/I7LDZPIWQSGVAWFBVBXHTLHISG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I7LDZPIWQSGVAWFBVBXHTLHISG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I7LDZPIWQSGVAWFBVBXHTLHISG/action/storage_attestation","attest_author":"https://pith.science/pith/I7LDZPIWQSGVAWFBVBXHTLHISG/action/author_attestation","sign_citation":"https://pith.science/pith/I7LDZPIWQSGVAWFBVBXHTLHISG/action/citation_signature","submit_replication":"https://pith.science/pith/I7LDZPIWQSGVAWFBVBXHTLHISG/action/replication_record"}},"created_at":"2026-05-18T02:23:15.734419+00:00","updated_at":"2026-05-18T02:23:15.734419+00:00"}