{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2KIMAMUCVDGTBFYU6GZAYSBILP","short_pith_number":"pith:2KIMAMUC","canonical_record":{"source":{"id":"1405.5193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-19T17:27:58Z","cross_cats_sorted":["cs.CR","cs.IT","math.CO","math.IT","math.PR"],"title_canon_sha256":"c2b9bf0c3c2c25e8d41a3c8758b56ab69217fb71e1581767288ab3b3c1280186","abstract_canon_sha256":"beb5f6606d811531a7b6eeb23db39f7e24678311bec8705eca41a765870c99fa"},"schema_version":"1.0"},"canonical_sha256":"d290c03282a8cd309714f1b20c48285bf899f5ce7283a1f8e17660e480494614","source":{"kind":"arxiv","id":"1405.5193","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5193","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5193v1","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5193","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"pith_short_12","alias_value":"2KIMAMUCVDGT","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2KIMAMUCVDGTBFYU","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2KIMAMUC","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2KIMAMUCVDGTBFYU6GZAYSBILP","target":"record","payload":{"canonical_record":{"source":{"id":"1405.5193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-19T17:27:58Z","cross_cats_sorted":["cs.CR","cs.IT","math.CO","math.IT","math.PR"],"title_canon_sha256":"c2b9bf0c3c2c25e8d41a3c8758b56ab69217fb71e1581767288ab3b3c1280186","abstract_canon_sha256":"beb5f6606d811531a7b6eeb23db39f7e24678311bec8705eca41a765870c99fa"},"schema_version":"1.0"},"canonical_sha256":"d290c03282a8cd309714f1b20c48285bf899f5ce7283a1f8e17660e480494614","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:55.725285Z","signature_b64":"S6rgyb8rJiV28kqTAWUceBjPq0fQqS0Qld57XEcQmY5SBSiZQx/I2ENLFF7Dvxe2vPewqZu8xz8S9D6xIUn8Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d290c03282a8cd309714f1b20c48285bf899f5ce7283a1f8e17660e480494614","last_reissued_at":"2026-05-18T00:52:55.724837Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:55.724837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.5193","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":"Ragh5iRZ5MxUaPA7stS0y/wgwq/T746S1pgc3OKSiI+YspHWfVOwktFw+49TKW2W4yiaYaO/zT4b9/lp8hZDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:21:53.718932Z"},"content_sha256":"17784899de5783b239377bee3b8640a4a4427bd037d6c52e461904717cd57570","schema_version":"1.0","event_id":"sha256:17784899de5783b239377bee3b8640a4a4427bd037d6c52e461904717cd57570"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2KIMAMUCVDGTBFYU6GZAYSBILP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards $k$-connectivity of the random graph induced by a pairwise key predistribution scheme with unreliable links","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.IT","math.CO","math.IT","math.PR"],"primary_cat":"cs.DM","authors_text":"Faruk Yavuz, Jun Zhao, Osman Ya\\u{g}an, Virgil Gligor","submitted_at":"2014-04-19T17:27:58Z","abstract_excerpt":"We study the secure and reliable connectivity of wireless sensor networks. Security is assumed to be ensured by the random pairwise key predistribution scheme of Chan, Perrig, and Song, and unreliable wireless links are represented by independent on/off channels. Modeling the network by an intersection of a random $K$-out graph and an Erd\\H{o}s-R\\'enyi graph, we present scaling conditions (on the number of nodes, the scheme parameter $K$, and the probability of a wireless channel being on) such that the resulting graph contains no nodes with degree less than $k$ with high probability, when the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5193","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":"O0f5xX9I0nVHlsx/TEFnJhoxu1wrs98MAspq2DpI+QUdM5QBREiRKv/HEFuRgTdgoIjUjB8gmM7hM10UJ0MQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:21:53.719286Z"},"content_sha256":"3ad3d57946290d11bd61b549610d3a12af1abac7398b7a50e1e97a85ca9089ab","schema_version":"1.0","event_id":"sha256:3ad3d57946290d11bd61b549610d3a12af1abac7398b7a50e1e97a85ca9089ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2KIMAMUCVDGTBFYU6GZAYSBILP/bundle.json","state_url":"https://pith.science/pith/2KIMAMUCVDGTBFYU6GZAYSBILP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2KIMAMUCVDGTBFYU6GZAYSBILP/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-12T05:21:53Z","links":{"resolver":"https://pith.science/pith/2KIMAMUCVDGTBFYU6GZAYSBILP","bundle":"https://pith.science/pith/2KIMAMUCVDGTBFYU6GZAYSBILP/bundle.json","state":"https://pith.science/pith/2KIMAMUCVDGTBFYU6GZAYSBILP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2KIMAMUCVDGTBFYU6GZAYSBILP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2KIMAMUCVDGTBFYU6GZAYSBILP","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":"beb5f6606d811531a7b6eeb23db39f7e24678311bec8705eca41a765870c99fa","cross_cats_sorted":["cs.CR","cs.IT","math.CO","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-19T17:27:58Z","title_canon_sha256":"c2b9bf0c3c2c25e8d41a3c8758b56ab69217fb71e1581767288ab3b3c1280186"},"schema_version":"1.0","source":{"id":"1405.5193","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5193","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5193v1","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5193","created_at":"2026-05-18T00:52:55Z"},{"alias_kind":"pith_short_12","alias_value":"2KIMAMUCVDGT","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2KIMAMUCVDGTBFYU","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2KIMAMUC","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:3ad3d57946290d11bd61b549610d3a12af1abac7398b7a50e1e97a85ca9089ab","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 study the secure and reliable connectivity of wireless sensor networks. Security is assumed to be ensured by the random pairwise key predistribution scheme of Chan, Perrig, and Song, and unreliable wireless links are represented by independent on/off channels. Modeling the network by an intersection of a random $K$-out graph and an Erd\\H{o}s-R\\'enyi graph, we present scaling conditions (on the number of nodes, the scheme parameter $K$, and the probability of a wireless channel being on) such that the resulting graph contains no nodes with degree less than $k$ with high probability, when the","authors_text":"Faruk Yavuz, Jun Zhao, Osman Ya\\u{g}an, Virgil Gligor","cross_cats":["cs.CR","cs.IT","math.CO","math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-19T17:27:58Z","title":"Towards $k$-connectivity of the random graph induced by a pairwise key predistribution scheme with unreliable links"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5193","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:17784899de5783b239377bee3b8640a4a4427bd037d6c52e461904717cd57570","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":"beb5f6606d811531a7b6eeb23db39f7e24678311bec8705eca41a765870c99fa","cross_cats_sorted":["cs.CR","cs.IT","math.CO","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-04-19T17:27:58Z","title_canon_sha256":"c2b9bf0c3c2c25e8d41a3c8758b56ab69217fb71e1581767288ab3b3c1280186"},"schema_version":"1.0","source":{"id":"1405.5193","kind":"arxiv","version":1}},"canonical_sha256":"d290c03282a8cd309714f1b20c48285bf899f5ce7283a1f8e17660e480494614","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d290c03282a8cd309714f1b20c48285bf899f5ce7283a1f8e17660e480494614","first_computed_at":"2026-05-18T00:52:55.724837Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:55.724837Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S6rgyb8rJiV28kqTAWUceBjPq0fQqS0Qld57XEcQmY5SBSiZQx/I2ENLFF7Dvxe2vPewqZu8xz8S9D6xIUn8Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:55.725285Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.5193","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17784899de5783b239377bee3b8640a4a4427bd037d6c52e461904717cd57570","sha256:3ad3d57946290d11bd61b549610d3a12af1abac7398b7a50e1e97a85ca9089ab"],"state_sha256":"a9b07a8a9a645fa11ff10e8cdac574b8e3208854395bfc71d546dee3806bb4c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+y6PE+v9rrFaDXUHvb91fQeaD0t8i69qIvmHRLQ4lCayYz1h3gYMublhjf/SgtB1RU9e+Z3osVRJgZTr5WH0AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T05:21:53.721347Z","bundle_sha256":"5f85ac67a84bc5baa2a8d0019d8eb93d738209a116ce33bdb27638eaec5f999d"}}