{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IZ626QX7PG5QON3TCAMOQRV6US","short_pith_number":"pith:IZ626QX7","canonical_record":{"source":{"id":"1609.03013","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-10T08:34:56Z","cross_cats_sorted":["math.CO","math.GR"],"title_canon_sha256":"ada9354c04c356aac9ad31909d233a24762117fbf7d3999fb55a4804b45b3ef5","abstract_canon_sha256":"bbf6d120fa34ec45f3b6bcda46852352cd1bfabc0f5a5c9b6081de6348c51d51"},"schema_version":"1.0"},"canonical_sha256":"467daf42ff79bb0737731018e846bea4aff68040559eb771a237622b64fcd0cf","source":{"kind":"arxiv","id":"1609.03013","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03013","created_at":"2026-05-18T00:51:57Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03013v2","created_at":"2026-05-18T00:51:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03013","created_at":"2026-05-18T00:51:57Z"},{"alias_kind":"pith_short_12","alias_value":"IZ626QX7PG5Q","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IZ626QX7PG5QON3T","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IZ626QX7","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IZ626QX7PG5QON3TCAMOQRV6US","target":"record","payload":{"canonical_record":{"source":{"id":"1609.03013","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-10T08:34:56Z","cross_cats_sorted":["math.CO","math.GR"],"title_canon_sha256":"ada9354c04c356aac9ad31909d233a24762117fbf7d3999fb55a4804b45b3ef5","abstract_canon_sha256":"bbf6d120fa34ec45f3b6bcda46852352cd1bfabc0f5a5c9b6081de6348c51d51"},"schema_version":"1.0"},"canonical_sha256":"467daf42ff79bb0737731018e846bea4aff68040559eb771a237622b64fcd0cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:57.584106Z","signature_b64":"4bcawx8EmstxjK790DrX3gF/dx1uWPXbHI9q3pBy/uz+FpYvyjLXHQ8Rz6ET/UN2zUWeHI5I0UTR2MX6uFU7BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"467daf42ff79bb0737731018e846bea4aff68040559eb771a237622b64fcd0cf","last_reissued_at":"2026-05-18T00:51:57.583482Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:57.583482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.03013","source_version":2,"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-05-18T00:51:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WyCuxNcNdirC04VPHSsfjTU8PGK6yKHRPFJtTTErenEm/uGVABKYk6njXyD4uMlHsJU903V7Vj3/bznj+Ml2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:40:14.726189Z"},"content_sha256":"02bcb63c17fa0a09a2d41bd6924e9425c38e1fb70e4b56ecd31812bba10cae73","schema_version":"1.0","event_id":"sha256:02bcb63c17fa0a09a2d41bd6924e9425c38e1fb70e4b56ecd31812bba10cae73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IZ626QX7PG5QON3TCAMOQRV6US","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithmic Aspects of Regular Graph Covers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.GR"],"primary_cat":"cs.DM","authors_text":"Jan Kratochv\\'il, Ji\\v{r}\\'i Fiala, Pavel Klav\\'ik, Roman Nedela","submitted_at":"2016-09-10T08:34:56Z","abstract_excerpt":"A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers where this homomorphism is prescribed by the action of a semiregular subgroup of $\\textrm{Aut}(G)$. We study computational aspects of regular covers that have not been addressed before. The decision problem RegularCover asks for given graphs $G$ and $H$ whether $G$ regularly covers $H$. When $|H|=1$, this problem becomes Cayley graph recognition for which the complexity is still unresolved. Another special case arises for $|G| = |H|$ when it becomes the graph isomorphism"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03013","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-05-18T00:51:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/T+jp2XQc+ro0fSbsdT+m988QCRhj3h5I1a6jb+XpkkYVYcMbEe/MAEEBKcxauNE/WEi2bWlm5urjKDaKD7ECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:40:14.726546Z"},"content_sha256":"cdbafe75d5092abd00fdea37b26cf6c0f9506d20444af5e5b9174131d91bfc26","schema_version":"1.0","event_id":"sha256:cdbafe75d5092abd00fdea37b26cf6c0f9506d20444af5e5b9174131d91bfc26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IZ626QX7PG5QON3TCAMOQRV6US/bundle.json","state_url":"https://pith.science/pith/IZ626QX7PG5QON3TCAMOQRV6US/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IZ626QX7PG5QON3TCAMOQRV6US/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-08T13:40:14Z","links":{"resolver":"https://pith.science/pith/IZ626QX7PG5QON3TCAMOQRV6US","bundle":"https://pith.science/pith/IZ626QX7PG5QON3TCAMOQRV6US/bundle.json","state":"https://pith.science/pith/IZ626QX7PG5QON3TCAMOQRV6US/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IZ626QX7PG5QON3TCAMOQRV6US/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IZ626QX7PG5QON3TCAMOQRV6US","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":"bbf6d120fa34ec45f3b6bcda46852352cd1bfabc0f5a5c9b6081de6348c51d51","cross_cats_sorted":["math.CO","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-10T08:34:56Z","title_canon_sha256":"ada9354c04c356aac9ad31909d233a24762117fbf7d3999fb55a4804b45b3ef5"},"schema_version":"1.0","source":{"id":"1609.03013","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03013","created_at":"2026-05-18T00:51:57Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03013v2","created_at":"2026-05-18T00:51:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03013","created_at":"2026-05-18T00:51:57Z"},{"alias_kind":"pith_short_12","alias_value":"IZ626QX7PG5Q","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IZ626QX7PG5QON3T","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IZ626QX7","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:cdbafe75d5092abd00fdea37b26cf6c0f9506d20444af5e5b9174131d91bfc26","target":"graph","created_at":"2026-05-18T00:51:57Z","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"},"paper":{"abstract_excerpt":"A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers where this homomorphism is prescribed by the action of a semiregular subgroup of $\\textrm{Aut}(G)$. We study computational aspects of regular covers that have not been addressed before. The decision problem RegularCover asks for given graphs $G$ and $H$ whether $G$ regularly covers $H$. When $|H|=1$, this problem becomes Cayley graph recognition for which the complexity is still unresolved. Another special case arises for $|G| = |H|$ when it becomes the graph isomorphism","authors_text":"Jan Kratochv\\'il, Ji\\v{r}\\'i Fiala, Pavel Klav\\'ik, Roman Nedela","cross_cats":["math.CO","math.GR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-10T08:34:56Z","title":"Algorithmic Aspects of Regular Graph Covers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03013","kind":"arxiv","version":2},"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:02bcb63c17fa0a09a2d41bd6924e9425c38e1fb70e4b56ecd31812bba10cae73","target":"record","created_at":"2026-05-18T00:51:57Z","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":"bbf6d120fa34ec45f3b6bcda46852352cd1bfabc0f5a5c9b6081de6348c51d51","cross_cats_sorted":["math.CO","math.GR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-09-10T08:34:56Z","title_canon_sha256":"ada9354c04c356aac9ad31909d233a24762117fbf7d3999fb55a4804b45b3ef5"},"schema_version":"1.0","source":{"id":"1609.03013","kind":"arxiv","version":2}},"canonical_sha256":"467daf42ff79bb0737731018e846bea4aff68040559eb771a237622b64fcd0cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"467daf42ff79bb0737731018e846bea4aff68040559eb771a237622b64fcd0cf","first_computed_at":"2026-05-18T00:51:57.583482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:57.583482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4bcawx8EmstxjK790DrX3gF/dx1uWPXbHI9q3pBy/uz+FpYvyjLXHQ8Rz6ET/UN2zUWeHI5I0UTR2MX6uFU7BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:57.584106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03013","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02bcb63c17fa0a09a2d41bd6924e9425c38e1fb70e4b56ecd31812bba10cae73","sha256:cdbafe75d5092abd00fdea37b26cf6c0f9506d20444af5e5b9174131d91bfc26"],"state_sha256":"3d2130e789c286550647439fdc782b92f15de5e3239c0e32547e00f89f0e8775"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l7sKSsEfnlkZ5VX7JD+T60p+9HmKGVgQMoGNltWrYn/FcsJClUrts0D55DOGavNQdO0kl6qKg384mQD9HywoDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:40:14.728442Z","bundle_sha256":"3c5bfd5b2af9b35016457b000ebfb0034428d8df2d2bb237d26aa0d90f76fae6"}}