{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OSNMM7FBE7M5PXVI2ZXBFAIAD3","short_pith_number":"pith:OSNMM7FB","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"},"canonical_sha256":"749ac67ca127d9d7dea8d66e1281001ee11c1c66ae66f691aab50473ab5a2f65","source":{"kind":"arxiv","id":"1505.00321","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00321","created_at":"2026-05-18T02:17:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00321v1","created_at":"2026-05-18T02:17:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00321","created_at":"2026-05-18T02:17:10Z"},{"alias_kind":"pith_short_12","alias_value":"OSNMM7FBE7M5","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OSNMM7FBE7M5PXVI","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OSNMM7FB","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OSNMM7FBE7M5PXVI2ZXBFAIAD3","target":"record","payload":{"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"},"canonical_sha256":"749ac67ca127d9d7dea8d66e1281001ee11c1c66ae66f691aab50473ab5a2f65","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"},"source_kind":"arxiv","source_id":"1505.00321","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-05-18T02:17:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GyYFXJB3aVkcTm1HEMDYh5Lhz27jIuy2H5pGBq6szpccDtdy7wYC26wU3Wc5RKg2JEZhVTnNqmxIvE6EFpfcDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:33:34.336451Z"},"content_sha256":"93a6f45bc9ad3d8a9fe717248026a4707d1a572f88805cc92e1d55ff54668af7","schema_version":"1.0","event_id":"sha256:93a6f45bc9ad3d8a9fe717248026a4707d1a572f88805cc92e1d55ff54668af7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OSNMM7FBE7M5PXVI2ZXBFAIAD3","target":"graph","payload":{"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"},"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-18T02:17:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dkNhVy6J/dmMjKsWGkwkVJg7xwy0jhuxUYbPvWPH4K7HdYMjaGaG1ulIgU/egZndVqJ0rM4XkPIi1KIo6W7aCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T20:33:34.336793Z"},"content_sha256":"0f00c1a6a09ef8dead837f1305bea243ca580f7811f3a8815d43f673d4667e18","schema_version":"1.0","event_id":"sha256:0f00c1a6a09ef8dead837f1305bea243ca580f7811f3a8815d43f673d4667e18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OSNMM7FBE7M5PXVI2ZXBFAIAD3/bundle.json","state_url":"https://pith.science/pith/OSNMM7FBE7M5PXVI2ZXBFAIAD3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OSNMM7FBE7M5PXVI2ZXBFAIAD3/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-27T20:33:34Z","links":{"resolver":"https://pith.science/pith/OSNMM7FBE7M5PXVI2ZXBFAIAD3","bundle":"https://pith.science/pith/OSNMM7FBE7M5PXVI2ZXBFAIAD3/bundle.json","state":"https://pith.science/pith/OSNMM7FBE7M5PXVI2ZXBFAIAD3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OSNMM7FBE7M5PXVI2ZXBFAIAD3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OSNMM7FBE7M5PXVI2ZXBFAIAD3","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":"c414ac1422617611d64b5d9e8a3dba7061251d4287142d09028c7744f23845ff","cross_cats_sorted":["math.CO","math.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2015-05-02T08:07:57Z","title_canon_sha256":"db6eb04b627b9191d6e6471f135cc7c91ee3c07abdd70c1769266e8bf41d75d5"},"schema_version":"1.0","source":{"id":"1505.00321","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00321","created_at":"2026-05-18T02:17:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00321v1","created_at":"2026-05-18T02:17:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00321","created_at":"2026-05-18T02:17:10Z"},{"alias_kind":"pith_short_12","alias_value":"OSNMM7FBE7M5","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OSNMM7FBE7M5PXVI","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OSNMM7FB","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:0f00c1a6a09ef8dead837f1305bea243ca580f7811f3a8815d43f673d4667e18","target":"graph","created_at":"2026-05-18T02:17:10Z","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":"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.","authors_text":"A. D. Mednykh","cross_cats":["math.CO","math.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2015-05-02T08:07:57Z","title":"On the Riemann-Hurwitz formula for graph coverings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00321","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:93a6f45bc9ad3d8a9fe717248026a4707d1a572f88805cc92e1d55ff54668af7","target":"record","created_at":"2026-05-18T02:17:10Z","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":"c414ac1422617611d64b5d9e8a3dba7061251d4287142d09028c7744f23845ff","cross_cats_sorted":["math.CO","math.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AT","submitted_at":"2015-05-02T08:07:57Z","title_canon_sha256":"db6eb04b627b9191d6e6471f135cc7c91ee3c07abdd70c1769266e8bf41d75d5"},"schema_version":"1.0","source":{"id":"1505.00321","kind":"arxiv","version":1}},"canonical_sha256":"749ac67ca127d9d7dea8d66e1281001ee11c1c66ae66f691aab50473ab5a2f65","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"749ac67ca127d9d7dea8d66e1281001ee11c1c66ae66f691aab50473ab5a2f65","first_computed_at":"2026-05-18T02:17:10.455220Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:10.455220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sXJNjxu/tQjRIwVRs4xeYpXvTv3VUOUIP2/tJJvimxHcguKpM29Bex+bzSDCh1do59w4vkAETVLuAtouZ9iZAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:10.455992Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.00321","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93a6f45bc9ad3d8a9fe717248026a4707d1a572f88805cc92e1d55ff54668af7","sha256:0f00c1a6a09ef8dead837f1305bea243ca580f7811f3a8815d43f673d4667e18"],"state_sha256":"0cfc404600045b280ef3f93c0e43cb13d32ec5bb8867be54afae53b4f94dc90c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cv5MKKmafatSH+KUibx+RwNQA3Hgo91lOTNdkwEF/R7jUP8MyZNezysC1Cp76nH5AUtRbXMCXYqwZbAKe2stCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T20:33:34.338887Z","bundle_sha256":"0ebc8cf8dfa8152997fd292ddd3bc686dabc773d2db783e87c0e32000553dce8"}}