{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:AHOKWTLXMOAVQKQOYUFWXYRNSF","short_pith_number":"pith:AHOKWTLX","schema_version":"1.0","canonical_sha256":"01dcab4d776381582a0ec50b6be22d914c3bc883e008827f4268155e02be5e94","source":{"kind":"arxiv","id":"1903.07966","version":1},"attestation_state":"computed","paper":{"title":"Upward Book Embeddings of st-Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Carla Binucci, Emilio Di Giacomo, Giordano Da Lozzo, Maurizio Patrignani, Tamara Mchedlidze, Walter Didimo","submitted_at":"2019-03-19T12:45:04Z","abstract_excerpt":"We study $k$-page upward book embeddings ($k$UBEs) of $st$-graphs, that is, book embeddings of single-source single-sink directed acyclic graphs on $k$ pages with the additional requirement that the vertices of the graph appear in a topological ordering along the spine of the book. We show that testing whether a graph admits a $k$UBE is NP-complete for $k\\geq 3$. A hardness result for this problem was previously known only for $k = 6$ [Heath and Pemmaraju, 1999]. Motivated by this negative result, we focus our attention on $k=2$. On the algorithmic side, we present polynomial-time algorithms f"},"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":"1903.07966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-03-19T12:45:04Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1514aa4a5dd4e5edd2c05ad8e9f1ddc7c45796dbc261fd4a9abd6c1dc9a4ecdf","abstract_canon_sha256":"80542ae0553da6fd7943508a7857c2c82cd0f17511c11c42a00f37c06ad9d65e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:53.388542Z","signature_b64":"/gmtWiAGNluf4TA0EIqF3JvSuU1k1yzJjmPRrgUFEos7OHY4TljriJt1qp0R9dR4kxZfSfhRbJctbYW/eC6+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01dcab4d776381582a0ec50b6be22d914c3bc883e008827f4268155e02be5e94","last_reissued_at":"2026-05-17T23:50:53.387808Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:53.387808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Upward Book Embeddings of st-Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Carla Binucci, Emilio Di Giacomo, Giordano Da Lozzo, Maurizio Patrignani, Tamara Mchedlidze, Walter Didimo","submitted_at":"2019-03-19T12:45:04Z","abstract_excerpt":"We study $k$-page upward book embeddings ($k$UBEs) of $st$-graphs, that is, book embeddings of single-source single-sink directed acyclic graphs on $k$ pages with the additional requirement that the vertices of the graph appear in a topological ordering along the spine of the book. We show that testing whether a graph admits a $k$UBE is NP-complete for $k\\geq 3$. A hardness result for this problem was previously known only for $k = 6$ [Heath and Pemmaraju, 1999]. Motivated by this negative result, we focus our attention on $k=2$. On the algorithmic side, we present polynomial-time algorithms f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07966","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":"1903.07966","created_at":"2026-05-17T23:50:53.387920+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.07966v1","created_at":"2026-05-17T23:50:53.387920+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07966","created_at":"2026-05-17T23:50:53.387920+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHOKWTLXMOAV","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHOKWTLXMOAVQKQO","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHOKWTLX","created_at":"2026-05-18T12:33:12.712433+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/AHOKWTLXMOAVQKQOYUFWXYRNSF","json":"https://pith.science/pith/AHOKWTLXMOAVQKQOYUFWXYRNSF.json","graph_json":"https://pith.science/api/pith-number/AHOKWTLXMOAVQKQOYUFWXYRNSF/graph.json","events_json":"https://pith.science/api/pith-number/AHOKWTLXMOAVQKQOYUFWXYRNSF/events.json","paper":"https://pith.science/paper/AHOKWTLX"},"agent_actions":{"view_html":"https://pith.science/pith/AHOKWTLXMOAVQKQOYUFWXYRNSF","download_json":"https://pith.science/pith/AHOKWTLXMOAVQKQOYUFWXYRNSF.json","view_paper":"https://pith.science/paper/AHOKWTLX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.07966&json=true","fetch_graph":"https://pith.science/api/pith-number/AHOKWTLXMOAVQKQOYUFWXYRNSF/graph.json","fetch_events":"https://pith.science/api/pith-number/AHOKWTLXMOAVQKQOYUFWXYRNSF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHOKWTLXMOAVQKQOYUFWXYRNSF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHOKWTLXMOAVQKQOYUFWXYRNSF/action/storage_attestation","attest_author":"https://pith.science/pith/AHOKWTLXMOAVQKQOYUFWXYRNSF/action/author_attestation","sign_citation":"https://pith.science/pith/AHOKWTLXMOAVQKQOYUFWXYRNSF/action/citation_signature","submit_replication":"https://pith.science/pith/AHOKWTLXMOAVQKQOYUFWXYRNSF/action/replication_record"}},"created_at":"2026-05-17T23:50:53.387920+00:00","updated_at":"2026-05-17T23:50:53.387920+00:00"}