{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CFXSARM5I3DABVP3TREK7XJJ43","short_pith_number":"pith:CFXSARM5","canonical_record":{"source":{"id":"1204.0667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-04-03T11:54:57Z","cross_cats_sorted":[],"title_canon_sha256":"fc5518a8fb3a9750f5f63daabc9768e1b87b5d3e976346bb01976d641e649955","abstract_canon_sha256":"b6d3a8a73d632f5eb191ab19968b82cc31e5879f6c5667c1ad16a05ac67dc579"},"schema_version":"1.0"},"canonical_sha256":"116f20459d46c600d5fb9c48afdd29e6c90fcebcb602a1b8a9de7e3ea50ffecc","source":{"kind":"arxiv","id":"1204.0667","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0667","created_at":"2026-05-18T03:49:11Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0667v2","created_at":"2026-05-18T03:49:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0667","created_at":"2026-05-18T03:49:11Z"},{"alias_kind":"pith_short_12","alias_value":"CFXSARM5I3DA","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CFXSARM5I3DABVP3","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CFXSARM5","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CFXSARM5I3DABVP3TREK7XJJ43","target":"record","payload":{"canonical_record":{"source":{"id":"1204.0667","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-04-03T11:54:57Z","cross_cats_sorted":[],"title_canon_sha256":"fc5518a8fb3a9750f5f63daabc9768e1b87b5d3e976346bb01976d641e649955","abstract_canon_sha256":"b6d3a8a73d632f5eb191ab19968b82cc31e5879f6c5667c1ad16a05ac67dc579"},"schema_version":"1.0"},"canonical_sha256":"116f20459d46c600d5fb9c48afdd29e6c90fcebcb602a1b8a9de7e3ea50ffecc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:11.686152Z","signature_b64":"cnrTzcwaA71MH6Q1iyuEdVJowMM4ks2Ivnt+KbZOQIf2Gr2Q1B2JAyDudwnng9jBfrMpv0SclKOADAYVPy/sDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"116f20459d46c600d5fb9c48afdd29e6c90fcebcb602a1b8a9de7e3ea50ffecc","last_reissued_at":"2026-05-18T03:49:11.685550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:11.685550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.0667","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:49:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GcCcJ08Ag0FCKt8D71HxDkp1nxi+ARXx3A3Ey1ZECiLZx+qvytWzmPZESkH5yhGgDQFLeV7TyB/YGVm9gLhNCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:33:44.752854Z"},"content_sha256":"e12a51aeee14006bb4daa67d70ff9e6ac1dda83ff63f76f01a4e9d4f6b05e4a1","schema_version":"1.0","event_id":"sha256:e12a51aeee14006bb4daa67d70ff9e6ac1dda83ff63f76f01a4e9d4f6b05e4a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CFXSARM5I3DABVP3TREK7XJJ43","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Connectivity Threshold of Random Geometric Graphs with Cantor Distributed Vertices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Antar Bandyopadhyay, Farkhondeh Sajadi","submitted_at":"2012-04-03T11:54:57Z","abstract_excerpt":"For connectivity of \\emph{random geometric graphs}, where there is no density for underlying distribution of the vertices, we consider $n$ i.i.d. \\emph{Cantor} distributed points on $[0,1]$. We show that for this random geometric graph, the connectivity threshold $R_{n}$, converges almost surely to a constant $1-2\\phi$ where $0 < \\phi < 1/2$, which for the standard Cantor distribution is 1/3. We also show that $\\| R_n - (1 - 2 \\phi) \\|_1 \\sim 2 \\, C(\\phi) \\, n^{-1/d_{\\phi}}$ where $C(\\phi) > 0$ is a constant and $d_{\\phi} := - {\\log 2}/{\\log \\phi}$ is the \\emph{Hausdorff dimension} of the gene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0667","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:49:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7SPg/E4Qn0dqSzgWNjYmeZAmwJHQUM+nQ58L56o5AFxIBVHYRyTvgwsYge2WJt9FSL07G9G45i/nCJko2/v4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:33:44.753207Z"},"content_sha256":"c21c0f1c264143703a3a625eded2cc6fb534b737ce491791ab3a712e00e1763b","schema_version":"1.0","event_id":"sha256:c21c0f1c264143703a3a625eded2cc6fb534b737ce491791ab3a712e00e1763b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CFXSARM5I3DABVP3TREK7XJJ43/bundle.json","state_url":"https://pith.science/pith/CFXSARM5I3DABVP3TREK7XJJ43/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CFXSARM5I3DABVP3TREK7XJJ43/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-08T22:33:44Z","links":{"resolver":"https://pith.science/pith/CFXSARM5I3DABVP3TREK7XJJ43","bundle":"https://pith.science/pith/CFXSARM5I3DABVP3TREK7XJJ43/bundle.json","state":"https://pith.science/pith/CFXSARM5I3DABVP3TREK7XJJ43/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CFXSARM5I3DABVP3TREK7XJJ43/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CFXSARM5I3DABVP3TREK7XJJ43","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":"b6d3a8a73d632f5eb191ab19968b82cc31e5879f6c5667c1ad16a05ac67dc579","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-04-03T11:54:57Z","title_canon_sha256":"fc5518a8fb3a9750f5f63daabc9768e1b87b5d3e976346bb01976d641e649955"},"schema_version":"1.0","source":{"id":"1204.0667","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0667","created_at":"2026-05-18T03:49:11Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0667v2","created_at":"2026-05-18T03:49:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0667","created_at":"2026-05-18T03:49:11Z"},{"alias_kind":"pith_short_12","alias_value":"CFXSARM5I3DA","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CFXSARM5I3DABVP3","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CFXSARM5","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:c21c0f1c264143703a3a625eded2cc6fb534b737ce491791ab3a712e00e1763b","target":"graph","created_at":"2026-05-18T03:49:11Z","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":"For connectivity of \\emph{random geometric graphs}, where there is no density for underlying distribution of the vertices, we consider $n$ i.i.d. \\emph{Cantor} distributed points on $[0,1]$. We show that for this random geometric graph, the connectivity threshold $R_{n}$, converges almost surely to a constant $1-2\\phi$ where $0 < \\phi < 1/2$, which for the standard Cantor distribution is 1/3. We also show that $\\| R_n - (1 - 2 \\phi) \\|_1 \\sim 2 \\, C(\\phi) \\, n^{-1/d_{\\phi}}$ where $C(\\phi) > 0$ is a constant and $d_{\\phi} := - {\\log 2}/{\\log \\phi}$ is the \\emph{Hausdorff dimension} of the gene","authors_text":"Antar Bandyopadhyay, Farkhondeh Sajadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-04-03T11:54:57Z","title":"Connectivity Threshold of Random Geometric Graphs with Cantor Distributed Vertices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0667","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:e12a51aeee14006bb4daa67d70ff9e6ac1dda83ff63f76f01a4e9d4f6b05e4a1","target":"record","created_at":"2026-05-18T03:49:11Z","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":"b6d3a8a73d632f5eb191ab19968b82cc31e5879f6c5667c1ad16a05ac67dc579","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2012-04-03T11:54:57Z","title_canon_sha256":"fc5518a8fb3a9750f5f63daabc9768e1b87b5d3e976346bb01976d641e649955"},"schema_version":"1.0","source":{"id":"1204.0667","kind":"arxiv","version":2}},"canonical_sha256":"116f20459d46c600d5fb9c48afdd29e6c90fcebcb602a1b8a9de7e3ea50ffecc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"116f20459d46c600d5fb9c48afdd29e6c90fcebcb602a1b8a9de7e3ea50ffecc","first_computed_at":"2026-05-18T03:49:11.685550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:11.685550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cnrTzcwaA71MH6Q1iyuEdVJowMM4ks2Ivnt+KbZOQIf2Gr2Q1B2JAyDudwnng9jBfrMpv0SclKOADAYVPy/sDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:11.686152Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.0667","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e12a51aeee14006bb4daa67d70ff9e6ac1dda83ff63f76f01a4e9d4f6b05e4a1","sha256:c21c0f1c264143703a3a625eded2cc6fb534b737ce491791ab3a712e00e1763b"],"state_sha256":"b0b7486d9fb23a888ce8026762217ea09924bd442353fe6dcccaa8b0f600e942"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1wPGGbqMkj/2WcA7cxgbhvDDDCQr0SdoCwbzj40uvpt5JOnqIRh6j2iS7kvwhmk/GCAOPughmjRP4RSwotl1Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:33:44.755665Z","bundle_sha256":"fe08972e71d3b161b74baca5c7f7ffcbda37eaabada22e51218725c26318f285"}}