{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:EXPWV5HJO7DNYXSTJICRR53OEV","short_pith_number":"pith:EXPWV5HJ","canonical_record":{"source":{"id":"0908.3644","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-08-25T16:18:14Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"b98c56097700c689055c5b567fbd4b08bb57a4331603e45521f7c10b54599e33","abstract_canon_sha256":"ae0aa606879c6588b06c105b9724e706a1ae19ca7351c7a6d76b8295cc1e6b3b"},"schema_version":"1.0"},"canonical_sha256":"25df6af4e977c6dc5e534a0518f76e257fecd1db71efad2589b2ca275441b3e0","source":{"kind":"arxiv","id":"0908.3644","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.3644","created_at":"2026-05-18T03:29:16Z"},{"alias_kind":"arxiv_version","alias_value":"0908.3644v2","created_at":"2026-05-18T03:29:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.3644","created_at":"2026-05-18T03:29:16Z"},{"alias_kind":"pith_short_12","alias_value":"EXPWV5HJO7DN","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"EXPWV5HJO7DNYXST","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"EXPWV5HJ","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:EXPWV5HJO7DNYXSTJICRR53OEV","target":"record","payload":{"canonical_record":{"source":{"id":"0908.3644","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-08-25T16:18:14Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"b98c56097700c689055c5b567fbd4b08bb57a4331603e45521f7c10b54599e33","abstract_canon_sha256":"ae0aa606879c6588b06c105b9724e706a1ae19ca7351c7a6d76b8295cc1e6b3b"},"schema_version":"1.0"},"canonical_sha256":"25df6af4e977c6dc5e534a0518f76e257fecd1db71efad2589b2ca275441b3e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:16.682670Z","signature_b64":"/SY9JdyrvDMfe+Xda8Qt/lhjXXj8fAJxELzW6X1N4xPMOH7L9ie6mkFaATLVD3gXCRSS7TuMAcPvQqWUrzepAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25df6af4e977c6dc5e534a0518f76e257fecd1db71efad2589b2ca275441b3e0","last_reissued_at":"2026-05-18T03:29:16.682051Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:16.682051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0908.3644","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:29:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7dawZOJWDmJdl4+ctIpeLZRpk5eo3qjt/zPdb/+F/yaFfwDtxEb58riwRw7HkI6W5VtXzNd6yNBRNIbqW+wmAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:28:23.905377Z"},"content_sha256":"42d72924537a940e2a04c6617033171c224d9f4de7f9e4705f12c04ff2195570","schema_version":"1.0","event_id":"sha256:42d72924537a940e2a04c6617033171c224d9f4de7f9e4705f12c04ff2195570"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:EXPWV5HJO7DNYXSTJICRR53OEV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Zero-one laws for connectivity in random key graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Armand M. Makowski, Osman Yagan","submitted_at":"2009-08-25T16:18:14Z","abstract_excerpt":"The random key graph is a random graph naturally associated with the random key predistribution scheme of Eschenauer and Gligor for wireless sensor networks. For this class of random graphs we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly large. The results reported here complement and strengthen recent work on this conjecture by Blackburn and Gerke. In particular, the results are given under conditions which are more realistic for applications to wireless sensor networks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.3644","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:29:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bRQiKTyOiYSTUOD+we+4iGNYXhxL20VXHT3U3Q6I0Nh145djkWzHk8lZxfqCHR4J/EyTlcx21ARXc71j1eIHBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:28:23.906018Z"},"content_sha256":"1f3877f43268b0d8c662100d02dcb0eab3847c249800d17369bc63dd97170974","schema_version":"1.0","event_id":"sha256:1f3877f43268b0d8c662100d02dcb0eab3847c249800d17369bc63dd97170974"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EXPWV5HJO7DNYXSTJICRR53OEV/bundle.json","state_url":"https://pith.science/pith/EXPWV5HJO7DNYXSTJICRR53OEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EXPWV5HJO7DNYXSTJICRR53OEV/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-30T02:28:23Z","links":{"resolver":"https://pith.science/pith/EXPWV5HJO7DNYXSTJICRR53OEV","bundle":"https://pith.science/pith/EXPWV5HJO7DNYXSTJICRR53OEV/bundle.json","state":"https://pith.science/pith/EXPWV5HJO7DNYXSTJICRR53OEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EXPWV5HJO7DNYXSTJICRR53OEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:EXPWV5HJO7DNYXSTJICRR53OEV","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":"ae0aa606879c6588b06c105b9724e706a1ae19ca7351c7a6d76b8295cc1e6b3b","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-08-25T16:18:14Z","title_canon_sha256":"b98c56097700c689055c5b567fbd4b08bb57a4331603e45521f7c10b54599e33"},"schema_version":"1.0","source":{"id":"0908.3644","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0908.3644","created_at":"2026-05-18T03:29:16Z"},{"alias_kind":"arxiv_version","alias_value":"0908.3644v2","created_at":"2026-05-18T03:29:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.3644","created_at":"2026-05-18T03:29:16Z"},{"alias_kind":"pith_short_12","alias_value":"EXPWV5HJO7DN","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"EXPWV5HJO7DNYXST","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"EXPWV5HJ","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:1f3877f43268b0d8c662100d02dcb0eab3847c249800d17369bc63dd97170974","target":"graph","created_at":"2026-05-18T03:29:16Z","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 random key graph is a random graph naturally associated with the random key predistribution scheme of Eschenauer and Gligor for wireless sensor networks. For this class of random graphs we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly large. The results reported here complement and strengthen recent work on this conjecture by Blackburn and Gerke. In particular, the results are given under conditions which are more realistic for applications to wireless sensor networks.","authors_text":"Armand M. Makowski, Osman Yagan","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-08-25T16:18:14Z","title":"Zero-one laws for connectivity in random key graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.3644","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:42d72924537a940e2a04c6617033171c224d9f4de7f9e4705f12c04ff2195570","target":"record","created_at":"2026-05-18T03:29:16Z","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":"ae0aa606879c6588b06c105b9724e706a1ae19ca7351c7a6d76b8295cc1e6b3b","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-08-25T16:18:14Z","title_canon_sha256":"b98c56097700c689055c5b567fbd4b08bb57a4331603e45521f7c10b54599e33"},"schema_version":"1.0","source":{"id":"0908.3644","kind":"arxiv","version":2}},"canonical_sha256":"25df6af4e977c6dc5e534a0518f76e257fecd1db71efad2589b2ca275441b3e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25df6af4e977c6dc5e534a0518f76e257fecd1db71efad2589b2ca275441b3e0","first_computed_at":"2026-05-18T03:29:16.682051Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:16.682051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/SY9JdyrvDMfe+Xda8Qt/lhjXXj8fAJxELzW6X1N4xPMOH7L9ie6mkFaATLVD3gXCRSS7TuMAcPvQqWUrzepAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:16.682670Z","signed_message":"canonical_sha256_bytes"},"source_id":"0908.3644","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42d72924537a940e2a04c6617033171c224d9f4de7f9e4705f12c04ff2195570","sha256:1f3877f43268b0d8c662100d02dcb0eab3847c249800d17369bc63dd97170974"],"state_sha256":"349062fadbbecd406653345d8444e33caab9767b7234e97e9b90c979bd3e8124"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yfP99M91/GOIg3DMMA5sIVJJf5v6qkFKt1IRLWCCh+BXJ2S6tcuPd1XyIYiTX47GMkSRt8FTDqZszqO8h4d4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:28:23.909604Z","bundle_sha256":"3cb5ec4ae303a65d85ba1f7b1ee9a59bd3c123313f56a7d96712e6958128fd5c"}}