{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TD3MDWTPV26PK422DIIYXCI2WD","short_pith_number":"pith:TD3MDWTP","canonical_record":{"source":{"id":"1903.08637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-20T17:50:59Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"e75b6b8b72949a7062458a2a73ca9c995cb3d5d086e8988ee0ea36501d6738c4","abstract_canon_sha256":"c1deeed290f1598f49b91a2be6ee527a33c1a2a7d210c7ce94bbf39c3a1dc80a"},"schema_version":"1.0"},"canonical_sha256":"98f6c1da6faebcf5735a1a118b891ab0c76df30c8604467f3b41fd5cacde1e78","source":{"kind":"arxiv","id":"1903.08637","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08637","created_at":"2026-05-17T23:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08637v1","created_at":"2026-05-17T23:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08637","created_at":"2026-05-17T23:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"TD3MDWTPV26P","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TD3MDWTPV26PK422","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TD3MDWTP","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TD3MDWTPV26PK422DIIYXCI2WD","target":"record","payload":{"canonical_record":{"source":{"id":"1903.08637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-20T17:50:59Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"e75b6b8b72949a7062458a2a73ca9c995cb3d5d086e8988ee0ea36501d6738c4","abstract_canon_sha256":"c1deeed290f1598f49b91a2be6ee527a33c1a2a7d210c7ce94bbf39c3a1dc80a"},"schema_version":"1.0"},"canonical_sha256":"98f6c1da6faebcf5735a1a118b891ab0c76df30c8604467f3b41fd5cacde1e78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:47.538579Z","signature_b64":"13H3sxDoTcVVx+glSe2mHaSZBnUL+y8EDXiD5bFNfDy3Qy1s+vmGbJOt2eOiTLpt/QdR3w2ltrSwe13oYfS6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"98f6c1da6faebcf5735a1a118b891ab0c76df30c8604467f3b41fd5cacde1e78","last_reissued_at":"2026-05-17T23:50:47.537936Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:47.537936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.08637","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-17T23:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Rx2k1lHcslRYvaNywDiF0OWwDz9FyPLSgFqg8YbCmfjNHK3KUXzLsQkjaWuti3TJsi7gAwVDIORXcsjSM2TAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:57:05.998105Z"},"content_sha256":"65719d8e82b3eba86b4379575e3450789fa0a7dd0fc466b9a3b8ebca1e362986","schema_version":"1.0","event_id":"sha256:65719d8e82b3eba86b4379575e3450789fa0a7dd0fc466b9a3b8ebca1e362986"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TD3MDWTPV26PK422DIIYXCI2WD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Z_2-genus of graphs and minimum rank of partial symmetric matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"math.CO","authors_text":"Jan Kyn\\v{c}l, Radoslav Fulek","submitted_at":"2019-03-20T17:50:59Z","abstract_excerpt":"The \\emph{genus} $\\mathrm{g}(G)$ of a graph $G$ is the minimum $g$ such that $G$ has an embedding on the orientable surface $M_g$ of genus $g$.\n  A drawing of a graph on a surface is \\emph{independently even} if every pair of nonadjacent edges in the drawing crosses an even number of times. The \\emph{$\\mathbb{Z}_2$-genus} of a graph $G$, denoted by $\\mathrm{g}_0(G)$, is the minimum $g$ such that $G$ has an independently even drawing on $M_g$.\n  By a result of Battle, Harary, Kodama and Youngs from 1962, the graph genus is additive over 2-connected blocks.\n  In 2013, Schaefer and \\v{S}tefankovi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08637","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-17T23:50:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kf3gWvit+pYbADaeSYxSrP8iEgB7oglu1kfZPgygvpV0N87PrsXtWfeCl5eYZu5JUHLUifGQhXZTkgdRLjWGDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:57:05.998775Z"},"content_sha256":"b377ec1b5c9502e53402f416a8e8a2c673363726ab29c5e0904e71ce5d54828a","schema_version":"1.0","event_id":"sha256:b377ec1b5c9502e53402f416a8e8a2c673363726ab29c5e0904e71ce5d54828a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TD3MDWTPV26PK422DIIYXCI2WD/bundle.json","state_url":"https://pith.science/pith/TD3MDWTPV26PK422DIIYXCI2WD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TD3MDWTPV26PK422DIIYXCI2WD/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-05-31T02:57:06Z","links":{"resolver":"https://pith.science/pith/TD3MDWTPV26PK422DIIYXCI2WD","bundle":"https://pith.science/pith/TD3MDWTPV26PK422DIIYXCI2WD/bundle.json","state":"https://pith.science/pith/TD3MDWTPV26PK422DIIYXCI2WD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TD3MDWTPV26PK422DIIYXCI2WD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TD3MDWTPV26PK422DIIYXCI2WD","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":"c1deeed290f1598f49b91a2be6ee527a33c1a2a7d210c7ce94bbf39c3a1dc80a","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-20T17:50:59Z","title_canon_sha256":"e75b6b8b72949a7062458a2a73ca9c995cb3d5d086e8988ee0ea36501d6738c4"},"schema_version":"1.0","source":{"id":"1903.08637","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.08637","created_at":"2026-05-17T23:50:47Z"},{"alias_kind":"arxiv_version","alias_value":"1903.08637v1","created_at":"2026-05-17T23:50:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.08637","created_at":"2026-05-17T23:50:47Z"},{"alias_kind":"pith_short_12","alias_value":"TD3MDWTPV26P","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"TD3MDWTPV26PK422","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"TD3MDWTP","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:b377ec1b5c9502e53402f416a8e8a2c673363726ab29c5e0904e71ce5d54828a","target":"graph","created_at":"2026-05-17T23:50:47Z","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 \\emph{genus} $\\mathrm{g}(G)$ of a graph $G$ is the minimum $g$ such that $G$ has an embedding on the orientable surface $M_g$ of genus $g$.\n  A drawing of a graph on a surface is \\emph{independently even} if every pair of nonadjacent edges in the drawing crosses an even number of times. The \\emph{$\\mathbb{Z}_2$-genus} of a graph $G$, denoted by $\\mathrm{g}_0(G)$, is the minimum $g$ such that $G$ has an independently even drawing on $M_g$.\n  By a result of Battle, Harary, Kodama and Youngs from 1962, the graph genus is additive over 2-connected blocks.\n  In 2013, Schaefer and \\v{S}tefankovi","authors_text":"Jan Kyn\\v{c}l, Radoslav Fulek","cross_cats":["cs.CG","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-20T17:50:59Z","title":"Z_2-genus of graphs and minimum rank of partial symmetric matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.08637","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:65719d8e82b3eba86b4379575e3450789fa0a7dd0fc466b9a3b8ebca1e362986","target":"record","created_at":"2026-05-17T23:50:47Z","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":"c1deeed290f1598f49b91a2be6ee527a33c1a2a7d210c7ce94bbf39c3a1dc80a","cross_cats_sorted":["cs.CG","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-03-20T17:50:59Z","title_canon_sha256":"e75b6b8b72949a7062458a2a73ca9c995cb3d5d086e8988ee0ea36501d6738c4"},"schema_version":"1.0","source":{"id":"1903.08637","kind":"arxiv","version":1}},"canonical_sha256":"98f6c1da6faebcf5735a1a118b891ab0c76df30c8604467f3b41fd5cacde1e78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"98f6c1da6faebcf5735a1a118b891ab0c76df30c8604467f3b41fd5cacde1e78","first_computed_at":"2026-05-17T23:50:47.537936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:47.537936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"13H3sxDoTcVVx+glSe2mHaSZBnUL+y8EDXiD5bFNfDy3Qy1s+vmGbJOt2eOiTLpt/QdR3w2ltrSwe13oYfS6Bg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:47.538579Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.08637","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65719d8e82b3eba86b4379575e3450789fa0a7dd0fc466b9a3b8ebca1e362986","sha256:b377ec1b5c9502e53402f416a8e8a2c673363726ab29c5e0904e71ce5d54828a"],"state_sha256":"2054406726ef13a345465656ee475952ae4f724593f8ff23084f182214c2bed4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2k5YGRLKQff/5PM9SYq63ETGK0qfbWlAC2cZ1jljhJ9/bF4BHXczzrle7rQLD/a9FuJLlWJtU9jSqmZ+FlTABg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:57:06.002347Z","bundle_sha256":"0fc1fc07d7104e3183fd6f162cbfa5bf9a878904fab08c86e32cccdc7ff7b462"}}