{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WXTXIUWSSQOPSEEJT3R5ACRDOB","short_pith_number":"pith:WXTXIUWS","schema_version":"1.0","canonical_sha256":"b5e77452d2941cf910899ee3d00a23705df5d26beadd98d42d9ffb968bcb3698","source":{"kind":"arxiv","id":"1308.3370","version":1},"attestation_state":"computed","paper":{"title":"Drawing Planar Graphs with a Prescribed Inner Face","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Ignaz Rutter, Martin N\\\"ollenburg, Tamara Mchedlidze","submitted_at":"2013-08-15T12:07:03Z","abstract_excerpt":"Given a plane graph $G$ (i.e., a planar graph with a fixed planar embedding) and a simple cycle $C$ in $G$ whose vertices are mapped to a convex polygon, we consider the question whether this drawing can be extended to a planar straight-line drawing of $G$. We characterize when this is possible in terms of simple necessary conditions, which we prove to be sufficient. This also leads to a linear-time testing algorithm. If a drawing extension exists, it can be computed in the same running time."},"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":"1308.3370","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-15T12:07:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"99feea94ab483fc96ecb2731bb25842db8303db71205f12f5850a207706be980","abstract_canon_sha256":"6dc76f5c38345c1a0405db27be2d3a045e4f752b989340b1c58c382c5d403c55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:54.828610Z","signature_b64":"EFmcBPGP7VBQUzcbXy64J1aXUsMF4F21IyeeXEpKIVDpqs/W5nNAKv8G2c1S332ZOKuhjOmX6mdOGyz7OS/YBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5e77452d2941cf910899ee3d00a23705df5d26beadd98d42d9ffb968bcb3698","last_reissued_at":"2026-05-18T03:15:54.827848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:54.827848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Drawing Planar Graphs with a Prescribed Inner Face","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Ignaz Rutter, Martin N\\\"ollenburg, Tamara Mchedlidze","submitted_at":"2013-08-15T12:07:03Z","abstract_excerpt":"Given a plane graph $G$ (i.e., a planar graph with a fixed planar embedding) and a simple cycle $C$ in $G$ whose vertices are mapped to a convex polygon, we consider the question whether this drawing can be extended to a planar straight-line drawing of $G$. We characterize when this is possible in terms of simple necessary conditions, which we prove to be sufficient. This also leads to a linear-time testing algorithm. If a drawing extension exists, it can be computed in the same running time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3370","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.3370","created_at":"2026-05-18T03:15:54.827990+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.3370v1","created_at":"2026-05-18T03:15:54.827990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3370","created_at":"2026-05-18T03:15:54.827990+00:00"},{"alias_kind":"pith_short_12","alias_value":"WXTXIUWSSQOP","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"WXTXIUWSSQOPSEEJ","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"WXTXIUWS","created_at":"2026-05-18T12:28:06.772260+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/WXTXIUWSSQOPSEEJT3R5ACRDOB","json":"https://pith.science/pith/WXTXIUWSSQOPSEEJT3R5ACRDOB.json","graph_json":"https://pith.science/api/pith-number/WXTXIUWSSQOPSEEJT3R5ACRDOB/graph.json","events_json":"https://pith.science/api/pith-number/WXTXIUWSSQOPSEEJT3R5ACRDOB/events.json","paper":"https://pith.science/paper/WXTXIUWS"},"agent_actions":{"view_html":"https://pith.science/pith/WXTXIUWSSQOPSEEJT3R5ACRDOB","download_json":"https://pith.science/pith/WXTXIUWSSQOPSEEJT3R5ACRDOB.json","view_paper":"https://pith.science/paper/WXTXIUWS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.3370&json=true","fetch_graph":"https://pith.science/api/pith-number/WXTXIUWSSQOPSEEJT3R5ACRDOB/graph.json","fetch_events":"https://pith.science/api/pith-number/WXTXIUWSSQOPSEEJT3R5ACRDOB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WXTXIUWSSQOPSEEJT3R5ACRDOB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WXTXIUWSSQOPSEEJT3R5ACRDOB/action/storage_attestation","attest_author":"https://pith.science/pith/WXTXIUWSSQOPSEEJT3R5ACRDOB/action/author_attestation","sign_citation":"https://pith.science/pith/WXTXIUWSSQOPSEEJT3R5ACRDOB/action/citation_signature","submit_replication":"https://pith.science/pith/WXTXIUWSSQOPSEEJT3R5ACRDOB/action/replication_record"}},"created_at":"2026-05-18T03:15:54.827990+00:00","updated_at":"2026-05-18T03:15:54.827990+00:00"}