{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MPRF4JC7KQJZWRU6OUXU7ML335","short_pith_number":"pith:MPRF4JC7","schema_version":"1.0","canonical_sha256":"63e25e245f54139b469e752f4fb17bdf70b37119a8d9cbe26aa5cb21196f80d8","source":{"kind":"arxiv","id":"1608.01278","version":1},"attestation_state":"computed","paper":{"title":"Packing Loose Hamilton Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Daniel Montealegre, Kyle Luh, Oanh Nguyen","submitted_at":"2016-08-03T18:26:34Z","abstract_excerpt":"A subset $C$ of edges in a $k$-uniform hypergraph $H$ is a \\emph{loose Hamilton cycle} if $C$ covers all the vertices of $H$ and there exists a cyclic ordering of these vertices such that the edges in $C$ are segments of that order and such that every two consecutive edges share exactly one vertex. The binomial random $k$-uniform hypergraph $H^k_{n,p}$ has vertex set $[n]$ and an edge set $E$ obtained by adding each $k$-tuple $e\\in \\binom{[n]}{k}$ to $E$ with probability $p$, independently at random.\n  Here we consider the problem of finding edge-disjoint loose Hamilton cycles covering all but"},"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":"1608.01278","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-03T18:26:34Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"cfe37cbc3ea213b6bc950e91be1cf466909697274d509b0e503a8f0976710386","abstract_canon_sha256":"c11a7f1fb9dfd8a885cd49da44513f6c65d65d02e51952adda1dc82d53e5e01f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:55.989802Z","signature_b64":"sSwuvfxAJ6lg/I+rLWkZ7D3GwpG+BCEolxh31pjWHzmQQUNpWGrsnPMLJFnidJhYx8H+zS1EORPzaCsHiFAPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63e25e245f54139b469e752f4fb17bdf70b37119a8d9cbe26aa5cb21196f80d8","last_reissued_at":"2026-05-18T01:09:55.989175Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:55.989175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing Loose Hamilton Cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Daniel Montealegre, Kyle Luh, Oanh Nguyen","submitted_at":"2016-08-03T18:26:34Z","abstract_excerpt":"A subset $C$ of edges in a $k$-uniform hypergraph $H$ is a \\emph{loose Hamilton cycle} if $C$ covers all the vertices of $H$ and there exists a cyclic ordering of these vertices such that the edges in $C$ are segments of that order and such that every two consecutive edges share exactly one vertex. The binomial random $k$-uniform hypergraph $H^k_{n,p}$ has vertex set $[n]$ and an edge set $E$ obtained by adding each $k$-tuple $e\\in \\binom{[n]}{k}$ to $E$ with probability $p$, independently at random.\n  Here we consider the problem of finding edge-disjoint loose Hamilton cycles covering all but"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01278","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":"1608.01278","created_at":"2026-05-18T01:09:55.989283+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.01278v1","created_at":"2026-05-18T01:09:55.989283+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01278","created_at":"2026-05-18T01:09:55.989283+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPRF4JC7KQJZ","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPRF4JC7KQJZWRU6","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPRF4JC7","created_at":"2026-05-18T12:30:32.724797+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/MPRF4JC7KQJZWRU6OUXU7ML335","json":"https://pith.science/pith/MPRF4JC7KQJZWRU6OUXU7ML335.json","graph_json":"https://pith.science/api/pith-number/MPRF4JC7KQJZWRU6OUXU7ML335/graph.json","events_json":"https://pith.science/api/pith-number/MPRF4JC7KQJZWRU6OUXU7ML335/events.json","paper":"https://pith.science/paper/MPRF4JC7"},"agent_actions":{"view_html":"https://pith.science/pith/MPRF4JC7KQJZWRU6OUXU7ML335","download_json":"https://pith.science/pith/MPRF4JC7KQJZWRU6OUXU7ML335.json","view_paper":"https://pith.science/paper/MPRF4JC7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.01278&json=true","fetch_graph":"https://pith.science/api/pith-number/MPRF4JC7KQJZWRU6OUXU7ML335/graph.json","fetch_events":"https://pith.science/api/pith-number/MPRF4JC7KQJZWRU6OUXU7ML335/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPRF4JC7KQJZWRU6OUXU7ML335/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPRF4JC7KQJZWRU6OUXU7ML335/action/storage_attestation","attest_author":"https://pith.science/pith/MPRF4JC7KQJZWRU6OUXU7ML335/action/author_attestation","sign_citation":"https://pith.science/pith/MPRF4JC7KQJZWRU6OUXU7ML335/action/citation_signature","submit_replication":"https://pith.science/pith/MPRF4JC7KQJZWRU6OUXU7ML335/action/replication_record"}},"created_at":"2026-05-18T01:09:55.989283+00:00","updated_at":"2026-05-18T01:09:55.989283+00:00"}