{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ULG3OU3DJLTUXI7DI5HOH6NNSI","short_pith_number":"pith:ULG3OU3D","canonical_record":{"source":{"id":"1708.09314","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-30T15:06:28Z","cross_cats_sorted":[],"title_canon_sha256":"40f4ebca8b137c0bc5384511237f21a3336f2e3a260631bf169e7f4672f3c168","abstract_canon_sha256":"c1a73d3c11057ba0defc06a2230e38b9b1187dde72434760f80ec987210ca56f"},"schema_version":"1.0"},"canonical_sha256":"a2cdb753634ae74ba3e3474ee3f9ad921aea7f3802455b70e45acf8e86c9ebc4","source":{"kind":"arxiv","id":"1708.09314","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09314","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09314v2","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09314","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"ULG3OU3DJLTU","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"ULG3OU3DJLTUXI7D","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"ULG3OU3D","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ULG3OU3DJLTUXI7DI5HOH6NNSI","target":"record","payload":{"canonical_record":{"source":{"id":"1708.09314","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-30T15:06:28Z","cross_cats_sorted":[],"title_canon_sha256":"40f4ebca8b137c0bc5384511237f21a3336f2e3a260631bf169e7f4672f3c168","abstract_canon_sha256":"c1a73d3c11057ba0defc06a2230e38b9b1187dde72434760f80ec987210ca56f"},"schema_version":"1.0"},"canonical_sha256":"a2cdb753634ae74ba3e3474ee3f9ad921aea7f3802455b70e45acf8e86c9ebc4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:20.832236Z","signature_b64":"NdVcuW7sJ42WKbZcKOA90bdbrWfwwaM6TpRaoG2gSVPWlzq3ScTnGHlmqdLhmy4Mzj8z7yuw9eTpeM6gMqdEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2cdb753634ae74ba3e3474ee3f9ad921aea7f3802455b70e45acf8e86c9ebc4","last_reissued_at":"2026-05-18T00:06:20.831752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:20.831752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.09314","source_version":2,"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:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TWQ8RL9wJ6GqXNmQfGMT7THrEgpIbR2sxRZV8KTrfSGhnT3SzVAUlF60blV3XlMvC+dr56a+UnLbC/zSvnJ5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:15:05.855475Z"},"content_sha256":"40433cd381696a6e82f7a52b90aaa8f3afba11f1deeafcc8255066ce28c80980","schema_version":"1.0","event_id":"sha256:40433cd381696a6e82f7a52b90aaa8f3afba11f1deeafcc8255066ce28c80980"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ULG3OU3DJLTUXI7DI5HOH6NNSI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on Approximating Weighted Independence on Intersection Graphs of Paths on a Grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Saeed Mehrabi","submitted_at":"2017-08-30T15:06:28Z","abstract_excerpt":"A graph $G$ is called $B_k$-VPG, for some constant $k\\geq 0$, if it has a string representation on an axis-parallel grid such that each vertex is a path with at most $k$ bends and two vertices are adjacent in $G$ if and only if the corresponding paths intersect each other. The part of a path that is between two consecutive bends is called a segment of the path. In this paper, we study the Maximum-Weighted Independent Set problem on $B_k$-VPG graphs. The problem is known to be NP-complete on $B_1$-VPG graphs, even when the two segments of every path have unit length [12], and $O(\\log n)$-approx"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09314","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"},"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:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bo8hRRIJ8cWYmYx2QyYje93s9dAwSq8kBddm9W+fZzZu3U49q9WnmVSg5ckfZLfokK0lau4jP2oqQlDa4hH5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T20:15:05.855815Z"},"content_sha256":"2f75770d5ed5ec165abf43e1f6fdda6813425293577c73f7b2ab76d45e40a91d","schema_version":"1.0","event_id":"sha256:2f75770d5ed5ec165abf43e1f6fdda6813425293577c73f7b2ab76d45e40a91d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ULG3OU3DJLTUXI7DI5HOH6NNSI/bundle.json","state_url":"https://pith.science/pith/ULG3OU3DJLTUXI7DI5HOH6NNSI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ULG3OU3DJLTUXI7DI5HOH6NNSI/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:15:05Z","links":{"resolver":"https://pith.science/pith/ULG3OU3DJLTUXI7DI5HOH6NNSI","bundle":"https://pith.science/pith/ULG3OU3DJLTUXI7DI5HOH6NNSI/bundle.json","state":"https://pith.science/pith/ULG3OU3DJLTUXI7DI5HOH6NNSI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ULG3OU3DJLTUXI7DI5HOH6NNSI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ULG3OU3DJLTUXI7DI5HOH6NNSI","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":"c1a73d3c11057ba0defc06a2230e38b9b1187dde72434760f80ec987210ca56f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-30T15:06:28Z","title_canon_sha256":"40f4ebca8b137c0bc5384511237f21a3336f2e3a260631bf169e7f4672f3c168"},"schema_version":"1.0","source":{"id":"1708.09314","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09314","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09314v2","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09314","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"ULG3OU3DJLTU","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"ULG3OU3DJLTUXI7D","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"ULG3OU3D","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:2f75770d5ed5ec165abf43e1f6fdda6813425293577c73f7b2ab76d45e40a91d","target":"graph","created_at":"2026-05-18T00:06:20Z","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, for some constant $k\\geq 0$, if it has a string representation on an axis-parallel grid such that each vertex is a path with at most $k$ bends and two vertices are adjacent in $G$ if and only if the corresponding paths intersect each other. The part of a path that is between two consecutive bends is called a segment of the path. In this paper, we study the Maximum-Weighted Independent Set problem on $B_k$-VPG graphs. The problem is known to be NP-complete on $B_1$-VPG graphs, even when the two segments of every path have unit length [12], and $O(\\log n)$-approx","authors_text":"Saeed Mehrabi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-30T15:06:28Z","title":"A Note on Approximating Weighted Independence on Intersection Graphs of Paths on a Grid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09314","kind":"arxiv","version":2},"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:40433cd381696a6e82f7a52b90aaa8f3afba11f1deeafcc8255066ce28c80980","target":"record","created_at":"2026-05-18T00:06:20Z","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":"c1a73d3c11057ba0defc06a2230e38b9b1187dde72434760f80ec987210ca56f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-30T15:06:28Z","title_canon_sha256":"40f4ebca8b137c0bc5384511237f21a3336f2e3a260631bf169e7f4672f3c168"},"schema_version":"1.0","source":{"id":"1708.09314","kind":"arxiv","version":2}},"canonical_sha256":"a2cdb753634ae74ba3e3474ee3f9ad921aea7f3802455b70e45acf8e86c9ebc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2cdb753634ae74ba3e3474ee3f9ad921aea7f3802455b70e45acf8e86c9ebc4","first_computed_at":"2026-05-18T00:06:20.831752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:20.831752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NdVcuW7sJ42WKbZcKOA90bdbrWfwwaM6TpRaoG2gSVPWlzq3ScTnGHlmqdLhmy4Mzj8z7yuw9eTpeM6gMqdEDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:20.832236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09314","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:40433cd381696a6e82f7a52b90aaa8f3afba11f1deeafcc8255066ce28c80980","sha256:2f75770d5ed5ec165abf43e1f6fdda6813425293577c73f7b2ab76d45e40a91d"],"state_sha256":"2bd4c1d95da03441e86893d0c6794825c389058aedcab3bd2842d58f63d0eb9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z9crnYIGxayJZaVXgDbHe5BnNl0Tu+l5FAnT9/HbSG4O92vTXphrbsEnEmljJx6DhwSei8cZglTt0e9w7EyeCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T20:15:05.857774Z","bundle_sha256":"90e868cfe1c6a50c307c22fc6890bc4c3bcac4ed5caca4d550c7b5b5662ac387"}}