{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JVVI5NG3HFBSX6MA7JEWIZME7N","short_pith_number":"pith:JVVI5NG3","schema_version":"1.0","canonical_sha256":"4d6a8eb4db39432bf980fa49646584fb7135da05c23e1270993b859bbd71d7f8","source":{"kind":"arxiv","id":"1811.11331","version":1},"attestation_state":"computed","paper":{"title":"Asynchronous Local Construction of Bounded-Degree Network Topologies Using Only Neighborhood Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Erdem Koyuncu, Hamid Jafarkhani","submitted_at":"2018-11-28T01:08:20Z","abstract_excerpt":"We consider ad-hoc networks consisting of $n$ wireless nodes that are located on the plane. Any two given nodes are called neighbors if they are located within a certain distance (communication range) from one another. A given node can be directly connected to any one of its neighbors and picks its connections according to a unique topology control algorithm that is available at every node. Given that each node knows only the indices (unique identification numbers) of its one- and two-hop neighbors, we identify an algorithm that preserves connectivity and can operate without the need of any sy"},"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.11331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-28T01:08:20Z","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"title_canon_sha256":"8bdc563b7ca48b22ff40452890842a128cae41f99b192b813251b91cb9a2449a","abstract_canon_sha256":"64f2e6878aaa5a7b3252afc0e616493e868946f85f4fe8dbfb2074865d698fa4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:44.170992Z","signature_b64":"8bDV5wb+pJX0jzXgeCAc8b5BQQdw9IzUntq8506GW68wErpNDbtS80Eke9V8HLHxzGAeTlV+xY7aC4k91JU6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d6a8eb4db39432bf980fa49646584fb7135da05c23e1270993b859bbd71d7f8","last_reissued_at":"2026-05-17T23:59:44.170609Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:44.170609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asynchronous Local Construction of Bounded-Degree Network Topologies Using Only Neighborhood Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IT","math.IT"],"primary_cat":"cs.NI","authors_text":"Erdem Koyuncu, Hamid Jafarkhani","submitted_at":"2018-11-28T01:08:20Z","abstract_excerpt":"We consider ad-hoc networks consisting of $n$ wireless nodes that are located on the plane. Any two given nodes are called neighbors if they are located within a certain distance (communication range) from one another. A given node can be directly connected to any one of its neighbors and picks its connections according to a unique topology control algorithm that is available at every node. Given that each node knows only the indices (unique identification numbers) of its one- and two-hop neighbors, we identify an algorithm that preserves connectivity and can operate without the need of any sy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11331","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.11331","created_at":"2026-05-17T23:59:44.170668+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.11331v1","created_at":"2026-05-17T23:59:44.170668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11331","created_at":"2026-05-17T23:59:44.170668+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVVI5NG3HFBS","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVVI5NG3HFBSX6MA","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVVI5NG3","created_at":"2026-05-18T12:32:33.847187+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/JVVI5NG3HFBSX6MA7JEWIZME7N","json":"https://pith.science/pith/JVVI5NG3HFBSX6MA7JEWIZME7N.json","graph_json":"https://pith.science/api/pith-number/JVVI5NG3HFBSX6MA7JEWIZME7N/graph.json","events_json":"https://pith.science/api/pith-number/JVVI5NG3HFBSX6MA7JEWIZME7N/events.json","paper":"https://pith.science/paper/JVVI5NG3"},"agent_actions":{"view_html":"https://pith.science/pith/JVVI5NG3HFBSX6MA7JEWIZME7N","download_json":"https://pith.science/pith/JVVI5NG3HFBSX6MA7JEWIZME7N.json","view_paper":"https://pith.science/paper/JVVI5NG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.11331&json=true","fetch_graph":"https://pith.science/api/pith-number/JVVI5NG3HFBSX6MA7JEWIZME7N/graph.json","fetch_events":"https://pith.science/api/pith-number/JVVI5NG3HFBSX6MA7JEWIZME7N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVVI5NG3HFBSX6MA7JEWIZME7N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVVI5NG3HFBSX6MA7JEWIZME7N/action/storage_attestation","attest_author":"https://pith.science/pith/JVVI5NG3HFBSX6MA7JEWIZME7N/action/author_attestation","sign_citation":"https://pith.science/pith/JVVI5NG3HFBSX6MA7JEWIZME7N/action/citation_signature","submit_replication":"https://pith.science/pith/JVVI5NG3HFBSX6MA7JEWIZME7N/action/replication_record"}},"created_at":"2026-05-17T23:59:44.170668+00:00","updated_at":"2026-05-17T23:59:44.170668+00:00"}