{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7V4VKI3IWQT7BSQM5TCYXBK5CU","short_pith_number":"pith:7V4VKI3I","schema_version":"1.0","canonical_sha256":"fd79552368b427f0ca0cecc58b855d150053065aa151bf167c3e01957a15156e","source":{"kind":"arxiv","id":"1401.7313","version":1},"attestation_state":"computed","paper":{"title":"Deterministic Blind Rendezvous in Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Abhishek Samanta, Alexander Russell, Ravi Sundaram, Sixia Chen","submitted_at":"2014-01-28T20:13:03Z","abstract_excerpt":"Blind rendezvous is a fundamental problem in cognitive radio networks. The problem involves a collection of agents (radios) that wish to discover each other in the blind setting where there is no shared infrastructure and they initially have no knowledge of each other. Time is divided into discrete slots; spectrum is divided into discrete channels, $\\{1,2,..., n\\}$. Each agent may access a single channel in a single time slot and we say that two agents rendezvous when they access the same channel in the same time slot. The model is asymmetric: each agent $A_i$ may only use a particular subset "},"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":"1401.7313","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-01-28T20:13:03Z","cross_cats_sorted":[],"title_canon_sha256":"7b89a7b77f73710bf615a8283839940a06af086637dc1862a7014c38db142409","abstract_canon_sha256":"083635ed93a5e768b86a259a20619cd62392bed9568f203accc22a95c28cbdf9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:50.304483Z","signature_b64":"a7mi4ghbBim6Xdh8iwoHiLfzLrlkykv3tBFNORwwDFYx7o+ttb+bGgyN6H61eCYgAinTpqUIF37Zn9dicOcGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd79552368b427f0ca0cecc58b855d150053065aa151bf167c3e01957a15156e","last_reissued_at":"2026-05-18T03:00:50.303859Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:50.303859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Blind Rendezvous in Cognitive Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Abhishek Samanta, Alexander Russell, Ravi Sundaram, Sixia Chen","submitted_at":"2014-01-28T20:13:03Z","abstract_excerpt":"Blind rendezvous is a fundamental problem in cognitive radio networks. The problem involves a collection of agents (radios) that wish to discover each other in the blind setting where there is no shared infrastructure and they initially have no knowledge of each other. Time is divided into discrete slots; spectrum is divided into discrete channels, $\\{1,2,..., n\\}$. Each agent may access a single channel in a single time slot and we say that two agents rendezvous when they access the same channel in the same time slot. The model is asymmetric: each agent $A_i$ may only use a particular subset "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.7313","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":"1401.7313","created_at":"2026-05-18T03:00:50.303944+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.7313v1","created_at":"2026-05-18T03:00:50.303944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.7313","created_at":"2026-05-18T03:00:50.303944+00:00"},{"alias_kind":"pith_short_12","alias_value":"7V4VKI3IWQT7","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7V4VKI3IWQT7BSQM","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7V4VKI3I","created_at":"2026-05-18T12:28:19.803747+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/7V4VKI3IWQT7BSQM5TCYXBK5CU","json":"https://pith.science/pith/7V4VKI3IWQT7BSQM5TCYXBK5CU.json","graph_json":"https://pith.science/api/pith-number/7V4VKI3IWQT7BSQM5TCYXBK5CU/graph.json","events_json":"https://pith.science/api/pith-number/7V4VKI3IWQT7BSQM5TCYXBK5CU/events.json","paper":"https://pith.science/paper/7V4VKI3I"},"agent_actions":{"view_html":"https://pith.science/pith/7V4VKI3IWQT7BSQM5TCYXBK5CU","download_json":"https://pith.science/pith/7V4VKI3IWQT7BSQM5TCYXBK5CU.json","view_paper":"https://pith.science/paper/7V4VKI3I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.7313&json=true","fetch_graph":"https://pith.science/api/pith-number/7V4VKI3IWQT7BSQM5TCYXBK5CU/graph.json","fetch_events":"https://pith.science/api/pith-number/7V4VKI3IWQT7BSQM5TCYXBK5CU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7V4VKI3IWQT7BSQM5TCYXBK5CU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7V4VKI3IWQT7BSQM5TCYXBK5CU/action/storage_attestation","attest_author":"https://pith.science/pith/7V4VKI3IWQT7BSQM5TCYXBK5CU/action/author_attestation","sign_citation":"https://pith.science/pith/7V4VKI3IWQT7BSQM5TCYXBK5CU/action/citation_signature","submit_replication":"https://pith.science/pith/7V4VKI3IWQT7BSQM5TCYXBK5CU/action/replication_record"}},"created_at":"2026-05-18T03:00:50.303944+00:00","updated_at":"2026-05-18T03:00:50.303944+00:00"}