{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XBC2ZROWFKZB2P72BAZFVYPI5N","short_pith_number":"pith:XBC2ZROW","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"},"canonical_sha256":"b845acc5d62ab21d3ffa08325ae1e8eb754ea0e9293143312dce66c0455ea18e","source":{"kind":"arxiv","id":"1807.10983","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10983","created_at":"2026-05-18T00:09:33Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10983v1","created_at":"2026-05-18T00:09:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10983","created_at":"2026-05-18T00:09:33Z"},{"alias_kind":"pith_short_12","alias_value":"XBC2ZROWFKZB","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XBC2ZROWFKZB2P72","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XBC2ZROW","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XBC2ZROWFKZB2P72BAZFVYPI5N","target":"record","payload":{"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"},"canonical_sha256":"b845acc5d62ab21d3ffa08325ae1e8eb754ea0e9293143312dce66c0455ea18e","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"},"source_kind":"arxiv","source_id":"1807.10983","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:09:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iQ2/7BHgRlpVZiEl876tdETq1aZXB2+5JKpcotqb3/jYac6VHrpkX38RuJF0FhTsOavsKqkCKbK86U8P1YIvCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:03:41.832116Z"},"content_sha256":"b6eb836ee75b8028ea7757ff5c7e7d6e83476d57fefa3dba5de2c8e95aa8142e","schema_version":"1.0","event_id":"sha256:b6eb836ee75b8028ea7757ff5c7e7d6e83476d57fefa3dba5de2c8e95aa8142e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XBC2ZROWFKZB2P72BAZFVYPI5N","target":"graph","payload":{"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"},"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:09:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cTDUE3uHxI9R8ayeqTZC2ZewpNfrQxrB/Wtnyp1lcrIKaevQr6W8hMxIuiJSR3NC78P+MTNU0oDtp/meNf9jAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:03:41.832794Z"},"content_sha256":"b479ff0415e023efb15626d7a996557f33745615ad7761176dfbe57ee570cc80","schema_version":"1.0","event_id":"sha256:b479ff0415e023efb15626d7a996557f33745615ad7761176dfbe57ee570cc80"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XBC2ZROWFKZB2P72BAZFVYPI5N/bundle.json","state_url":"https://pith.science/pith/XBC2ZROWFKZB2P72BAZFVYPI5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XBC2ZROWFKZB2P72BAZFVYPI5N/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-05-27T14:03:41Z","links":{"resolver":"https://pith.science/pith/XBC2ZROWFKZB2P72BAZFVYPI5N","bundle":"https://pith.science/pith/XBC2ZROWFKZB2P72BAZFVYPI5N/bundle.json","state":"https://pith.science/pith/XBC2ZROWFKZB2P72BAZFVYPI5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XBC2ZROWFKZB2P72BAZFVYPI5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XBC2ZROWFKZB2P72BAZFVYPI5N","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":"dc1ec3f683efea3064c08541dd810d38b3f737a4c2b5fe52eb31162bb7a4bc3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-28T23:30:29Z","title_canon_sha256":"c82f2e4a12b76b10d0e19446cb44d43e418d5ab065b534f0f7020d5c55ed01cd"},"schema_version":"1.0","source":{"id":"1807.10983","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.10983","created_at":"2026-05-18T00:09:33Z"},{"alias_kind":"arxiv_version","alias_value":"1807.10983v1","created_at":"2026-05-18T00:09:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.10983","created_at":"2026-05-18T00:09:33Z"},{"alias_kind":"pith_short_12","alias_value":"XBC2ZROWFKZB","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XBC2ZROWFKZB2P72","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XBC2ZROW","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:b479ff0415e023efb15626d7a996557f33745615ad7761176dfbe57ee570cc80","target":"graph","created_at":"2026-05-18T00:09:33Z","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":"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","authors_text":"Holger Spakowski, Lane A. Hemaspaandra","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-28T23:30:29Z","title":"Team Diagonalization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.10983","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:b6eb836ee75b8028ea7757ff5c7e7d6e83476d57fefa3dba5de2c8e95aa8142e","target":"record","created_at":"2026-05-18T00:09:33Z","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":"dc1ec3f683efea3064c08541dd810d38b3f737a4c2b5fe52eb31162bb7a4bc3d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-07-28T23:30:29Z","title_canon_sha256":"c82f2e4a12b76b10d0e19446cb44d43e418d5ab065b534f0f7020d5c55ed01cd"},"schema_version":"1.0","source":{"id":"1807.10983","kind":"arxiv","version":1}},"canonical_sha256":"b845acc5d62ab21d3ffa08325ae1e8eb754ea0e9293143312dce66c0455ea18e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b845acc5d62ab21d3ffa08325ae1e8eb754ea0e9293143312dce66c0455ea18e","first_computed_at":"2026-05-18T00:09:33.251349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:33.251349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cuAJHJhWbrlD6jO/t64UktMF8GJuht6kBNTE6cK56raZoQTYm7CadbzYUa4x9+D501VBMRpAQlng6f2TKBuXDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:33.251887Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.10983","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6eb836ee75b8028ea7757ff5c7e7d6e83476d57fefa3dba5de2c8e95aa8142e","sha256:b479ff0415e023efb15626d7a996557f33745615ad7761176dfbe57ee570cc80"],"state_sha256":"86074f51860f0e3f3af4e55459b599b77d35596b71eb0f5fd69a745252832966"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ncb7uip+zyF99KxiuYVhH8OhztJnReIfRaKBvqcpeWRtPEkogP9iU3mOU4LCkXKk1EsdixH6/cDp/ekzlyiIBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:03:41.836188Z","bundle_sha256":"035e4df7c5fa453da5a64a74f6e2f3cb335301f2dac72960d56388cac2f28027"}}