{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KL5R5IFAFMIEUVFQT23AXFLST2","short_pith_number":"pith:KL5R5IFA","schema_version":"1.0","canonical_sha256":"52fb1ea0a02b104a54b09eb60b95729eb631e35d439acc07f9c78bc307319a02","source":{"kind":"arxiv","id":"1501.06729","version":2},"attestation_state":"computed","paper":{"title":"The Complexity of the Kth Largest Subset Problem and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Christoph Haase, Stefan Kiefer","submitted_at":"2015-01-27T10:33:56Z","abstract_excerpt":"We show that the Kth largest subset problem and the Kth largest m-tuple problem are in PP and hard for PP under polynomial-time Turing reductions. Several problems from the literature were previously shown NP-hard via reductions from those two problems, and by our main result they become PP-hard as well. We also provide complementary PP-upper bounds for some of them."},"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":"1501.06729","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-01-27T10:33:56Z","cross_cats_sorted":[],"title_canon_sha256":"4bd99fadde2eb79539a0ac85a886de99a703ffdd8c6c7cc6f435a83fc0f284e3","abstract_canon_sha256":"6f64e89cb39ca233c98ea58ac2227debdb5798741af35bcd6c25bda68a301d16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:30.007948Z","signature_b64":"XRUWFLE+5cRHBwkmj1nYwYAtxaoSv+3ZwfxD3aosYR6dImTCPdacmUqSjAgRQAV8/KtfC/EvVwGJ7McRVU2yDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52fb1ea0a02b104a54b09eb60b95729eb631e35d439acc07f9c78bc307319a02","last_reissued_at":"2026-05-18T01:31:30.007385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:30.007385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of the Kth Largest Subset Problem and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Christoph Haase, Stefan Kiefer","submitted_at":"2015-01-27T10:33:56Z","abstract_excerpt":"We show that the Kth largest subset problem and the Kth largest m-tuple problem are in PP and hard for PP under polynomial-time Turing reductions. Several problems from the literature were previously shown NP-hard via reductions from those two problems, and by our main result they become PP-hard as well. We also provide complementary PP-upper bounds for some of them."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06729","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":"1501.06729","created_at":"2026-05-18T01:31:30.007453+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06729v2","created_at":"2026-05-18T01:31:30.007453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06729","created_at":"2026-05-18T01:31:30.007453+00:00"},{"alias_kind":"pith_short_12","alias_value":"KL5R5IFAFMIE","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"KL5R5IFAFMIEUVFQ","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"KL5R5IFA","created_at":"2026-05-18T12:29:29.992203+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/KL5R5IFAFMIEUVFQT23AXFLST2","json":"https://pith.science/pith/KL5R5IFAFMIEUVFQT23AXFLST2.json","graph_json":"https://pith.science/api/pith-number/KL5R5IFAFMIEUVFQT23AXFLST2/graph.json","events_json":"https://pith.science/api/pith-number/KL5R5IFAFMIEUVFQT23AXFLST2/events.json","paper":"https://pith.science/paper/KL5R5IFA"},"agent_actions":{"view_html":"https://pith.science/pith/KL5R5IFAFMIEUVFQT23AXFLST2","download_json":"https://pith.science/pith/KL5R5IFAFMIEUVFQT23AXFLST2.json","view_paper":"https://pith.science/paper/KL5R5IFA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06729&json=true","fetch_graph":"https://pith.science/api/pith-number/KL5R5IFAFMIEUVFQT23AXFLST2/graph.json","fetch_events":"https://pith.science/api/pith-number/KL5R5IFAFMIEUVFQT23AXFLST2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KL5R5IFAFMIEUVFQT23AXFLST2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KL5R5IFAFMIEUVFQT23AXFLST2/action/storage_attestation","attest_author":"https://pith.science/pith/KL5R5IFAFMIEUVFQT23AXFLST2/action/author_attestation","sign_citation":"https://pith.science/pith/KL5R5IFAFMIEUVFQT23AXFLST2/action/citation_signature","submit_replication":"https://pith.science/pith/KL5R5IFAFMIEUVFQT23AXFLST2/action/replication_record"}},"created_at":"2026-05-18T01:31:30.007453+00:00","updated_at":"2026-05-18T01:31:30.007453+00:00"}