{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:XFQHBM2H3FLEYVR32LRGDPJUEB","short_pith_number":"pith:XFQHBM2H","canonical_record":{"source":{"id":"2507.22807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-30T16:19:49Z","cross_cats_sorted":[],"title_canon_sha256":"1d548eb138e17895677e5b6836ac10cfc1888aab31c8f4871d58387112b98089","abstract_canon_sha256":"606865478311cedc9471188d7bfb769f6719e89c94c755380bb500fa9ce7c1b8"},"schema_version":"1.0"},"canonical_sha256":"b96070b347d9564c563bd2e261bd342049895c9868e72fed57c0c2aad17e71d5","source":{"kind":"arxiv","id":"2507.22807","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.22807","created_at":"2026-07-05T11:45:49Z"},{"alias_kind":"arxiv_version","alias_value":"2507.22807v1","created_at":"2026-07-05T11:45:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.22807","created_at":"2026-07-05T11:45:49Z"},{"alias_kind":"pith_short_12","alias_value":"XFQHBM2H3FLE","created_at":"2026-07-05T11:45:49Z"},{"alias_kind":"pith_short_16","alias_value":"XFQHBM2H3FLEYVR3","created_at":"2026-07-05T11:45:49Z"},{"alias_kind":"pith_short_8","alias_value":"XFQHBM2H","created_at":"2026-07-05T11:45:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:XFQHBM2H3FLEYVR32LRGDPJUEB","target":"record","payload":{"canonical_record":{"source":{"id":"2507.22807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-30T16:19:49Z","cross_cats_sorted":[],"title_canon_sha256":"1d548eb138e17895677e5b6836ac10cfc1888aab31c8f4871d58387112b98089","abstract_canon_sha256":"606865478311cedc9471188d7bfb769f6719e89c94c755380bb500fa9ce7c1b8"},"schema_version":"1.0"},"canonical_sha256":"b96070b347d9564c563bd2e261bd342049895c9868e72fed57c0c2aad17e71d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:45:49.465302Z","signature_b64":"IDQdH2fBirZRJRsLRIatG2/ZmBwYIl8hEkAftK+Y1aMHRaXccjFwuEmb4X8mEcixbzUCGvWEUneJ7Z58eSIZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b96070b347d9564c563bd2e261bd342049895c9868e72fed57c0c2aad17e71d5","last_reissued_at":"2026-07-05T11:45:49.464782Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:45:49.464782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.22807","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-07-05T11:45:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TdDFn3WqABJ4qXZo/k6IhCQdxd9Mo/DfV+vy7wn2Awsl2NbYvvVCfO7+iAGBWEiDxjnhPxyi+i88U4I0qhaGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:40:11.563139Z"},"content_sha256":"c619fd8e1f0df66c1c6e63c0bb9e25f9bdbd4eccefd2dcacc71f19549ac4141b","schema_version":"1.0","event_id":"sha256:c619fd8e1f0df66c1c6e63c0bb9e25f9bdbd4eccefd2dcacc71f19549ac4141b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:XFQHBM2H3FLEYVR32LRGDPJUEB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, David Munh\\'a Correia, Hyunwoo Lee, Jaehoon Kim, Mat\\'ias Pavez-Sign\\'e, Nemanja Dragani\\'c","submitted_at":"2025-07-30T16:19:49Z","abstract_excerpt":"Dirac's classical theorem asserts that, for $n \\ge 3$, any $n$-vertex graph with minimum degree at least $n/2$ is Hamiltonian. Furthermore, if we additionally assume that such graphs are regular, then, by the breakthrough work of Csaba, K\\\"uhn, Lo, Osthus and Treglown, they admit a decomposition into Hamilton cycles and at most one perfect matching, solving the well-known Nash-Williams conjecture. In the pseudorandom setting, it has long been conjectured that similar results hold in much sparser graphs. We prove two overarching theorems for graphs that exclude excessively dense subgraphs, whic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.22807","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.22807/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-05T11:45:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZOK+wzW7BiFBXm040omLCRZ9c65LIgLOa6HAZFWuYqzLCCDerjyZrBibNueb7lT0G0BNgIGBSbQRl3ISo3UtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:40:11.564090Z"},"content_sha256":"dd3914c25d24c41a9d2bbc28867736c211826621810e570dc003ce58f2007412","schema_version":"1.0","event_id":"sha256:dd3914c25d24c41a9d2bbc28867736c211826621810e570dc003ce58f2007412"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XFQHBM2H3FLEYVR32LRGDPJUEB/bundle.json","state_url":"https://pith.science/pith/XFQHBM2H3FLEYVR32LRGDPJUEB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XFQHBM2H3FLEYVR32LRGDPJUEB/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-08T11:40:11Z","links":{"resolver":"https://pith.science/pith/XFQHBM2H3FLEYVR32LRGDPJUEB","bundle":"https://pith.science/pith/XFQHBM2H3FLEYVR32LRGDPJUEB/bundle.json","state":"https://pith.science/pith/XFQHBM2H3FLEYVR32LRGDPJUEB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XFQHBM2H3FLEYVR32LRGDPJUEB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XFQHBM2H3FLEYVR32LRGDPJUEB","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":"606865478311cedc9471188d7bfb769f6719e89c94c755380bb500fa9ce7c1b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-30T16:19:49Z","title_canon_sha256":"1d548eb138e17895677e5b6836ac10cfc1888aab31c8f4871d58387112b98089"},"schema_version":"1.0","source":{"id":"2507.22807","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.22807","created_at":"2026-07-05T11:45:49Z"},{"alias_kind":"arxiv_version","alias_value":"2507.22807v1","created_at":"2026-07-05T11:45:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.22807","created_at":"2026-07-05T11:45:49Z"},{"alias_kind":"pith_short_12","alias_value":"XFQHBM2H3FLE","created_at":"2026-07-05T11:45:49Z"},{"alias_kind":"pith_short_16","alias_value":"XFQHBM2H3FLEYVR3","created_at":"2026-07-05T11:45:49Z"},{"alias_kind":"pith_short_8","alias_value":"XFQHBM2H","created_at":"2026-07-05T11:45:49Z"}],"graph_snapshots":[{"event_id":"sha256:dd3914c25d24c41a9d2bbc28867736c211826621810e570dc003ce58f2007412","target":"graph","created_at":"2026-07-05T11:45:49Z","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/2507.22807/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dirac's classical theorem asserts that, for $n \\ge 3$, any $n$-vertex graph with minimum degree at least $n/2$ is Hamiltonian. Furthermore, if we additionally assume that such graphs are regular, then, by the breakthrough work of Csaba, K\\\"uhn, Lo, Osthus and Treglown, they admit a decomposition into Hamilton cycles and at most one perfect matching, solving the well-known Nash-Williams conjecture. In the pseudorandom setting, it has long been conjectured that similar results hold in much sparser graphs. We prove two overarching theorems for graphs that exclude excessively dense subgraphs, whic","authors_text":"Benny Sudakov, David Munh\\'a Correia, Hyunwoo Lee, Jaehoon Kim, Mat\\'ias Pavez-Sign\\'e, Nemanja Dragani\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-30T16:19:49Z","title":"Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.22807","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:c619fd8e1f0df66c1c6e63c0bb9e25f9bdbd4eccefd2dcacc71f19549ac4141b","target":"record","created_at":"2026-07-05T11:45:49Z","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":"606865478311cedc9471188d7bfb769f6719e89c94c755380bb500fa9ce7c1b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-07-30T16:19:49Z","title_canon_sha256":"1d548eb138e17895677e5b6836ac10cfc1888aab31c8f4871d58387112b98089"},"schema_version":"1.0","source":{"id":"2507.22807","kind":"arxiv","version":1}},"canonical_sha256":"b96070b347d9564c563bd2e261bd342049895c9868e72fed57c0c2aad17e71d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b96070b347d9564c563bd2e261bd342049895c9868e72fed57c0c2aad17e71d5","first_computed_at":"2026-07-05T11:45:49.464782Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:45:49.464782Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IDQdH2fBirZRJRsLRIatG2/ZmBwYIl8hEkAftK+Y1aMHRaXccjFwuEmb4X8mEcixbzUCGvWEUneJ7Z58eSIZDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:45:49.465302Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.22807","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c619fd8e1f0df66c1c6e63c0bb9e25f9bdbd4eccefd2dcacc71f19549ac4141b","sha256:dd3914c25d24c41a9d2bbc28867736c211826621810e570dc003ce58f2007412"],"state_sha256":"6fca3a073391376bf9f842809250caa29a6c1e09f3be0b8184a785cb1eb6eda1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MrwMxm0X/Ra4of+WGJvbT6zf/tito0JnZil2L/C382NKPFIdxq9PAZsm4AWLM5Z1YAMOlLjQmSSO9RVXkO7ZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T11:40:11.571559Z","bundle_sha256":"993d4d45dac4455136042755dde052dcd34e73762c89933d82d199b4cb059ec6"}}