{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UZD2HQHKOLJKSSFYRGZTW62WAB","short_pith_number":"pith:UZD2HQHK","schema_version":"1.0","canonical_sha256":"a647a3c0ea72d2a948b889b33b7b5600483a1394cf1a413515090ece1ff21df2","source":{"kind":"arxiv","id":"1410.7446","version":1},"attestation_state":"computed","paper":{"title":"On Weak Hamiltonicity of a Random Hypergraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Daniel Poole","submitted_at":"2014-10-27T22:28:50Z","abstract_excerpt":"A {\\it weak (Berge) cycle} is an alternating sequence of vertices and (hyper)edges $C=(v_0, e_1, v_1, ..., v_{\\ell-1}, e_\\ell, v_{\\ell}=v_0)$ such that the vertices $v_0, ..., v_{\\ell-1}$ are distinct with $v_k, v_{k+1} \\in e_{k}$ for each $k$, but the edges $e_1, ..., e_\\ell$ are not necessarily distinct. We prove that the main barrier to the random $d$-uniform hypergraph $H_d(n,p),$ where each of the potential edges of cardinality $d$ is present with probability $p$, developing a weak Hamilton cycle is the presence of isolated vertices. In particular, for $d \\geq 3$ fixed and $p=(d-1)! \\frac"},"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":"1410.7446","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-27T22:28:50Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"9fc37d1315eaa4c8aedf70013ccf67042842f70b860d961e31dc3036f7c3b9a2","abstract_canon_sha256":"bc2c12cc6469fe2dcb3ae08bb22400584cbcdce1f7f7be5a64a8108d5c515ac6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:17.122770Z","signature_b64":"orh/lhV093w5VexeLUzPUmdz07IIUmd1jfAkh4eSD/YcE96wMpRYsQ5P9IxbcKU6oO7icgEL+ZQqqGyLtHRQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a647a3c0ea72d2a948b889b33b7b5600483a1394cf1a413515090ece1ff21df2","last_reissued_at":"2026-05-18T02:39:17.122366Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:17.122366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Weak Hamiltonicity of a Random Hypergraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Daniel Poole","submitted_at":"2014-10-27T22:28:50Z","abstract_excerpt":"A {\\it weak (Berge) cycle} is an alternating sequence of vertices and (hyper)edges $C=(v_0, e_1, v_1, ..., v_{\\ell-1}, e_\\ell, v_{\\ell}=v_0)$ such that the vertices $v_0, ..., v_{\\ell-1}$ are distinct with $v_k, v_{k+1} \\in e_{k}$ for each $k$, but the edges $e_1, ..., e_\\ell$ are not necessarily distinct. We prove that the main barrier to the random $d$-uniform hypergraph $H_d(n,p),$ where each of the potential edges of cardinality $d$ is present with probability $p$, developing a weak Hamilton cycle is the presence of isolated vertices. In particular, for $d \\geq 3$ fixed and $p=(d-1)! \\frac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7446","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":"1410.7446","created_at":"2026-05-18T02:39:17.122426+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.7446v1","created_at":"2026-05-18T02:39:17.122426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7446","created_at":"2026-05-18T02:39:17.122426+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZD2HQHKOLJK","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZD2HQHKOLJKSSFY","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZD2HQHK","created_at":"2026-05-18T12:28:52.271510+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/UZD2HQHKOLJKSSFYRGZTW62WAB","json":"https://pith.science/pith/UZD2HQHKOLJKSSFYRGZTW62WAB.json","graph_json":"https://pith.science/api/pith-number/UZD2HQHKOLJKSSFYRGZTW62WAB/graph.json","events_json":"https://pith.science/api/pith-number/UZD2HQHKOLJKSSFYRGZTW62WAB/events.json","paper":"https://pith.science/paper/UZD2HQHK"},"agent_actions":{"view_html":"https://pith.science/pith/UZD2HQHKOLJKSSFYRGZTW62WAB","download_json":"https://pith.science/pith/UZD2HQHKOLJKSSFYRGZTW62WAB.json","view_paper":"https://pith.science/paper/UZD2HQHK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.7446&json=true","fetch_graph":"https://pith.science/api/pith-number/UZD2HQHKOLJKSSFYRGZTW62WAB/graph.json","fetch_events":"https://pith.science/api/pith-number/UZD2HQHKOLJKSSFYRGZTW62WAB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZD2HQHKOLJKSSFYRGZTW62WAB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZD2HQHKOLJKSSFYRGZTW62WAB/action/storage_attestation","attest_author":"https://pith.science/pith/UZD2HQHKOLJKSSFYRGZTW62WAB/action/author_attestation","sign_citation":"https://pith.science/pith/UZD2HQHKOLJKSSFYRGZTW62WAB/action/citation_signature","submit_replication":"https://pith.science/pith/UZD2HQHKOLJKSSFYRGZTW62WAB/action/replication_record"}},"created_at":"2026-05-18T02:39:17.122426+00:00","updated_at":"2026-05-18T02:39:17.122426+00:00"}