{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BAHZL2KURLMJXM23C72W3ZND7A","short_pith_number":"pith:BAHZL2KU","canonical_record":{"source":{"id":"1107.4613","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-22T20:07:54Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"76f460dd7d6ac7f527f3504c3281dc6c0d767bc29a82c6d62069b64644910c30","abstract_canon_sha256":"10767aaae6be4f3f1ab4b96e70cc98075cc945aa08e201be83079c0b55396c93"},"schema_version":"1.0"},"canonical_sha256":"080f95e9548ad89bb35b17f56de5a3f80647d02091c4b3d24e0236e83e70ea89","source":{"kind":"arxiv","id":"1107.4613","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4613","created_at":"2026-05-18T03:48:48Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4613v2","created_at":"2026-05-18T03:48:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4613","created_at":"2026-05-18T03:48:48Z"},{"alias_kind":"pith_short_12","alias_value":"BAHZL2KURLMJ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BAHZL2KURLMJXM23","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BAHZL2KU","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BAHZL2KURLMJXM23C72W3ZND7A","target":"record","payload":{"canonical_record":{"source":{"id":"1107.4613","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-22T20:07:54Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"76f460dd7d6ac7f527f3504c3281dc6c0d767bc29a82c6d62069b64644910c30","abstract_canon_sha256":"10767aaae6be4f3f1ab4b96e70cc98075cc945aa08e201be83079c0b55396c93"},"schema_version":"1.0"},"canonical_sha256":"080f95e9548ad89bb35b17f56de5a3f80647d02091c4b3d24e0236e83e70ea89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:48:48.144558Z","signature_b64":"WiF9opvzrla7RMFykoK43Lh5gTMlciSeZDkrieHmUA4WoPUnY+cfl7bJolJCTi2TTFpPHI0Trhf5ZYb5c0YxDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"080f95e9548ad89bb35b17f56de5a3f80647d02091c4b3d24e0236e83e70ea89","last_reissued_at":"2026-05-18T03:48:48.143875Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:48:48.143875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.4613","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:48:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BxXa9dXF8rOQTB8ornt4A6TjsQJqMhXEnMuznF43pPCQvm5Ejv3NPpVqlLxzmp683wGZyEngDnFxt7HYNCbWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:49:19.031275Z"},"content_sha256":"0175a6b9e9af51732103cf4b9725e47ac8c9cdd383da26e43a2f8120b5312d8d","schema_version":"1.0","event_id":"sha256:0175a6b9e9af51732103cf4b9725e47ac8c9cdd383da26e43a2f8120b5312d8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BAHZL2KURLMJXM23C72W3ZND7A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Percolation in the Secrecy Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.PR","authors_text":"Amites Sarkar, Martin Haenggi","submitted_at":"2011-07-22T20:07:54Z","abstract_excerpt":"The secrecy graph is a random geometric graph which is intended to model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely in the presence of eavesdroppers, which, in the model, is determined solely by the locations of the nodes and eavesdroppers. In the case of infinite networks, a critical parameter is the maximum density of eavesdroppers that can be accommodated while still guaranteeing an infinite component in the network, i.e., the percolation threshold. We focus on the case where the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4613","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:48:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F3y4QtWWpkRGf80qR2qg13Y8ZUDXbXL/MVD5QerPAlpATY4wUh8hqnfdYZGjFtj6fRzugeACjSBBGNTMdP8tAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:49:19.032002Z"},"content_sha256":"e31a323100bdf0db7588567b08ac4eeced7c711e0bcf51e6919f0d9b4dbfd41e","schema_version":"1.0","event_id":"sha256:e31a323100bdf0db7588567b08ac4eeced7c711e0bcf51e6919f0d9b4dbfd41e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BAHZL2KURLMJXM23C72W3ZND7A/bundle.json","state_url":"https://pith.science/pith/BAHZL2KURLMJXM23C72W3ZND7A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BAHZL2KURLMJXM23C72W3ZND7A/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-27T16:49:19Z","links":{"resolver":"https://pith.science/pith/BAHZL2KURLMJXM23C72W3ZND7A","bundle":"https://pith.science/pith/BAHZL2KURLMJXM23C72W3ZND7A/bundle.json","state":"https://pith.science/pith/BAHZL2KURLMJXM23C72W3ZND7A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BAHZL2KURLMJXM23C72W3ZND7A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BAHZL2KURLMJXM23C72W3ZND7A","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":"10767aaae6be4f3f1ab4b96e70cc98075cc945aa08e201be83079c0b55396c93","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-22T20:07:54Z","title_canon_sha256":"76f460dd7d6ac7f527f3504c3281dc6c0d767bc29a82c6d62069b64644910c30"},"schema_version":"1.0","source":{"id":"1107.4613","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.4613","created_at":"2026-05-18T03:48:48Z"},{"alias_kind":"arxiv_version","alias_value":"1107.4613v2","created_at":"2026-05-18T03:48:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.4613","created_at":"2026-05-18T03:48:48Z"},{"alias_kind":"pith_short_12","alias_value":"BAHZL2KURLMJ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BAHZL2KURLMJXM23","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BAHZL2KU","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:e31a323100bdf0db7588567b08ac4eeced7c711e0bcf51e6919f0d9b4dbfd41e","target":"graph","created_at":"2026-05-18T03:48:48Z","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":"The secrecy graph is a random geometric graph which is intended to model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely in the presence of eavesdroppers, which, in the model, is determined solely by the locations of the nodes and eavesdroppers. In the case of infinite networks, a critical parameter is the maximum density of eavesdroppers that can be accommodated while still guaranteeing an infinite component in the network, i.e., the percolation threshold. We focus on the case where the ","authors_text":"Amites Sarkar, Martin Haenggi","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-22T20:07:54Z","title":"Percolation in the Secrecy Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.4613","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:0175a6b9e9af51732103cf4b9725e47ac8c9cdd383da26e43a2f8120b5312d8d","target":"record","created_at":"2026-05-18T03:48:48Z","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":"10767aaae6be4f3f1ab4b96e70cc98075cc945aa08e201be83079c0b55396c93","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2011-07-22T20:07:54Z","title_canon_sha256":"76f460dd7d6ac7f527f3504c3281dc6c0d767bc29a82c6d62069b64644910c30"},"schema_version":"1.0","source":{"id":"1107.4613","kind":"arxiv","version":2}},"canonical_sha256":"080f95e9548ad89bb35b17f56de5a3f80647d02091c4b3d24e0236e83e70ea89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"080f95e9548ad89bb35b17f56de5a3f80647d02091c4b3d24e0236e83e70ea89","first_computed_at":"2026-05-18T03:48:48.143875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:48:48.143875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WiF9opvzrla7RMFykoK43Lh5gTMlciSeZDkrieHmUA4WoPUnY+cfl7bJolJCTi2TTFpPHI0Trhf5ZYb5c0YxDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:48:48.144558Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.4613","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0175a6b9e9af51732103cf4b9725e47ac8c9cdd383da26e43a2f8120b5312d8d","sha256:e31a323100bdf0db7588567b08ac4eeced7c711e0bcf51e6919f0d9b4dbfd41e"],"state_sha256":"7e0f840db3e3aaa64501dbc3e64a4f42f5b9009c9a58c6d025aa8fd98d54c334"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MolrZv9ThKJoxA6cHLRdR9UyRhH96W23VL73vaQHKEJ+UK/4HJxSVUzjzvs3CXg6zcyK5w4mQbNJIYmhWA49BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:49:19.035519Z","bundle_sha256":"e69633fa3c29f7ff07eac37e2e2871ffff1747a7e52368a3977e34465a22b195"}}