{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GAGKOBDQFCHEPR2GB2HUO2JQJE","short_pith_number":"pith:GAGKOBDQ","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"},"canonical_sha256":"300ca70470288e47c7460e8f476930492d1f2363b49f7789315c7ea7818b53e5","source":{"kind":"arxiv","id":"2606.21941","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.21941","created_at":"2026-06-23T02:13:03Z"},{"alias_kind":"arxiv_version","alias_value":"2606.21941v1","created_at":"2026-06-23T02:13:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21941","created_at":"2026-06-23T02:13:03Z"},{"alias_kind":"pith_short_12","alias_value":"GAGKOBDQFCHE","created_at":"2026-06-23T02:13:03Z"},{"alias_kind":"pith_short_16","alias_value":"GAGKOBDQFCHEPR2G","created_at":"2026-06-23T02:13:03Z"},{"alias_kind":"pith_short_8","alias_value":"GAGKOBDQ","created_at":"2026-06-23T02:13:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GAGKOBDQFCHEPR2GB2HUO2JQJE","target":"record","payload":{"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"},"canonical_sha256":"300ca70470288e47c7460e8f476930492d1f2363b49f7789315c7ea7818b53e5","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"},"source_kind":"arxiv","source_id":"2606.21941","source_version":1,"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-06-23T02:13:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6SPIjTItWp7kfMZzqATBbidvYq1kgw6+xIeMdfJPZF6+OalmS5t/KFVHHL7fn4gcRy/poF9GwOkgPaN3qfjaDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:43:36.593296Z"},"content_sha256":"480a2f770856d89d7a5f62d12120a1321e3bedf34cccf956b5f4d59a022bcb21","schema_version":"1.0","event_id":"sha256:480a2f770856d89d7a5f62d12120a1321e3bedf34cccf956b5f4d59a022bcb21"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GAGKOBDQFCHEPR2GB2HUO2JQJE","target":"graph","payload":{"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"},"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-06-23T02:13:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ON22WgYRtvAt8SdZ8DdSU9D7/y+ePKvqwhxbcBrI9NJi8WScNS1qEnQKit9twvhfIHmgSmbHZOrAyRwMe0G/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:43:36.593710Z"},"content_sha256":"5759a671d2498705fa3e9e54db3f25b606a61c072c3bd55b63c8876c8031aa1c","schema_version":"1.0","event_id":"sha256:5759a671d2498705fa3e9e54db3f25b606a61c072c3bd55b63c8876c8031aa1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GAGKOBDQFCHEPR2GB2HUO2JQJE/bundle.json","state_url":"https://pith.science/pith/GAGKOBDQFCHEPR2GB2HUO2JQJE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GAGKOBDQFCHEPR2GB2HUO2JQJE/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-06-26T14:43:36Z","links":{"resolver":"https://pith.science/pith/GAGKOBDQFCHEPR2GB2HUO2JQJE","bundle":"https://pith.science/pith/GAGKOBDQFCHEPR2GB2HUO2JQJE/bundle.json","state":"https://pith.science/pith/GAGKOBDQFCHEPR2GB2HUO2JQJE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GAGKOBDQFCHEPR2GB2HUO2JQJE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GAGKOBDQFCHEPR2GB2HUO2JQJE","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":"43671362136a37c46606530ee97604e8eebe791672fd1f8c5517424f1c9d11a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-20T08:16:25Z","title_canon_sha256":"ca7a8c11fc6a14127b336d733b4aba72cfa0762276cc2e2306bb184e1281954d"},"schema_version":"1.0","source":{"id":"2606.21941","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.21941","created_at":"2026-06-23T02:13:03Z"},{"alias_kind":"arxiv_version","alias_value":"2606.21941v1","created_at":"2026-06-23T02:13:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21941","created_at":"2026-06-23T02:13:03Z"},{"alias_kind":"pith_short_12","alias_value":"GAGKOBDQFCHE","created_at":"2026-06-23T02:13:03Z"},{"alias_kind":"pith_short_16","alias_value":"GAGKOBDQFCHEPR2G","created_at":"2026-06-23T02:13:03Z"},{"alias_kind":"pith_short_8","alias_value":"GAGKOBDQ","created_at":"2026-06-23T02:13:03Z"}],"graph_snapshots":[{"event_id":"sha256:5759a671d2498705fa3e9e54db3f25b606a61c072c3bd55b63c8876c8031aa1c","target":"graph","created_at":"2026-06-23T02:13:03Z","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.21941/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Gregor Potocnik, Marston Conder, Primoz Potocnik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-20T08:16:25Z","title":"Computing the Hamiltonian compression factors of cubic graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21941","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:480a2f770856d89d7a5f62d12120a1321e3bedf34cccf956b5f4d59a022bcb21","target":"record","created_at":"2026-06-23T02:13:03Z","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":"43671362136a37c46606530ee97604e8eebe791672fd1f8c5517424f1c9d11a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-20T08:16:25Z","title_canon_sha256":"ca7a8c11fc6a14127b336d733b4aba72cfa0762276cc2e2306bb184e1281954d"},"schema_version":"1.0","source":{"id":"2606.21941","kind":"arxiv","version":1}},"canonical_sha256":"300ca70470288e47c7460e8f476930492d1f2363b49f7789315c7ea7818b53e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"300ca70470288e47c7460e8f476930492d1f2363b49f7789315c7ea7818b53e5","first_computed_at":"2026-06-23T02:13:03.687786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T02:13:03.687786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qJkSQrTIgkFcTJm2SBtAs1j/DfoSiqS4d+szEwkVJj9PYXpyg5LFygsrRjy33dAGJsL3Fa5s6Lr6xjxYicBfDA==","signature_status":"signed_v1","signed_at":"2026-06-23T02:13:03.688166Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.21941","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:480a2f770856d89d7a5f62d12120a1321e3bedf34cccf956b5f4d59a022bcb21","sha256:5759a671d2498705fa3e9e54db3f25b606a61c072c3bd55b63c8876c8031aa1c"],"state_sha256":"b2bdc7dea7b5714fb9a79c32030f736e4808c37c334a49638e7032441bb0ecc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PLWfeD8PhqyxocUmkp4oBiqBLVDVHnwVocqU8etXBJ3ZPQAYyd0THcL/rdPJHXhhnbT3EmwjH+klfe50QoQMDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T14:43:36.595801Z","bundle_sha256":"79ab0b90899a794789b71f97da373d5082953cd7d64741a24e0a8b86e5c620aa"}}