{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LKTQUTWNDXFFLONX2HO7S6BO6X","short_pith_number":"pith:LKTQUTWN","schema_version":"1.0","canonical_sha256":"5aa70a4ecd1dca55b9b7d1ddf9782ef5f538e1ee5065962f3ab758d61325969f","source":{"kind":"arxiv","id":"1702.05633","version":1},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for Independence and Domination on B$_1$-VPG and B$_1$-EPG Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Saeed Mehrabi","submitted_at":"2017-02-18T17:02:58Z","abstract_excerpt":"A graph $G$ is called B$_k$-VPG (resp., B$_k$-EPG), for some constant $k\\geq 0$, if it has a string representation on a grid such that each vertex is an orthogonal path with at most $k$ bends and two vertices are adjacent in $G$ if and only if the corresponding strings intersect (resp., the corresponding strings share at least one grid edge). If two adjacent strings of a B$_k$-VPG graph intersect exactly once, then the graph is called a one-string B$_k$-VPG graph.\n  In this paper, we study the Maximum Independent Set and Minimum Dominating Set problems on B$_1$-VPG and B$_1$-EPG graphs. We fir"},"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":"1702.05633","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-18T17:02:58Z","cross_cats_sorted":[],"title_canon_sha256":"2cd1b42abbe62872fa8be63a95a49b1e653f63ed07a666fec922484b3077f9c1","abstract_canon_sha256":"41c06e4f62c1604526488d205b66d800fc5d413b519f17c13007a0c9c4cc9bdf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:30.166875Z","signature_b64":"4Or8ytC8IxVuWExog8HzKYcowHdpwcVh6tgYMOknUat4MXwnkX5L/fF/KQA7HitLclXWiojkPz9JpGPczYIeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5aa70a4ecd1dca55b9b7d1ddf9782ef5f538e1ee5065962f3ab758d61325969f","last_reissued_at":"2026-05-18T00:50:30.166379Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:30.166379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Independence and Domination on B$_1$-VPG and B$_1$-EPG Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Saeed Mehrabi","submitted_at":"2017-02-18T17:02:58Z","abstract_excerpt":"A graph $G$ is called B$_k$-VPG (resp., B$_k$-EPG), for some constant $k\\geq 0$, if it has a string representation on a grid such that each vertex is an orthogonal path with at most $k$ bends and two vertices are adjacent in $G$ if and only if the corresponding strings intersect (resp., the corresponding strings share at least one grid edge). If two adjacent strings of a B$_k$-VPG graph intersect exactly once, then the graph is called a one-string B$_k$-VPG graph.\n  In this paper, we study the Maximum Independent Set and Minimum Dominating Set problems on B$_1$-VPG and B$_1$-EPG graphs. We fir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05633","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":"1702.05633","created_at":"2026-05-18T00:50:30.166447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.05633v1","created_at":"2026-05-18T00:50:30.166447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05633","created_at":"2026-05-18T00:50:30.166447+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKTQUTWNDXFF","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKTQUTWNDXFFLONX","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKTQUTWN","created_at":"2026-05-18T12:31:28.150371+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/LKTQUTWNDXFFLONX2HO7S6BO6X","json":"https://pith.science/pith/LKTQUTWNDXFFLONX2HO7S6BO6X.json","graph_json":"https://pith.science/api/pith-number/LKTQUTWNDXFFLONX2HO7S6BO6X/graph.json","events_json":"https://pith.science/api/pith-number/LKTQUTWNDXFFLONX2HO7S6BO6X/events.json","paper":"https://pith.science/paper/LKTQUTWN"},"agent_actions":{"view_html":"https://pith.science/pith/LKTQUTWNDXFFLONX2HO7S6BO6X","download_json":"https://pith.science/pith/LKTQUTWNDXFFLONX2HO7S6BO6X.json","view_paper":"https://pith.science/paper/LKTQUTWN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.05633&json=true","fetch_graph":"https://pith.science/api/pith-number/LKTQUTWNDXFFLONX2HO7S6BO6X/graph.json","fetch_events":"https://pith.science/api/pith-number/LKTQUTWNDXFFLONX2HO7S6BO6X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKTQUTWNDXFFLONX2HO7S6BO6X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKTQUTWNDXFFLONX2HO7S6BO6X/action/storage_attestation","attest_author":"https://pith.science/pith/LKTQUTWNDXFFLONX2HO7S6BO6X/action/author_attestation","sign_citation":"https://pith.science/pith/LKTQUTWNDXFFLONX2HO7S6BO6X/action/citation_signature","submit_replication":"https://pith.science/pith/LKTQUTWNDXFFLONX2HO7S6BO6X/action/replication_record"}},"created_at":"2026-05-18T00:50:30.166447+00:00","updated_at":"2026-05-18T00:50:30.166447+00:00"}