{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:7LVX6OBH4MJGYLLA4UJNZYC6C5","short_pith_number":"pith:7LVX6OBH","schema_version":"1.0","canonical_sha256":"faeb7f3827e3126c2d60e512dce05e176030f3a9c593d67531a5edc005c6b204","source":{"kind":"arxiv","id":"1206.5159","version":1},"attestation_state":"computed","paper":{"title":"Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Jan Kratochv\\'il, Steven Chaplick, Tom\\'a\\v{s} Vysko\\v{c}il, V\\'it Jel\\'inek","submitted_at":"2012-06-22T14:28:30Z","abstract_excerpt":"In this paper we study properties of intersection graphs of k-bend paths in the rectangular grid. A k-bend path is a path with at most k 90 degree turns. The class of graphs representable by intersections of k-bend paths is denoted by B_k-VPG. We show here that for every fixed k, B_k-VPG is a proper subset of B_{k+1}-VPG and that recognition of graphs from B_k-VPG is NP-complete even when the input graph is given by a B_{k+1}-VPG representation. We also show that the class B_k-VPG (for k>0) is in no inclusion relation with the class of intersection graphs of straight line segments in the plane"},"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":"1206.5159","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2012-06-22T14:28:30Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"fec47503054ff1bf7909a7ef53ea3f44958671c62f211ac3cc4a4ba1a40ed6c7","abstract_canon_sha256":"9b0bc3096e5a2f3a2ff4cd2c2d3bfe2508de26cbceedad7beeb50cbe9c8c7b07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:52.091986Z","signature_b64":"XSb/T0K9cQozp8hkv4m4R0dHU30mMBmkRDx/jjp97jC5+KWd6lpgwA3jwzUxFpfAIWA/JPd7apWoudnM0HXEBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faeb7f3827e3126c2d60e512dce05e176030f3a9c593d67531a5edc005c6b204","last_reissued_at":"2026-05-18T03:52:52.091264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:52.091264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CG","authors_text":"Jan Kratochv\\'il, Steven Chaplick, Tom\\'a\\v{s} Vysko\\v{c}il, V\\'it Jel\\'inek","submitted_at":"2012-06-22T14:28:30Z","abstract_excerpt":"In this paper we study properties of intersection graphs of k-bend paths in the rectangular grid. A k-bend path is a path with at most k 90 degree turns. The class of graphs representable by intersections of k-bend paths is denoted by B_k-VPG. We show here that for every fixed k, B_k-VPG is a proper subset of B_{k+1}-VPG and that recognition of graphs from B_k-VPG is NP-complete even when the input graph is given by a B_{k+1}-VPG representation. We also show that the class B_k-VPG (for k>0) is in no inclusion relation with the class of intersection graphs of straight line segments in the plane"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5159","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":"1206.5159","created_at":"2026-05-18T03:52:52.091372+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5159v1","created_at":"2026-05-18T03:52:52.091372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5159","created_at":"2026-05-18T03:52:52.091372+00:00"},{"alias_kind":"pith_short_12","alias_value":"7LVX6OBH4MJG","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"7LVX6OBH4MJGYLLA","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"7LVX6OBH","created_at":"2026-05-18T12:26:58.693483+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/7LVX6OBH4MJGYLLA4UJNZYC6C5","json":"https://pith.science/pith/7LVX6OBH4MJGYLLA4UJNZYC6C5.json","graph_json":"https://pith.science/api/pith-number/7LVX6OBH4MJGYLLA4UJNZYC6C5/graph.json","events_json":"https://pith.science/api/pith-number/7LVX6OBH4MJGYLLA4UJNZYC6C5/events.json","paper":"https://pith.science/paper/7LVX6OBH"},"agent_actions":{"view_html":"https://pith.science/pith/7LVX6OBH4MJGYLLA4UJNZYC6C5","download_json":"https://pith.science/pith/7LVX6OBH4MJGYLLA4UJNZYC6C5.json","view_paper":"https://pith.science/paper/7LVX6OBH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5159&json=true","fetch_graph":"https://pith.science/api/pith-number/7LVX6OBH4MJGYLLA4UJNZYC6C5/graph.json","fetch_events":"https://pith.science/api/pith-number/7LVX6OBH4MJGYLLA4UJNZYC6C5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7LVX6OBH4MJGYLLA4UJNZYC6C5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7LVX6OBH4MJGYLLA4UJNZYC6C5/action/storage_attestation","attest_author":"https://pith.science/pith/7LVX6OBH4MJGYLLA4UJNZYC6C5/action/author_attestation","sign_citation":"https://pith.science/pith/7LVX6OBH4MJGYLLA4UJNZYC6C5/action/citation_signature","submit_replication":"https://pith.science/pith/7LVX6OBH4MJGYLLA4UJNZYC6C5/action/replication_record"}},"created_at":"2026-05-18T03:52:52.091372+00:00","updated_at":"2026-05-18T03:52:52.091372+00:00"}