{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YVVZNBIINY5VJURYPM2B7EHLIT","short_pith_number":"pith:YVVZNBII","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"},"canonical_sha256":"c56b9685086e3b54d2387b341f90eb44d16a68e52802785e85fc34b405c806c4","source":{"kind":"arxiv","id":"1508.02407","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02407","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02407v1","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02407","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"pith_short_12","alias_value":"YVVZNBIINY5V","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YVVZNBIINY5VJURY","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YVVZNBII","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YVVZNBIINY5VJURYPM2B7EHLIT","target":"record","payload":{"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"},"canonical_sha256":"c56b9685086e3b54d2387b341f90eb44d16a68e52802785e85fc34b405c806c4","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"},"source_kind":"arxiv","source_id":"1508.02407","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-18T00:52:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VF2watmwwaS/RAmenAPd6KRM5dg4rqITRORIRTyIhAjzPKW+gNAeQan2E4o3NdzHSmUpJbecYWHchN8GO3WyBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T22:09:03.700939Z"},"content_sha256":"1cc268460b5b8b6f55bb9029ab8ba4290a25cc016051a2087f6575117209a449","schema_version":"1.0","event_id":"sha256:1cc268460b5b8b6f55bb9029ab8ba4290a25cc016051a2087f6575117209a449"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YVVZNBIINY5VJURYPM2B7EHLIT","target":"graph","payload":{"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"},"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-18T00:52:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EcXZPIZ5J8HVnnQ74TgkM+YCCwpiakhOZjr8K6nZUTFRFhSSD+NnHp14so50pOSYGFcLRKaPWUdG0UapNGoZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T22:09:03.701312Z"},"content_sha256":"14310624fcbae7fbcfb8190148727e8321428a66dca2a3a907cc7327022712fa","schema_version":"1.0","event_id":"sha256:14310624fcbae7fbcfb8190148727e8321428a66dca2a3a907cc7327022712fa"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YVVZNBIINY5VJURYPM2B7EHLIT/bundle.json","state_url":"https://pith.science/pith/YVVZNBIINY5VJURYPM2B7EHLIT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YVVZNBIINY5VJURYPM2B7EHLIT/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-07-04T22:09:03Z","links":{"resolver":"https://pith.science/pith/YVVZNBIINY5VJURYPM2B7EHLIT","bundle":"https://pith.science/pith/YVVZNBIINY5VJURYPM2B7EHLIT/bundle.json","state":"https://pith.science/pith/YVVZNBIINY5VJURYPM2B7EHLIT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YVVZNBIINY5VJURYPM2B7EHLIT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YVVZNBIINY5VJURYPM2B7EHLIT","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":"0ad0ebd34b67ee4e6108c40b629b90b3001ae779df1b72fd3c9817795e431cd1","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-08-10T20:11:02Z","title_canon_sha256":"6492549b74399f94492524f2eff0e2c55ef25f1687bc216e8ba33d3fe01bcf1e"},"schema_version":"1.0","source":{"id":"1508.02407","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.02407","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"arxiv_version","alias_value":"1508.02407v1","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02407","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"pith_short_12","alias_value":"YVVZNBIINY5V","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"YVVZNBIINY5VJURY","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"YVVZNBII","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:14310624fcbae7fbcfb8190148727e8321428a66dca2a3a907cc7327022712fa","target":"graph","created_at":"2026-05-18T00:52:55Z","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":"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","authors_text":"Osman Yagan","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-08-10T20:11:02Z","title":"Zero-one laws for connectivity in inhomogeneous random key graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02407","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:1cc268460b5b8b6f55bb9029ab8ba4290a25cc016051a2087f6575117209a449","target":"record","created_at":"2026-05-18T00:52:55Z","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":"0ad0ebd34b67ee4e6108c40b629b90b3001ae779df1b72fd3c9817795e431cd1","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-08-10T20:11:02Z","title_canon_sha256":"6492549b74399f94492524f2eff0e2c55ef25f1687bc216e8ba33d3fe01bcf1e"},"schema_version":"1.0","source":{"id":"1508.02407","kind":"arxiv","version":1}},"canonical_sha256":"c56b9685086e3b54d2387b341f90eb44d16a68e52802785e85fc34b405c806c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c56b9685086e3b54d2387b341f90eb44d16a68e52802785e85fc34b405c806c4","first_computed_at":"2026-05-18T00:52:55.570024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:55.570024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wsmuA4lKQ+yQr2gmsgdnc9mEASzDWvZU/wfBydArPm8VbXRyUNpdcBJvGd30k3o/cQRxXzE0C4ggfMoKQ1wIAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:55.570572Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.02407","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cc268460b5b8b6f55bb9029ab8ba4290a25cc016051a2087f6575117209a449","sha256:14310624fcbae7fbcfb8190148727e8321428a66dca2a3a907cc7327022712fa"],"state_sha256":"85c76499484026c6caae57eecdfd4f35892973bf9fd4ad50b86407c91a2c6a8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SlJr4aa73H+Bh+yRMp5vmhMN73MIID8BrOS3KrKeMqHRDZTco5N3oRb7vqCfbm0sGx9O/MORwr4urPZ9CF5gAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T22:09:03.703192Z","bundle_sha256":"adf8b9b782345209d65df984c487e48acc2596bf62e0ee2b5cca6706d8f5019c"}}