{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AT4S7HTUGBTYV7246YJOBQDVY6","short_pith_number":"pith:AT4S7HTU","schema_version":"1.0","canonical_sha256":"04f92f9e7430678aff5cf612e0c075c7897aee6572d35c4f743b05711b85d717","source":{"kind":"arxiv","id":"1701.07806","version":2},"attestation_state":"computed","paper":{"title":"Almost partitioning 2-coloured complete 3-uniform hypergraphs into two monochromatic tight or loose cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hiep Han, Maya Stein, Sebastian Bustamante","submitted_at":"2017-01-26T18:32:28Z","abstract_excerpt":"We show that for every {\\eta} > 0 there exists an integer n_0 such that every 2-colouring of the 3-uniform complete hypergraph on n \\geq n_0 vertices contains two disjoint monochromatic tight cycles of distinct colours that together cover all but at most {\\eta}n vertices. The same result holds if we replace tight cycles with loose cycles."},"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":"1701.07806","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-26T18:32:28Z","cross_cats_sorted":[],"title_canon_sha256":"89e7b3760176237757505798346b193ee50a74b4d12f67c99ca863fc2d744725","abstract_canon_sha256":"ae424b050b3bea62a399371fb87a839dcb9bd5c36038bf9b6cfc4a24b5744876"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:09.645343Z","signature_b64":"sC+AT8L59/2v3Ha64ZzfwokOD5kPjsKoBmgxxINSd8NZlHftehMedxLxPJBi0L2+4CRVxOs6yT2gDsnm9nn4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04f92f9e7430678aff5cf612e0c075c7897aee6572d35c4f743b05711b85d717","last_reissued_at":"2026-05-18T00:05:09.644676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:09.644676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Almost partitioning 2-coloured complete 3-uniform hypergraphs into two monochromatic tight or loose cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hiep Han, Maya Stein, Sebastian Bustamante","submitted_at":"2017-01-26T18:32:28Z","abstract_excerpt":"We show that for every {\\eta} > 0 there exists an integer n_0 such that every 2-colouring of the 3-uniform complete hypergraph on n \\geq n_0 vertices contains two disjoint monochromatic tight cycles of distinct colours that together cover all but at most {\\eta}n vertices. The same result holds if we replace tight cycles with loose cycles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07806","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":"1701.07806","created_at":"2026-05-18T00:05:09.644766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07806v2","created_at":"2026-05-18T00:05:09.644766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07806","created_at":"2026-05-18T00:05:09.644766+00:00"},{"alias_kind":"pith_short_12","alias_value":"AT4S7HTUGBTY","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"AT4S7HTUGBTYV724","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"AT4S7HTU","created_at":"2026-05-18T12:31:08.081275+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/AT4S7HTUGBTYV7246YJOBQDVY6","json":"https://pith.science/pith/AT4S7HTUGBTYV7246YJOBQDVY6.json","graph_json":"https://pith.science/api/pith-number/AT4S7HTUGBTYV7246YJOBQDVY6/graph.json","events_json":"https://pith.science/api/pith-number/AT4S7HTUGBTYV7246YJOBQDVY6/events.json","paper":"https://pith.science/paper/AT4S7HTU"},"agent_actions":{"view_html":"https://pith.science/pith/AT4S7HTUGBTYV7246YJOBQDVY6","download_json":"https://pith.science/pith/AT4S7HTUGBTYV7246YJOBQDVY6.json","view_paper":"https://pith.science/paper/AT4S7HTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07806&json=true","fetch_graph":"https://pith.science/api/pith-number/AT4S7HTUGBTYV7246YJOBQDVY6/graph.json","fetch_events":"https://pith.science/api/pith-number/AT4S7HTUGBTYV7246YJOBQDVY6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AT4S7HTUGBTYV7246YJOBQDVY6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AT4S7HTUGBTYV7246YJOBQDVY6/action/storage_attestation","attest_author":"https://pith.science/pith/AT4S7HTUGBTYV7246YJOBQDVY6/action/author_attestation","sign_citation":"https://pith.science/pith/AT4S7HTUGBTYV7246YJOBQDVY6/action/citation_signature","submit_replication":"https://pith.science/pith/AT4S7HTUGBTYV7246YJOBQDVY6/action/replication_record"}},"created_at":"2026-05-18T00:05:09.644766+00:00","updated_at":"2026-05-18T00:05:09.644766+00:00"}