{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OSNMM7FBE7M5PXVI2ZXBFAIAD3","short_pith_number":"pith:OSNMM7FB","schema_version":"1.0","canonical_sha256":"749ac67ca127d9d7dea8d66e1281001ee11c1c66ae66f691aab50473ab5a2f65","source":{"kind":"arxiv","id":"1505.00321","version":1},"attestation_state":"computed","paper":{"title":"On the Riemann-Hurwitz formula for graph coverings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.CV"],"primary_cat":"math.AT","authors_text":"A. D. Mednykh","submitted_at":"2015-05-02T08:07:57Z","abstract_excerpt":"The aim of this paper is to present a few versions of the Riemann-Hurwitz formula for a regular branched covering of graphs. By a graph, we mean a finite connected multigraph. The genus of a graph is defined as the rank of the first homology group. We consider a finite group acting on a graph, possibly with fixed and invertible edges, and the respective factor graph. Then, the obtained Riemann-Hurwitz formula relates genus of the graph with genus of the factor graph and orders of the vertex and edge stabilisers."},"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":"1505.00321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2015-05-02T08:07:57Z","cross_cats_sorted":["math.CO","math.CV"],"title_canon_sha256":"db6eb04b627b9191d6e6471f135cc7c91ee3c07abdd70c1769266e8bf41d75d5","abstract_canon_sha256":"c414ac1422617611d64b5d9e8a3dba7061251d4287142d09028c7744f23845ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:10.455992Z","signature_b64":"sXJNjxu/tQjRIwVRs4xeYpXvTv3VUOUIP2/tJJvimxHcguKpM29Bex+bzSDCh1do59w4vkAETVLuAtouZ9iZAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"749ac67ca127d9d7dea8d66e1281001ee11c1c66ae66f691aab50473ab5a2f65","last_reissued_at":"2026-05-18T02:17:10.455220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:10.455220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Riemann-Hurwitz formula for graph coverings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.CV"],"primary_cat":"math.AT","authors_text":"A. D. Mednykh","submitted_at":"2015-05-02T08:07:57Z","abstract_excerpt":"The aim of this paper is to present a few versions of the Riemann-Hurwitz formula for a regular branched covering of graphs. By a graph, we mean a finite connected multigraph. The genus of a graph is defined as the rank of the first homology group. We consider a finite group acting on a graph, possibly with fixed and invertible edges, and the respective factor graph. Then, the obtained Riemann-Hurwitz formula relates genus of the graph with genus of the factor graph and orders of the vertex and edge stabilisers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00321","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":""},"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":"1505.00321","created_at":"2026-05-18T02:17:10.455343+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.00321v1","created_at":"2026-05-18T02:17:10.455343+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00321","created_at":"2026-05-18T02:17:10.455343+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSNMM7FBE7M5","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSNMM7FBE7M5PXVI","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSNMM7FB","created_at":"2026-05-18T12:29:34.919912+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/OSNMM7FBE7M5PXVI2ZXBFAIAD3","json":"https://pith.science/pith/OSNMM7FBE7M5PXVI2ZXBFAIAD3.json","graph_json":"https://pith.science/api/pith-number/OSNMM7FBE7M5PXVI2ZXBFAIAD3/graph.json","events_json":"https://pith.science/api/pith-number/OSNMM7FBE7M5PXVI2ZXBFAIAD3/events.json","paper":"https://pith.science/paper/OSNMM7FB"},"agent_actions":{"view_html":"https://pith.science/pith/OSNMM7FBE7M5PXVI2ZXBFAIAD3","download_json":"https://pith.science/pith/OSNMM7FBE7M5PXVI2ZXBFAIAD3.json","view_paper":"https://pith.science/paper/OSNMM7FB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.00321&json=true","fetch_graph":"https://pith.science/api/pith-number/OSNMM7FBE7M5PXVI2ZXBFAIAD3/graph.json","fetch_events":"https://pith.science/api/pith-number/OSNMM7FBE7M5PXVI2ZXBFAIAD3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSNMM7FBE7M5PXVI2ZXBFAIAD3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSNMM7FBE7M5PXVI2ZXBFAIAD3/action/storage_attestation","attest_author":"https://pith.science/pith/OSNMM7FBE7M5PXVI2ZXBFAIAD3/action/author_attestation","sign_citation":"https://pith.science/pith/OSNMM7FBE7M5PXVI2ZXBFAIAD3/action/citation_signature","submit_replication":"https://pith.science/pith/OSNMM7FBE7M5PXVI2ZXBFAIAD3/action/replication_record"}},"created_at":"2026-05-18T02:17:10.455343+00:00","updated_at":"2026-05-18T02:17:10.455343+00:00"}