{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TLPAUGWET7BDEFSYT3OXATV6R6","short_pith_number":"pith:TLPAUGWE","schema_version":"1.0","canonical_sha256":"9ade0a1ac49fc23216589edd704ebe8fa97b1eb618f2049b9aa6a1d448d3639d","source":{"kind":"arxiv","id":"1708.08975","version":2},"attestation_state":"computed","paper":{"title":"On Rainbow Hamilton Cycles in Random Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Andrzej Dudek, Sean English","submitted_at":"2017-08-29T18:58:33Z","abstract_excerpt":"Let $H_{n,p,r}^{(k)}$ denote a randomly colored random hypergraph, constructed on the vertex set $[n]$ by taking each $k$-tuple independently with probability $p$, and then independently coloring it with a random color from the set $[r]$. Let $H$ be a $k$-uniform hypergraph of order $n$. An $\\ell$-Hamilton cycle is a spanning subhypergraph $C$ of $H$ with $n/(k-\\ell)$ edges and such that for some cyclic ordering of the vertices each edge of $C$ consists of $k$ consecutive vertices and every pair of adjacent edges in $C$ intersects in precisely $\\ell$ vertices.\n  In this note we study the exist"},"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":"1708.08975","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-29T18:58:33Z","cross_cats_sorted":[],"title_canon_sha256":"b2eee4bc3d1cae93d795b9b9afba37a63da950b5bc91b2c53c76b41cf1ccbd6d","abstract_canon_sha256":"cab3c4029506d32d34ab0b054d827d4b8c29a4f3dd2feac4531a230b4adb2500"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:37.718689Z","signature_b64":"BUyQzPYWlUmlFKFAK8c00U1UMejv69YbVWpC6hCosXJSehIqPS5VM8pLG6aiG2ZYfkzi5jaL1+iirzkdH89MAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ade0a1ac49fc23216589edd704ebe8fa97b1eb618f2049b9aa6a1d448d3639d","last_reissued_at":"2026-05-18T00:13:37.718085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:37.718085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Rainbow Hamilton Cycles in Random Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Andrzej Dudek, Sean English","submitted_at":"2017-08-29T18:58:33Z","abstract_excerpt":"Let $H_{n,p,r}^{(k)}$ denote a randomly colored random hypergraph, constructed on the vertex set $[n]$ by taking each $k$-tuple independently with probability $p$, and then independently coloring it with a random color from the set $[r]$. Let $H$ be a $k$-uniform hypergraph of order $n$. An $\\ell$-Hamilton cycle is a spanning subhypergraph $C$ of $H$ with $n/(k-\\ell)$ edges and such that for some cyclic ordering of the vertices each edge of $C$ consists of $k$ consecutive vertices and every pair of adjacent edges in $C$ intersects in precisely $\\ell$ vertices.\n  In this note we study the exist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08975","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.08975","created_at":"2026-05-18T00:13:37.718149+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.08975v2","created_at":"2026-05-18T00:13:37.718149+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08975","created_at":"2026-05-18T00:13:37.718149+00:00"},{"alias_kind":"pith_short_12","alias_value":"TLPAUGWET7BD","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TLPAUGWET7BDEFSY","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TLPAUGWE","created_at":"2026-05-18T12:31:46.661854+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/TLPAUGWET7BDEFSYT3OXATV6R6","json":"https://pith.science/pith/TLPAUGWET7BDEFSYT3OXATV6R6.json","graph_json":"https://pith.science/api/pith-number/TLPAUGWET7BDEFSYT3OXATV6R6/graph.json","events_json":"https://pith.science/api/pith-number/TLPAUGWET7BDEFSYT3OXATV6R6/events.json","paper":"https://pith.science/paper/TLPAUGWE"},"agent_actions":{"view_html":"https://pith.science/pith/TLPAUGWET7BDEFSYT3OXATV6R6","download_json":"https://pith.science/pith/TLPAUGWET7BDEFSYT3OXATV6R6.json","view_paper":"https://pith.science/paper/TLPAUGWE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.08975&json=true","fetch_graph":"https://pith.science/api/pith-number/TLPAUGWET7BDEFSYT3OXATV6R6/graph.json","fetch_events":"https://pith.science/api/pith-number/TLPAUGWET7BDEFSYT3OXATV6R6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TLPAUGWET7BDEFSYT3OXATV6R6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TLPAUGWET7BDEFSYT3OXATV6R6/action/storage_attestation","attest_author":"https://pith.science/pith/TLPAUGWET7BDEFSYT3OXATV6R6/action/author_attestation","sign_citation":"https://pith.science/pith/TLPAUGWET7BDEFSYT3OXATV6R6/action/citation_signature","submit_replication":"https://pith.science/pith/TLPAUGWET7BDEFSYT3OXATV6R6/action/replication_record"}},"created_at":"2026-05-18T00:13:37.718149+00:00","updated_at":"2026-05-18T00:13:37.718149+00:00"}