{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GAGKOBDQFCHEPR2GB2HUO2JQJE","short_pith_number":"pith:GAGKOBDQ","schema_version":"1.0","canonical_sha256":"300ca70470288e47c7460e8f476930492d1f2363b49f7789315c7ea7818b53e5","source":{"kind":"arxiv","id":"2606.21941","version":1},"attestation_state":"computed","paper":{"title":"Computing the Hamiltonian compression factors of cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gregor Potocnik, Marston Conder, Primoz Potocnik","submitted_at":"2026-06-20T08:16:25Z","abstract_excerpt":"We present an algorithm for computing Hamiltonian cycles that are invariant under a graph automorphism acting on them as a rotation. We also present an application of this algorithm for computing the Hamiltonian compression factor of a graph, that is, the largest order of an automorphism preserving some Hamiltonian cycle and acting on it as a rotation. As an example, we compute the Hamiltonian compression factors of all cubic edge-transitive graphs on up to $10{,}000$ vertices, with the exception of two graphs, which are not Hamiltonian, and $98$ graphs (the smallest having $2304$ vertices) fo"},"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":"2606.21941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-20T08:16:25Z","cross_cats_sorted":[],"title_canon_sha256":"ca7a8c11fc6a14127b336d733b4aba72cfa0762276cc2e2306bb184e1281954d","abstract_canon_sha256":"43671362136a37c46606530ee97604e8eebe791672fd1f8c5517424f1c9d11a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:03.688166Z","signature_b64":"qJkSQrTIgkFcTJm2SBtAs1j/DfoSiqS4d+szEwkVJj9PYXpyg5LFygsrRjy33dAGJsL3Fa5s6Lr6xjxYicBfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"300ca70470288e47c7460e8f476930492d1f2363b49f7789315c7ea7818b53e5","last_reissued_at":"2026-06-23T02:13:03.687786Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:03.687786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing the Hamiltonian compression factors of cubic graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gregor Potocnik, Marston Conder, Primoz Potocnik","submitted_at":"2026-06-20T08:16:25Z","abstract_excerpt":"We present an algorithm for computing Hamiltonian cycles that are invariant under a graph automorphism acting on them as a rotation. We also present an application of this algorithm for computing the Hamiltonian compression factor of a graph, that is, the largest order of an automorphism preserving some Hamiltonian cycle and acting on it as a rotation. As an example, we compute the Hamiltonian compression factors of all cubic edge-transitive graphs on up to $10{,}000$ vertices, with the exception of two graphs, which are not Hamiltonian, and $98$ graphs (the smallest having $2304$ vertices) fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21941","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.21941/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":"2606.21941","created_at":"2026-06-23T02:13:03.687849+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.21941v1","created_at":"2026-06-23T02:13:03.687849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21941","created_at":"2026-06-23T02:13:03.687849+00:00"},{"alias_kind":"pith_short_12","alias_value":"GAGKOBDQFCHE","created_at":"2026-06-23T02:13:03.687849+00:00"},{"alias_kind":"pith_short_16","alias_value":"GAGKOBDQFCHEPR2G","created_at":"2026-06-23T02:13:03.687849+00:00"},{"alias_kind":"pith_short_8","alias_value":"GAGKOBDQ","created_at":"2026-06-23T02:13:03.687849+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/GAGKOBDQFCHEPR2GB2HUO2JQJE","json":"https://pith.science/pith/GAGKOBDQFCHEPR2GB2HUO2JQJE.json","graph_json":"https://pith.science/api/pith-number/GAGKOBDQFCHEPR2GB2HUO2JQJE/graph.json","events_json":"https://pith.science/api/pith-number/GAGKOBDQFCHEPR2GB2HUO2JQJE/events.json","paper":"https://pith.science/paper/GAGKOBDQ"},"agent_actions":{"view_html":"https://pith.science/pith/GAGKOBDQFCHEPR2GB2HUO2JQJE","download_json":"https://pith.science/pith/GAGKOBDQFCHEPR2GB2HUO2JQJE.json","view_paper":"https://pith.science/paper/GAGKOBDQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.21941&json=true","fetch_graph":"https://pith.science/api/pith-number/GAGKOBDQFCHEPR2GB2HUO2JQJE/graph.json","fetch_events":"https://pith.science/api/pith-number/GAGKOBDQFCHEPR2GB2HUO2JQJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GAGKOBDQFCHEPR2GB2HUO2JQJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GAGKOBDQFCHEPR2GB2HUO2JQJE/action/storage_attestation","attest_author":"https://pith.science/pith/GAGKOBDQFCHEPR2GB2HUO2JQJE/action/author_attestation","sign_citation":"https://pith.science/pith/GAGKOBDQFCHEPR2GB2HUO2JQJE/action/citation_signature","submit_replication":"https://pith.science/pith/GAGKOBDQFCHEPR2GB2HUO2JQJE/action/replication_record"}},"created_at":"2026-06-23T02:13:03.687849+00:00","updated_at":"2026-06-23T02:13:03.687849+00:00"}