{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:UK2LTUB2KOELHSUN7W5XB6H7EO","short_pith_number":"pith:UK2LTUB2","schema_version":"1.0","canonical_sha256":"a2b4b9d03a5388b3ca8dfdbb70f8ff23a57f53a0b01e7cd83e17411a191fa311","source":{"kind":"arxiv","id":"0912.2652","version":7},"attestation_state":"computed","paper":{"title":"A complex analogue of Toda's Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.AT","math.CO"],"primary_cat":"math.AG","authors_text":"Saugata Basu","submitted_at":"2009-12-14T14:50:38Z","abstract_excerpt":"Toda \\cite{Toda} proved in 1989 that the (discrete) polynomial time hierarchy, $\\mathbf{PH}$, is contained in the class $\\mathbf{P}^{#\\mathbf{P}}$, namely the class of languages that can be decided by a Turing machine in polynomial time given access to an oracle with the power to compute a function in the counting complexity class $#\\mathbf{P}$. This result, which illustrates the power of counting is considered to be a seminal result in computational complexity theory. An analogous result (with a compactness hypothesis) in the complexity theory over the reals (in the sense of Blum-Shub-Smale r"},"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":"0912.2652","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2009-12-14T14:50:38Z","cross_cats_sorted":["cs.CC","math.AT","math.CO"],"title_canon_sha256":"c4fbd0466fe9584919784bdc73eabe7863a26e7fd721902f724431cad5d86bd3","abstract_canon_sha256":"4dcd40cfc8d9e4b72a1182b24d8fd8da142ef28591a157096b2b449963ca7cd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:06.177079Z","signature_b64":"6HM4CvC7WrI8GUrfN8+14ybLzd+pV8yscMT1cRw6Rhq/ol0gBliy+UtK0NH1htRiHoZCC0jYO7UA2zFt7FyHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2b4b9d03a5388b3ca8dfdbb70f8ff23a57f53a0b01e7cd83e17411a191fa311","last_reissued_at":"2026-05-18T04:11:06.176640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:06.176640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A complex analogue of Toda's Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.AT","math.CO"],"primary_cat":"math.AG","authors_text":"Saugata Basu","submitted_at":"2009-12-14T14:50:38Z","abstract_excerpt":"Toda \\cite{Toda} proved in 1989 that the (discrete) polynomial time hierarchy, $\\mathbf{PH}$, is contained in the class $\\mathbf{P}^{#\\mathbf{P}}$, namely the class of languages that can be decided by a Turing machine in polynomial time given access to an oracle with the power to compute a function in the counting complexity class $#\\mathbf{P}$. This result, which illustrates the power of counting is considered to be a seminal result in computational complexity theory. An analogous result (with a compactness hypothesis) in the complexity theory over the reals (in the sense of Blum-Shub-Smale r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.2652","kind":"arxiv","version":7},"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":"0912.2652","created_at":"2026-05-18T04:11:06.176704+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.2652v7","created_at":"2026-05-18T04:11:06.176704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.2652","created_at":"2026-05-18T04:11:06.176704+00:00"},{"alias_kind":"pith_short_12","alias_value":"UK2LTUB2KOEL","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"UK2LTUB2KOELHSUN","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"UK2LTUB2","created_at":"2026-05-18T12:26:02.257875+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/UK2LTUB2KOELHSUN7W5XB6H7EO","json":"https://pith.science/pith/UK2LTUB2KOELHSUN7W5XB6H7EO.json","graph_json":"https://pith.science/api/pith-number/UK2LTUB2KOELHSUN7W5XB6H7EO/graph.json","events_json":"https://pith.science/api/pith-number/UK2LTUB2KOELHSUN7W5XB6H7EO/events.json","paper":"https://pith.science/paper/UK2LTUB2"},"agent_actions":{"view_html":"https://pith.science/pith/UK2LTUB2KOELHSUN7W5XB6H7EO","download_json":"https://pith.science/pith/UK2LTUB2KOELHSUN7W5XB6H7EO.json","view_paper":"https://pith.science/paper/UK2LTUB2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.2652&json=true","fetch_graph":"https://pith.science/api/pith-number/UK2LTUB2KOELHSUN7W5XB6H7EO/graph.json","fetch_events":"https://pith.science/api/pith-number/UK2LTUB2KOELHSUN7W5XB6H7EO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UK2LTUB2KOELHSUN7W5XB6H7EO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UK2LTUB2KOELHSUN7W5XB6H7EO/action/storage_attestation","attest_author":"https://pith.science/pith/UK2LTUB2KOELHSUN7W5XB6H7EO/action/author_attestation","sign_citation":"https://pith.science/pith/UK2LTUB2KOELHSUN7W5XB6H7EO/action/citation_signature","submit_replication":"https://pith.science/pith/UK2LTUB2KOELHSUN7W5XB6H7EO/action/replication_record"}},"created_at":"2026-05-18T04:11:06.176704+00:00","updated_at":"2026-05-18T04:11:06.176704+00:00"}