{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JHVDXWPQJVIJQBFYC52CMJNUEJ","short_pith_number":"pith:JHVDXWPQ","schema_version":"1.0","canonical_sha256":"49ea3bd9f04d509804b817742625b422720785cdc54882ba1d00b9f56eb6ac09","source":{"kind":"arxiv","id":"1606.01172","version":1},"attestation_state":"computed","paper":{"title":"Generic case completeness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.GR"],"primary_cat":"cs.CC","authors_text":"Alexander Ushakov, Alexei Miasnikov","submitted_at":"2016-05-13T19:56:51Z","abstract_excerpt":"In this note we introduce a notion of a generically (strongly generically) NP-complete problem and show that the randomized bounded version of the halting problem is strongly generically NP-complete."},"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":"1606.01172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-05-13T19:56:51Z","cross_cats_sorted":["cs.LO","math.GR"],"title_canon_sha256":"7c249a4c162b3223421e8c0b3b905edfabe0ca54e9e5acc93259dc7f27aeb23b","abstract_canon_sha256":"091266e47b3b90b57a3e5f681f6bd1d924566687a61b6c1134f4fb81be722968"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:59.170103Z","signature_b64":"r9Y2fGjZArOnJd+4TFDflfaDgA5gxBLnDV35oYdw/N9TzkcISVVWgmcN19JO4M3HH37Kmmlw47f9mqDEVUqsAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49ea3bd9f04d509804b817742625b422720785cdc54882ba1d00b9f56eb6ac09","last_reissued_at":"2026-05-18T01:12:59.169747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:59.169747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generic case completeness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","math.GR"],"primary_cat":"cs.CC","authors_text":"Alexander Ushakov, Alexei Miasnikov","submitted_at":"2016-05-13T19:56:51Z","abstract_excerpt":"In this note we introduce a notion of a generically (strongly generically) NP-complete problem and show that the randomized bounded version of the halting problem is strongly generically NP-complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.01172","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":"1606.01172","created_at":"2026-05-18T01:12:59.169809+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.01172v1","created_at":"2026-05-18T01:12:59.169809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.01172","created_at":"2026-05-18T01:12:59.169809+00:00"},{"alias_kind":"pith_short_12","alias_value":"JHVDXWPQJVIJ","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JHVDXWPQJVIJQBFY","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JHVDXWPQ","created_at":"2026-05-18T12:30:25.849896+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/JHVDXWPQJVIJQBFYC52CMJNUEJ","json":"https://pith.science/pith/JHVDXWPQJVIJQBFYC52CMJNUEJ.json","graph_json":"https://pith.science/api/pith-number/JHVDXWPQJVIJQBFYC52CMJNUEJ/graph.json","events_json":"https://pith.science/api/pith-number/JHVDXWPQJVIJQBFYC52CMJNUEJ/events.json","paper":"https://pith.science/paper/JHVDXWPQ"},"agent_actions":{"view_html":"https://pith.science/pith/JHVDXWPQJVIJQBFYC52CMJNUEJ","download_json":"https://pith.science/pith/JHVDXWPQJVIJQBFYC52CMJNUEJ.json","view_paper":"https://pith.science/paper/JHVDXWPQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.01172&json=true","fetch_graph":"https://pith.science/api/pith-number/JHVDXWPQJVIJQBFYC52CMJNUEJ/graph.json","fetch_events":"https://pith.science/api/pith-number/JHVDXWPQJVIJQBFYC52CMJNUEJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JHVDXWPQJVIJQBFYC52CMJNUEJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JHVDXWPQJVIJQBFYC52CMJNUEJ/action/storage_attestation","attest_author":"https://pith.science/pith/JHVDXWPQJVIJQBFYC52CMJNUEJ/action/author_attestation","sign_citation":"https://pith.science/pith/JHVDXWPQJVIJQBFYC52CMJNUEJ/action/citation_signature","submit_replication":"https://pith.science/pith/JHVDXWPQJVIJQBFYC52CMJNUEJ/action/replication_record"}},"created_at":"2026-05-18T01:12:59.169809+00:00","updated_at":"2026-05-18T01:12:59.169809+00:00"}