{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:W2V2R7UCA3HFJWOM45BH2M2Z57","short_pith_number":"pith:W2V2R7UC","canonical_record":{"source":{"id":"1301.6422","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T01:17:05Z","cross_cats_sorted":["math.CO","math.IT","math.PR"],"title_canon_sha256":"6bf30018a33594b6c2711f7f819ae575f571b48f36287227eb2e162ee81fdf37","abstract_canon_sha256":"86785d70ab8503733ebff38ae243767801906d8e1b1df24ee8dd0205aa24f992"},"schema_version":"1.0"},"canonical_sha256":"b6aba8fe8206ce54d9cce7427d3359efd5fe890d4be018d4ee7a00b8714a53cb","source":{"kind":"arxiv","id":"1301.6422","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6422","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6422v2","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6422","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"W2V2R7UCA3HF","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"W2V2R7UCA3HFJWOM","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"W2V2R7UC","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:W2V2R7UCA3HFJWOM45BH2M2Z57","target":"record","payload":{"canonical_record":{"source":{"id":"1301.6422","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T01:17:05Z","cross_cats_sorted":["math.CO","math.IT","math.PR"],"title_canon_sha256":"6bf30018a33594b6c2711f7f819ae575f571b48f36287227eb2e162ee81fdf37","abstract_canon_sha256":"86785d70ab8503733ebff38ae243767801906d8e1b1df24ee8dd0205aa24f992"},"schema_version":"1.0"},"canonical_sha256":"b6aba8fe8206ce54d9cce7427d3359efd5fe890d4be018d4ee7a00b8714a53cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:40.889247Z","signature_b64":"6wIWdWKmvYRCGCBANwmJ5B32v/Rxb60KA2/xEA6C7Wd7y3n80nsk01b+9XEMWloCf9xSRD8YbcFHagaPF3Y4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6aba8fe8206ce54d9cce7427d3359efd5fe890d4be018d4ee7a00b8714a53cb","last_reissued_at":"2026-05-18T03:26:40.888703Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:40.888703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.6422","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:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JpSIXlTPR/nGDSvloI/nJ+n6BHTRMd08N+UgwvcZVk5ceabyzDl8W5iUPdIOtzWq/d63M5fDHJQUPUsIV050BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:07:03.812436Z"},"content_sha256":"930d223fd1541452c6facd21011c331756ef639ea17a836999b73082aea12d99","schema_version":"1.0","event_id":"sha256:930d223fd1541452c6facd21011c331756ef639ea17a836999b73082aea12d99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:W2V2R7UCA3HFJWOM45BH2M2Z57","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Connectivity Thresholds in the Intersection of Random Key Graphs on Random Geometric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT","math.PR"],"primary_cat":"cs.IT","authors_text":"Ayalvadi Ganesh, B. Santhana Krishnan, D. Manjunath","submitted_at":"2013-01-28T01:17:05Z","abstract_excerpt":"In a random key graph (RKG) of $n$ nodes each node is randomly assigned a key ring of $K_n$ cryptographic keys from a pool of $P_n$ keys. Two nodes can communicate directly if they have at least one common key in their key rings. We assume that the $n$ nodes are distributed uniformly in $[0,1]^2.$ In addition to the common key requirement, we require two nodes to also be within $r_n$ of each other to be able to have a direct edge. Thus we have a random graph in which the RKG is superposed on the familiar random geometric graph (RGG). For such a random graph, we obtain tight bounds on the relat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6422","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:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aY58xzCPBMKM9tdEcKUdDXqBYCzfpIn8ZdtYE7nnziDYewNpBwd82FVjbpX84EP9z3Lg/iu4kuN/lAxOun1UCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:07:03.812787Z"},"content_sha256":"4c39c7bb1daaeae8ba7325f1bd243424ed1496705b341e5233e1827e4ba1817b","schema_version":"1.0","event_id":"sha256:4c39c7bb1daaeae8ba7325f1bd243424ed1496705b341e5233e1827e4ba1817b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W2V2R7UCA3HFJWOM45BH2M2Z57/bundle.json","state_url":"https://pith.science/pith/W2V2R7UCA3HFJWOM45BH2M2Z57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W2V2R7UCA3HFJWOM45BH2M2Z57/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-03T13:07:03Z","links":{"resolver":"https://pith.science/pith/W2V2R7UCA3HFJWOM45BH2M2Z57","bundle":"https://pith.science/pith/W2V2R7UCA3HFJWOM45BH2M2Z57/bundle.json","state":"https://pith.science/pith/W2V2R7UCA3HFJWOM45BH2M2Z57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W2V2R7UCA3HFJWOM45BH2M2Z57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:W2V2R7UCA3HFJWOM45BH2M2Z57","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":"86785d70ab8503733ebff38ae243767801906d8e1b1df24ee8dd0205aa24f992","cross_cats_sorted":["math.CO","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T01:17:05Z","title_canon_sha256":"6bf30018a33594b6c2711f7f819ae575f571b48f36287227eb2e162ee81fdf37"},"schema_version":"1.0","source":{"id":"1301.6422","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.6422","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1301.6422v2","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6422","created_at":"2026-05-18T03:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"W2V2R7UCA3HF","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"W2V2R7UCA3HFJWOM","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"W2V2R7UC","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:4c39c7bb1daaeae8ba7325f1bd243424ed1496705b341e5233e1827e4ba1817b","target":"graph","created_at":"2026-05-18T03:26:40Z","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 a random key graph (RKG) of $n$ nodes each node is randomly assigned a key ring of $K_n$ cryptographic keys from a pool of $P_n$ keys. Two nodes can communicate directly if they have at least one common key in their key rings. We assume that the $n$ nodes are distributed uniformly in $[0,1]^2.$ In addition to the common key requirement, we require two nodes to also be within $r_n$ of each other to be able to have a direct edge. Thus we have a random graph in which the RKG is superposed on the familiar random geometric graph (RGG). For such a random graph, we obtain tight bounds on the relat","authors_text":"Ayalvadi Ganesh, B. Santhana Krishnan, D. Manjunath","cross_cats":["math.CO","math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T01:17:05Z","title":"On Connectivity Thresholds in the Intersection of Random Key Graphs on Random Geometric Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.6422","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:930d223fd1541452c6facd21011c331756ef639ea17a836999b73082aea12d99","target":"record","created_at":"2026-05-18T03:26:40Z","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":"86785d70ab8503733ebff38ae243767801906d8e1b1df24ee8dd0205aa24f992","cross_cats_sorted":["math.CO","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-01-28T01:17:05Z","title_canon_sha256":"6bf30018a33594b6c2711f7f819ae575f571b48f36287227eb2e162ee81fdf37"},"schema_version":"1.0","source":{"id":"1301.6422","kind":"arxiv","version":2}},"canonical_sha256":"b6aba8fe8206ce54d9cce7427d3359efd5fe890d4be018d4ee7a00b8714a53cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6aba8fe8206ce54d9cce7427d3359efd5fe890d4be018d4ee7a00b8714a53cb","first_computed_at":"2026-05-18T03:26:40.888703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:40.888703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6wIWdWKmvYRCGCBANwmJ5B32v/Rxb60KA2/xEA6C7Wd7y3n80nsk01b+9XEMWloCf9xSRD8YbcFHagaPF3Y4CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:40.889247Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.6422","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:930d223fd1541452c6facd21011c331756ef639ea17a836999b73082aea12d99","sha256:4c39c7bb1daaeae8ba7325f1bd243424ed1496705b341e5233e1827e4ba1817b"],"state_sha256":"4f1d3e2eba707ce389bbdf0f2603f342f01a1400f7780781aeca873a2c821cec"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a5clFGPikePIYu/jyaMCczXauKmn9N+WiR5SP9xamC7KDOoKlQ7X2lQdtwzOrRXLfh90+XfM5wetRf/T97siCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T13:07:03.814692Z","bundle_sha256":"a5fb9d8364de9dd54c6c33c89e57a02606b543c644e9d836342369e9155581ad"}}