{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MWMVACISIDD54M2E2MX6WF64FM","short_pith_number":"pith:MWMVACIS","canonical_record":{"source":{"id":"1205.5164","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-05-23T13:19:20Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"877868e3a888f312ddafdda64bb5e04c8cd1ffb877397f983c72861c8a050efd","abstract_canon_sha256":"73ff9739de311a56d408a44d5fc477278a9fde64ef38eeeaf6335a5227f54353"},"schema_version":"1.0"},"canonical_sha256":"659950091240c7de3344d32feb17dc2b0b1217d964b9cd37ee0d8c0818cabb1f","source":{"kind":"arxiv","id":"1205.5164","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.5164","created_at":"2026-05-18T03:43:07Z"},{"alias_kind":"arxiv_version","alias_value":"1205.5164v2","created_at":"2026-05-18T03:43:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.5164","created_at":"2026-05-18T03:43:07Z"},{"alias_kind":"pith_short_12","alias_value":"MWMVACISIDD5","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MWMVACISIDD54M2E","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MWMVACIS","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MWMVACISIDD54M2E2MX6WF64FM","target":"record","payload":{"canonical_record":{"source":{"id":"1205.5164","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-05-23T13:19:20Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"877868e3a888f312ddafdda64bb5e04c8cd1ffb877397f983c72861c8a050efd","abstract_canon_sha256":"73ff9739de311a56d408a44d5fc477278a9fde64ef38eeeaf6335a5227f54353"},"schema_version":"1.0"},"canonical_sha256":"659950091240c7de3344d32feb17dc2b0b1217d964b9cd37ee0d8c0818cabb1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:43:07.146926Z","signature_b64":"4JxuJQBQ/l2kft/NoIaQhOxHGFieN+aJlO5e7IJsCuPg3CN2EqkSySaj3VlWCtD9z9hxWfxX/Jbzq9BdThFeCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"659950091240c7de3344d32feb17dc2b0b1217d964b9cd37ee0d8c0818cabb1f","last_reissued_at":"2026-05-18T03:43:07.146345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:43:07.146345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.5164","source_version":2,"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-18T03:43:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ri8cIw8FJ2JbjsLA8sKWEU/mHjOZMTWR/oYNYWGm1qC6ZNg6rUx7uagfCRYDPOUIvndN8L2ddrhH7isQMJoeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:58:01.166826Z"},"content_sha256":"16c88ca7260f078c629783299cb402f6fae958f9321e3d304c4061f1246f6da7","schema_version":"1.0","event_id":"sha256:16c88ca7260f078c629783299cb402f6fae958f9321e3d304c4061f1246f6da7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MWMVACISIDD54M2E2MX6WF64FM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Connectivity of Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NI","authors_text":"Magnus M. Halldorsson, Pradipta Mitra","submitted_at":"2012-05-23T13:19:20Z","abstract_excerpt":"We consider the problem of constructing a communication infrastructure from scratch, for a collection of identical wireless nodes. Combinatorially, this means a) finding a set of links that form a strongly connected spanning graph on a set of $n$ points in the plane, and b) scheduling it efficiently in the SINR model of interference. The nodes must converge on a solution in a distributed manner, having no means of communication beyond the sole wireless channel.\n  We give distributed connectivity algorithms that run in time $O(poly(\\log \\Delta, \\log n))$, where $\\Delta$ is the ratio between the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.5164","kind":"arxiv","version":2},"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-18T03:43:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yTzIJ9N+DR+LvcVDFMdERXkdblKugdPb3V4732I+zClMeNMsQ1gzVn+73su9aAUWfXScj+NuPuSJEvlrgGH9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T19:58:01.167569Z"},"content_sha256":"9411bf6cc04a9214e7e07006d03b9ec85580db0c6cb08fc8040956c8b61b9393","schema_version":"1.0","event_id":"sha256:9411bf6cc04a9214e7e07006d03b9ec85580db0c6cb08fc8040956c8b61b9393"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MWMVACISIDD54M2E2MX6WF64FM/bundle.json","state_url":"https://pith.science/pith/MWMVACISIDD54M2E2MX6WF64FM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MWMVACISIDD54M2E2MX6WF64FM/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-06-05T19:58:01Z","links":{"resolver":"https://pith.science/pith/MWMVACISIDD54M2E2MX6WF64FM","bundle":"https://pith.science/pith/MWMVACISIDD54M2E2MX6WF64FM/bundle.json","state":"https://pith.science/pith/MWMVACISIDD54M2E2MX6WF64FM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MWMVACISIDD54M2E2MX6WF64FM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MWMVACISIDD54M2E2MX6WF64FM","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":"73ff9739de311a56d408a44d5fc477278a9fde64ef38eeeaf6335a5227f54353","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-05-23T13:19:20Z","title_canon_sha256":"877868e3a888f312ddafdda64bb5e04c8cd1ffb877397f983c72861c8a050efd"},"schema_version":"1.0","source":{"id":"1205.5164","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.5164","created_at":"2026-05-18T03:43:07Z"},{"alias_kind":"arxiv_version","alias_value":"1205.5164v2","created_at":"2026-05-18T03:43:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.5164","created_at":"2026-05-18T03:43:07Z"},{"alias_kind":"pith_short_12","alias_value":"MWMVACISIDD5","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MWMVACISIDD54M2E","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MWMVACIS","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:9411bf6cc04a9214e7e07006d03b9ec85580db0c6cb08fc8040956c8b61b9393","target":"graph","created_at":"2026-05-18T03:43:07Z","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 the problem of constructing a communication infrastructure from scratch, for a collection of identical wireless nodes. Combinatorially, this means a) finding a set of links that form a strongly connected spanning graph on a set of $n$ points in the plane, and b) scheduling it efficiently in the SINR model of interference. The nodes must converge on a solution in a distributed manner, having no means of communication beyond the sole wireless channel.\n  We give distributed connectivity algorithms that run in time $O(poly(\\log \\Delta, \\log n))$, where $\\Delta$ is the ratio between the","authors_text":"Magnus M. Halldorsson, Pradipta Mitra","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-05-23T13:19:20Z","title":"Distributed Connectivity of Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.5164","kind":"arxiv","version":2},"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:16c88ca7260f078c629783299cb402f6fae958f9321e3d304c4061f1246f6da7","target":"record","created_at":"2026-05-18T03:43:07Z","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":"73ff9739de311a56d408a44d5fc477278a9fde64ef38eeeaf6335a5227f54353","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2012-05-23T13:19:20Z","title_canon_sha256":"877868e3a888f312ddafdda64bb5e04c8cd1ffb877397f983c72861c8a050efd"},"schema_version":"1.0","source":{"id":"1205.5164","kind":"arxiv","version":2}},"canonical_sha256":"659950091240c7de3344d32feb17dc2b0b1217d964b9cd37ee0d8c0818cabb1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"659950091240c7de3344d32feb17dc2b0b1217d964b9cd37ee0d8c0818cabb1f","first_computed_at":"2026-05-18T03:43:07.146345Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:43:07.146345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4JxuJQBQ/l2kft/NoIaQhOxHGFieN+aJlO5e7IJsCuPg3CN2EqkSySaj3VlWCtD9z9hxWfxX/Jbzq9BdThFeCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:43:07.146926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.5164","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16c88ca7260f078c629783299cb402f6fae958f9321e3d304c4061f1246f6da7","sha256:9411bf6cc04a9214e7e07006d03b9ec85580db0c6cb08fc8040956c8b61b9393"],"state_sha256":"aa67ceb3b847226f8d39122357876ebf6bfc5e10c204d23c93fd3606bf0b05fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pZIhTLafvUr7GBwUh2aV2QCtYEj2FhCGexlq57CgJwDP9KSXHGJTz+rPefuhiZXmGGbnkDTrJxo68uST03qiDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T19:58:01.171514Z","bundle_sha256":"38932a6fe337df325c62df4656e3b7411a9dd2755bad729e85db6e071630e544"}}