{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FPFFSJYGBKXC72JP57F4XIDAQU","short_pith_number":"pith:FPFFSJYG","canonical_record":{"source":{"id":"2507.17739","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-23T17:52:43Z","cross_cats_sorted":[],"title_canon_sha256":"535a80b8c9d005122554814b736ed2520db28fbc1584d7168480a957de21dc01","abstract_canon_sha256":"38cbf77a8bd80620bade82216a6f1e1629b7759593eb3146d050d9e5f41c3611"},"schema_version":"1.0"},"canonical_sha256":"2bca5927060aae2fe92fefcbcba0608502cb228a02b89a306dd575f14f372af2","source":{"kind":"arxiv","id":"2507.17739","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.17739","created_at":"2026-07-05T11:44:52Z"},{"alias_kind":"arxiv_version","alias_value":"2507.17739v2","created_at":"2026-07-05T11:44:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.17739","created_at":"2026-07-05T11:44:52Z"},{"alias_kind":"pith_short_12","alias_value":"FPFFSJYGBKXC","created_at":"2026-07-05T11:44:52Z"},{"alias_kind":"pith_short_16","alias_value":"FPFFSJYGBKXC72JP","created_at":"2026-07-05T11:44:52Z"},{"alias_kind":"pith_short_8","alias_value":"FPFFSJYG","created_at":"2026-07-05T11:44:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FPFFSJYGBKXC72JP57F4XIDAQU","target":"record","payload":{"canonical_record":{"source":{"id":"2507.17739","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-23T17:52:43Z","cross_cats_sorted":[],"title_canon_sha256":"535a80b8c9d005122554814b736ed2520db28fbc1584d7168480a957de21dc01","abstract_canon_sha256":"38cbf77a8bd80620bade82216a6f1e1629b7759593eb3146d050d9e5f41c3611"},"schema_version":"1.0"},"canonical_sha256":"2bca5927060aae2fe92fefcbcba0608502cb228a02b89a306dd575f14f372af2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:44:52.394091Z","signature_b64":"iMyS3uYwAuYei6XQDzSttPg8VEqdtvaHICbLu7kC0PFGiF40jSX/gBteOKcS9K6XL/DizS7I17YoWThpYoruDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bca5927060aae2fe92fefcbcba0608502cb228a02b89a306dd575f14f372af2","last_reissued_at":"2026-07-05T11:44:52.393661Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:44:52.393661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.17739","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-05T11:44:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RB/3phA3vMrLDe4hYbLBJ2DOl8JpGy/7jfLF95N0BOi5JxniW2Fic8NkeQ3D92RA+Ycjnzq1qxX31v3nOn0ZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T11:29:46.617051Z"},"content_sha256":"70128966e814034dce06a1bf34d54e4fb58f3afab91083dc3bbd5d8dc7c2683f","schema_version":"1.0","event_id":"sha256:70128966e814034dce06a1bf34d54e4fb58f3afab91083dc3bbd5d8dc7c2683f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FPFFSJYGBKXC72JP57F4XIDAQU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal stability results on color-biased Hamilton cycles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mingyuan Rong, Wenchong Chen, Zixiang Xu","submitted_at":"2025-07-23T17:52:43Z","abstract_excerpt":"We investigate Hamilton cycles in edge-colored graphs with \\( r \\) colors, focusing on the notion of color-bias (discrepancy), the maximum deviation from uniform color frequencies along a cycle. Foundational work by Balogh, Csaba, Jing, and Pluh\\'{a}r, and the later generalization by Freschi, Hyde, Lada, and Treglown, as well as an independent work by Gishboliner, Krivelevich, and Michaeli, established that any \\(n\\)-vertex graph with minimum degree exceeding \\( \\frac{(r+1)n}{2r} + \\frac{m}{2}\\) contains a Hamilton cycle with color-bias at least \\(m\\), and characterized the extremal graphs wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.17739","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/2507.17739/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:44:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xm0u83KrM2BpouxFHDGBgA8b7TpZ0qI5ZtFkPSxcfjzduG0Iy5uAQ99AK850MpJsxQadpnSJgFZAlOxe8W3/DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T11:29:46.617560Z"},"content_sha256":"bc8daf2d5a7448a9b795908a25a1eb62a9f78159b8306a89870d83df13282945","schema_version":"1.0","event_id":"sha256:bc8daf2d5a7448a9b795908a25a1eb62a9f78159b8306a89870d83df13282945"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FPFFSJYGBKXC72JP57F4XIDAQU/bundle.json","state_url":"https://pith.science/pith/FPFFSJYGBKXC72JP57F4XIDAQU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FPFFSJYGBKXC72JP57F4XIDAQU/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-23T11:29:46Z","links":{"resolver":"https://pith.science/pith/FPFFSJYGBKXC72JP57F4XIDAQU","bundle":"https://pith.science/pith/FPFFSJYGBKXC72JP57F4XIDAQU/bundle.json","state":"https://pith.science/pith/FPFFSJYGBKXC72JP57F4XIDAQU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FPFFSJYGBKXC72JP57F4XIDAQU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FPFFSJYGBKXC72JP57F4XIDAQU","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":"38cbf77a8bd80620bade82216a6f1e1629b7759593eb3146d050d9e5f41c3611","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-23T17:52:43Z","title_canon_sha256":"535a80b8c9d005122554814b736ed2520db28fbc1584d7168480a957de21dc01"},"schema_version":"1.0","source":{"id":"2507.17739","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.17739","created_at":"2026-07-05T11:44:52Z"},{"alias_kind":"arxiv_version","alias_value":"2507.17739v2","created_at":"2026-07-05T11:44:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.17739","created_at":"2026-07-05T11:44:52Z"},{"alias_kind":"pith_short_12","alias_value":"FPFFSJYGBKXC","created_at":"2026-07-05T11:44:52Z"},{"alias_kind":"pith_short_16","alias_value":"FPFFSJYGBKXC72JP","created_at":"2026-07-05T11:44:52Z"},{"alias_kind":"pith_short_8","alias_value":"FPFFSJYG","created_at":"2026-07-05T11:44:52Z"}],"graph_snapshots":[{"event_id":"sha256:bc8daf2d5a7448a9b795908a25a1eb62a9f78159b8306a89870d83df13282945","target":"graph","created_at":"2026-07-05T11:44:52Z","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.17739/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate Hamilton cycles in edge-colored graphs with \\( r \\) colors, focusing on the notion of color-bias (discrepancy), the maximum deviation from uniform color frequencies along a cycle. Foundational work by Balogh, Csaba, Jing, and Pluh\\'{a}r, and the later generalization by Freschi, Hyde, Lada, and Treglown, as well as an independent work by Gishboliner, Krivelevich, and Michaeli, established that any \\(n\\)-vertex graph with minimum degree exceeding \\( \\frac{(r+1)n}{2r} + \\frac{m}{2}\\) contains a Hamilton cycle with color-bias at least \\(m\\), and characterized the extremal graphs wit","authors_text":"Mingyuan Rong, Wenchong Chen, Zixiang Xu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-23T17:52:43Z","title":"Optimal stability results on color-biased Hamilton cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.17739","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:70128966e814034dce06a1bf34d54e4fb58f3afab91083dc3bbd5d8dc7c2683f","target":"record","created_at":"2026-07-05T11:44:52Z","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":"38cbf77a8bd80620bade82216a6f1e1629b7759593eb3146d050d9e5f41c3611","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-07-23T17:52:43Z","title_canon_sha256":"535a80b8c9d005122554814b736ed2520db28fbc1584d7168480a957de21dc01"},"schema_version":"1.0","source":{"id":"2507.17739","kind":"arxiv","version":2}},"canonical_sha256":"2bca5927060aae2fe92fefcbcba0608502cb228a02b89a306dd575f14f372af2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bca5927060aae2fe92fefcbcba0608502cb228a02b89a306dd575f14f372af2","first_computed_at":"2026-07-05T11:44:52.393661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:44:52.393661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iMyS3uYwAuYei6XQDzSttPg8VEqdtvaHICbLu7kC0PFGiF40jSX/gBteOKcS9K6XL/DizS7I17YoWThpYoruDA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:44:52.394091Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.17739","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70128966e814034dce06a1bf34d54e4fb58f3afab91083dc3bbd5d8dc7c2683f","sha256:bc8daf2d5a7448a9b795908a25a1eb62a9f78159b8306a89870d83df13282945"],"state_sha256":"9d8d903353ef167c552688e455f2a9212ef5d7360223fd5452787b73ab9fb557"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pSMSo5Y3GHOsv5rcuITtiWt4gyNzB6akVgsJebDLYXPMSIj5S4ZVsM0/F3H5BTemLPq1eXemZaRB2V8NuHI0CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T11:29:46.622191Z","bundle_sha256":"11344628fa21ac1856067360ab6eb3d1dda1758ca80b9ba834c5decfae419473"}}