{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AIWXFYOAPVZJ4BTLEVBIIUQ26S","short_pith_number":"pith:AIWXFYOA","canonical_record":{"source":{"id":"1906.05142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T13:58:57Z","cross_cats_sorted":[],"title_canon_sha256":"1a4ec94d8948e3635beacb9acac7447cb91988eed94d5bebeb0fac9a0369fd84","abstract_canon_sha256":"e82e208858886ae2beeef7a79f7f59fddb3732ebf45790907b3504ceb9eac127"},"schema_version":"1.0"},"canonical_sha256":"022d72e1c07d729e066b254284521af4a9dc663d8beacb941c3d4ccb6b8f453c","source":{"kind":"arxiv","id":"1906.05142","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05142","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05142v1","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05142","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"pith_short_12","alias_value":"AIWXFYOAPVZJ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AIWXFYOAPVZJ4BTL","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AIWXFYOA","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AIWXFYOAPVZJ4BTLEVBIIUQ26S","target":"record","payload":{"canonical_record":{"source":{"id":"1906.05142","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T13:58:57Z","cross_cats_sorted":[],"title_canon_sha256":"1a4ec94d8948e3635beacb9acac7447cb91988eed94d5bebeb0fac9a0369fd84","abstract_canon_sha256":"e82e208858886ae2beeef7a79f7f59fddb3732ebf45790907b3504ceb9eac127"},"schema_version":"1.0"},"canonical_sha256":"022d72e1c07d729e066b254284521af4a9dc663d8beacb941c3d4ccb6b8f453c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:29.353691Z","signature_b64":"lWkfkgHN6RjzLtBMvzyqm6XJ/GJ1AuGirJwiIF5eJldENzccS8fFftH5WQBJASkBVMP4oXW8XyZaFGcdGxiuAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"022d72e1c07d729e066b254284521af4a9dc663d8beacb941c3d4ccb6b8f453c","last_reissued_at":"2026-05-17T23:43:29.353035Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:29.353035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.05142","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-17T23:43:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t8J5uwunGQJal5MHjfWbqOI6WAwsd9+52VM8On9+NCCTvW9BtXCcuzn9oKwQQRd6uoxROGs68gBNc3E3XFpKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:41:01.928760Z"},"content_sha256":"b17dbe9df7daf572d5cc2e9d265c07367862f7f4ff70c6a42f611a4087b74fcc","schema_version":"1.0","event_id":"sha256:b17dbe9df7daf572d5cc2e9d265c07367862f7f4ff70c6a42f611a4087b74fcc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AIWXFYOAPVZJ4BTLEVBIIUQ26S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bhargav Narayanan, Mathias Schacht","submitted_at":"2019-06-12T13:58:57Z","abstract_excerpt":"For positive integers $r > \\ell$, an $r$-uniform hypergraph is called an $\\ell$-cycle if there exists a cyclic ordering of its vertices such that each of its edges consists of $r$ consecutive vertices, and such that every pair of consecutive edges (in the natural ordering of the edges) intersect in precisely $\\ell$ vertices. Such cycles are said to be linear when $\\ell = 1$, and nonlinear when $\\ell > 1$. We determine the sharp threshold for nonlinear Hamiltonian cycles and show that for all $r > \\ell > 1$, the threshold $p^*_{r, \\ell} (n)$ for the appearance of a Hamiltonian $\\ell$-cycle in t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05142","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-17T23:43:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xEgcFmVo6Q2HyqRlFdikTTGk989VeW9/wzKm83Rj99EiHZwxxBdPyeWolSsHZ6FoCowbtHlee8Juu5royW7nDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:41:01.929127Z"},"content_sha256":"2ce8bb5378119f06330d8057c1618e299e384b16efa7ea26897313aefab578d6","schema_version":"1.0","event_id":"sha256:2ce8bb5378119f06330d8057c1618e299e384b16efa7ea26897313aefab578d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIWXFYOAPVZJ4BTLEVBIIUQ26S/bundle.json","state_url":"https://pith.science/pith/AIWXFYOAPVZJ4BTLEVBIIUQ26S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIWXFYOAPVZJ4BTLEVBIIUQ26S/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-05-27T10:41:01Z","links":{"resolver":"https://pith.science/pith/AIWXFYOAPVZJ4BTLEVBIIUQ26S","bundle":"https://pith.science/pith/AIWXFYOAPVZJ4BTLEVBIIUQ26S/bundle.json","state":"https://pith.science/pith/AIWXFYOAPVZJ4BTLEVBIIUQ26S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIWXFYOAPVZJ4BTLEVBIIUQ26S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AIWXFYOAPVZJ4BTLEVBIIUQ26S","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":"e82e208858886ae2beeef7a79f7f59fddb3732ebf45790907b3504ceb9eac127","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T13:58:57Z","title_canon_sha256":"1a4ec94d8948e3635beacb9acac7447cb91988eed94d5bebeb0fac9a0369fd84"},"schema_version":"1.0","source":{"id":"1906.05142","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05142","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05142v1","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05142","created_at":"2026-05-17T23:43:29Z"},{"alias_kind":"pith_short_12","alias_value":"AIWXFYOAPVZJ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AIWXFYOAPVZJ4BTL","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AIWXFYOA","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:2ce8bb5378119f06330d8057c1618e299e384b16efa7ea26897313aefab578d6","target":"graph","created_at":"2026-05-17T23:43:29Z","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":"For positive integers $r > \\ell$, an $r$-uniform hypergraph is called an $\\ell$-cycle if there exists a cyclic ordering of its vertices such that each of its edges consists of $r$ consecutive vertices, and such that every pair of consecutive edges (in the natural ordering of the edges) intersect in precisely $\\ell$ vertices. Such cycles are said to be linear when $\\ell = 1$, and nonlinear when $\\ell > 1$. We determine the sharp threshold for nonlinear Hamiltonian cycles and show that for all $r > \\ell > 1$, the threshold $p^*_{r, \\ell} (n)$ for the appearance of a Hamiltonian $\\ell$-cycle in t","authors_text":"Bhargav Narayanan, Mathias Schacht","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T13:58:57Z","title":"Sharp thresholds for nonlinear Hamiltonian cycles in hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05142","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:b17dbe9df7daf572d5cc2e9d265c07367862f7f4ff70c6a42f611a4087b74fcc","target":"record","created_at":"2026-05-17T23:43:29Z","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":"e82e208858886ae2beeef7a79f7f59fddb3732ebf45790907b3504ceb9eac127","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T13:58:57Z","title_canon_sha256":"1a4ec94d8948e3635beacb9acac7447cb91988eed94d5bebeb0fac9a0369fd84"},"schema_version":"1.0","source":{"id":"1906.05142","kind":"arxiv","version":1}},"canonical_sha256":"022d72e1c07d729e066b254284521af4a9dc663d8beacb941c3d4ccb6b8f453c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"022d72e1c07d729e066b254284521af4a9dc663d8beacb941c3d4ccb6b8f453c","first_computed_at":"2026-05-17T23:43:29.353035Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:29.353035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lWkfkgHN6RjzLtBMvzyqm6XJ/GJ1AuGirJwiIF5eJldENzccS8fFftH5WQBJASkBVMP4oXW8XyZaFGcdGxiuAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:29.353691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.05142","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b17dbe9df7daf572d5cc2e9d265c07367862f7f4ff70c6a42f611a4087b74fcc","sha256:2ce8bb5378119f06330d8057c1618e299e384b16efa7ea26897313aefab578d6"],"state_sha256":"b1204e579a3bd272491340195bdbfe33ebeeab50ca5d9e5f942894254488fbc2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"649BUJ+FVPpYZZkcKZpmKoOm9M/sb++qaqtEvlRFCicNfvnguquU/pM9SQNdj67+psY3tpo3eb7oxsPa47FEDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:41:01.931726Z","bundle_sha256":"46900cb41e6826b0797cb82bf631e7ed33730ed0a12b7c35623af89c268e666c"}}