{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SBGCZURLUCVLNSNNZULEX5U4Z3","short_pith_number":"pith:SBGCZURL","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"},"canonical_sha256":"904c2cd22ba0aab6c9adcd164bf69ccef0cbfc55c41e210b6e85d62c37e9091d","source":{"kind":"arxiv","id":"1710.09806","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09806","created_at":"2026-05-18T00:31:56Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09806v1","created_at":"2026-05-18T00:31:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09806","created_at":"2026-05-18T00:31:56Z"},{"alias_kind":"pith_short_12","alias_value":"SBGCZURLUCVL","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SBGCZURLUCVLNSNN","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SBGCZURL","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SBGCZURLUCVLNSNNZULEX5U4Z3","target":"record","payload":{"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"},"canonical_sha256":"904c2cd22ba0aab6c9adcd164bf69ccef0cbfc55c41e210b6e85d62c37e9091d","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"},"source_kind":"arxiv","source_id":"1710.09806","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:31:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sf5PDpk4fdEX0GBXqeB/nrgBssxZ0WqECu5hdKXLzjeu5JD2NOwJIYzG08t9Q/aT6c//36fEccFubgrkde2GBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:32:48.499800Z"},"content_sha256":"c9dae20f264bb5c66338c20e4c17d4840065b5aa959e83c6bb911a00cdc178de","schema_version":"1.0","event_id":"sha256:c9dae20f264bb5c66338c20e4c17d4840065b5aa959e83c6bb911a00cdc178de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SBGCZURLUCVLNSNNZULEX5U4Z3","target":"graph","payload":{"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"},"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:31:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aa7l7JHzEisogzOAjZvovznGg9bnoji580Ls1SVRlhDj6ou+llaInT6ZtXJ4NTUC9wnUWI35d62azRJft2EvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:32:48.500147Z"},"content_sha256":"8db410f040e4e5b434ada0866a75bcbe9320bd5738c6aee191e1a85414143f3f","schema_version":"1.0","event_id":"sha256:8db410f040e4e5b434ada0866a75bcbe9320bd5738c6aee191e1a85414143f3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SBGCZURLUCVLNSNNZULEX5U4Z3/bundle.json","state_url":"https://pith.science/pith/SBGCZURLUCVLNSNNZULEX5U4Z3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SBGCZURLUCVLNSNNZULEX5U4Z3/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-28T13:32:48Z","links":{"resolver":"https://pith.science/pith/SBGCZURLUCVLNSNNZULEX5U4Z3","bundle":"https://pith.science/pith/SBGCZURLUCVLNSNNZULEX5U4Z3/bundle.json","state":"https://pith.science/pith/SBGCZURLUCVLNSNNZULEX5U4Z3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SBGCZURLUCVLNSNNZULEX5U4Z3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SBGCZURLUCVLNSNNZULEX5U4Z3","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":"df2549e794173fbf4a09ac4c691ca5dd1c35f350075147cb3796874eaf10ba08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-26T16:55:23Z","title_canon_sha256":"2d7eef2fcbf1e692b06d4fe92a67b98b369644b3d31937553be13ebae6bfee26"},"schema_version":"1.0","source":{"id":"1710.09806","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09806","created_at":"2026-05-18T00:31:56Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09806v1","created_at":"2026-05-18T00:31:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09806","created_at":"2026-05-18T00:31:56Z"},{"alias_kind":"pith_short_12","alias_value":"SBGCZURLUCVL","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SBGCZURLUCVLNSNN","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SBGCZURL","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:8db410f040e4e5b434ada0866a75bcbe9320bd5738c6aee191e1a85414143f3f","target":"graph","created_at":"2026-05-18T00:31:56Z","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":"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","authors_text":"Andrew Morgan, Cristopher Moore, Dieter van Melkebeek, Eric Allender, Joshua A. Grochow","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-26T16:55:23Z","title":"Minimum Circuit Size, Graph Isomorphism, and Related Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09806","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:c9dae20f264bb5c66338c20e4c17d4840065b5aa959e83c6bb911a00cdc178de","target":"record","created_at":"2026-05-18T00:31:56Z","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":"df2549e794173fbf4a09ac4c691ca5dd1c35f350075147cb3796874eaf10ba08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-26T16:55:23Z","title_canon_sha256":"2d7eef2fcbf1e692b06d4fe92a67b98b369644b3d31937553be13ebae6bfee26"},"schema_version":"1.0","source":{"id":"1710.09806","kind":"arxiv","version":1}},"canonical_sha256":"904c2cd22ba0aab6c9adcd164bf69ccef0cbfc55c41e210b6e85d62c37e9091d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"904c2cd22ba0aab6c9adcd164bf69ccef0cbfc55c41e210b6e85d62c37e9091d","first_computed_at":"2026-05-18T00:31:56.441985Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:56.441985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W8Ugm6MjipgxKqO63Fzq5j19ICa9jijBTdWEvjkyAl2H8WMHWrNsRAur8t/lPV2TdeApZLYJoNChNYNpgHaOCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:56.442386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.09806","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9dae20f264bb5c66338c20e4c17d4840065b5aa959e83c6bb911a00cdc178de","sha256:8db410f040e4e5b434ada0866a75bcbe9320bd5738c6aee191e1a85414143f3f"],"state_sha256":"421f1d4bd02f5778633ea013e77665133db6766a87481bf1404cf74f8520485d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ET8poCkEJ2nYfOyEEC+35D9Fkpor5incmuiLO97SMb0fpDU3WtzwIuy2rWJ1aRSCbNbt4/9LilFUOj4oePICw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:32:48.502065Z","bundle_sha256":"c833903aa6d6e16723bfed1c1ebd1e6c32975cfc13d8babce07f7b5b69be1525"}}