{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:R7BQNYWJEJZPS3AEO6S7ZZ2IRU","short_pith_number":"pith:R7BQNYWJ","schema_version":"1.0","canonical_sha256":"8fc306e2c92272f96c0477a5fce7488d32c5897e476c2a31479c73c7ddc0581d","source":{"kind":"arxiv","id":"1708.06730","version":1},"attestation_state":"computed","paper":{"title":"Upward Partitioned Book Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.CG","authors_text":"Adam Hesterberg, Erik D. Demaine, Hugo A. Akitaya, Quanquan C. Liu","submitted_at":"2017-08-22T17:19:55Z","abstract_excerpt":"We analyze a directed variation of the book embedding problem when the page partition is prespecified and the nodes on the spine must be in topological order (upward book embedding). Given a directed acyclic graph and a partition of its edges into $k$ pages, can we linearly order the vertices such that the drawing is upward (a topological sort) and each page avoids crossings? We prove that the problem is NP-complete for $k\\ge 3$, and for $k\\ge 4$ even in the special case when each page is a matching. By contrast, the problem can be solved in linear time for $k=2$ pages when pages are restricte"},"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":"1708.06730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-22T17:19:55Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"40937f3b5150bd652394273cf23c544c6769e92695b0f17e56c1d7c9973002f6","abstract_canon_sha256":"2cf43a8cde8bcfbf2f17dbd30be26d102ce69af414bdfc51315103d484b80b07"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:32.790053Z","signature_b64":"X0jsbYeBg06lmde7L48RJopE81fYrBMznmNJqUVeo7uOgaq8E3IhZAm41sqzN4eoshc/RYngg7lmHgvhSPKSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fc306e2c92272f96c0477a5fce7488d32c5897e476c2a31479c73c7ddc0581d","last_reissued_at":"2026-05-18T00:37:32.789615Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:32.789615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upward Partitioned Book Embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.CG","authors_text":"Adam Hesterberg, Erik D. Demaine, Hugo A. Akitaya, Quanquan C. Liu","submitted_at":"2017-08-22T17:19:55Z","abstract_excerpt":"We analyze a directed variation of the book embedding problem when the page partition is prespecified and the nodes on the spine must be in topological order (upward book embedding). Given a directed acyclic graph and a partition of its edges into $k$ pages, can we linearly order the vertices such that the drawing is upward (a topological sort) and each page avoids crossings? We prove that the problem is NP-complete for $k\\ge 3$, and for $k\\ge 4$ even in the special case when each page is a matching. By contrast, the problem can be solved in linear time for $k=2$ pages when pages are restricte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06730","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":"1708.06730","created_at":"2026-05-18T00:37:32.789679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06730v1","created_at":"2026-05-18T00:37:32.789679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06730","created_at":"2026-05-18T00:37:32.789679+00:00"},{"alias_kind":"pith_short_12","alias_value":"R7BQNYWJEJZP","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"R7BQNYWJEJZPS3AE","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"R7BQNYWJ","created_at":"2026-05-18T12:31:39.905425+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/R7BQNYWJEJZPS3AEO6S7ZZ2IRU","json":"https://pith.science/pith/R7BQNYWJEJZPS3AEO6S7ZZ2IRU.json","graph_json":"https://pith.science/api/pith-number/R7BQNYWJEJZPS3AEO6S7ZZ2IRU/graph.json","events_json":"https://pith.science/api/pith-number/R7BQNYWJEJZPS3AEO6S7ZZ2IRU/events.json","paper":"https://pith.science/paper/R7BQNYWJ"},"agent_actions":{"view_html":"https://pith.science/pith/R7BQNYWJEJZPS3AEO6S7ZZ2IRU","download_json":"https://pith.science/pith/R7BQNYWJEJZPS3AEO6S7ZZ2IRU.json","view_paper":"https://pith.science/paper/R7BQNYWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06730&json=true","fetch_graph":"https://pith.science/api/pith-number/R7BQNYWJEJZPS3AEO6S7ZZ2IRU/graph.json","fetch_events":"https://pith.science/api/pith-number/R7BQNYWJEJZPS3AEO6S7ZZ2IRU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R7BQNYWJEJZPS3AEO6S7ZZ2IRU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R7BQNYWJEJZPS3AEO6S7ZZ2IRU/action/storage_attestation","attest_author":"https://pith.science/pith/R7BQNYWJEJZPS3AEO6S7ZZ2IRU/action/author_attestation","sign_citation":"https://pith.science/pith/R7BQNYWJEJZPS3AEO6S7ZZ2IRU/action/citation_signature","submit_replication":"https://pith.science/pith/R7BQNYWJEJZPS3AEO6S7ZZ2IRU/action/replication_record"}},"created_at":"2026-05-18T00:37:32.789679+00:00","updated_at":"2026-05-18T00:37:32.789679+00:00"}