{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:E4ODW4O2MEOECFV4XWDMJSFB7K","short_pith_number":"pith:E4ODW4O2","schema_version":"1.0","canonical_sha256":"271c3b71da611c4116bcbd86c4c8a1faa4cf91e8a329fab7c90528009b7196bb","source":{"kind":"arxiv","id":"1612.07276","version":1},"attestation_state":"computed","paper":{"title":"Splitting $B_2$-VPG graphs into outer-string and co-comparability 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":"2016-12-21T18:58:17Z","abstract_excerpt":"In this paper, we show that any $B_2$-VPG graph (i.e., an intersection graph of orthogonal curves with at most 2 bends) can be decomposed into $O(\\log n)$ outerstring graphs or $O(\\log^3 n)$ permutation graphs. This leads to better approximation algorithms for hereditary graph problems, such as independent set, clique and clique cover, on $B_2$-VPG graphs."},"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":"1612.07276","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-12-21T18:58:17Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ef29260ed1efb03636d8410a9ad6a8fdac47a834ff0a64dcd631eba609044b40","abstract_canon_sha256":"b586d617b54e242bf4271559a4420c7ac9626cccdc66ce6012cea9b9036199db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:14.343275Z","signature_b64":"2hv+64ORhfZc5Rn6uklJcYXr6/bRof99ksozTlDzyX5rAbaRByMEXIoBTsiCgm+QirJXPjcJHdboCuxlNb1uBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"271c3b71da611c4116bcbd86c4c8a1faa4cf91e8a329fab7c90528009b7196bb","last_reissued_at":"2026-05-18T00:54:14.342876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:14.342876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Splitting $B_2$-VPG graphs into outer-string and co-comparability 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":"2016-12-21T18:58:17Z","abstract_excerpt":"In this paper, we show that any $B_2$-VPG graph (i.e., an intersection graph of orthogonal curves with at most 2 bends) can be decomposed into $O(\\log n)$ outerstring graphs or $O(\\log^3 n)$ permutation graphs. This leads to better approximation algorithms for hereditary graph problems, such as independent set, clique and clique cover, on $B_2$-VPG graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07276","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":"1612.07276","created_at":"2026-05-18T00:54:14.342933+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.07276v1","created_at":"2026-05-18T00:54:14.342933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07276","created_at":"2026-05-18T00:54:14.342933+00:00"},{"alias_kind":"pith_short_12","alias_value":"E4ODW4O2MEOE","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"E4ODW4O2MEOECFV4","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"E4ODW4O2","created_at":"2026-05-18T12:30:12.583610+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/E4ODW4O2MEOECFV4XWDMJSFB7K","json":"https://pith.science/pith/E4ODW4O2MEOECFV4XWDMJSFB7K.json","graph_json":"https://pith.science/api/pith-number/E4ODW4O2MEOECFV4XWDMJSFB7K/graph.json","events_json":"https://pith.science/api/pith-number/E4ODW4O2MEOECFV4XWDMJSFB7K/events.json","paper":"https://pith.science/paper/E4ODW4O2"},"agent_actions":{"view_html":"https://pith.science/pith/E4ODW4O2MEOECFV4XWDMJSFB7K","download_json":"https://pith.science/pith/E4ODW4O2MEOECFV4XWDMJSFB7K.json","view_paper":"https://pith.science/paper/E4ODW4O2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.07276&json=true","fetch_graph":"https://pith.science/api/pith-number/E4ODW4O2MEOECFV4XWDMJSFB7K/graph.json","fetch_events":"https://pith.science/api/pith-number/E4ODW4O2MEOECFV4XWDMJSFB7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E4ODW4O2MEOECFV4XWDMJSFB7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E4ODW4O2MEOECFV4XWDMJSFB7K/action/storage_attestation","attest_author":"https://pith.science/pith/E4ODW4O2MEOECFV4XWDMJSFB7K/action/author_attestation","sign_citation":"https://pith.science/pith/E4ODW4O2MEOECFV4XWDMJSFB7K/action/citation_signature","submit_replication":"https://pith.science/pith/E4ODW4O2MEOECFV4XWDMJSFB7K/action/replication_record"}},"created_at":"2026-05-18T00:54:14.342933+00:00","updated_at":"2026-05-18T00:54:14.342933+00:00"}