{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TAO763TBZ77VVKLBLCGH7IVV3N","short_pith_number":"pith:TAO763TB","schema_version":"1.0","canonical_sha256":"981dff6e61cfff5aa961588c7fa2b5db60a4b441a471c906f773ebfbffa32a06","source":{"kind":"arxiv","id":"1411.7277","version":2},"attestation_state":"computed","paper":{"title":"$1$-String $B_2$-VPG Representation of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Martin Derka, Therese Biedl","submitted_at":"2014-11-26T15:59:43Z","abstract_excerpt":"In this paper, we prove that every planar graph has a 1-string $B_2$-VPG representation---a string representation using paths in a rectangular grid that contain at most two bends. Furthermore, two paths representing vertices $u,v$ intersect precisely once whenever there is an edge between $u$ and $v$."},"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":"1411.7277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-11-26T15:59:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c1e529711aa046629bcc75dce1e9ec52eb38fb72aee37393567801e1f5bf432a","abstract_canon_sha256":"d825c2dd7799d9240eef6789b97240ba4f6da57802755b551417ab7aa3a14123"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:24.686219Z","signature_b64":"wOHgFvoU9/BqJAeXdVKkJ1jydsoJxkPs9RMWRDAXF9cR5eEwfvV+WT9A0onEEEy+muKZ3sm7fUkzAqA4JqNfBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"981dff6e61cfff5aa961588c7fa2b5db60a4b441a471c906f773ebfbffa32a06","last_reissued_at":"2026-05-18T01:25:24.685779Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:24.685779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$1$-String $B_2$-VPG Representation of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Martin Derka, Therese Biedl","submitted_at":"2014-11-26T15:59:43Z","abstract_excerpt":"In this paper, we prove that every planar graph has a 1-string $B_2$-VPG representation---a string representation using paths in a rectangular grid that contain at most two bends. Furthermore, two paths representing vertices $u,v$ intersect precisely once whenever there is an edge between $u$ and $v$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7277","kind":"arxiv","version":2},"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":"1411.7277","created_at":"2026-05-18T01:25:24.685850+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.7277v2","created_at":"2026-05-18T01:25:24.685850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7277","created_at":"2026-05-18T01:25:24.685850+00:00"},{"alias_kind":"pith_short_12","alias_value":"TAO763TBZ77V","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TAO763TBZ77VVKLB","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TAO763TB","created_at":"2026-05-18T12:28:49.207871+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/TAO763TBZ77VVKLBLCGH7IVV3N","json":"https://pith.science/pith/TAO763TBZ77VVKLBLCGH7IVV3N.json","graph_json":"https://pith.science/api/pith-number/TAO763TBZ77VVKLBLCGH7IVV3N/graph.json","events_json":"https://pith.science/api/pith-number/TAO763TBZ77VVKLBLCGH7IVV3N/events.json","paper":"https://pith.science/paper/TAO763TB"},"agent_actions":{"view_html":"https://pith.science/pith/TAO763TBZ77VVKLBLCGH7IVV3N","download_json":"https://pith.science/pith/TAO763TBZ77VVKLBLCGH7IVV3N.json","view_paper":"https://pith.science/paper/TAO763TB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.7277&json=true","fetch_graph":"https://pith.science/api/pith-number/TAO763TBZ77VVKLBLCGH7IVV3N/graph.json","fetch_events":"https://pith.science/api/pith-number/TAO763TBZ77VVKLBLCGH7IVV3N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TAO763TBZ77VVKLBLCGH7IVV3N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TAO763TBZ77VVKLBLCGH7IVV3N/action/storage_attestation","attest_author":"https://pith.science/pith/TAO763TBZ77VVKLBLCGH7IVV3N/action/author_attestation","sign_citation":"https://pith.science/pith/TAO763TBZ77VVKLBLCGH7IVV3N/action/citation_signature","submit_replication":"https://pith.science/pith/TAO763TBZ77VVKLBLCGH7IVV3N/action/replication_record"}},"created_at":"2026-05-18T01:25:24.685850+00:00","updated_at":"2026-05-18T01:25:24.685850+00:00"}