{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ALCAHKYWCAYD7R6M4MAAQNMO2A","short_pith_number":"pith:ALCAHKYW","schema_version":"1.0","canonical_sha256":"02c403ab1610303fc7cce30008358ed033fe5a291062ebbe3b00d69900ab5bff","source":{"kind":"arxiv","id":"1009.6046","version":1},"attestation_state":"computed","paper":{"title":"On Cycles in Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Madhav P. Desai","submitted_at":"2010-09-30T06:29:36Z","abstract_excerpt":"We consider the geometric random (GR) graph on the $d-$dimensional torus with the $L_\\sigma$ distance measure ($1 \\leq \\sigma \\leq \\infty$). Our main result is an exact characterization of the probability that a particular labeled cycle exists in this random graph. For $\\sigma = 2$ and $\\sigma = \\infty$, we use this characterization to derive a series which evaluates to the cycle probability. We thus obtain an exact formula for the expected number of Hamilton cycles in the random graph (when $\\sigma = \\infty$ and $\\sigma = 2$). We also consider the adjacency matrix of the random graph and deri"},"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":"1009.6046","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-30T06:29:36Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"49353cd4d37fcc41937f54db9040930ea0494470df90db541671a8b8d5b2451a","abstract_canon_sha256":"b369273600399a08d64b918a50f7f509dd519328a7c70b59bb366cff8c817870"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:07.847999Z","signature_b64":"X/SyRoMFSzKDWHgdY1CAzjmwgjD4kgjVOe6sRbQ+PkTKB82UM0ZTQUA8OMl6IEffnlrvmhuMrVB0yT9RlqBADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02c403ab1610303fc7cce30008358ed033fe5a291062ebbe3b00d69900ab5bff","last_reissued_at":"2026-05-18T04:40:07.847494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:07.847494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Cycles in Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Madhav P. Desai","submitted_at":"2010-09-30T06:29:36Z","abstract_excerpt":"We consider the geometric random (GR) graph on the $d-$dimensional torus with the $L_\\sigma$ distance measure ($1 \\leq \\sigma \\leq \\infty$). Our main result is an exact characterization of the probability that a particular labeled cycle exists in this random graph. For $\\sigma = 2$ and $\\sigma = \\infty$, we use this characterization to derive a series which evaluates to the cycle probability. We thus obtain an exact formula for the expected number of Hamilton cycles in the random graph (when $\\sigma = \\infty$ and $\\sigma = 2$). We also consider the adjacency matrix of the random graph and deri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.6046","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":"1009.6046","created_at":"2026-05-18T04:40:07.847570+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.6046v1","created_at":"2026-05-18T04:40:07.847570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.6046","created_at":"2026-05-18T04:40:07.847570+00:00"},{"alias_kind":"pith_short_12","alias_value":"ALCAHKYWCAYD","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"ALCAHKYWCAYD7R6M","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"ALCAHKYW","created_at":"2026-05-18T12:26:05.355336+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/ALCAHKYWCAYD7R6M4MAAQNMO2A","json":"https://pith.science/pith/ALCAHKYWCAYD7R6M4MAAQNMO2A.json","graph_json":"https://pith.science/api/pith-number/ALCAHKYWCAYD7R6M4MAAQNMO2A/graph.json","events_json":"https://pith.science/api/pith-number/ALCAHKYWCAYD7R6M4MAAQNMO2A/events.json","paper":"https://pith.science/paper/ALCAHKYW"},"agent_actions":{"view_html":"https://pith.science/pith/ALCAHKYWCAYD7R6M4MAAQNMO2A","download_json":"https://pith.science/pith/ALCAHKYWCAYD7R6M4MAAQNMO2A.json","view_paper":"https://pith.science/paper/ALCAHKYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.6046&json=true","fetch_graph":"https://pith.science/api/pith-number/ALCAHKYWCAYD7R6M4MAAQNMO2A/graph.json","fetch_events":"https://pith.science/api/pith-number/ALCAHKYWCAYD7R6M4MAAQNMO2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ALCAHKYWCAYD7R6M4MAAQNMO2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ALCAHKYWCAYD7R6M4MAAQNMO2A/action/storage_attestation","attest_author":"https://pith.science/pith/ALCAHKYWCAYD7R6M4MAAQNMO2A/action/author_attestation","sign_citation":"https://pith.science/pith/ALCAHKYWCAYD7R6M4MAAQNMO2A/action/citation_signature","submit_replication":"https://pith.science/pith/ALCAHKYWCAYD7R6M4MAAQNMO2A/action/replication_record"}},"created_at":"2026-05-18T04:40:07.847570+00:00","updated_at":"2026-05-18T04:40:07.847570+00:00"}