{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NVUVCGWAFGCTEILNIIPCTAAMFM","short_pith_number":"pith:NVUVCGWA","schema_version":"1.0","canonical_sha256":"6d69511ac0298532216d421e29800c2b1b6f8fb862fecb5265fb4c200f8f5a3f","source":{"kind":"arxiv","id":"2411.13452","version":2},"attestation_state":"computed","paper":{"title":"Exact threshold and limiting distribution for non-linear Hamilton cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Byron Chin","submitted_at":"2024-11-20T16:55:24Z","abstract_excerpt":"For positive integers $r > \\ell \\geq 1$, an $\\ell$-cycle in an $r$-uniform hypergraph is a cycle where each edge consists of $r$ vertices and each pair of consecutive edges intersect in $\\ell$ vertices. For $\\ell \\geq 2$, we determine the limiting distribution of the number of Hamilton $\\ell$-cycles in an Erd\\H{o}s--R\\'enyi random hypergraph. The behavior is distinguished in two cases:\n  -When $\\ell \\geq 3$, the number of cycles concentrates when the expectation diverges and converges to a Poisson distribution when the expectation is constant.\n  -When $\\ell = 2$, the normalized number of cycle"},"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":"2411.13452","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2024-11-20T16:55:24Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"ad1e0ef188375e1b3ec373fb6c0fa14c4e2874c95a480802b478759ba42195ca","abstract_canon_sha256":"ca9ce0c5a3755d99211b019730389d27e0ec9497689617a6a70de4ea5797fac6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:57:48.954417Z","signature_b64":"W8UBbz+WdX9LXbq6kZd82HjlDTKHRfAFcQwExWVI+xSGeem10mcUvKJA15xQnC75QsUXJrqPi3OJikGeseBpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d69511ac0298532216d421e29800c2b1b6f8fb862fecb5265fb4c200f8f5a3f","last_reissued_at":"2026-07-05T09:57:48.953986Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:57:48.953986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact threshold and limiting distribution for non-linear Hamilton cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Byron Chin","submitted_at":"2024-11-20T16:55:24Z","abstract_excerpt":"For positive integers $r > \\ell \\geq 1$, an $\\ell$-cycle in an $r$-uniform hypergraph is a cycle where each edge consists of $r$ vertices and each pair of consecutive edges intersect in $\\ell$ vertices. For $\\ell \\geq 2$, we determine the limiting distribution of the number of Hamilton $\\ell$-cycles in an Erd\\H{o}s--R\\'enyi random hypergraph. The behavior is distinguished in two cases:\n  -When $\\ell \\geq 3$, the number of cycles concentrates when the expectation diverges and converges to a Poisson distribution when the expectation is constant.\n  -When $\\ell = 2$, the normalized number of cycle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13452","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.13452/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.13452","created_at":"2026-07-05T09:57:48.954042+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.13452v2","created_at":"2026-07-05T09:57:48.954042+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13452","created_at":"2026-07-05T09:57:48.954042+00:00"},{"alias_kind":"pith_short_12","alias_value":"NVUVCGWAFGCT","created_at":"2026-07-05T09:57:48.954042+00:00"},{"alias_kind":"pith_short_16","alias_value":"NVUVCGWAFGCTEILN","created_at":"2026-07-05T09:57:48.954042+00:00"},{"alias_kind":"pith_short_8","alias_value":"NVUVCGWA","created_at":"2026-07-05T09:57:48.954042+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/NVUVCGWAFGCTEILNIIPCTAAMFM","json":"https://pith.science/pith/NVUVCGWAFGCTEILNIIPCTAAMFM.json","graph_json":"https://pith.science/api/pith-number/NVUVCGWAFGCTEILNIIPCTAAMFM/graph.json","events_json":"https://pith.science/api/pith-number/NVUVCGWAFGCTEILNIIPCTAAMFM/events.json","paper":"https://pith.science/paper/NVUVCGWA"},"agent_actions":{"view_html":"https://pith.science/pith/NVUVCGWAFGCTEILNIIPCTAAMFM","download_json":"https://pith.science/pith/NVUVCGWAFGCTEILNIIPCTAAMFM.json","view_paper":"https://pith.science/paper/NVUVCGWA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.13452&json=true","fetch_graph":"https://pith.science/api/pith-number/NVUVCGWAFGCTEILNIIPCTAAMFM/graph.json","fetch_events":"https://pith.science/api/pith-number/NVUVCGWAFGCTEILNIIPCTAAMFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NVUVCGWAFGCTEILNIIPCTAAMFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NVUVCGWAFGCTEILNIIPCTAAMFM/action/storage_attestation","attest_author":"https://pith.science/pith/NVUVCGWAFGCTEILNIIPCTAAMFM/action/author_attestation","sign_citation":"https://pith.science/pith/NVUVCGWAFGCTEILNIIPCTAAMFM/action/citation_signature","submit_replication":"https://pith.science/pith/NVUVCGWAFGCTEILNIIPCTAAMFM/action/replication_record"}},"created_at":"2026-07-05T09:57:48.954042+00:00","updated_at":"2026-07-05T09:57:48.954042+00:00"}