{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DCMA2FVDJOSHKAJFRNFHKZSZK6","short_pith_number":"pith:DCMA2FVD","schema_version":"1.0","canonical_sha256":"18980d16a34ba47501258b4a756659578355e9c39c0f7385aeaff105c3e52ac7","source":{"kind":"arxiv","id":"1504.05908","version":2},"attestation_state":"computed","paper":{"title":"Maximum Pagenumber-k Subgraph is NP-Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Marco Kuhlmann, Peter Jonsson","submitted_at":"2015-04-21T06:36:48Z","abstract_excerpt":"Given a graph $G$ with a total order defined on its vertices, the Maximum Pagenumber-$k$ Subgraph Problem asks for a maximum subgraph $G'$ of $G$ such that $G'$ can be embedded into a $k$-book when the vertices are placed on the spine according to the specified total order. We show that this problem is NP-complete for $k \\geq 2$."},"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":"1504.05908","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-21T06:36:48Z","cross_cats_sorted":[],"title_canon_sha256":"bc2271773294feeebb9ae575d617447a317d7379f1ebc258587b0d134dbecd06","abstract_canon_sha256":"b005de38ac130710dd69be2c20b4968ad815831501a610a14ffb3dc321fa7675"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:03.175170Z","signature_b64":"q6qzGJ5RNXzUyIVIX6T9IK4LrWuBom7u5293cz0dqhGSkc1LKPU/jKMDKJvRhsl+UjOjVdxiLXdb/iHjNW1sDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18980d16a34ba47501258b4a756659578355e9c39c0f7385aeaff105c3e52ac7","last_reissued_at":"2026-05-18T02:18:03.174455Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:03.174455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximum Pagenumber-k Subgraph is NP-Complete","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Marco Kuhlmann, Peter Jonsson","submitted_at":"2015-04-21T06:36:48Z","abstract_excerpt":"Given a graph $G$ with a total order defined on its vertices, the Maximum Pagenumber-$k$ Subgraph Problem asks for a maximum subgraph $G'$ of $G$ such that $G'$ can be embedded into a $k$-book when the vertices are placed on the spine according to the specified total order. We show that this problem is NP-complete for $k \\geq 2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05908","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.05908","created_at":"2026-05-18T02:18:03.174577+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05908v2","created_at":"2026-05-18T02:18:03.174577+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05908","created_at":"2026-05-18T02:18:03.174577+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCMA2FVDJOSH","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCMA2FVDJOSHKAJF","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCMA2FVD","created_at":"2026-05-18T12:29:17.054201+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/DCMA2FVDJOSHKAJFRNFHKZSZK6","json":"https://pith.science/pith/DCMA2FVDJOSHKAJFRNFHKZSZK6.json","graph_json":"https://pith.science/api/pith-number/DCMA2FVDJOSHKAJFRNFHKZSZK6/graph.json","events_json":"https://pith.science/api/pith-number/DCMA2FVDJOSHKAJFRNFHKZSZK6/events.json","paper":"https://pith.science/paper/DCMA2FVD"},"agent_actions":{"view_html":"https://pith.science/pith/DCMA2FVDJOSHKAJFRNFHKZSZK6","download_json":"https://pith.science/pith/DCMA2FVDJOSHKAJFRNFHKZSZK6.json","view_paper":"https://pith.science/paper/DCMA2FVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05908&json=true","fetch_graph":"https://pith.science/api/pith-number/DCMA2FVDJOSHKAJFRNFHKZSZK6/graph.json","fetch_events":"https://pith.science/api/pith-number/DCMA2FVDJOSHKAJFRNFHKZSZK6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCMA2FVDJOSHKAJFRNFHKZSZK6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCMA2FVDJOSHKAJFRNFHKZSZK6/action/storage_attestation","attest_author":"https://pith.science/pith/DCMA2FVDJOSHKAJFRNFHKZSZK6/action/author_attestation","sign_citation":"https://pith.science/pith/DCMA2FVDJOSHKAJFRNFHKZSZK6/action/citation_signature","submit_replication":"https://pith.science/pith/DCMA2FVDJOSHKAJFRNFHKZSZK6/action/replication_record"}},"created_at":"2026-05-18T02:18:03.174577+00:00","updated_at":"2026-05-18T02:18:03.174577+00:00"}