{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JVVI5NG3HFBSX6MA7JEWIZME7N","short_pith_number":"pith:JVVI5NG3","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"},"canonical_sha256":"4d6a8eb4db39432bf980fa49646584fb7135da05c23e1270993b859bbd71d7f8","source":{"kind":"arxiv","id":"1811.11331","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11331","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11331v1","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11331","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"pith_short_12","alias_value":"JVVI5NG3HFBS","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"JVVI5NG3HFBSX6MA","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"JVVI5NG3","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JVVI5NG3HFBSX6MA7JEWIZME7N","target":"record","payload":{"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"},"canonical_sha256":"4d6a8eb4db39432bf980fa49646584fb7135da05c23e1270993b859bbd71d7f8","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"},"source_kind":"arxiv","source_id":"1811.11331","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hrJ7uTGfjntxT8Jvpz2lA7h6M/Fcd/2Grwj3jKbpAYfrYtJZCVghQ/HSDoxTZLSdP0w2KS13SA3HM4H4tqdcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:37:47.351682Z"},"content_sha256":"09b95ddb2fdcc85c0b6e722b316ae122a1be7bd148eb4df8e3eee61fe8e86a69","schema_version":"1.0","event_id":"sha256:09b95ddb2fdcc85c0b6e722b316ae122a1be7bd148eb4df8e3eee61fe8e86a69"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JVVI5NG3HFBSX6MA7JEWIZME7N","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:59:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"96V8c+8BDhI+S2sjtRjaoJ/aTVwQzojR9Eqv5rqXUL3e3J3YOpEXOTylGu6zHDrRfJqi/xCR9OAt1KYHqpM6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T16:37:47.352030Z"},"content_sha256":"b05526c8cc10283eb77d8ffc0aeae803c4520e074c78436808ddb60322266108","schema_version":"1.0","event_id":"sha256:b05526c8cc10283eb77d8ffc0aeae803c4520e074c78436808ddb60322266108"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JVVI5NG3HFBSX6MA7JEWIZME7N/bundle.json","state_url":"https://pith.science/pith/JVVI5NG3HFBSX6MA7JEWIZME7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JVVI5NG3HFBSX6MA7JEWIZME7N/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T16:37:47Z","links":{"resolver":"https://pith.science/pith/JVVI5NG3HFBSX6MA7JEWIZME7N","bundle":"https://pith.science/pith/JVVI5NG3HFBSX6MA7JEWIZME7N/bundle.json","state":"https://pith.science/pith/JVVI5NG3HFBSX6MA7JEWIZME7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JVVI5NG3HFBSX6MA7JEWIZME7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JVVI5NG3HFBSX6MA7JEWIZME7N","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"64f2e6878aaa5a7b3252afc0e616493e868946f85f4fe8dbfb2074865d698fa4","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-28T01:08:20Z","title_canon_sha256":"8bdc563b7ca48b22ff40452890842a128cae41f99b192b813251b91cb9a2449a"},"schema_version":"1.0","source":{"id":"1811.11331","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11331","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11331v1","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11331","created_at":"2026-05-17T23:59:44Z"},{"alias_kind":"pith_short_12","alias_value":"JVVI5NG3HFBS","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"JVVI5NG3HFBSX6MA","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"JVVI5NG3","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:b05526c8cc10283eb77d8ffc0aeae803c4520e074c78436808ddb60322266108","target":"graph","created_at":"2026-05-17T23:59:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Erdem Koyuncu, Hamid Jafarkhani","cross_cats":["cs.DM","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-28T01:08:20Z","title":"Asynchronous Local Construction of Bounded-Degree Network Topologies Using Only Neighborhood Information"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11331","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:09b95ddb2fdcc85c0b6e722b316ae122a1be7bd148eb4df8e3eee61fe8e86a69","target":"record","created_at":"2026-05-17T23:59:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"64f2e6878aaa5a7b3252afc0e616493e868946f85f4fe8dbfb2074865d698fa4","cross_cats_sorted":["cs.DM","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-11-28T01:08:20Z","title_canon_sha256":"8bdc563b7ca48b22ff40452890842a128cae41f99b192b813251b91cb9a2449a"},"schema_version":"1.0","source":{"id":"1811.11331","kind":"arxiv","version":1}},"canonical_sha256":"4d6a8eb4db39432bf980fa49646584fb7135da05c23e1270993b859bbd71d7f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d6a8eb4db39432bf980fa49646584fb7135da05c23e1270993b859bbd71d7f8","first_computed_at":"2026-05-17T23:59:44.170609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:44.170609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8bDV5wb+pJX0jzXgeCAc8b5BQQdw9IzUntq8506GW68wErpNDbtS80Eke9V8HLHxzGAeTlV+xY7aC4k91JU6BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:44.170992Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11331","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09b95ddb2fdcc85c0b6e722b316ae122a1be7bd148eb4df8e3eee61fe8e86a69","sha256:b05526c8cc10283eb77d8ffc0aeae803c4520e074c78436808ddb60322266108"],"state_sha256":"f26ed2ec7d5ca57080b972743012e06907687ca48a0efdc82a1cce2325d4e4d5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AI2xKpQLcWtf331XlxVeGwXphqM8s2RsBANkm1zSvd/qVj5qTt6pKhYUGdwBWtoM0CL/fk5PUmsFz/9+kkwnBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T16:37:47.354006Z","bundle_sha256":"07331448fa0310db69f76bd0dcdad51c25f1bb035599c27f978701fbfdb2b917"}}