{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SBGCZURLUCVLNSNNZULEX5U4Z3","short_pith_number":"pith:SBGCZURL","schema_version":"1.0","canonical_sha256":"904c2cd22ba0aab6c9adcd164bf69ccef0cbfc55c41e210b6e85d62c37e9091d","source":{"kind":"arxiv","id":"1710.09806","version":1},"attestation_state":"computed","paper":{"title":"Minimum Circuit Size, Graph Isomorphism, and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andrew Morgan, Cristopher Moore, Dieter van Melkebeek, Eric Allender, Joshua A. Grochow","submitted_at":"2017-10-26T16:55:23Z","abstract_excerpt":"We study the computational power of deciding whether a given truth-table can be described by a circuit of a given size (the Minimum Circuit Size Problem, or MCSP for short), and of the variant denoted as MKTP where circuit size is replaced by a polynomially-related Kolmogorov measure. All prior reductions from supposedly-intractable problems to MCSP / MKTP hinged on the power of MCSP / MKTP to distinguish random distributions from distributions produced by hardness-based pseudorandom generator constructions. We develop a fundamentally different approach inspired by the well-known interactive 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":"1710.09806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-26T16:55:23Z","cross_cats_sorted":[],"title_canon_sha256":"2d7eef2fcbf1e692b06d4fe92a67b98b369644b3d31937553be13ebae6bfee26","abstract_canon_sha256":"df2549e794173fbf4a09ac4c691ca5dd1c35f350075147cb3796874eaf10ba08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:56.442386Z","signature_b64":"W8Ugm6MjipgxKqO63Fzq5j19ICa9jijBTdWEvjkyAl2H8WMHWrNsRAur8t/lPV2TdeApZLYJoNChNYNpgHaOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"904c2cd22ba0aab6c9adcd164bf69ccef0cbfc55c41e210b6e85d62c37e9091d","last_reissued_at":"2026-05-18T00:31:56.441985Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:56.441985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum Circuit Size, Graph Isomorphism, and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Andrew Morgan, Cristopher Moore, Dieter van Melkebeek, Eric Allender, Joshua A. Grochow","submitted_at":"2017-10-26T16:55:23Z","abstract_excerpt":"We study the computational power of deciding whether a given truth-table can be described by a circuit of a given size (the Minimum Circuit Size Problem, or MCSP for short), and of the variant denoted as MKTP where circuit size is replaced by a polynomially-related Kolmogorov measure. All prior reductions from supposedly-intractable problems to MCSP / MKTP hinged on the power of MCSP / MKTP to distinguish random distributions from distributions produced by hardness-based pseudorandom generator constructions. We develop a fundamentally different approach inspired by the well-known interactive p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09806","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":"1710.09806","created_at":"2026-05-18T00:31:56.442052+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.09806v1","created_at":"2026-05-18T00:31:56.442052+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09806","created_at":"2026-05-18T00:31:56.442052+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBGCZURLUCVL","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBGCZURLUCVLNSNN","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBGCZURL","created_at":"2026-05-18T12:31:43.269735+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/SBGCZURLUCVLNSNNZULEX5U4Z3","json":"https://pith.science/pith/SBGCZURLUCVLNSNNZULEX5U4Z3.json","graph_json":"https://pith.science/api/pith-number/SBGCZURLUCVLNSNNZULEX5U4Z3/graph.json","events_json":"https://pith.science/api/pith-number/SBGCZURLUCVLNSNNZULEX5U4Z3/events.json","paper":"https://pith.science/paper/SBGCZURL"},"agent_actions":{"view_html":"https://pith.science/pith/SBGCZURLUCVLNSNNZULEX5U4Z3","download_json":"https://pith.science/pith/SBGCZURLUCVLNSNNZULEX5U4Z3.json","view_paper":"https://pith.science/paper/SBGCZURL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.09806&json=true","fetch_graph":"https://pith.science/api/pith-number/SBGCZURLUCVLNSNNZULEX5U4Z3/graph.json","fetch_events":"https://pith.science/api/pith-number/SBGCZURLUCVLNSNNZULEX5U4Z3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBGCZURLUCVLNSNNZULEX5U4Z3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBGCZURLUCVLNSNNZULEX5U4Z3/action/storage_attestation","attest_author":"https://pith.science/pith/SBGCZURLUCVLNSNNZULEX5U4Z3/action/author_attestation","sign_citation":"https://pith.science/pith/SBGCZURLUCVLNSNNZULEX5U4Z3/action/citation_signature","submit_replication":"https://pith.science/pith/SBGCZURLUCVLNSNNZULEX5U4Z3/action/replication_record"}},"created_at":"2026-05-18T00:31:56.442052+00:00","updated_at":"2026-05-18T00:31:56.442052+00:00"}