{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MRSKCKD4VXDDSFEYD34XW3TLEA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"39b9867e925caedece22fc2bad994bb5ab1e382ff3756348fcc614d307664db6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-09T22:35:51Z","title_canon_sha256":"cb18dc9be9c4f75c5062e3b802a954b462ae215a41c7c4985aaa7486b7c480fd"},"schema_version":"1.0","source":{"id":"1611.03118","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03118","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03118v2","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03118","created_at":"2026-05-17T23:43:33Z"},{"alias_kind":"pith_short_12","alias_value":"MRSKCKD4VXDD","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MRSKCKD4VXDDSFEY","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MRSKCKD4","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:163165d14fefee4e14a670157de56c30fdae0275d0b341be76a7cd0c0bd0fa92","target":"graph","created_at":"2026-05-17T23:43:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We show that every 3-uniform hypergraph with $n$ vertices and minimum vertex degree at least $(5/9+o(1))\\binom{n}2$ contains a tight Hamiltonian cycle. Known lower bound constructions show that this degree condition is asymptotically optimal.","authors_text":"Andrzej Ruci\\'nski, Christian Reiher, Endre Szemer\\'edi, Mathias Schacht, Vojt\\v{e}ch R\\\"odl","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-09T22:35:51Z","title":"Minimum vertex degree condition for tight Hamiltonian cycles in 3-uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03118","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:afbfda9b2765f5d427e2aba7bad4c92123986515acc0dac210643ac75149771c","target":"record","created_at":"2026-05-17T23:43:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"39b9867e925caedece22fc2bad994bb5ab1e382ff3756348fcc614d307664db6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-09T22:35:51Z","title_canon_sha256":"cb18dc9be9c4f75c5062e3b802a954b462ae215a41c7c4985aaa7486b7c480fd"},"schema_version":"1.0","source":{"id":"1611.03118","kind":"arxiv","version":2}},"canonical_sha256":"6464a1287cadc63914981ef97b6e6b2002e89570dc9f5be1b31aea5d89ce65fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6464a1287cadc63914981ef97b6e6b2002e89570dc9f5be1b31aea5d89ce65fb","first_computed_at":"2026-05-17T23:43:33.583076Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:33.583076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sq9SgPp4bgCXP+VV5BVPYSFNhWF6nHYj2CkSKQ8buQoPUwJp6OBHFKo7y1r/THDFkmPwu5la0akrbLcnW55fDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:33.583589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03118","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:afbfda9b2765f5d427e2aba7bad4c92123986515acc0dac210643ac75149771c","sha256:163165d14fefee4e14a670157de56c30fdae0275d0b341be76a7cd0c0bd0fa92"],"state_sha256":"95afcaacea3355193b1029e3e0d2adf349952e0d9d23da896fbde7ebd4fe7160"}