{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BQKJSYSJN7PPNYJE44XBW7AZ6N","short_pith_number":"pith:BQKJSYSJ","schema_version":"1.0","canonical_sha256":"0c149962496fdef6e124e72e1b7c19f36ad5d6d6180f2a44506ce41febb42bc5","source":{"kind":"arxiv","id":"1308.6778","version":2},"attestation_state":"computed","paper":{"title":"Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Benjamin Niedermann, Ignaz Rutter, Martin N\\\"ollenburg, Roman Prutkin, Therese Biedl, Thomas Bl\\\"asius","submitted_at":"2013-08-30T15:46:54Z","abstract_excerpt":"We present a simple and versatile formulation of grid-based graph representation problems as an integer linear program (ILP) and a corresponding SAT instance. In a grid-based representation vertices and edges correspond to axis-parallel boxes on an underlying integer grid; boxes can be further constrained in their shapes and interactions by additional problem-specific constraints. We describe a general d-dimensional model for grid representation problems. This model can be used to solve a variety of NP-hard graph problems, including pathwidth, bandwidth, optimum st-orientation, area-minimal (b"},"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":"1308.6778","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-30T15:46:54Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"66b44533947cf2e56cd58d365e92a14b9f19b04ccc9314b7218d39a8e08522e9","abstract_canon_sha256":"a62c12e54a86501375eeaa4ee3d5ae3c0affb6d873f487a0e07748e512b8ccad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:05.803953Z","signature_b64":"D3YZG7rmE7AJO2lo2ZSAGfvCOl8id/5xoKWWWf4kjehX/ncs8yTenvVwll8jtn/hLqzcEwj5OSoXA/l0BCjxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c149962496fdef6e124e72e1b7c19f36ad5d6d6180f2a44506ce41febb42bc5","last_reissued_at":"2026-05-18T02:27:05.803182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:05.803182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Benjamin Niedermann, Ignaz Rutter, Martin N\\\"ollenburg, Roman Prutkin, Therese Biedl, Thomas Bl\\\"asius","submitted_at":"2013-08-30T15:46:54Z","abstract_excerpt":"We present a simple and versatile formulation of grid-based graph representation problems as an integer linear program (ILP) and a corresponding SAT instance. In a grid-based representation vertices and edges correspond to axis-parallel boxes on an underlying integer grid; boxes can be further constrained in their shapes and interactions by additional problem-specific constraints. We describe a general d-dimensional model for grid representation problems. This model can be used to solve a variety of NP-hard graph problems, including pathwidth, bandwidth, optimum st-orientation, area-minimal (b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6778","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.6778","created_at":"2026-05-18T02:27:05.803336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.6778v2","created_at":"2026-05-18T02:27:05.803336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6778","created_at":"2026-05-18T02:27:05.803336+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQKJSYSJN7PP","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQKJSYSJN7PPNYJE","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQKJSYSJ","created_at":"2026-05-18T12:27:40.988391+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/BQKJSYSJN7PPNYJE44XBW7AZ6N","json":"https://pith.science/pith/BQKJSYSJN7PPNYJE44XBW7AZ6N.json","graph_json":"https://pith.science/api/pith-number/BQKJSYSJN7PPNYJE44XBW7AZ6N/graph.json","events_json":"https://pith.science/api/pith-number/BQKJSYSJN7PPNYJE44XBW7AZ6N/events.json","paper":"https://pith.science/paper/BQKJSYSJ"},"agent_actions":{"view_html":"https://pith.science/pith/BQKJSYSJN7PPNYJE44XBW7AZ6N","download_json":"https://pith.science/pith/BQKJSYSJN7PPNYJE44XBW7AZ6N.json","view_paper":"https://pith.science/paper/BQKJSYSJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.6778&json=true","fetch_graph":"https://pith.science/api/pith-number/BQKJSYSJN7PPNYJE44XBW7AZ6N/graph.json","fetch_events":"https://pith.science/api/pith-number/BQKJSYSJN7PPNYJE44XBW7AZ6N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQKJSYSJN7PPNYJE44XBW7AZ6N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQKJSYSJN7PPNYJE44XBW7AZ6N/action/storage_attestation","attest_author":"https://pith.science/pith/BQKJSYSJN7PPNYJE44XBW7AZ6N/action/author_attestation","sign_citation":"https://pith.science/pith/BQKJSYSJN7PPNYJE44XBW7AZ6N/action/citation_signature","submit_replication":"https://pith.science/pith/BQKJSYSJN7PPNYJE44XBW7AZ6N/action/replication_record"}},"created_at":"2026-05-18T02:27:05.803336+00:00","updated_at":"2026-05-18T02:27:05.803336+00:00"}