{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DYYDN657HJZ4GDSRMXJYUIHVE3","short_pith_number":"pith:DYYDN657","schema_version":"1.0","canonical_sha256":"1e3036fbbf3a73c30e5165d38a20f526fd69ef23fcf2621dec4d108ecd296c06","source":{"kind":"arxiv","id":"2607.05807","version":1},"attestation_state":"computed","paper":{"title":"Long Directed Cycles in Vertex-Transitive Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Bowen Li","submitted_at":"2026-07-07T04:02:25Z","abstract_excerpt":"The search for Hamiltonian cycles in vertex-transitive graphs and digraphs is a classical problem at the interface of graph theory and group theory. In the undirected setting, this goes back to famous conjectures of Lov\\'asz and Thomassen predicting that every sufficiently large connected vertex-transitive graph is Hamiltonian. The directed analogue has an even richer history, originating with Rankin in 1946, naturally translating the search for long cycles into classical group rearrangement problems. It was shown by Trotter and Erd\\H{o}s in 1978 that connected vertex-transitive digraphs need "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.05807","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-07T04:02:25Z","cross_cats_sorted":[],"title_canon_sha256":"76c45f74d678c1da6d14ebffdb92dc850423e43b2edd5a554329e6221059de7e","abstract_canon_sha256":"7d0077c64307d4f75f7881ebdb06b4bf980ab93e5176d908f3da5d7366a25ee6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-08T01:18:46.690082Z","signature_b64":"EQL8GMS7ZWIK+1gF92WE0AKgjuJhrDW52+2jRcyXM5snFbcS85wMIQoozxyaaWQQOzFRCpolADZDGAynPPqqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e3036fbbf3a73c30e5165d38a20f526fd69ef23fcf2621dec4d108ecd296c06","last_reissued_at":"2026-07-08T01:18:46.689500Z","signature_status":"signed_v1","first_computed_at":"2026-07-08T01:18:46.689500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Long Directed Cycles in Vertex-Transitive Digraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, Bowen Li","submitted_at":"2026-07-07T04:02:25Z","abstract_excerpt":"The search for Hamiltonian cycles in vertex-transitive graphs and digraphs is a classical problem at the interface of graph theory and group theory. In the undirected setting, this goes back to famous conjectures of Lov\\'asz and Thomassen predicting that every sufficiently large connected vertex-transitive graph is Hamiltonian. The directed analogue has an even richer history, originating with Rankin in 1946, naturally translating the search for long cycles into classical group rearrangement problems. It was shown by Trotter and Erd\\H{o}s in 1978 that connected vertex-transitive digraphs need "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.05807","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/2607.05807/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.05807","created_at":"2026-07-08T01:18:46.689584+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.05807v1","created_at":"2026-07-08T01:18:46.689584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05807","created_at":"2026-07-08T01:18:46.689584+00:00"},{"alias_kind":"pith_short_12","alias_value":"DYYDN657HJZ4","created_at":"2026-07-08T01:18:46.689584+00:00"},{"alias_kind":"pith_short_16","alias_value":"DYYDN657HJZ4GDSR","created_at":"2026-07-08T01:18:46.689584+00:00"},{"alias_kind":"pith_short_8","alias_value":"DYYDN657","created_at":"2026-07-08T01:18:46.689584+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DYYDN657HJZ4GDSRMXJYUIHVE3","json":"https://pith.science/pith/DYYDN657HJZ4GDSRMXJYUIHVE3.json","graph_json":"https://pith.science/api/pith-number/DYYDN657HJZ4GDSRMXJYUIHVE3/graph.json","events_json":"https://pith.science/api/pith-number/DYYDN657HJZ4GDSRMXJYUIHVE3/events.json","paper":"https://pith.science/paper/DYYDN657"},"agent_actions":{"view_html":"https://pith.science/pith/DYYDN657HJZ4GDSRMXJYUIHVE3","download_json":"https://pith.science/pith/DYYDN657HJZ4GDSRMXJYUIHVE3.json","view_paper":"https://pith.science/paper/DYYDN657","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.05807&json=true","fetch_graph":"https://pith.science/api/pith-number/DYYDN657HJZ4GDSRMXJYUIHVE3/graph.json","fetch_events":"https://pith.science/api/pith-number/DYYDN657HJZ4GDSRMXJYUIHVE3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DYYDN657HJZ4GDSRMXJYUIHVE3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DYYDN657HJZ4GDSRMXJYUIHVE3/action/storage_attestation","attest_author":"https://pith.science/pith/DYYDN657HJZ4GDSRMXJYUIHVE3/action/author_attestation","sign_citation":"https://pith.science/pith/DYYDN657HJZ4GDSRMXJYUIHVE3/action/citation_signature","submit_replication":"https://pith.science/pith/DYYDN657HJZ4GDSRMXJYUIHVE3/action/replication_record"}},"created_at":"2026-07-08T01:18:46.689584+00:00","updated_at":"2026-07-08T01:18:46.689584+00:00"}