{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3YYTSHFOE6222MAGIGTFNXU2L4","short_pith_number":"pith:3YYTSHFO","schema_version":"1.0","canonical_sha256":"de31391cae27b5ad300641a656de9a5f2c30f2d3fe15749d91bc33c0b2cbea36","source":{"kind":"arxiv","id":"1312.0903","version":1},"attestation_state":"computed","paper":{"title":"Uniqueness in quadratic and hyperbolic 0-1 programming problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Bettina Klinz, Gerhard J. Woeginger, Vladimir G. Deineko","submitted_at":"2013-12-03T18:52:47Z","abstract_excerpt":"We analyze the question of deciding whether a quadratic or a hyperbolic 0-1 programming instance has a unique optimal solution. Both uniqueness questions are known to be NP-hard, but are unlikely to be contained in the class NP. We precisely pinpoint their computational complexity by showing that they both are complete for the complexity class {\\mbox{$\\Delta_2$P}."},"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":"1312.0903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-03T18:52:47Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e001bfdde7d5e1e24014d2d38a7f75758c205d45ad3dafb04d73bdf90fcd4d0a","abstract_canon_sha256":"acd5effd92e0ac1e54d07c91de2d776da0714c5ed0135b64ae32fe50157378c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:36.412170Z","signature_b64":"HvIljsknIuwJSAm4y0L11YZnxHe8YME1g34f7w04a1J0to3pKlPP8LjhFfh/6f37IXkIBxOgqgwiPMy1fBaRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de31391cae27b5ad300641a656de9a5f2c30f2d3fe15749d91bc33c0b2cbea36","last_reissued_at":"2026-05-18T03:05:36.411719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:36.411719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uniqueness in quadratic and hyperbolic 0-1 programming problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Bettina Klinz, Gerhard J. Woeginger, Vladimir G. Deineko","submitted_at":"2013-12-03T18:52:47Z","abstract_excerpt":"We analyze the question of deciding whether a quadratic or a hyperbolic 0-1 programming instance has a unique optimal solution. Both uniqueness questions are known to be NP-hard, but are unlikely to be contained in the class NP. We precisely pinpoint their computational complexity by showing that they both are complete for the complexity class {\\mbox{$\\Delta_2$P}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0903","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":"1312.0903","created_at":"2026-05-18T03:05:36.411785+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0903v1","created_at":"2026-05-18T03:05:36.411785+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0903","created_at":"2026-05-18T03:05:36.411785+00:00"},{"alias_kind":"pith_short_12","alias_value":"3YYTSHFOE622","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3YYTSHFOE6222MAG","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3YYTSHFO","created_at":"2026-05-18T12:27:32.513160+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/3YYTSHFOE6222MAGIGTFNXU2L4","json":"https://pith.science/pith/3YYTSHFOE6222MAGIGTFNXU2L4.json","graph_json":"https://pith.science/api/pith-number/3YYTSHFOE6222MAGIGTFNXU2L4/graph.json","events_json":"https://pith.science/api/pith-number/3YYTSHFOE6222MAGIGTFNXU2L4/events.json","paper":"https://pith.science/paper/3YYTSHFO"},"agent_actions":{"view_html":"https://pith.science/pith/3YYTSHFOE6222MAGIGTFNXU2L4","download_json":"https://pith.science/pith/3YYTSHFOE6222MAGIGTFNXU2L4.json","view_paper":"https://pith.science/paper/3YYTSHFO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0903&json=true","fetch_graph":"https://pith.science/api/pith-number/3YYTSHFOE6222MAGIGTFNXU2L4/graph.json","fetch_events":"https://pith.science/api/pith-number/3YYTSHFOE6222MAGIGTFNXU2L4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3YYTSHFOE6222MAGIGTFNXU2L4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3YYTSHFOE6222MAGIGTFNXU2L4/action/storage_attestation","attest_author":"https://pith.science/pith/3YYTSHFOE6222MAGIGTFNXU2L4/action/author_attestation","sign_citation":"https://pith.science/pith/3YYTSHFOE6222MAGIGTFNXU2L4/action/citation_signature","submit_replication":"https://pith.science/pith/3YYTSHFOE6222MAGIGTFNXU2L4/action/replication_record"}},"created_at":"2026-05-18T03:05:36.411785+00:00","updated_at":"2026-05-18T03:05:36.411785+00:00"}