{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MB2DBDWQSRMZAD7ECDM2PBI72U","short_pith_number":"pith:MB2DBDWQ","schema_version":"1.0","canonical_sha256":"6074308ed09459900fe410d9a7851fd53ba14e0d461c16db975ca6dfe8d57f54","source":{"kind":"arxiv","id":"1908.08938","version":1},"attestation_state":"computed","paper":{"title":"Mixed Linear Layouts: Complexity, Heuristics, and Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabian Klute, Martin N\\\"ollenburg, Philipp de Col","submitted_at":"2019-08-23T17:59:39Z","abstract_excerpt":"A $k$-page linear graph layout of a graph $G = (V,E)$ draws all vertices along a line $\\ell$ and each edge in one of $k$ disjoint halfplanes called pages, which are bounded by $\\ell$. We consider two types of pages. In a stack page no two edges should cross and in a queue page no edge should be nested by another edge. A crossing (nesting) in a stack (queue) page is called a conflict. The algorithmic problem is twofold and requires to compute (i) a vertex ordering and (ii) a page assignment of the edges such that the resulting layout is either conflict-free or conflict-minimal. While linear lay"},"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":"1908.08938","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-23T17:59:39Z","cross_cats_sorted":[],"title_canon_sha256":"2beb8c54e7c4f49390d32f4ae3314a7f3ddf0e211afe4e9e1b78f9806f671bb7","abstract_canon_sha256":"329dee55d534ead89041d7a1b52f6857283a0ba418d17572e5176a83ccfe67fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:25.397864Z","signature_b64":"0hs0NXHpm52t3lZAA7gUumeoe7Jtb+tFhrSuZueR9s5m/KXAhVS7XDfivxOEyrwKl9sqwObD1wHIlX18o+BECw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6074308ed09459900fe410d9a7851fd53ba14e0d461c16db975ca6dfe8d57f54","last_reissued_at":"2026-07-04T23:59:25.397460Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:25.397460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixed Linear Layouts: Complexity, Heuristics, and Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fabian Klute, Martin N\\\"ollenburg, Philipp de Col","submitted_at":"2019-08-23T17:59:39Z","abstract_excerpt":"A $k$-page linear graph layout of a graph $G = (V,E)$ draws all vertices along a line $\\ell$ and each edge in one of $k$ disjoint halfplanes called pages, which are bounded by $\\ell$. We consider two types of pages. In a stack page no two edges should cross and in a queue page no edge should be nested by another edge. A crossing (nesting) in a stack (queue) page is called a conflict. The algorithmic problem is twofold and requires to compute (i) a vertex ordering and (ii) a page assignment of the edges such that the resulting layout is either conflict-free or conflict-minimal. While linear lay"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08938","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.08938/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.08938","created_at":"2026-07-04T23:59:25.397515+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.08938v1","created_at":"2026-07-04T23:59:25.397515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08938","created_at":"2026-07-04T23:59:25.397515+00:00"},{"alias_kind":"pith_short_12","alias_value":"MB2DBDWQSRMZ","created_at":"2026-07-04T23:59:25.397515+00:00"},{"alias_kind":"pith_short_16","alias_value":"MB2DBDWQSRMZAD7E","created_at":"2026-07-04T23:59:25.397515+00:00"},{"alias_kind":"pith_short_8","alias_value":"MB2DBDWQ","created_at":"2026-07-04T23:59:25.397515+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/MB2DBDWQSRMZAD7ECDM2PBI72U","json":"https://pith.science/pith/MB2DBDWQSRMZAD7ECDM2PBI72U.json","graph_json":"https://pith.science/api/pith-number/MB2DBDWQSRMZAD7ECDM2PBI72U/graph.json","events_json":"https://pith.science/api/pith-number/MB2DBDWQSRMZAD7ECDM2PBI72U/events.json","paper":"https://pith.science/paper/MB2DBDWQ"},"agent_actions":{"view_html":"https://pith.science/pith/MB2DBDWQSRMZAD7ECDM2PBI72U","download_json":"https://pith.science/pith/MB2DBDWQSRMZAD7ECDM2PBI72U.json","view_paper":"https://pith.science/paper/MB2DBDWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.08938&json=true","fetch_graph":"https://pith.science/api/pith-number/MB2DBDWQSRMZAD7ECDM2PBI72U/graph.json","fetch_events":"https://pith.science/api/pith-number/MB2DBDWQSRMZAD7ECDM2PBI72U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MB2DBDWQSRMZAD7ECDM2PBI72U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MB2DBDWQSRMZAD7ECDM2PBI72U/action/storage_attestation","attest_author":"https://pith.science/pith/MB2DBDWQSRMZAD7ECDM2PBI72U/action/author_attestation","sign_citation":"https://pith.science/pith/MB2DBDWQSRMZAD7ECDM2PBI72U/action/citation_signature","submit_replication":"https://pith.science/pith/MB2DBDWQSRMZAD7ECDM2PBI72U/action/replication_record"}},"created_at":"2026-07-04T23:59:25.397515+00:00","updated_at":"2026-07-04T23:59:25.397515+00:00"}