{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PZWDW6DA5EG2KF3LMUF53WKIF3","short_pith_number":"pith:PZWDW6DA","schema_version":"1.0","canonical_sha256":"7e6c3b7860e90da5176b650bddd9482ece0c2385e58252d635596eeec70e2b06","source":{"kind":"arxiv","id":"1403.2894","version":1},"attestation_state":"computed","paper":{"title":"Monochromatic Hamiltonian Berge-cycles in colored hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"G.R. Omidi, L. Maherani","submitted_at":"2014-03-12T11:47:31Z","abstract_excerpt":"It has been conjectured that for any fixed r and sufficiently large n, there is a monochromatic Hamiltonian Berge-cycle in every (r - 1)-coloring of the edges of the complete r-uniform hypergraph on n vertices. In this paper, we show that the statement of this conjecture is true with r-2 colors (instead of r-1 colors) by showing that there is a monochromatic Hamiltonian t-tight Berge-cycle in every b r-2 / t-1 -edge coloring of Kr n for any fixed r > t >= 2 and sufficiently large n. Also, we give a proof for this conjecture when r = 4 (the first open case). These results improve the previously"},"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":"1403.2894","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-12T11:47:31Z","cross_cats_sorted":[],"title_canon_sha256":"c41e5af77b8fd5ef067e98e234426bae6cfee435af03aaf932194322ba963f85","abstract_canon_sha256":"02b5d0ec6199e14b839808f74c5b920f3f54cb72d9e186057cd80091117a4d69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:33.658993Z","signature_b64":"ZuRIT9UumTv26NYkulUoDXsm7d9OeeEHhspePpXh0qqmGtiP4Hdi77bgmWXixAFZJESqYu4GDeVtkKh4jMNFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e6c3b7860e90da5176b650bddd9482ece0c2385e58252d635596eeec70e2b06","last_reissued_at":"2026-05-18T02:56:33.658189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:33.658189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monochromatic Hamiltonian Berge-cycles in colored hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"G.R. Omidi, L. Maherani","submitted_at":"2014-03-12T11:47:31Z","abstract_excerpt":"It has been conjectured that for any fixed r and sufficiently large n, there is a monochromatic Hamiltonian Berge-cycle in every (r - 1)-coloring of the edges of the complete r-uniform hypergraph on n vertices. In this paper, we show that the statement of this conjecture is true with r-2 colors (instead of r-1 colors) by showing that there is a monochromatic Hamiltonian t-tight Berge-cycle in every b r-2 / t-1 -edge coloring of Kr n for any fixed r > t >= 2 and sufficiently large n. Also, we give a proof for this conjecture when r = 4 (the first open case). These results improve the previously"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.2894","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":"1403.2894","created_at":"2026-05-18T02:56:33.658337+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.2894v1","created_at":"2026-05-18T02:56:33.658337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.2894","created_at":"2026-05-18T02:56:33.658337+00:00"},{"alias_kind":"pith_short_12","alias_value":"PZWDW6DA5EG2","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PZWDW6DA5EG2KF3L","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PZWDW6DA","created_at":"2026-05-18T12:28:43.426989+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/PZWDW6DA5EG2KF3LMUF53WKIF3","json":"https://pith.science/pith/PZWDW6DA5EG2KF3LMUF53WKIF3.json","graph_json":"https://pith.science/api/pith-number/PZWDW6DA5EG2KF3LMUF53WKIF3/graph.json","events_json":"https://pith.science/api/pith-number/PZWDW6DA5EG2KF3LMUF53WKIF3/events.json","paper":"https://pith.science/paper/PZWDW6DA"},"agent_actions":{"view_html":"https://pith.science/pith/PZWDW6DA5EG2KF3LMUF53WKIF3","download_json":"https://pith.science/pith/PZWDW6DA5EG2KF3LMUF53WKIF3.json","view_paper":"https://pith.science/paper/PZWDW6DA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.2894&json=true","fetch_graph":"https://pith.science/api/pith-number/PZWDW6DA5EG2KF3LMUF53WKIF3/graph.json","fetch_events":"https://pith.science/api/pith-number/PZWDW6DA5EG2KF3LMUF53WKIF3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PZWDW6DA5EG2KF3LMUF53WKIF3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PZWDW6DA5EG2KF3LMUF53WKIF3/action/storage_attestation","attest_author":"https://pith.science/pith/PZWDW6DA5EG2KF3LMUF53WKIF3/action/author_attestation","sign_citation":"https://pith.science/pith/PZWDW6DA5EG2KF3LMUF53WKIF3/action/citation_signature","submit_replication":"https://pith.science/pith/PZWDW6DA5EG2KF3LMUF53WKIF3/action/replication_record"}},"created_at":"2026-05-18T02:56:33.658337+00:00","updated_at":"2026-05-18T02:56:33.658337+00:00"}