{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:AVC6SP4O3AUPSQHKRX3NHXMZLV","short_pith_number":"pith:AVC6SP4O","canonical_record":{"source":{"id":"1603.04462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-14T20:41:33Z","cross_cats_sorted":[],"title_canon_sha256":"cc09e626f33c44eccb59381db3344a5394ac36cff2835fbe248e59eb62db785e","abstract_canon_sha256":"d17145c8fe6cf2dddcb6e0b46b476b605d5ca7fec2d15fdeb9f18f100f224d73"},"schema_version":"1.0"},"canonical_sha256":"0545e93f8ed828f940ea8df6d3dd995d60498411d8484017aea423c57a7868fd","source":{"kind":"arxiv","id":"1603.04462","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04462","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04462v1","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04462","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"AVC6SP4O3AUP","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AVC6SP4O3AUPSQHK","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AVC6SP4O","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:AVC6SP4O3AUPSQHKRX3NHXMZLV","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-14T20:41:33Z","cross_cats_sorted":[],"title_canon_sha256":"cc09e626f33c44eccb59381db3344a5394ac36cff2835fbe248e59eb62db785e","abstract_canon_sha256":"d17145c8fe6cf2dddcb6e0b46b476b605d5ca7fec2d15fdeb9f18f100f224d73"},"schema_version":"1.0"},"canonical_sha256":"0545e93f8ed828f940ea8df6d3dd995d60498411d8484017aea423c57a7868fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:04.876893Z","signature_b64":"GRnL3UivHKqPGFEKevQ/ntnWz5p+zHujd6bZ4xXDis9SbHIqeIU9MDpfyE4wBFTNAe0sUVJi9Pjk6YCvK1c/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0545e93f8ed828f940ea8df6d3dd995d60498411d8484017aea423c57a7868fd","last_reissued_at":"2026-05-18T01:19:04.876240Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:04.876240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04462","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kWz5XeAcDCg0Gu2Cf8CjdOvaPKyJrEm4ArX3B3wkP4UQQS6JS6f66qEiAvHYhG3eunoIZj7vBlhqE8QXF5sADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T09:21:34.602456Z"},"content_sha256":"d6e899800522db4116c83660c61981eaca150f6e48e41420195197369b3aa5eb","schema_version":"1.0","event_id":"sha256:d6e899800522db4116c83660c61981eaca150f6e48e41420195197369b3aa5eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:AVC6SP4O3AUPSQHKRX3NHXMZLV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum vertex degree conditions for loose Hamilton cycles in $3$-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"E. Bu\\ss, H. H\\`an, M. Schacht","submitted_at":"2016-03-14T20:41:33Z","abstract_excerpt":"We investigate minimum vertex degree conditions for $3$-uniform hypergraphs which ensure the existence of loose Hamilton cycles. A loose Hamilton cycle is a spanning cycle in which only consecutive edges intersect and these intersections consist of precisely one vertex.\n  We prove that every $3$-uniform $n$-vertex ($n$ even) hypergraph $\\mathcal{H}$ with minimum vertex degree $\\delta_1(\\mathcal{H})\\geq \\left(\\frac7{16}+o(1)\\right)\\binom{n}{2}$ contains a loose Hamilton cycle. This bound is asymptotically best possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04462","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:19:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Ki5LpgF7qZ9dPC22W+jv6jm9FbZSYWkwXcpWu+kt9me56JWdBvyvJSg6+JtwhWLSr2lR25I+iicRaLeFnQ5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T09:21:34.603160Z"},"content_sha256":"975d6551615a1d72630d0d6d803ddfef7126578d2871cff6c54a716bcf805315","schema_version":"1.0","event_id":"sha256:975d6551615a1d72630d0d6d803ddfef7126578d2871cff6c54a716bcf805315"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AVC6SP4O3AUPSQHKRX3NHXMZLV/bundle.json","state_url":"https://pith.science/pith/AVC6SP4O3AUPSQHKRX3NHXMZLV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AVC6SP4O3AUPSQHKRX3NHXMZLV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T09:21:34Z","links":{"resolver":"https://pith.science/pith/AVC6SP4O3AUPSQHKRX3NHXMZLV","bundle":"https://pith.science/pith/AVC6SP4O3AUPSQHKRX3NHXMZLV/bundle.json","state":"https://pith.science/pith/AVC6SP4O3AUPSQHKRX3NHXMZLV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AVC6SP4O3AUPSQHKRX3NHXMZLV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:AVC6SP4O3AUPSQHKRX3NHXMZLV","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":"d17145c8fe6cf2dddcb6e0b46b476b605d5ca7fec2d15fdeb9f18f100f224d73","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-14T20:41:33Z","title_canon_sha256":"cc09e626f33c44eccb59381db3344a5394ac36cff2835fbe248e59eb62db785e"},"schema_version":"1.0","source":{"id":"1603.04462","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04462","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04462v1","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04462","created_at":"2026-05-18T01:19:04Z"},{"alias_kind":"pith_short_12","alias_value":"AVC6SP4O3AUP","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"AVC6SP4O3AUPSQHK","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"AVC6SP4O","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:975d6551615a1d72630d0d6d803ddfef7126578d2871cff6c54a716bcf805315","target":"graph","created_at":"2026-05-18T01:19:04Z","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 investigate minimum vertex degree conditions for $3$-uniform hypergraphs which ensure the existence of loose Hamilton cycles. A loose Hamilton cycle is a spanning cycle in which only consecutive edges intersect and these intersections consist of precisely one vertex.\n  We prove that every $3$-uniform $n$-vertex ($n$ even) hypergraph $\\mathcal{H}$ with minimum vertex degree $\\delta_1(\\mathcal{H})\\geq \\left(\\frac7{16}+o(1)\\right)\\binom{n}{2}$ contains a loose Hamilton cycle. This bound is asymptotically best possible.","authors_text":"E. Bu\\ss, H. H\\`an, M. Schacht","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-14T20:41:33Z","title":"Minimum vertex degree conditions for loose Hamilton cycles in $3$-uniform hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04462","kind":"arxiv","version":1},"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:d6e899800522db4116c83660c61981eaca150f6e48e41420195197369b3aa5eb","target":"record","created_at":"2026-05-18T01:19:04Z","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":"d17145c8fe6cf2dddcb6e0b46b476b605d5ca7fec2d15fdeb9f18f100f224d73","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-03-14T20:41:33Z","title_canon_sha256":"cc09e626f33c44eccb59381db3344a5394ac36cff2835fbe248e59eb62db785e"},"schema_version":"1.0","source":{"id":"1603.04462","kind":"arxiv","version":1}},"canonical_sha256":"0545e93f8ed828f940ea8df6d3dd995d60498411d8484017aea423c57a7868fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0545e93f8ed828f940ea8df6d3dd995d60498411d8484017aea423c57a7868fd","first_computed_at":"2026-05-18T01:19:04.876240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:04.876240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GRnL3UivHKqPGFEKevQ/ntnWz5p+zHujd6bZ4xXDis9SbHIqeIU9MDpfyE4wBFTNAe0sUVJi9Pjk6YCvK1c/Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:04.876893Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04462","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6e899800522db4116c83660c61981eaca150f6e48e41420195197369b3aa5eb","sha256:975d6551615a1d72630d0d6d803ddfef7126578d2871cff6c54a716bcf805315"],"state_sha256":"4e811c59afbf8b118d3d9bbaa80b0ba89295e7d8a015e8526481985db48556fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xim9EhpC/yAKsjQTce804nO2bdHeWX9G7xt5Vwkb2Ql9Mflr6dBAz1G9DqXBGki79cZFERT5areV3kHebX8jCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T09:21:34.607230Z","bundle_sha256":"45d8abbfd36e1e3ec5150f19fd498fb623cf6e746e9b5139cee154f08a57c55c"}}