{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IZ626QX7PG5QON3TCAMOQRV6US","short_pith_number":"pith:IZ626QX7","schema_version":"1.0","canonical_sha256":"467daf42ff79bb0737731018e846bea4aff68040559eb771a237622b64fcd0cf","source":{"kind":"arxiv","id":"1609.03013","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1609.03013","created_at":"2026-05-18T00:51:57.583586+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.03013v2","created_at":"2026-05-18T00:51:57.583586+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03013","created_at":"2026-05-18T00:51:57.583586+00:00"},{"alias_kind":"pith_short_12","alias_value":"IZ626QX7PG5Q","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IZ626QX7PG5QON3T","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IZ626QX7","created_at":"2026-05-18T12:30:22.444734+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/IZ626QX7PG5QON3TCAMOQRV6US","json":"https://pith.science/pith/IZ626QX7PG5QON3TCAMOQRV6US.json","graph_json":"https://pith.science/api/pith-number/IZ626QX7PG5QON3TCAMOQRV6US/graph.json","events_json":"https://pith.science/api/pith-number/IZ626QX7PG5QON3TCAMOQRV6US/events.json","paper":"https://pith.science/paper/IZ626QX7"},"agent_actions":{"view_html":"https://pith.science/pith/IZ626QX7PG5QON3TCAMOQRV6US","download_json":"https://pith.science/pith/IZ626QX7PG5QON3TCAMOQRV6US.json","view_paper":"https://pith.science/paper/IZ626QX7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.03013&json=true","fetch_graph":"https://pith.science/api/pith-number/IZ626QX7PG5QON3TCAMOQRV6US/graph.json","fetch_events":"https://pith.science/api/pith-number/IZ626QX7PG5QON3TCAMOQRV6US/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IZ626QX7PG5QON3TCAMOQRV6US/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IZ626QX7PG5QON3TCAMOQRV6US/action/storage_attestation","attest_author":"https://pith.science/pith/IZ626QX7PG5QON3TCAMOQRV6US/action/author_attestation","sign_citation":"https://pith.science/pith/IZ626QX7PG5QON3TCAMOQRV6US/action/citation_signature","submit_replication":"https://pith.science/pith/IZ626QX7PG5QON3TCAMOQRV6US/action/replication_record"}},"created_at":"2026-05-18T00:51:57.583586+00:00","updated_at":"2026-05-18T00:51:57.583586+00:00"}