{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:XBC2ZROWFKZB2P72BAZFVYPI5N","short_pith_number":"pith:XBC2ZROW","schema_version":"1.0","canonical_sha256":"b845acc5d62ab21d3ffa08325ae1e8eb754ea0e9293143312dce66c0455ea18e","source":{"kind":"arxiv","id":"1807.10983","version":1},"attestation_state":"computed","paper":{"title":"Team Diagonalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Holger Spakowski, Lane A. Hemaspaandra","submitted_at":"2018-07-28T23:30:29Z","abstract_excerpt":"Ten years ago, Gla{\\ss}er, Pavan, Selman, and Zhang [GPSZ08] proved that if P $\\neq$ NP, then all NP-complete sets can be simply split into two NP-complete sets.\n  That advance might naturally make one wonder about a quite different potential consequence of NP-completeness: Can the union of easy NP sets ever be hard? In particular, can the union of two non-NP-complete NP sets ever be NP-complete?\n  Amazingly, Ladner [Lad75] resolved this more than forty years ago: If P $\\neq$ NP, then all NP-complete sets can be simply split into two non-NP-complete NP sets. Indeed, this holds even when one re"},"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":"1807.10983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-28T23:30:29Z","cross_cats_sorted":[],"title_canon_sha256":"c82f2e4a12b76b10d0e19446cb44d43e418d5ab065b534f0f7020d5c55ed01cd","abstract_canon_sha256":"dc1ec3f683efea3064c08541dd810d38b3f737a4c2b5fe52eb31162bb7a4bc3d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:33.251887Z","signature_b64":"cuAJHJhWbrlD6jO/t64UktMF8GJuht6kBNTE6cK56raZoQTYm7CadbzYUa4x9+D501VBMRpAQlng6f2TKBuXDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b845acc5d62ab21d3ffa08325ae1e8eb754ea0e9293143312dce66c0455ea18e","last_reissued_at":"2026-05-18T00:09:33.251349Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:33.251349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Team Diagonalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Holger Spakowski, Lane A. Hemaspaandra","submitted_at":"2018-07-28T23:30:29Z","abstract_excerpt":"Ten years ago, Gla{\\ss}er, Pavan, Selman, and Zhang [GPSZ08] proved that if P $\\neq$ NP, then all NP-complete sets can be simply split into two NP-complete sets.\n  That advance might naturally make one wonder about a quite different potential consequence of NP-completeness: Can the union of easy NP sets ever be hard? In particular, can the union of two non-NP-complete NP sets ever be NP-complete?\n  Amazingly, Ladner [Lad75] resolved this more than forty years ago: If P $\\neq$ NP, then all NP-complete sets can be simply split into two non-NP-complete NP sets. Indeed, this holds even when one re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10983","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":"1807.10983","created_at":"2026-05-18T00:09:33.251436+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.10983v1","created_at":"2026-05-18T00:09:33.251436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10983","created_at":"2026-05-18T00:09:33.251436+00:00"},{"alias_kind":"pith_short_12","alias_value":"XBC2ZROWFKZB","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"XBC2ZROWFKZB2P72","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"XBC2ZROW","created_at":"2026-05-18T12:33:01.666342+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/XBC2ZROWFKZB2P72BAZFVYPI5N","json":"https://pith.science/pith/XBC2ZROWFKZB2P72BAZFVYPI5N.json","graph_json":"https://pith.science/api/pith-number/XBC2ZROWFKZB2P72BAZFVYPI5N/graph.json","events_json":"https://pith.science/api/pith-number/XBC2ZROWFKZB2P72BAZFVYPI5N/events.json","paper":"https://pith.science/paper/XBC2ZROW"},"agent_actions":{"view_html":"https://pith.science/pith/XBC2ZROWFKZB2P72BAZFVYPI5N","download_json":"https://pith.science/pith/XBC2ZROWFKZB2P72BAZFVYPI5N.json","view_paper":"https://pith.science/paper/XBC2ZROW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.10983&json=true","fetch_graph":"https://pith.science/api/pith-number/XBC2ZROWFKZB2P72BAZFVYPI5N/graph.json","fetch_events":"https://pith.science/api/pith-number/XBC2ZROWFKZB2P72BAZFVYPI5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XBC2ZROWFKZB2P72BAZFVYPI5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XBC2ZROWFKZB2P72BAZFVYPI5N/action/storage_attestation","attest_author":"https://pith.science/pith/XBC2ZROWFKZB2P72BAZFVYPI5N/action/author_attestation","sign_citation":"https://pith.science/pith/XBC2ZROWFKZB2P72BAZFVYPI5N/action/citation_signature","submit_replication":"https://pith.science/pith/XBC2ZROWFKZB2P72BAZFVYPI5N/action/replication_record"}},"created_at":"2026-05-18T00:09:33.251436+00:00","updated_at":"2026-05-18T00:09:33.251436+00:00"}