{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LKTQUTWNDXFFLONX2HO7S6BO6X","short_pith_number":"pith:LKTQUTWN","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"},"canonical_sha256":"5aa70a4ecd1dca55b9b7d1ddf9782ef5f538e1ee5065962f3ab758d61325969f","source":{"kind":"arxiv","id":"1702.05633","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05633","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05633v1","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05633","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"pith_short_12","alias_value":"LKTQUTWNDXFF","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LKTQUTWNDXFFLONX","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LKTQUTWN","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LKTQUTWNDXFFLONX2HO7S6BO6X","target":"record","payload":{"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"},"canonical_sha256":"5aa70a4ecd1dca55b9b7d1ddf9782ef5f538e1ee5065962f3ab758d61325969f","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"},"source_kind":"arxiv","source_id":"1702.05633","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xjgQUTvnZIrqGO5HF89FbkDvc9U/GQCeriG43nWbIbQ+r0OZeENaQ+myomVSbMDNoAq4vwoRrHy9dGVcQXbgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:30:34.482613Z"},"content_sha256":"871312c2e4893a55a75783820707abd7e14876ed5702b3cbe0665b6e3e2b0f74","schema_version":"1.0","event_id":"sha256:871312c2e4893a55a75783820707abd7e14876ed5702b3cbe0665b6e3e2b0f74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LKTQUTWNDXFFLONX2HO7S6BO6X","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1O4zWe0orxbP4TU4HNR7aFDYVDvQ48NlUoUJRT62Sx5KJrLOOXwR4W1Q/SMhnjA3tBGsn/BtKhfWALEmAbL1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:30:34.482956Z"},"content_sha256":"e7e6bf4a5c246b0617cf12e19dd56fd17ac79261177b68ca166b75f0dc2f213c","schema_version":"1.0","event_id":"sha256:e7e6bf4a5c246b0617cf12e19dd56fd17ac79261177b68ca166b75f0dc2f213c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LKTQUTWNDXFFLONX2HO7S6BO6X/bundle.json","state_url":"https://pith.science/pith/LKTQUTWNDXFFLONX2HO7S6BO6X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LKTQUTWNDXFFLONX2HO7S6BO6X/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-21T20:30:34Z","links":{"resolver":"https://pith.science/pith/LKTQUTWNDXFFLONX2HO7S6BO6X","bundle":"https://pith.science/pith/LKTQUTWNDXFFLONX2HO7S6BO6X/bundle.json","state":"https://pith.science/pith/LKTQUTWNDXFFLONX2HO7S6BO6X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LKTQUTWNDXFFLONX2HO7S6BO6X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LKTQUTWNDXFFLONX2HO7S6BO6X","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"41c06e4f62c1604526488d205b66d800fc5d413b519f17c13007a0c9c4cc9bdf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-18T17:02:58Z","title_canon_sha256":"2cd1b42abbe62872fa8be63a95a49b1e653f63ed07a666fec922484b3077f9c1"},"schema_version":"1.0","source":{"id":"1702.05633","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.05633","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"arxiv_version","alias_value":"1702.05633v1","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.05633","created_at":"2026-05-18T00:50:30Z"},{"alias_kind":"pith_short_12","alias_value":"LKTQUTWNDXFF","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LKTQUTWNDXFFLONX","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LKTQUTWN","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:e7e6bf4a5c246b0617cf12e19dd56fd17ac79261177b68ca166b75f0dc2f213c","target":"graph","created_at":"2026-05-18T00:50:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Saeed Mehrabi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-18T17:02:58Z","title":"Approximation Algorithms for Independence and Domination on B$_1$-VPG and B$_1$-EPG Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.05633","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:871312c2e4893a55a75783820707abd7e14876ed5702b3cbe0665b6e3e2b0f74","target":"record","created_at":"2026-05-18T00:50:30Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"41c06e4f62c1604526488d205b66d800fc5d413b519f17c13007a0c9c4cc9bdf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-02-18T17:02:58Z","title_canon_sha256":"2cd1b42abbe62872fa8be63a95a49b1e653f63ed07a666fec922484b3077f9c1"},"schema_version":"1.0","source":{"id":"1702.05633","kind":"arxiv","version":1}},"canonical_sha256":"5aa70a4ecd1dca55b9b7d1ddf9782ef5f538e1ee5065962f3ab758d61325969f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5aa70a4ecd1dca55b9b7d1ddf9782ef5f538e1ee5065962f3ab758d61325969f","first_computed_at":"2026-05-18T00:50:30.166379Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:30.166379Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Or8ytC8IxVuWExog8HzKYcowHdpwcVh6tgYMOknUat4MXwnkX5L/fF/KQA7HitLclXWiojkPz9JpGPczYIeBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:30.166875Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.05633","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:871312c2e4893a55a75783820707abd7e14876ed5702b3cbe0665b6e3e2b0f74","sha256:e7e6bf4a5c246b0617cf12e19dd56fd17ac79261177b68ca166b75f0dc2f213c"],"state_sha256":"a97d7d7b86c99ca99175f7c531bf9d47bc73e2fa749c1cce64a634921b2eff5f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ei1ocdZhQVes8AWf7qlu1XxikgoZ1f12bCYSqiIN2Xx+vRqOJL7glV0wOXlQDiDyVrkdi0q9nQY/JX4D/fgoCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T20:30:34.484885Z","bundle_sha256":"6aa6fd08d4fbc7f14cac204455de92825cbf203a8b042ba34ce0db02ec3fd029"}}