{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3EB3ALT2YMAW4XGD7U52UIY7RF","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":"239f8e51d03dc6fe677a7789039eec78e11e35b5299c43607800e06e7c6fb11e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T17:05:22Z","title_canon_sha256":"a30a01a59ad5f9b284b095d728b4713e0e7ef974d6a92623230346ca7411436e"},"schema_version":"1.0","source":{"id":"2606.09742","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.09742","created_at":"2026-06-09T02:09:07Z"},{"alias_kind":"arxiv_version","alias_value":"2606.09742v1","created_at":"2026-06-09T02:09:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.09742","created_at":"2026-06-09T02:09:07Z"},{"alias_kind":"pith_short_12","alias_value":"3EB3ALT2YMAW","created_at":"2026-06-09T02:09:07Z"},{"alias_kind":"pith_short_16","alias_value":"3EB3ALT2YMAW4XGD","created_at":"2026-06-09T02:09:07Z"},{"alias_kind":"pith_short_8","alias_value":"3EB3ALT2","created_at":"2026-06-09T02:09:07Z"}],"graph_snapshots":[{"event_id":"sha256:fca5e98b21daed9a8d5b4cae76d25053a855c0248b973400ee9832adab80be73","target":"graph","created_at":"2026-06-09T02:09:07Z","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.09742/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Lov\\'{a}sz' famous Hamiltonicity conjecture (1969) states that every connected vertex-transitive graph has a Hamiltonian path. A stronger version of the conjecture, often attributed to Thomassen (1978), states that every sufficiently large such graph even has a Hamiltonian cycle. Despite the great amount of attention these conjectures have attracted over the past decades both in the combinatorial and algebraic communities, for more than 40 years the best known lower bound for the maximum length of a cycle (path) in a connected vertex-transitive graph of order $n$ remained of the form $\\Omega(\\","authors_text":"Alexey Pokrovskiy, Matija Buci\\'c, Micha Christoph, Raphael Steiner","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T17:05:22Z","title":"Towards the Lov\\'{a}sz conjecture via sublinear expanders"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.09742","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:0f481a44c25ce4a77c30d3984156e3fef14db8abab81a58a66b8cae5d8edd268","target":"record","created_at":"2026-06-09T02:09:07Z","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":"239f8e51d03dc6fe677a7789039eec78e11e35b5299c43607800e06e7c6fb11e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-08T17:05:22Z","title_canon_sha256":"a30a01a59ad5f9b284b095d728b4713e0e7ef974d6a92623230346ca7411436e"},"schema_version":"1.0","source":{"id":"2606.09742","kind":"arxiv","version":1}},"canonical_sha256":"d903b02e7ac3016e5cc3fd3baa231f896ad65cc15fe50cbb22bc3bb8a77eec08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d903b02e7ac3016e5cc3fd3baa231f896ad65cc15fe50cbb22bc3bb8a77eec08","first_computed_at":"2026-06-09T02:09:07.157727Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T02:09:07.157727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lDKN8U43mttAa4piZPFHRBBpspOSPjxkC2v5sblw3qCN3D7fPVirLXh2bwvWx+uXZyUQGg9R+YMfS3WC7E8RBA==","signature_status":"signed_v1","signed_at":"2026-06-09T02:09:07.158634Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.09742","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f481a44c25ce4a77c30d3984156e3fef14db8abab81a58a66b8cae5d8edd268","sha256:fca5e98b21daed9a8d5b4cae76d25053a855c0248b973400ee9832adab80be73"],"state_sha256":"77862707ed9173cb7f6d63277069dfb74fe8d75e60a9b2c0efa6f2fa46b8fd87"}