{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:BQKJSYSJN7PPNYJE44XBW7AZ6N","short_pith_number":"pith:BQKJSYSJ","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"},"canonical_sha256":"0c149962496fdef6e124e72e1b7c19f36ad5d6d6180f2a44506ce41febb42bc5","source":{"kind":"arxiv","id":"1308.6778","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6778","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6778v2","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6778","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"BQKJSYSJN7PP","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BQKJSYSJN7PPNYJE","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BQKJSYSJ","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:BQKJSYSJN7PPNYJE44XBW7AZ6N","target":"record","payload":{"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"},"canonical_sha256":"0c149962496fdef6e124e72e1b7c19f36ad5d6d6180f2a44506ce41febb42bc5","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"},"source_kind":"arxiv","source_id":"1308.6778","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-18T02:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tskRjgtNRPcj3DvPN14dM013/NyrjQV1R+QbtjaszlukKn9QdcZqWFtrquOHUK54ic6p+b3nNr5vbBLr+gIQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:01:57.640917Z"},"content_sha256":"9f1d9ee9404038462f2fa0b24bdd327ea0cddca27c9850adfed6653137e7e7f7","schema_version":"1.0","event_id":"sha256:9f1d9ee9404038462f2fa0b24bdd327ea0cddca27c9850adfed6653137e7e7f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:BQKJSYSJN7PPNYJE44XBW7AZ6N","target":"graph","payload":{"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"},"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-18T02:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JL+8GqcLsdflxBcgrlTZUFMkI/xi1nCPNZlO8Hjc56T/yqlzIe3owEZXVMhJ8EIpEw5wZIbvZI+7mqDs6zOeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:01:57.641558Z"},"content_sha256":"4fa9b208db3ae1dbad2d0d32be7d69ec1cc0621fd146d79f7d8f164fbd878009","schema_version":"1.0","event_id":"sha256:4fa9b208db3ae1dbad2d0d32be7d69ec1cc0621fd146d79f7d8f164fbd878009"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQKJSYSJN7PPNYJE44XBW7AZ6N/bundle.json","state_url":"https://pith.science/pith/BQKJSYSJN7PPNYJE44XBW7AZ6N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQKJSYSJN7PPNYJE44XBW7AZ6N/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-05-27T23:01:57Z","links":{"resolver":"https://pith.science/pith/BQKJSYSJN7PPNYJE44XBW7AZ6N","bundle":"https://pith.science/pith/BQKJSYSJN7PPNYJE44XBW7AZ6N/bundle.json","state":"https://pith.science/pith/BQKJSYSJN7PPNYJE44XBW7AZ6N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQKJSYSJN7PPNYJE44XBW7AZ6N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BQKJSYSJN7PPNYJE44XBW7AZ6N","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":"a62c12e54a86501375eeaa4ee3d5ae3c0affb6d873f487a0e07748e512b8ccad","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-30T15:46:54Z","title_canon_sha256":"66b44533947cf2e56cd58d365e92a14b9f19b04ccc9314b7218d39a8e08522e9"},"schema_version":"1.0","source":{"id":"1308.6778","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6778","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6778v2","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6778","created_at":"2026-05-18T02:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"BQKJSYSJN7PP","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BQKJSYSJN7PPNYJE","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BQKJSYSJ","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:4fa9b208db3ae1dbad2d0d32be7d69ec1cc0621fd146d79f7d8f164fbd878009","target":"graph","created_at":"2026-05-18T02:27:05Z","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":"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","authors_text":"Benjamin Niedermann, Ignaz Rutter, Martin N\\\"ollenburg, Roman Prutkin, Therese Biedl, Thomas Bl\\\"asius","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-30T15:46:54Z","title":"Using ILP/SAT to determine pathwidth, visibility representations, and other grid-based graph drawings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6778","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:9f1d9ee9404038462f2fa0b24bdd327ea0cddca27c9850adfed6653137e7e7f7","target":"record","created_at":"2026-05-18T02:27:05Z","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":"a62c12e54a86501375eeaa4ee3d5ae3c0affb6d873f487a0e07748e512b8ccad","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-30T15:46:54Z","title_canon_sha256":"66b44533947cf2e56cd58d365e92a14b9f19b04ccc9314b7218d39a8e08522e9"},"schema_version":"1.0","source":{"id":"1308.6778","kind":"arxiv","version":2}},"canonical_sha256":"0c149962496fdef6e124e72e1b7c19f36ad5d6d6180f2a44506ce41febb42bc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c149962496fdef6e124e72e1b7c19f36ad5d6d6180f2a44506ce41febb42bc5","first_computed_at":"2026-05-18T02:27:05.803182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:05.803182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D3YZG7rmE7AJO2lo2ZSAGfvCOl8id/5xoKWWWf4kjehX/ncs8yTenvVwll8jtn/hLqzcEwj5OSoXA/l0BCjxBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:05.803953Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.6778","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f1d9ee9404038462f2fa0b24bdd327ea0cddca27c9850adfed6653137e7e7f7","sha256:4fa9b208db3ae1dbad2d0d32be7d69ec1cc0621fd146d79f7d8f164fbd878009"],"state_sha256":"a21611fc56f053a9bd5db8e370fcad713c70565197a96a017ac3435c7476feab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l/gZzNQnB2HDqy1rOlhI9i9+ftnuVN66KVEUvnzk9FVbegSGWmPb/axWktpt6pP5yP9Vgs9c2W6pbAQSzm1BAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:01:57.645056Z","bundle_sha256":"34fed34bd4820bf6875737d70abed072ce04e7c8da4186992f868c005d46e86b"}}