{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:25QKMEGJVA2ANAJVFOYBQURTVO","short_pith_number":"pith:25QKMEGJ","canonical_record":{"source":{"id":"1408.0812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-04T20:39:55Z","cross_cats_sorted":[],"title_canon_sha256":"cd1d025726d7f5c7ea5dc9d6bed7d02802c94604ba902f0b83c9584d68c2614e","abstract_canon_sha256":"93413fdb540bcbb31bcbc8b15ee0e35b8332e72624f1b5d26d61d266e657d2ff"},"schema_version":"1.0"},"canonical_sha256":"d760a610c9a8340681352bb0185233ab8327a256bcee133f174e0bf21968323c","source":{"kind":"arxiv","id":"1408.0812","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0812","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0812v1","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0812","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"pith_short_12","alias_value":"25QKMEGJVA2A","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"25QKMEGJVA2ANAJV","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"25QKMEGJ","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:25QKMEGJVA2ANAJVFOYBQURTVO","target":"record","payload":{"canonical_record":{"source":{"id":"1408.0812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-04T20:39:55Z","cross_cats_sorted":[],"title_canon_sha256":"cd1d025726d7f5c7ea5dc9d6bed7d02802c94604ba902f0b83c9584d68c2614e","abstract_canon_sha256":"93413fdb540bcbb31bcbc8b15ee0e35b8332e72624f1b5d26d61d266e657d2ff"},"schema_version":"1.0"},"canonical_sha256":"d760a610c9a8340681352bb0185233ab8327a256bcee133f174e0bf21968323c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:50.354502Z","signature_b64":"xT0vO3IpWf6sBBUrI9GFFB5Dp4JZS8i4LjBXYIm0fUya5KryzCDPuDGKsOfw5XeX7azmxn9OBrRKLPCGuDHcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d760a610c9a8340681352bb0185233ab8327a256bcee133f174e0bf21968323c","last_reissued_at":"2026-05-18T02:45:50.353990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:50.353990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.0812","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-18T02:45:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R+DNxjwsiFCZhxnxWYxB0hgafY3HT7rjBsiVBRuvEo05AbuV1yiD5/IMrs6FNeFOFh0bdr1/8yz7xz9ipcFgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:35:23.238098Z"},"content_sha256":"c39e8f3fe1cb2c6c5255efc4fafbf2c4666c34e0d4243303626c740ac297335c","schema_version":"1.0","event_id":"sha256:c39e8f3fe1cb2c6c5255efc4fafbf2c4666c34e0d4243303626c740ac297335c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:25QKMEGJVA2ANAJVFOYBQURTVO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for Structuring Unreliable Radio Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Calvin Newport","submitted_at":"2014-08-04T20:39:55Z","abstract_excerpt":"In this paper, we study lower bounds for randomized solutions to the maximal independent set (MIS) and connected dominating set (CDS) problems in the dual graph model of radio networks---a generalization of the standard graph-based model that now includes unreliable links controlled by an adversary. We begin by proving that a natural geographic constraint on the network topology is required to solve these problems efficiently (i.e., in time polylogarthmic in the network size). We then prove the importance of the assumption that nodes are provided advance knowledge of their reliable neighbors ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0812","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-18T02:45:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i1l2L5G+sb4JrvpVKjBldlghziwPIRtGCJB5QOk5j/z29P6gYQCmjo+dEduxJ8V8MAEX4N57oGHp8fGqPBhfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:35:23.238860Z"},"content_sha256":"16dbfbd2701fcee5a3b1f4c2cb3e629739d82b077f40246675d404747a1fe286","schema_version":"1.0","event_id":"sha256:16dbfbd2701fcee5a3b1f4c2cb3e629739d82b077f40246675d404747a1fe286"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/25QKMEGJVA2ANAJVFOYBQURTVO/bundle.json","state_url":"https://pith.science/pith/25QKMEGJVA2ANAJVFOYBQURTVO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/25QKMEGJVA2ANAJVFOYBQURTVO/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-08T21:35:23Z","links":{"resolver":"https://pith.science/pith/25QKMEGJVA2ANAJVFOYBQURTVO","bundle":"https://pith.science/pith/25QKMEGJVA2ANAJVFOYBQURTVO/bundle.json","state":"https://pith.science/pith/25QKMEGJVA2ANAJVFOYBQURTVO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/25QKMEGJVA2ANAJVFOYBQURTVO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:25QKMEGJVA2ANAJVFOYBQURTVO","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":"93413fdb540bcbb31bcbc8b15ee0e35b8332e72624f1b5d26d61d266e657d2ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-04T20:39:55Z","title_canon_sha256":"cd1d025726d7f5c7ea5dc9d6bed7d02802c94604ba902f0b83c9584d68c2614e"},"schema_version":"1.0","source":{"id":"1408.0812","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0812","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0812v1","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0812","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"pith_short_12","alias_value":"25QKMEGJVA2A","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"25QKMEGJVA2ANAJV","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"25QKMEGJ","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:16dbfbd2701fcee5a3b1f4c2cb3e629739d82b077f40246675d404747a1fe286","target":"graph","created_at":"2026-05-18T02:45:50Z","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":"In this paper, we study lower bounds for randomized solutions to the maximal independent set (MIS) and connected dominating set (CDS) problems in the dual graph model of radio networks---a generalization of the standard graph-based model that now includes unreliable links controlled by an adversary. We begin by proving that a natural geographic constraint on the network topology is required to solve these problems efficiently (i.e., in time polylogarthmic in the network size). We then prove the importance of the assumption that nodes are provided advance knowledge of their reliable neighbors (","authors_text":"Calvin Newport","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-04T20:39:55Z","title":"Lower Bounds for Structuring Unreliable Radio Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0812","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:c39e8f3fe1cb2c6c5255efc4fafbf2c4666c34e0d4243303626c740ac297335c","target":"record","created_at":"2026-05-18T02:45:50Z","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":"93413fdb540bcbb31bcbc8b15ee0e35b8332e72624f1b5d26d61d266e657d2ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-08-04T20:39:55Z","title_canon_sha256":"cd1d025726d7f5c7ea5dc9d6bed7d02802c94604ba902f0b83c9584d68c2614e"},"schema_version":"1.0","source":{"id":"1408.0812","kind":"arxiv","version":1}},"canonical_sha256":"d760a610c9a8340681352bb0185233ab8327a256bcee133f174e0bf21968323c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d760a610c9a8340681352bb0185233ab8327a256bcee133f174e0bf21968323c","first_computed_at":"2026-05-18T02:45:50.353990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:50.353990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xT0vO3IpWf6sBBUrI9GFFB5Dp4JZS8i4LjBXYIm0fUya5KryzCDPuDGKsOfw5XeX7azmxn9OBrRKLPCGuDHcAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:50.354502Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0812","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c39e8f3fe1cb2c6c5255efc4fafbf2c4666c34e0d4243303626c740ac297335c","sha256:16dbfbd2701fcee5a3b1f4c2cb3e629739d82b077f40246675d404747a1fe286"],"state_sha256":"ef56912bc29df1e0b560b41fd8d33eca69c42769a9dd769606abc872f5ccaaf7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A/8SwVHNDeK0fBjibRbrEGKUIa6RmGpCu0yXp6OEaDQU2vdepYoQfIG8zvBNTaI2sUFZCPSNdZywcJ/F8KlXDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:35:23.242874Z","bundle_sha256":"090aa7ad168944f5e72d98b26350b2c12d6180c4d7f2fe7dc5727dbafc927eec"}}