{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:AKTQ3V5CSLQCQGH7U4TNU2JLPI","short_pith_number":"pith:AKTQ3V5C","canonical_record":{"source":{"id":"2606.02160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T12:23:41Z","cross_cats_sorted":[],"title_canon_sha256":"14d91244d47c85c727059c02ec800c9f83ccbc8e991325e5c43f302496683816","abstract_canon_sha256":"6c80a8b2992faae8d10fda5df88b2f30c3d92efa183c5381cf9b58463fad8cfd"},"schema_version":"1.0"},"canonical_sha256":"02a70dd7a292e02818ffa726da692b7a08793886e2e2de5e6da87d0b2fc0ebe5","source":{"kind":"arxiv","id":"2606.02160","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02160","created_at":"2026-06-02T02:05:08Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02160v1","created_at":"2026-06-02T02:05:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02160","created_at":"2026-06-02T02:05:08Z"},{"alias_kind":"pith_short_12","alias_value":"AKTQ3V5CSLQC","created_at":"2026-06-02T02:05:08Z"},{"alias_kind":"pith_short_16","alias_value":"AKTQ3V5CSLQCQGH7","created_at":"2026-06-02T02:05:08Z"},{"alias_kind":"pith_short_8","alias_value":"AKTQ3V5C","created_at":"2026-06-02T02:05:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:AKTQ3V5CSLQCQGH7U4TNU2JLPI","target":"record","payload":{"canonical_record":{"source":{"id":"2606.02160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T12:23:41Z","cross_cats_sorted":[],"title_canon_sha256":"14d91244d47c85c727059c02ec800c9f83ccbc8e991325e5c43f302496683816","abstract_canon_sha256":"6c80a8b2992faae8d10fda5df88b2f30c3d92efa183c5381cf9b58463fad8cfd"},"schema_version":"1.0"},"canonical_sha256":"02a70dd7a292e02818ffa726da692b7a08793886e2e2de5e6da87d0b2fc0ebe5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:05:08.115353Z","signature_b64":"FhTs7v5UsJhmJ3Xu8TNezg8Ar/2SvtRHgfNw9wVxYkEnZBl+F+5fuyZLHwpUwTNCoKME3BWFmAUfDjL29oEMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02a70dd7a292e02818ffa726da692b7a08793886e2e2de5e6da87d0b2fc0ebe5","last_reissued_at":"2026-06-02T02:05:08.114965Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:05:08.114965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.02160","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-06-02T02:05:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MdbKTFEADvx0/QyXEy7oMNyPWMs05c/qmaT1BJXrQv8sb+CE9RV06hHNko5WvL0e3czYYKMKiH0Qtbi0ID61DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:37:35.433211Z"},"content_sha256":"0268f9b3d6f9ba9dbc344b3b495dee5cdff344f900c47328338675c42ceb4d21","schema_version":"1.0","event_id":"sha256:0268f9b3d6f9ba9dbc344b3b495dee5cdff344f900c47328338675c42ceb4d21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:AKTQ3V5CSLQCQGH7U4TNU2JLPI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pancyclicity of graphs perturbed by a random $F$-factor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dingjia Mao, Feihong Yuan, Wenling Zhou","submitted_at":"2026-06-01T12:23:41Z","abstract_excerpt":"Resolving a conjecture of Espuny D\\'iaz and Gir\\~ao [Random Structures Algorithms, 2023], we determine the sharp minimum-degree threshold for Hamiltonicity in graphs perturbed by a uniformly random $K_r$-factor. In fact, we prove the stronger pancyclic statement. More generally, for each fixed connected graph $F$, we study the union of an arbitrary deterministic graph of linear minimum degree and a uniformly random $F$-factor. Let $\\alpha^*(F)$ and $\\alpha_{\\text{pan}}^*(F)$ denote the corresponding Hamiltonicity and pancyclicity thresholds. We introduce two new parameters, $\\tau_{\\text{pc}}(F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02160","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/2606.02160/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-06-02T02:05:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1xCh1Iz4qu+eSURERDaeT7caNWst4RxHmuaQ2LFIEmc9b8wbOPiBZJz6CSPXxqGCjCBbB9W1aiN6vEKaOKzkDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:37:35.433611Z"},"content_sha256":"e0f8869716eec65766544399ab7fbdcbb1202f7fdf76b2b860bd887e32689504","schema_version":"1.0","event_id":"sha256:e0f8869716eec65766544399ab7fbdcbb1202f7fdf76b2b860bd887e32689504"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AKTQ3V5CSLQCQGH7U4TNU2JLPI/bundle.json","state_url":"https://pith.science/pith/AKTQ3V5CSLQCQGH7U4TNU2JLPI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AKTQ3V5CSLQCQGH7U4TNU2JLPI/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-03T16:37:35Z","links":{"resolver":"https://pith.science/pith/AKTQ3V5CSLQCQGH7U4TNU2JLPI","bundle":"https://pith.science/pith/AKTQ3V5CSLQCQGH7U4TNU2JLPI/bundle.json","state":"https://pith.science/pith/AKTQ3V5CSLQCQGH7U4TNU2JLPI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AKTQ3V5CSLQCQGH7U4TNU2JLPI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:AKTQ3V5CSLQCQGH7U4TNU2JLPI","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":"6c80a8b2992faae8d10fda5df88b2f30c3d92efa183c5381cf9b58463fad8cfd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T12:23:41Z","title_canon_sha256":"14d91244d47c85c727059c02ec800c9f83ccbc8e991325e5c43f302496683816"},"schema_version":"1.0","source":{"id":"2606.02160","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02160","created_at":"2026-06-02T02:05:08Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02160v1","created_at":"2026-06-02T02:05:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02160","created_at":"2026-06-02T02:05:08Z"},{"alias_kind":"pith_short_12","alias_value":"AKTQ3V5CSLQC","created_at":"2026-06-02T02:05:08Z"},{"alias_kind":"pith_short_16","alias_value":"AKTQ3V5CSLQCQGH7","created_at":"2026-06-02T02:05:08Z"},{"alias_kind":"pith_short_8","alias_value":"AKTQ3V5C","created_at":"2026-06-02T02:05:08Z"}],"graph_snapshots":[{"event_id":"sha256:e0f8869716eec65766544399ab7fbdcbb1202f7fdf76b2b860bd887e32689504","target":"graph","created_at":"2026-06-02T02:05:08Z","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/2606.02160/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Resolving a conjecture of Espuny D\\'iaz and Gir\\~ao [Random Structures Algorithms, 2023], we determine the sharp minimum-degree threshold for Hamiltonicity in graphs perturbed by a uniformly random $K_r$-factor. In fact, we prove the stronger pancyclic statement. More generally, for each fixed connected graph $F$, we study the union of an arbitrary deterministic graph of linear minimum degree and a uniformly random $F$-factor. Let $\\alpha^*(F)$ and $\\alpha_{\\text{pan}}^*(F)$ denote the corresponding Hamiltonicity and pancyclicity thresholds. We introduce two new parameters, $\\tau_{\\text{pc}}(F","authors_text":"Dingjia Mao, Feihong Yuan, Wenling Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T12:23:41Z","title":"Pancyclicity of graphs perturbed by a random $F$-factor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02160","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:0268f9b3d6f9ba9dbc344b3b495dee5cdff344f900c47328338675c42ceb4d21","target":"record","created_at":"2026-06-02T02:05:08Z","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":"6c80a8b2992faae8d10fda5df88b2f30c3d92efa183c5381cf9b58463fad8cfd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T12:23:41Z","title_canon_sha256":"14d91244d47c85c727059c02ec800c9f83ccbc8e991325e5c43f302496683816"},"schema_version":"1.0","source":{"id":"2606.02160","kind":"arxiv","version":1}},"canonical_sha256":"02a70dd7a292e02818ffa726da692b7a08793886e2e2de5e6da87d0b2fc0ebe5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02a70dd7a292e02818ffa726da692b7a08793886e2e2de5e6da87d0b2fc0ebe5","first_computed_at":"2026-06-02T02:05:08.114965Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:05:08.114965Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FhTs7v5UsJhmJ3Xu8TNezg8Ar/2SvtRHgfNw9wVxYkEnZBl+F+5fuyZLHwpUwTNCoKME3BWFmAUfDjL29oEMBg==","signature_status":"signed_v1","signed_at":"2026-06-02T02:05:08.115353Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.02160","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0268f9b3d6f9ba9dbc344b3b495dee5cdff344f900c47328338675c42ceb4d21","sha256:e0f8869716eec65766544399ab7fbdcbb1202f7fdf76b2b860bd887e32689504"],"state_sha256":"5ccd3db7257edc4ca2b8be13c62747e707a35abe845eadcfedcd1ebe464f30f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ooM/fqYQRxwH+cbwjxK2qiQ4+FVvwo0QhaCwLqwGHzzk0MTFNCc2USBiwgnrYMjTGJzKCUNjtQruv5or9aszDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:37:35.435729Z","bundle_sha256":"7ee99673c0fe858e83b0c0cedfbb21eb5d19030f039e719fe67ebc57c600ba48"}}