{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:R7BQNYWJEJZPS3AEO6S7ZZ2IRU","short_pith_number":"pith:R7BQNYWJ","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"},"canonical_sha256":"8fc306e2c92272f96c0477a5fce7488d32c5897e476c2a31479c73c7ddc0581d","source":{"kind":"arxiv","id":"1708.06730","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06730","created_at":"2026-05-18T00:37:32Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06730v1","created_at":"2026-05-18T00:37:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06730","created_at":"2026-05-18T00:37:32Z"},{"alias_kind":"pith_short_12","alias_value":"R7BQNYWJEJZP","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"R7BQNYWJEJZPS3AE","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"R7BQNYWJ","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:R7BQNYWJEJZPS3AEO6S7ZZ2IRU","target":"record","payload":{"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"},"canonical_sha256":"8fc306e2c92272f96c0477a5fce7488d32c5897e476c2a31479c73c7ddc0581d","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"},"source_kind":"arxiv","source_id":"1708.06730","source_version":1,"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-18T00:37:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b89/eaB09IkNgvHVY2dZHj+2E9HYOUwwsB9i9+i4E+aCvhCWQ7qCgs4te0kjpFG8YlbLqQtTVIquEkMeZ13GCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:16:15.426772Z"},"content_sha256":"c5f26e955631f412743d33ca2caabe83c9b4a12ad62717db8d7fb1f60a317048","schema_version":"1.0","event_id":"sha256:c5f26e955631f412743d33ca2caabe83c9b4a12ad62717db8d7fb1f60a317048"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:R7BQNYWJEJZPS3AEO6S7ZZ2IRU","target":"graph","payload":{"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"},"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-18T00:37:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"epTxKh5/OeDokghY7wYoihKNn4oFQ/a7UnBnJ9N7v4gsjUM7qKbCI8gCkwbSc/AoJtgL0kAb6n5mRBXfvVifBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:16:15.427118Z"},"content_sha256":"bf511b573f9ce1f625a2961039ae32b10d505e9d948765683c289d25b0e4644a","schema_version":"1.0","event_id":"sha256:bf511b573f9ce1f625a2961039ae32b10d505e9d948765683c289d25b0e4644a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R7BQNYWJEJZPS3AEO6S7ZZ2IRU/bundle.json","state_url":"https://pith.science/pith/R7BQNYWJEJZPS3AEO6S7ZZ2IRU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R7BQNYWJEJZPS3AEO6S7ZZ2IRU/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-06-02T02:16:15Z","links":{"resolver":"https://pith.science/pith/R7BQNYWJEJZPS3AEO6S7ZZ2IRU","bundle":"https://pith.science/pith/R7BQNYWJEJZPS3AEO6S7ZZ2IRU/bundle.json","state":"https://pith.science/pith/R7BQNYWJEJZPS3AEO6S7ZZ2IRU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R7BQNYWJEJZPS3AEO6S7ZZ2IRU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:R7BQNYWJEJZPS3AEO6S7ZZ2IRU","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":"2cf43a8cde8bcfbf2f17dbd30be26d102ce69af414bdfc51315103d484b80b07","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-22T17:19:55Z","title_canon_sha256":"40937f3b5150bd652394273cf23c544c6769e92695b0f17e56c1d7c9973002f6"},"schema_version":"1.0","source":{"id":"1708.06730","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06730","created_at":"2026-05-18T00:37:32Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06730v1","created_at":"2026-05-18T00:37:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06730","created_at":"2026-05-18T00:37:32Z"},{"alias_kind":"pith_short_12","alias_value":"R7BQNYWJEJZP","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"R7BQNYWJEJZPS3AE","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"R7BQNYWJ","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:bf511b573f9ce1f625a2961039ae32b10d505e9d948765683c289d25b0e4644a","target":"graph","created_at":"2026-05-18T00:37:32Z","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 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","authors_text":"Adam Hesterberg, Erik D. Demaine, Hugo A. Akitaya, Quanquan C. Liu","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-22T17:19:55Z","title":"Upward Partitioned Book Embeddings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06730","kind":"arxiv","version":1},"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:c5f26e955631f412743d33ca2caabe83c9b4a12ad62717db8d7fb1f60a317048","target":"record","created_at":"2026-05-18T00:37:32Z","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":"2cf43a8cde8bcfbf2f17dbd30be26d102ce69af414bdfc51315103d484b80b07","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-22T17:19:55Z","title_canon_sha256":"40937f3b5150bd652394273cf23c544c6769e92695b0f17e56c1d7c9973002f6"},"schema_version":"1.0","source":{"id":"1708.06730","kind":"arxiv","version":1}},"canonical_sha256":"8fc306e2c92272f96c0477a5fce7488d32c5897e476c2a31479c73c7ddc0581d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fc306e2c92272f96c0477a5fce7488d32c5897e476c2a31479c73c7ddc0581d","first_computed_at":"2026-05-18T00:37:32.789615Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:32.789615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X0jsbYeBg06lmde7L48RJopE81fYrBMznmNJqUVeo7uOgaq8E3IhZAm41sqzN4eoshc/RYngg7lmHgvhSPKSCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:32.790053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06730","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5f26e955631f412743d33ca2caabe83c9b4a12ad62717db8d7fb1f60a317048","sha256:bf511b573f9ce1f625a2961039ae32b10d505e9d948765683c289d25b0e4644a"],"state_sha256":"1bd20a4aea4303a87c8102ed21a5bae928461a213153dcb8b2810f740dfc9737"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NIN7XCedvQnGRY0BB2a0TLwr5wZ5MMpDcXt/dITF32zDCVdr9Kf+nhJdj36/ae9OUGjzhqM6LhpzHBEEqhSfAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:16:15.430281Z","bundle_sha256":"212862da72125b2c9062f5e80764fa704b5f4363712aa2f3f32bf063aef84bb3"}}