{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IKFIJFHSHBQTCF7ZBH72U7ANL2","short_pith_number":"pith:IKFIJFHS","schema_version":"1.0","canonical_sha256":"428a8494f238613117f909ffaa7c0d5eaa34b5a13218147c5e2fc4baa8881021","source":{"kind":"arxiv","id":"1605.00773","version":2},"attestation_state":"computed","paper":{"title":"On the Hamiltonicity of triple systems with high minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Ruci\\'nski, Endre Szemer\\'edi, Mathias Schacht, Vojt\\v{e}ch R\\\"odl","submitted_at":"2016-05-03T07:50:28Z","abstract_excerpt":"We show that every 3-uniform hypergraph with minimum vertex degree at least $0.8\\binom{n-1}{2}$ contains a tight Hamiltonian cycle."},"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":"1605.00773","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-03T07:50:28Z","cross_cats_sorted":[],"title_canon_sha256":"a3b8c05dac1701ebe05ef7e2a7b1f58c31b42908cefcfe7615d67e46197ea966","abstract_canon_sha256":"5f6c6f6d1cad5ffb0581ed48191e9901ff9f3b689146c3c03acb13c03cf8793f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:40.551354Z","signature_b64":"T7Q1Oe93kwqOe7m769kE78GgSYDJTEzqtIDC5bYOTB6itgy/72vHyvVDXtsIryUkCJmKbeNSXdGA5L3K2AFiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"428a8494f238613117f909ffaa7c0d5eaa34b5a13218147c5e2fc4baa8881021","last_reissued_at":"2026-05-18T00:39:40.550718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:40.550718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Hamiltonicity of triple systems with high minimum degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrzej Ruci\\'nski, Endre Szemer\\'edi, Mathias Schacht, Vojt\\v{e}ch R\\\"odl","submitted_at":"2016-05-03T07:50:28Z","abstract_excerpt":"We show that every 3-uniform hypergraph with minimum vertex degree at least $0.8\\binom{n-1}{2}$ contains a tight Hamiltonian cycle."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00773","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":"1605.00773","created_at":"2026-05-18T00:39:40.550806+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.00773v2","created_at":"2026-05-18T00:39:40.550806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00773","created_at":"2026-05-18T00:39:40.550806+00:00"},{"alias_kind":"pith_short_12","alias_value":"IKFIJFHSHBQT","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IKFIJFHSHBQTCF7Z","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IKFIJFHS","created_at":"2026-05-18T12:30:22.444734+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/IKFIJFHSHBQTCF7ZBH72U7ANL2","json":"https://pith.science/pith/IKFIJFHSHBQTCF7ZBH72U7ANL2.json","graph_json":"https://pith.science/api/pith-number/IKFIJFHSHBQTCF7ZBH72U7ANL2/graph.json","events_json":"https://pith.science/api/pith-number/IKFIJFHSHBQTCF7ZBH72U7ANL2/events.json","paper":"https://pith.science/paper/IKFIJFHS"},"agent_actions":{"view_html":"https://pith.science/pith/IKFIJFHSHBQTCF7ZBH72U7ANL2","download_json":"https://pith.science/pith/IKFIJFHSHBQTCF7ZBH72U7ANL2.json","view_paper":"https://pith.science/paper/IKFIJFHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.00773&json=true","fetch_graph":"https://pith.science/api/pith-number/IKFIJFHSHBQTCF7ZBH72U7ANL2/graph.json","fetch_events":"https://pith.science/api/pith-number/IKFIJFHSHBQTCF7ZBH72U7ANL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IKFIJFHSHBQTCF7ZBH72U7ANL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IKFIJFHSHBQTCF7ZBH72U7ANL2/action/storage_attestation","attest_author":"https://pith.science/pith/IKFIJFHSHBQTCF7ZBH72U7ANL2/action/author_attestation","sign_citation":"https://pith.science/pith/IKFIJFHSHBQTCF7ZBH72U7ANL2/action/citation_signature","submit_replication":"https://pith.science/pith/IKFIJFHSHBQTCF7ZBH72U7ANL2/action/replication_record"}},"created_at":"2026-05-18T00:39:40.550806+00:00","updated_at":"2026-05-18T00:39:40.550806+00:00"}