{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:IEZKOJT4FY3PJQ445UYMGZZZX4","short_pith_number":"pith:IEZKOJT4","canonical_record":{"source":{"id":"2312.15262","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-23T13:57:17Z","cross_cats_sorted":[],"title_canon_sha256":"3b6d4dd3d469c0ed76073c20bfa3f8152ba353d8075ace38bd452e888c0c9b63","abstract_canon_sha256":"14f13a2952a896363ca54ffc0f55690bc01a54fcd31415ed161fd1b2f2fd892b"},"schema_version":"1.0"},"canonical_sha256":"4132a7267c2e36f4c39ced30c36739bf24b23b942dfda868570c29384ea39a61","source":{"kind":"arxiv","id":"2312.15262","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.15262","created_at":"2026-07-05T09:54:43Z"},{"alias_kind":"arxiv_version","alias_value":"2312.15262v2","created_at":"2026-07-05T09:54:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.15262","created_at":"2026-07-05T09:54:43Z"},{"alias_kind":"pith_short_12","alias_value":"IEZKOJT4FY3P","created_at":"2026-07-05T09:54:43Z"},{"alias_kind":"pith_short_16","alias_value":"IEZKOJT4FY3PJQ44","created_at":"2026-07-05T09:54:43Z"},{"alias_kind":"pith_short_8","alias_value":"IEZKOJT4","created_at":"2026-07-05T09:54:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:IEZKOJT4FY3PJQ445UYMGZZZX4","target":"record","payload":{"canonical_record":{"source":{"id":"2312.15262","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-23T13:57:17Z","cross_cats_sorted":[],"title_canon_sha256":"3b6d4dd3d469c0ed76073c20bfa3f8152ba353d8075ace38bd452e888c0c9b63","abstract_canon_sha256":"14f13a2952a896363ca54ffc0f55690bc01a54fcd31415ed161fd1b2f2fd892b"},"schema_version":"1.0"},"canonical_sha256":"4132a7267c2e36f4c39ced30c36739bf24b23b942dfda868570c29384ea39a61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:54:43.793016Z","signature_b64":"FIno+nhGsHs5crWk2xuVkZbE2GonWimA9PH0PLuK7wb/cLIJPbIDVEHKuUxNDR5xqnARr2Gfn5Au3CdwSdqjCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4132a7267c2e36f4c39ced30c36739bf24b23b942dfda868570c29384ea39a61","last_reissued_at":"2026-07-05T09:54:43.792636Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:54:43.792636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.15262","source_version":2,"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-07-05T09:54:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yGsbpyDaV0KQW0Y6DbpLVtViALDPbBVhdkB550qMtEj3Ycef9C4x1xD7cJijhUEZqMjLupYljuxRz1OQ+H32AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T10:11:13.118870Z"},"content_sha256":"fae67045783be2dfcae73ab8cda4bf510e7982511cef2ea1324881fe43a1000d","schema_version":"1.0","event_id":"sha256:fae67045783be2dfcae73ab8cda4bf510e7982511cef2ea1324881fe43a1000d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:IEZKOJT4FY3PJQ445UYMGZZZX4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Hamiltonicity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Joos, Nicol\\'as Sanhueza-Matamala, Richard Lang","submitted_at":"2023-12-23T13:57:17Z","abstract_excerpt":"We study conditions under which a given hypergraph is randomly robust Hamiltonian, which means that a random sparsification of the host graph contains a Hamilton cycle with high probability. Our main contribution provides nearly optimal results whenever the host graph is Hamilton connected in a locally robust sense, which translates to a typical induced subgraph of constant order containing Hamilton paths between any pair of suitable ends.\n  The proofs are based on the recent breakthrough on Talagrand's conjecture, which reduces the problem to specifying a distribution on the desired guest str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.15262","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.15262/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:54:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wv6e4AEHwRg2RIkY8lqNGQ/PqJkqRj9wLodD6HkkQyueqJ9o7VnV8GGLzGVIzxs/I/e98jN6O4hkzcYZTHb+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T10:11:13.119362Z"},"content_sha256":"0dbdec0efb827b95946318532635aa9d463bd6cc035ca29ac9cff3ecc21cd2ad","schema_version":"1.0","event_id":"sha256:0dbdec0efb827b95946318532635aa9d463bd6cc035ca29ac9cff3ecc21cd2ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IEZKOJT4FY3PJQ445UYMGZZZX4/bundle.json","state_url":"https://pith.science/pith/IEZKOJT4FY3PJQ445UYMGZZZX4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IEZKOJT4FY3PJQ445UYMGZZZX4/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-08-20T10:11:13Z","links":{"resolver":"https://pith.science/pith/IEZKOJT4FY3PJQ445UYMGZZZX4","bundle":"https://pith.science/pith/IEZKOJT4FY3PJQ445UYMGZZZX4/bundle.json","state":"https://pith.science/pith/IEZKOJT4FY3PJQ445UYMGZZZX4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IEZKOJT4FY3PJQ445UYMGZZZX4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:IEZKOJT4FY3PJQ445UYMGZZZX4","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":"14f13a2952a896363ca54ffc0f55690bc01a54fcd31415ed161fd1b2f2fd892b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-23T13:57:17Z","title_canon_sha256":"3b6d4dd3d469c0ed76073c20bfa3f8152ba353d8075ace38bd452e888c0c9b63"},"schema_version":"1.0","source":{"id":"2312.15262","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.15262","created_at":"2026-07-05T09:54:43Z"},{"alias_kind":"arxiv_version","alias_value":"2312.15262v2","created_at":"2026-07-05T09:54:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.15262","created_at":"2026-07-05T09:54:43Z"},{"alias_kind":"pith_short_12","alias_value":"IEZKOJT4FY3P","created_at":"2026-07-05T09:54:43Z"},{"alias_kind":"pith_short_16","alias_value":"IEZKOJT4FY3PJQ44","created_at":"2026-07-05T09:54:43Z"},{"alias_kind":"pith_short_8","alias_value":"IEZKOJT4","created_at":"2026-07-05T09:54:43Z"}],"graph_snapshots":[{"event_id":"sha256:0dbdec0efb827b95946318532635aa9d463bd6cc035ca29ac9cff3ecc21cd2ad","target":"graph","created_at":"2026-07-05T09:54:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.15262/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study conditions under which a given hypergraph is randomly robust Hamiltonian, which means that a random sparsification of the host graph contains a Hamilton cycle with high probability. Our main contribution provides nearly optimal results whenever the host graph is Hamilton connected in a locally robust sense, which translates to a typical induced subgraph of constant order containing Hamilton paths between any pair of suitable ends.\n  The proofs are based on the recent breakthrough on Talagrand's conjecture, which reduces the problem to specifying a distribution on the desired guest str","authors_text":"Felix Joos, Nicol\\'as Sanhueza-Matamala, Richard Lang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-23T13:57:17Z","title":"Robust Hamiltonicity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.15262","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:fae67045783be2dfcae73ab8cda4bf510e7982511cef2ea1324881fe43a1000d","target":"record","created_at":"2026-07-05T09:54:43Z","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":"14f13a2952a896363ca54ffc0f55690bc01a54fcd31415ed161fd1b2f2fd892b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-23T13:57:17Z","title_canon_sha256":"3b6d4dd3d469c0ed76073c20bfa3f8152ba353d8075ace38bd452e888c0c9b63"},"schema_version":"1.0","source":{"id":"2312.15262","kind":"arxiv","version":2}},"canonical_sha256":"4132a7267c2e36f4c39ced30c36739bf24b23b942dfda868570c29384ea39a61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4132a7267c2e36f4c39ced30c36739bf24b23b942dfda868570c29384ea39a61","first_computed_at":"2026-07-05T09:54:43.792636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:54:43.792636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FIno+nhGsHs5crWk2xuVkZbE2GonWimA9PH0PLuK7wb/cLIJPbIDVEHKuUxNDR5xqnARr2Gfn5Au3CdwSdqjCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T09:54:43.793016Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.15262","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fae67045783be2dfcae73ab8cda4bf510e7982511cef2ea1324881fe43a1000d","sha256:0dbdec0efb827b95946318532635aa9d463bd6cc035ca29ac9cff3ecc21cd2ad"],"state_sha256":"84f821d76e83a69887df0fa3b346671eb2c21bb17562a5b574b9194721159ff8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AiGQp51NgWGzvXDtYGyqo7leG+GganbMUVQa427tazSJDA0hrUVfQuHORwj5j8uBIQd7bO3ndRvGOhQlsodEDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T10:11:13.123045Z","bundle_sha256":"ef43f01be89ba4ffe02087d2cc0e5b1d3bfb00675171e96490dd996b80b23db1"}}