{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JABUH7YRPSVAFMABE7OHFIT7LO","short_pith_number":"pith:JABUH7YR","schema_version":"1.0","canonical_sha256":"480343ff117caa02b00127dc72a27f5b81c063d0e91846bbe0442c00d6303eed","source":{"kind":"arxiv","id":"2410.13536","version":1},"attestation_state":"computed","paper":{"title":"A Simple Partially Embedded Planarity Test Based on Vertex-Addition","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ignaz Rutter, Sandhya T. P, Simon D. Fink","submitted_at":"2024-10-17T13:27:20Z","abstract_excerpt":"In the Partially Embedded Planarity problem, we are given a graph $G$ together with a topological drawing of a subgraph $H$ of $G$. The task is to decide whether the drawing can be extended to a drawing of the whole graph such that no two edges cross. Angelini et al. gave a linear-time algorithm for solving this problem in 2010 (SODA '10). While their paper constitutes a significant result, the algorithm described therein is highly complex: it uses several layers of decompositions according to connectivity of both $G$ and $H$, its description spans more than 30 pages, and can hardly be conside"},"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":"2410.13536","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2024-10-17T13:27:20Z","cross_cats_sorted":[],"title_canon_sha256":"edd84c0cb64a2992c475ff279ac18e401fe999275b79df0c038b48cac42d627e","abstract_canon_sha256":"e041399be29914a16b82eb91c6e1f9669a414dc99da45ce70b00018cf9756454"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:22:02.408335Z","signature_b64":"qhFrUMzXT49YX+TCmqjvFy3GBXz9N0xnI2CYH0NVhfKLCrNhR/h48rJT3Yhyn+drgeYN2TFlNK3jNir+7MmnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"480343ff117caa02b00127dc72a27f5b81c063d0e91846bbe0442c00d6303eed","last_reissued_at":"2026-07-05T09:22:02.407872Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:22:02.407872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Partially Embedded Planarity Test Based on Vertex-Addition","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ignaz Rutter, Sandhya T. P, Simon D. Fink","submitted_at":"2024-10-17T13:27:20Z","abstract_excerpt":"In the Partially Embedded Planarity problem, we are given a graph $G$ together with a topological drawing of a subgraph $H$ of $G$. The task is to decide whether the drawing can be extended to a drawing of the whole graph such that no two edges cross. Angelini et al. gave a linear-time algorithm for solving this problem in 2010 (SODA '10). While their paper constitutes a significant result, the algorithm described therein is highly complex: it uses several layers of decompositions according to connectivity of both $G$ and $H$, its description spans more than 30 pages, and can hardly be conside"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.13536","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/2410.13536/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2410.13536","created_at":"2026-07-05T09:22:02.407929+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.13536v1","created_at":"2026-07-05T09:22:02.407929+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.13536","created_at":"2026-07-05T09:22:02.407929+00:00"},{"alias_kind":"pith_short_12","alias_value":"JABUH7YRPSVA","created_at":"2026-07-05T09:22:02.407929+00:00"},{"alias_kind":"pith_short_16","alias_value":"JABUH7YRPSVAFMAB","created_at":"2026-07-05T09:22:02.407929+00:00"},{"alias_kind":"pith_short_8","alias_value":"JABUH7YR","created_at":"2026-07-05T09:22:02.407929+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/JABUH7YRPSVAFMABE7OHFIT7LO","json":"https://pith.science/pith/JABUH7YRPSVAFMABE7OHFIT7LO.json","graph_json":"https://pith.science/api/pith-number/JABUH7YRPSVAFMABE7OHFIT7LO/graph.json","events_json":"https://pith.science/api/pith-number/JABUH7YRPSVAFMABE7OHFIT7LO/events.json","paper":"https://pith.science/paper/JABUH7YR"},"agent_actions":{"view_html":"https://pith.science/pith/JABUH7YRPSVAFMABE7OHFIT7LO","download_json":"https://pith.science/pith/JABUH7YRPSVAFMABE7OHFIT7LO.json","view_paper":"https://pith.science/paper/JABUH7YR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.13536&json=true","fetch_graph":"https://pith.science/api/pith-number/JABUH7YRPSVAFMABE7OHFIT7LO/graph.json","fetch_events":"https://pith.science/api/pith-number/JABUH7YRPSVAFMABE7OHFIT7LO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JABUH7YRPSVAFMABE7OHFIT7LO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JABUH7YRPSVAFMABE7OHFIT7LO/action/storage_attestation","attest_author":"https://pith.science/pith/JABUH7YRPSVAFMABE7OHFIT7LO/action/author_attestation","sign_citation":"https://pith.science/pith/JABUH7YRPSVAFMABE7OHFIT7LO/action/citation_signature","submit_replication":"https://pith.science/pith/JABUH7YRPSVAFMABE7OHFIT7LO/action/replication_record"}},"created_at":"2026-07-05T09:22:02.407929+00:00","updated_at":"2026-07-05T09:22:02.407929+00:00"}