{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:W2V2R7UCA3HFJWOM45BH2M2Z57","short_pith_number":"pith:W2V2R7UC","schema_version":"1.0","canonical_sha256":"b6aba8fe8206ce54d9cce7427d3359efd5fe890d4be018d4ee7a00b8714a53cb","source":{"kind":"arxiv","id":"1301.6422","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1301.6422","created_at":"2026-05-18T03:26:40.888794+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.6422v2","created_at":"2026-05-18T03:26:40.888794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.6422","created_at":"2026-05-18T03:26:40.888794+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2V2R7UCA3HF","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2V2R7UCA3HFJWOM","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2V2R7UC","created_at":"2026-05-18T12:28:04.890932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W2V2R7UCA3HFJWOM45BH2M2Z57","json":"https://pith.science/pith/W2V2R7UCA3HFJWOM45BH2M2Z57.json","graph_json":"https://pith.science/api/pith-number/W2V2R7UCA3HFJWOM45BH2M2Z57/graph.json","events_json":"https://pith.science/api/pith-number/W2V2R7UCA3HFJWOM45BH2M2Z57/events.json","paper":"https://pith.science/paper/W2V2R7UC"},"agent_actions":{"view_html":"https://pith.science/pith/W2V2R7UCA3HFJWOM45BH2M2Z57","download_json":"https://pith.science/pith/W2V2R7UCA3HFJWOM45BH2M2Z57.json","view_paper":"https://pith.science/paper/W2V2R7UC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.6422&json=true","fetch_graph":"https://pith.science/api/pith-number/W2V2R7UCA3HFJWOM45BH2M2Z57/graph.json","fetch_events":"https://pith.science/api/pith-number/W2V2R7UCA3HFJWOM45BH2M2Z57/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2V2R7UCA3HFJWOM45BH2M2Z57/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2V2R7UCA3HFJWOM45BH2M2Z57/action/storage_attestation","attest_author":"https://pith.science/pith/W2V2R7UCA3HFJWOM45BH2M2Z57/action/author_attestation","sign_citation":"https://pith.science/pith/W2V2R7UCA3HFJWOM45BH2M2Z57/action/citation_signature","submit_replication":"https://pith.science/pith/W2V2R7UCA3HFJWOM45BH2M2Z57/action/replication_record"}},"created_at":"2026-05-18T03:26:40.888794+00:00","updated_at":"2026-05-18T03:26:40.888794+00:00"}