{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:DNWQ37R2M23DVUS4NOKMSDE5G4","short_pith_number":"pith:DNWQ37R2","canonical_record":{"source":{"id":"2007.11863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2020-07-23T08:43:33Z","cross_cats_sorted":[],"title_canon_sha256":"d1f14e7bd95b246ff1267c1461f0786b77714bd993a7b9d915716fbf27c08c25","abstract_canon_sha256":"cabd7645f925864c4432274543a1f2676cea6508ec062265db60bfec854b4c3e"},"schema_version":"1.0"},"canonical_sha256":"1b6d0dfe3a66b63ad25c6b94c90c9d370cef5bcda68a2e1d49623bbf82578f55","source":{"kind":"arxiv","id":"2007.11863","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.11863","created_at":"2026-07-05T01:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"2007.11863v1","created_at":"2026-07-05T01:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.11863","created_at":"2026-07-05T01:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"DNWQ37R2M23D","created_at":"2026-07-05T01:21:41Z"},{"alias_kind":"pith_short_16","alias_value":"DNWQ37R2M23DVUS4","created_at":"2026-07-05T01:21:41Z"},{"alias_kind":"pith_short_8","alias_value":"DNWQ37R2","created_at":"2026-07-05T01:21:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:DNWQ37R2M23DVUS4NOKMSDE5G4","target":"record","payload":{"canonical_record":{"source":{"id":"2007.11863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2020-07-23T08:43:33Z","cross_cats_sorted":[],"title_canon_sha256":"d1f14e7bd95b246ff1267c1461f0786b77714bd993a7b9d915716fbf27c08c25","abstract_canon_sha256":"cabd7645f925864c4432274543a1f2676cea6508ec062265db60bfec854b4c3e"},"schema_version":"1.0"},"canonical_sha256":"1b6d0dfe3a66b63ad25c6b94c90c9d370cef5bcda68a2e1d49623bbf82578f55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:21:41.168873Z","signature_b64":"GCPzQ7YMQ/3tIY7srCugpG4TibV4CWEQZ119PYEuE9bNDhtnWF8rZVthCM/JRXhQFDvzLYpIHCScgQCo0+uOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b6d0dfe3a66b63ad25c6b94c90c9d370cef5bcda68a2e1d49623bbf82578f55","last_reissued_at":"2026-07-05T01:21:41.168432Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:21:41.168432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.11863","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-07-05T01:21:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3OTplxgzudF3sIlYXXSl/VYDUeOyd3JjC6XQh/by7yEvPe9UuFKb8CYCUDPMHe/sW+bIJremSxFhIu/RKztICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:35:20.372840Z"},"content_sha256":"8575128a1d51d545d8393635f6fa193cb8cb04ef608b5a39c19b94c9d08118ea","schema_version":"1.0","event_id":"sha256:8575128a1d51d545d8393635f6fa193cb8cb04ef608b5a39c19b94c9d08118ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:DNWQ37R2M23DVUS4NOKMSDE5G4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Plane augmentation of plane graphs to meet parity constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"A. Garc\\'ia, J.C. Catana, J. Tejel, J. Urrutia","submitted_at":"2020-07-23T08:43:33Z","abstract_excerpt":"A plane topological graph $G=(V,E)$ is a graph drawn in the plane whose vertices are points in the plane and whose edges are simple curves that do not intersect, except at their endpoints. Given a plane topological graph $G=(V,E)$ and a set $C_G$ of parity constraints, in which every vertex has assigned a parity constraint on its degree, either even or odd, we say that $G$ is \\emph{topologically augmentable} to meet $C_G$ if there exits a plane topological graph $H$ on the same set of vertices, such that $G$ and $H$ are edge-disjoint and their union is a plane topological graph that meets all "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.11863","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.11863/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:21:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GYMtc2SGgw8jt6H53qjENf333fAyXKEOD8tgNjh3ZYR0S4Y1MN1ESbyR0HoAHEbx4LuzZR2f0SvVwmnK8w3dBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:35:20.373226Z"},"content_sha256":"0474c9e19a2ff485bf922c65ab1257d347a83d2601710b08ca0775e04c3e8731","schema_version":"1.0","event_id":"sha256:0474c9e19a2ff485bf922c65ab1257d347a83d2601710b08ca0775e04c3e8731"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DNWQ37R2M23DVUS4NOKMSDE5G4/bundle.json","state_url":"https://pith.science/pith/DNWQ37R2M23DVUS4NOKMSDE5G4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DNWQ37R2M23DVUS4NOKMSDE5G4/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-08-06T09:35:20Z","links":{"resolver":"https://pith.science/pith/DNWQ37R2M23DVUS4NOKMSDE5G4","bundle":"https://pith.science/pith/DNWQ37R2M23DVUS4NOKMSDE5G4/bundle.json","state":"https://pith.science/pith/DNWQ37R2M23DVUS4NOKMSDE5G4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DNWQ37R2M23DVUS4NOKMSDE5G4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:DNWQ37R2M23DVUS4NOKMSDE5G4","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":"cabd7645f925864c4432274543a1f2676cea6508ec062265db60bfec854b4c3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2020-07-23T08:43:33Z","title_canon_sha256":"d1f14e7bd95b246ff1267c1461f0786b77714bd993a7b9d915716fbf27c08c25"},"schema_version":"1.0","source":{"id":"2007.11863","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.11863","created_at":"2026-07-05T01:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"2007.11863v1","created_at":"2026-07-05T01:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.11863","created_at":"2026-07-05T01:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"DNWQ37R2M23D","created_at":"2026-07-05T01:21:41Z"},{"alias_kind":"pith_short_16","alias_value":"DNWQ37R2M23DVUS4","created_at":"2026-07-05T01:21:41Z"},{"alias_kind":"pith_short_8","alias_value":"DNWQ37R2","created_at":"2026-07-05T01:21:41Z"}],"graph_snapshots":[{"event_id":"sha256:0474c9e19a2ff485bf922c65ab1257d347a83d2601710b08ca0775e04c3e8731","target":"graph","created_at":"2026-07-05T01:21:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.11863/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A plane topological graph $G=(V,E)$ is a graph drawn in the plane whose vertices are points in the plane and whose edges are simple curves that do not intersect, except at their endpoints. Given a plane topological graph $G=(V,E)$ and a set $C_G$ of parity constraints, in which every vertex has assigned a parity constraint on its degree, either even or odd, we say that $G$ is \\emph{topologically augmentable} to meet $C_G$ if there exits a plane topological graph $H$ on the same set of vertices, such that $G$ and $H$ are edge-disjoint and their union is a plane topological graph that meets all ","authors_text":"A. Garc\\'ia, J.C. Catana, J. Tejel, J. Urrutia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2020-07-23T08:43:33Z","title":"Plane augmentation of plane graphs to meet parity constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.11863","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:8575128a1d51d545d8393635f6fa193cb8cb04ef608b5a39c19b94c9d08118ea","target":"record","created_at":"2026-07-05T01:21:41Z","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":"cabd7645f925864c4432274543a1f2676cea6508ec062265db60bfec854b4c3e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2020-07-23T08:43:33Z","title_canon_sha256":"d1f14e7bd95b246ff1267c1461f0786b77714bd993a7b9d915716fbf27c08c25"},"schema_version":"1.0","source":{"id":"2007.11863","kind":"arxiv","version":1}},"canonical_sha256":"1b6d0dfe3a66b63ad25c6b94c90c9d370cef5bcda68a2e1d49623bbf82578f55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b6d0dfe3a66b63ad25c6b94c90c9d370cef5bcda68a2e1d49623bbf82578f55","first_computed_at":"2026-07-05T01:21:41.168432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:21:41.168432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GCPzQ7YMQ/3tIY7srCugpG4TibV4CWEQZ119PYEuE9bNDhtnWF8rZVthCM/JRXhQFDvzLYpIHCScgQCo0+uOAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:21:41.168873Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.11863","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8575128a1d51d545d8393635f6fa193cb8cb04ef608b5a39c19b94c9d08118ea","sha256:0474c9e19a2ff485bf922c65ab1257d347a83d2601710b08ca0775e04c3e8731"],"state_sha256":"baaf6c975da5eb4c82cff6086062eef31b12b5b28c3a7bc1e8003bb5493b4410"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/n7YiyCO0DTKUMtSBZyv8ZtZx8LU03YzN9Er97Uc0mNaVIJ/LPk2qOUrZ+tef3BOXBb4XEg7AOFPs66J9wulAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T09:35:20.377116Z","bundle_sha256":"ebdb2a2ffc3fa825a40f10c4d5f94966ec911f0858c8f6403a0f350d81da7497"}}