{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EX5CXFYUE66KNHBSBGX4O5KLZP","short_pith_number":"pith:EX5CXFYU","canonical_record":{"source":{"id":"1303.1640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-07T10:35:12Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"d59ac477d3fb2ca1e3b12a60630d2b2e67d70782f14f5dc179984c03e6c0641d","abstract_canon_sha256":"95be2dfb0f4d1fbcf8c1b375e04f46666592e813e02338f13d049d1e762121fd"},"schema_version":"1.0"},"canonical_sha256":"25fa2b971427bca69c3209afc7754bcbf3136b0f329dc51e79189e2773e46801","source":{"kind":"arxiv","id":"1303.1640","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1640","created_at":"2026-05-18T03:31:42Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1640v1","created_at":"2026-05-18T03:31:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1640","created_at":"2026-05-18T03:31:42Z"},{"alias_kind":"pith_short_12","alias_value":"EX5CXFYUE66K","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EX5CXFYUE66KNHBS","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EX5CXFYU","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EX5CXFYUE66KNHBSBGX4O5KLZP","target":"record","payload":{"canonical_record":{"source":{"id":"1303.1640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-07T10:35:12Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"d59ac477d3fb2ca1e3b12a60630d2b2e67d70782f14f5dc179984c03e6c0641d","abstract_canon_sha256":"95be2dfb0f4d1fbcf8c1b375e04f46666592e813e02338f13d049d1e762121fd"},"schema_version":"1.0"},"canonical_sha256":"25fa2b971427bca69c3209afc7754bcbf3136b0f329dc51e79189e2773e46801","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:42.105243Z","signature_b64":"NcsqiM3FTCHmlI3iFoLqZA4H/o2CQh99Sa+Zrn2kFUhfixAtBL5aSnwJ8mc40f8jj71KjShU+MmBb0dJBQ53DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25fa2b971427bca69c3209afc7754bcbf3136b0f329dc51e79189e2773e46801","last_reissued_at":"2026-05-18T03:31:42.104615Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:42.104615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.1640","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-18T03:31:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aETevBD6j3nuMLtTo5Q6OXuI19QnWk0jCobPXWQpkD/dpSkPSpOXDjJkob0uBtUaRuBWqt0P7CiRwPclMVFvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:13:44.815192Z"},"content_sha256":"11c5839d7a97ba2fdd983fce74d525513e1ef1134289dacfa9a3ebbe211907b1","schema_version":"1.0","event_id":"sha256:11c5839d7a97ba2fdd983fce74d525513e1ef1134289dacfa9a3ebbe211907b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EX5CXFYUE66KNHBSBGX4O5KLZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Testing Mutual Duality of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Ignaz Rutter, Patrizio Angelini, Thomas Bl\\\"asius","submitted_at":"2013-03-07T10:35:12Z","abstract_excerpt":"We introduce and study the problem \\mpd, which asks for two planar graphs $G_1$ and $G_2$ whether $G_1$ can be embedded such that its dual is isomorphic to $G_2$. Our algorithmic main result is an NP-completeness proof for the general case and a linear-time algorithm for biconnected graphs. To shed light onto the combinatorial structure of the duals of a planar graph, we consider the \\emph{common dual relation} $\\sim$, where $G_1 \\sim G_2$ if and only if they have a common dual. While $\\sim$ is generally not transitive, we show that the restriction to biconnected graphs is an equivalence relat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1640","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-18T03:31:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uG8tz/9IIdvUBJgKDDEo+rZKgKIsnTnuVb15PE/KbtZZURVSS/PrlKmFjaqEp0buuz4hniVX7jGzzTreOZM4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:13:44.815574Z"},"content_sha256":"2112d291054c060530c3803935c45e01cc583344a3cf88126553c0cf8a45c05a","schema_version":"1.0","event_id":"sha256:2112d291054c060530c3803935c45e01cc583344a3cf88126553c0cf8a45c05a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EX5CXFYUE66KNHBSBGX4O5KLZP/bundle.json","state_url":"https://pith.science/pith/EX5CXFYUE66KNHBSBGX4O5KLZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EX5CXFYUE66KNHBSBGX4O5KLZP/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-30T08:13:44Z","links":{"resolver":"https://pith.science/pith/EX5CXFYUE66KNHBSBGX4O5KLZP","bundle":"https://pith.science/pith/EX5CXFYUE66KNHBSBGX4O5KLZP/bundle.json","state":"https://pith.science/pith/EX5CXFYUE66KNHBSBGX4O5KLZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EX5CXFYUE66KNHBSBGX4O5KLZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EX5CXFYUE66KNHBSBGX4O5KLZP","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":"95be2dfb0f4d1fbcf8c1b375e04f46666592e813e02338f13d049d1e762121fd","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-07T10:35:12Z","title_canon_sha256":"d59ac477d3fb2ca1e3b12a60630d2b2e67d70782f14f5dc179984c03e6c0641d"},"schema_version":"1.0","source":{"id":"1303.1640","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1640","created_at":"2026-05-18T03:31:42Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1640v1","created_at":"2026-05-18T03:31:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1640","created_at":"2026-05-18T03:31:42Z"},{"alias_kind":"pith_short_12","alias_value":"EX5CXFYUE66K","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EX5CXFYUE66KNHBS","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EX5CXFYU","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:2112d291054c060530c3803935c45e01cc583344a3cf88126553c0cf8a45c05a","target":"graph","created_at":"2026-05-18T03:31:42Z","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":"We introduce and study the problem \\mpd, which asks for two planar graphs $G_1$ and $G_2$ whether $G_1$ can be embedded such that its dual is isomorphic to $G_2$. Our algorithmic main result is an NP-completeness proof for the general case and a linear-time algorithm for biconnected graphs. To shed light onto the combinatorial structure of the duals of a planar graph, we consider the \\emph{common dual relation} $\\sim$, where $G_1 \\sim G_2$ if and only if they have a common dual. While $\\sim$ is generally not transitive, we show that the restriction to biconnected graphs is an equivalence relat","authors_text":"Ignaz Rutter, Patrizio Angelini, Thomas Bl\\\"asius","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-07T10:35:12Z","title":"Testing Mutual Duality of Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1640","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:11c5839d7a97ba2fdd983fce74d525513e1ef1134289dacfa9a3ebbe211907b1","target":"record","created_at":"2026-05-18T03:31:42Z","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":"95be2dfb0f4d1fbcf8c1b375e04f46666592e813e02338f13d049d1e762121fd","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-07T10:35:12Z","title_canon_sha256":"d59ac477d3fb2ca1e3b12a60630d2b2e67d70782f14f5dc179984c03e6c0641d"},"schema_version":"1.0","source":{"id":"1303.1640","kind":"arxiv","version":1}},"canonical_sha256":"25fa2b971427bca69c3209afc7754bcbf3136b0f329dc51e79189e2773e46801","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25fa2b971427bca69c3209afc7754bcbf3136b0f329dc51e79189e2773e46801","first_computed_at":"2026-05-18T03:31:42.104615Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:42.104615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NcsqiM3FTCHmlI3iFoLqZA4H/o2CQh99Sa+Zrn2kFUhfixAtBL5aSnwJ8mc40f8jj71KjShU+MmBb0dJBQ53DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:42.105243Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.1640","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11c5839d7a97ba2fdd983fce74d525513e1ef1134289dacfa9a3ebbe211907b1","sha256:2112d291054c060530c3803935c45e01cc583344a3cf88126553c0cf8a45c05a"],"state_sha256":"fc7424d95109a3f913ebd788fd416bb274f672a49853a04870efbf36d94dc645"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+AN1u2X7u8QG8Prh+RKqbDhyMcNt76Il3KgII9x7r8B0kqmrL+NNc7JFxUKA7oIWgkdh5umlU5ecGoEbao16Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:13:44.817887Z","bundle_sha256":"549bc7c2d836cfbfff71c241d38b5093219152e825849e8002d4ee0dad318e7f"}}