{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YVVZNBIINY5VJURYPM2B7EHLIT","short_pith_number":"pith:YVVZNBII","schema_version":"1.0","canonical_sha256":"c56b9685086e3b54d2387b341f90eb44d16a68e52802785e85fc34b405c806c4","source":{"kind":"arxiv","id":"1508.02407","version":1},"attestation_state":"computed","paper":{"title":"Zero-one laws for connectivity in inhomogeneous random key graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.PR","authors_text":"Osman Yagan","submitted_at":"2015-08-10T20:11:02Z","abstract_excerpt":"We introduce a new random key predistribution scheme for securing heterogeneous wireless sensor networks. Each of the n sensors in the network is classified into r classes according to some probability distribution {\\mu} = {{\\mu}_1 , . . . , {\\mu}_r }. Before deployment, a class-i sensor is assigned K_i cryptographic keys that are selected uniformly at random from a common pool of P keys. Once deployed, a pair of sensors can communicate securely if and only if they have a key in common. We model the communication topology of this network by a newly defined inhomogeneous random key graph. We es"},"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":"1508.02407","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-08-10T20:11:02Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"6492549b74399f94492524f2eff0e2c55ef25f1687bc216e8ba33d3fe01bcf1e","abstract_canon_sha256":"0ad0ebd34b67ee4e6108c40b629b90b3001ae779df1b72fd3c9817795e431cd1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:55.570572Z","signature_b64":"wsmuA4lKQ+yQr2gmsgdnc9mEASzDWvZU/wfBydArPm8VbXRyUNpdcBJvGd30k3o/cQRxXzE0C4ggfMoKQ1wIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c56b9685086e3b54d2387b341f90eb44d16a68e52802785e85fc34b405c806c4","last_reissued_at":"2026-05-18T00:52:55.570024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:55.570024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Zero-one laws for connectivity in inhomogeneous random key graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.PR","authors_text":"Osman Yagan","submitted_at":"2015-08-10T20:11:02Z","abstract_excerpt":"We introduce a new random key predistribution scheme for securing heterogeneous wireless sensor networks. Each of the n sensors in the network is classified into r classes according to some probability distribution {\\mu} = {{\\mu}_1 , . . . , {\\mu}_r }. Before deployment, a class-i sensor is assigned K_i cryptographic keys that are selected uniformly at random from a common pool of P keys. Once deployed, a pair of sensors can communicate securely if and only if they have a key in common. We model the communication topology of this network by a newly defined inhomogeneous random key graph. We es"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02407","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1508.02407","created_at":"2026-05-18T00:52:55.570103+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.02407v1","created_at":"2026-05-18T00:52:55.570103+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02407","created_at":"2026-05-18T00:52:55.570103+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVVZNBIINY5V","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVVZNBIINY5VJURY","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVVZNBII","created_at":"2026-05-18T12:29:52.810259+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/YVVZNBIINY5VJURYPM2B7EHLIT","json":"https://pith.science/pith/YVVZNBIINY5VJURYPM2B7EHLIT.json","graph_json":"https://pith.science/api/pith-number/YVVZNBIINY5VJURYPM2B7EHLIT/graph.json","events_json":"https://pith.science/api/pith-number/YVVZNBIINY5VJURYPM2B7EHLIT/events.json","paper":"https://pith.science/paper/YVVZNBII"},"agent_actions":{"view_html":"https://pith.science/pith/YVVZNBIINY5VJURYPM2B7EHLIT","download_json":"https://pith.science/pith/YVVZNBIINY5VJURYPM2B7EHLIT.json","view_paper":"https://pith.science/paper/YVVZNBII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.02407&json=true","fetch_graph":"https://pith.science/api/pith-number/YVVZNBIINY5VJURYPM2B7EHLIT/graph.json","fetch_events":"https://pith.science/api/pith-number/YVVZNBIINY5VJURYPM2B7EHLIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVVZNBIINY5VJURYPM2B7EHLIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVVZNBIINY5VJURYPM2B7EHLIT/action/storage_attestation","attest_author":"https://pith.science/pith/YVVZNBIINY5VJURYPM2B7EHLIT/action/author_attestation","sign_citation":"https://pith.science/pith/YVVZNBIINY5VJURYPM2B7EHLIT/action/citation_signature","submit_replication":"https://pith.science/pith/YVVZNBIINY5VJURYPM2B7EHLIT/action/replication_record"}},"created_at":"2026-05-18T00:52:55.570103+00:00","updated_at":"2026-05-18T00:52:55.570103+00:00"}