{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LIEHFRTYGDZPCXNN6MSED6EDXN","short_pith_number":"pith:LIEHFRTY","schema_version":"1.0","canonical_sha256":"5a0872c67830f2f15dadf32441f883bb62c754dfe418002ac20bfb7ab432d0dc","source":{"kind":"arxiv","id":"1308.0721","version":1},"attestation_state":"computed","paper":{"title":"Tight co-degree condition for the existence of loose Hamilton cycles in 3-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Czygrinow, Theodore Molla","submitted_at":"2013-08-03T16:54:22Z","abstract_excerpt":"In 2006, K\\\"{u}hn and Osthus showed that if a 3-graph H on n vertices has minimum co-degree at least (1/4 +o(1))n and n is even then H has a loose Hamilton cycle. In this paper, we prove that the minimum co-degree of n/4 suffices. The result is tight."},"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":"1308.0721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-03T16:54:22Z","cross_cats_sorted":[],"title_canon_sha256":"aa8cee0aac6d15ec72ba42e26a48a7aeff662d081d11fdcab9daccb8ca55f551","abstract_canon_sha256":"8187fb69eef5d77db977cf15989d43493806b4334568dbc7c6f595567bb1413f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:48.399488Z","signature_b64":"XCCTLO0TFUAn/rR4zi0kijIV/75Z3wUiL4sUhjGHMRIbmNQtilQ5XCvHYEJMdz1PUbK1o6XTuLR+xBqT+4huDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a0872c67830f2f15dadf32441f883bb62c754dfe418002ac20bfb7ab432d0dc","last_reissued_at":"2026-05-18T03:16:48.398822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:48.398822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight co-degree condition for the existence of loose Hamilton cycles in 3-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Czygrinow, Theodore Molla","submitted_at":"2013-08-03T16:54:22Z","abstract_excerpt":"In 2006, K\\\"{u}hn and Osthus showed that if a 3-graph H on n vertices has minimum co-degree at least (1/4 +o(1))n and n is even then H has a loose Hamilton cycle. In this paper, we prove that the minimum co-degree of n/4 suffices. The result is tight."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0721","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":"1308.0721","created_at":"2026-05-18T03:16:48.398918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0721v1","created_at":"2026-05-18T03:16:48.398918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0721","created_at":"2026-05-18T03:16:48.398918+00:00"},{"alias_kind":"pith_short_12","alias_value":"LIEHFRTYGDZP","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LIEHFRTYGDZPCXNN","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LIEHFRTY","created_at":"2026-05-18T12:27:51.066281+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/LIEHFRTYGDZPCXNN6MSED6EDXN","json":"https://pith.science/pith/LIEHFRTYGDZPCXNN6MSED6EDXN.json","graph_json":"https://pith.science/api/pith-number/LIEHFRTYGDZPCXNN6MSED6EDXN/graph.json","events_json":"https://pith.science/api/pith-number/LIEHFRTYGDZPCXNN6MSED6EDXN/events.json","paper":"https://pith.science/paper/LIEHFRTY"},"agent_actions":{"view_html":"https://pith.science/pith/LIEHFRTYGDZPCXNN6MSED6EDXN","download_json":"https://pith.science/pith/LIEHFRTYGDZPCXNN6MSED6EDXN.json","view_paper":"https://pith.science/paper/LIEHFRTY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0721&json=true","fetch_graph":"https://pith.science/api/pith-number/LIEHFRTYGDZPCXNN6MSED6EDXN/graph.json","fetch_events":"https://pith.science/api/pith-number/LIEHFRTYGDZPCXNN6MSED6EDXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LIEHFRTYGDZPCXNN6MSED6EDXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LIEHFRTYGDZPCXNN6MSED6EDXN/action/storage_attestation","attest_author":"https://pith.science/pith/LIEHFRTYGDZPCXNN6MSED6EDXN/action/author_attestation","sign_citation":"https://pith.science/pith/LIEHFRTYGDZPCXNN6MSED6EDXN/action/citation_signature","submit_replication":"https://pith.science/pith/LIEHFRTYGDZPCXNN6MSED6EDXN/action/replication_record"}},"created_at":"2026-05-18T03:16:48.398918+00:00","updated_at":"2026-05-18T03:16:48.398918+00:00"}