{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4QTUESE2N3P7E22FY2755S3KST","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":"8a77a2f82d61d0fb5e6d24bf0babcc31430ad6cd0c4d20b8e6fd5bb78ac5b9fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-19T15:44:55Z","title_canon_sha256":"59635a6fecd7e85c7a71c6f77e033868f7e29515a0f865c50c4188043fc51222"},"schema_version":"1.0","source":{"id":"2606.21548","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.21548","created_at":"2026-06-23T01:13:14Z"},{"alias_kind":"arxiv_version","alias_value":"2606.21548v1","created_at":"2026-06-23T01:13:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21548","created_at":"2026-06-23T01:13:14Z"},{"alias_kind":"pith_short_12","alias_value":"4QTUESE2N3P7","created_at":"2026-06-23T01:13:14Z"},{"alias_kind":"pith_short_16","alias_value":"4QTUESE2N3P7E22F","created_at":"2026-06-23T01:13:14Z"},{"alias_kind":"pith_short_8","alias_value":"4QTUESE2","created_at":"2026-06-23T01:13:14Z"}],"graph_snapshots":[{"event_id":"sha256:9c9273f741ea2baf6e3818dd3ff0aef4dc04e7fe2183c53de6beecd6e5a08391","target":"graph","created_at":"2026-06-23T01:13:14Z","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.21548/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An $\\ell$-cycle decomposition of a graph $G$ is a set of $\\ell$-cycles in $G$ whose edge sets partition the edge set of $G$. The $\\ell$-cycle decomposition threshold $\\delta_{C_\\ell}$ is then the least real number such that any $n$-vertex graph $G$ with minimum degree at least $(\\delta_{C_\\ell}+o(1))n$ has an $\\ell$-cycle decomposition if and only if $\\ell$ divides $|E(G)|$ and each vertex of $G$ has even degree. Nash-Williams' famous conjecture on triangle decompositions states, asymptotically, that $\\delta_{C_3}=\\frac{3}{4}$. A very recent breakthrough result of Delcourt and Postle completel","authors_text":"Bertille Granet, Daniel Horsley","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-19T15:44:55Z","title":"Determining decomposition thresholds for long odd cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21548","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:b726465bb1bb0df788a64da9916714f93289a1255acd3aca1c624af108e3b3d6","target":"record","created_at":"2026-06-23T01:13:14Z","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":"8a77a2f82d61d0fb5e6d24bf0babcc31430ad6cd0c4d20b8e6fd5bb78ac5b9fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-19T15:44:55Z","title_canon_sha256":"59635a6fecd7e85c7a71c6f77e033868f7e29515a0f865c50c4188043fc51222"},"schema_version":"1.0","source":{"id":"2606.21548","kind":"arxiv","version":1}},"canonical_sha256":"e42742489a6edff26b45c6bfdecb6a94e50aa7e0a4a377d4965f80b7461823ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e42742489a6edff26b45c6bfdecb6a94e50aa7e0a4a377d4965f80b7461823ac","first_computed_at":"2026-06-23T01:13:14.320291Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T01:13:14.320291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DMGraD41FZaYRNhg3XOS47r7iTX/OYIicyCDcwqckM6kZB8h+R2mjI6Pyt4AK1RhxYYVlLtOUOXhhVRRv0pVDw==","signature_status":"signed_v1","signed_at":"2026-06-23T01:13:14.320771Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.21548","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b726465bb1bb0df788a64da9916714f93289a1255acd3aca1c624af108e3b3d6","sha256:9c9273f741ea2baf6e3818dd3ff0aef4dc04e7fe2183c53de6beecd6e5a08391"],"state_sha256":"80238ae972b273bd1e35c30a10d2de40dd6ffb4986239e8a93f4ad2ef844c195"}