{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1998:FVFRBRID4B7RLVL6SFW5XVC7XG","short_pith_number":"pith:FVFRBRID","schema_version":"1.0","canonical_sha256":"2d4b10c503e07f15d57e916ddbd45fb9a18cf3c5cd30fc8ac902f215d27f33de","source":{"kind":"arxiv","id":"math/9807185","version":1},"attestation_state":"computed","paper":{"title":"Separating complexity classes using autoreducibility","license":"","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Dieter van Melkebeek (University of Chicago), Harry Buhrman (CWI), Lance Fortnow (University of Chicago), Leen Torenvliet (University of Amsterdam)","submitted_at":"1998-07-01T00:00:00Z","abstract_excerpt":"A set is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own input to the oracle. We use autoreducibility to separate the polynomial-time hierarchy from polynomial space by showing that all Turing-complete sets for certain levels of the exponential-time hierarchy are autoreducible but there exists some Turing-complete set for doubly exponential space that is not.\n  Although we already knew how to separate these classes using diagonalization, our proofs separate classes solely by showing they have different structural properties, thus applying Post's Progr"},"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":"math/9807185","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.LO","submitted_at":"1998-07-01T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"c920b2172f217a88f8832962ead899aec9ef8749268929a045d5132b5d18c8f7","abstract_canon_sha256":"9746d00a5f1ba6cfa14c37488668c623fee01cd8add05739a7ed75f72bba7145"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:33.830223Z","signature_b64":"rRhF+rEnwfOVBXVh1lse1lKqx5VOxVho4aKsqcNn4py4EdvlmH0bL5BAUXGNESPRJxbLxBGDZp4DVvOu/LMNDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d4b10c503e07f15d57e916ddbd45fb9a18cf3c5cd30fc8ac902f215d27f33de","last_reissued_at":"2026-05-18T01:05:33.829523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:33.829523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Separating complexity classes using autoreducibility","license":"","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Dieter van Melkebeek (University of Chicago), Harry Buhrman (CWI), Lance Fortnow (University of Chicago), Leen Torenvliet (University of Amsterdam)","submitted_at":"1998-07-01T00:00:00Z","abstract_excerpt":"A set is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own input to the oracle. We use autoreducibility to separate the polynomial-time hierarchy from polynomial space by showing that all Turing-complete sets for certain levels of the exponential-time hierarchy are autoreducible but there exists some Turing-complete set for doubly exponential space that is not.\n  Although we already knew how to separate these classes using diagonalization, our proofs separate classes solely by showing they have different structural properties, thus applying Post's Progr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9807185","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":"math/9807185","created_at":"2026-05-18T01:05:33.829594+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9807185v1","created_at":"2026-05-18T01:05:33.829594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9807185","created_at":"2026-05-18T01:05:33.829594+00:00"},{"alias_kind":"pith_short_12","alias_value":"FVFRBRID4B7R","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_16","alias_value":"FVFRBRID4B7RLVL6","created_at":"2026-05-18T12:25:49.038998+00:00"},{"alias_kind":"pith_short_8","alias_value":"FVFRBRID","created_at":"2026-05-18T12:25:49.038998+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/FVFRBRID4B7RLVL6SFW5XVC7XG","json":"https://pith.science/pith/FVFRBRID4B7RLVL6SFW5XVC7XG.json","graph_json":"https://pith.science/api/pith-number/FVFRBRID4B7RLVL6SFW5XVC7XG/graph.json","events_json":"https://pith.science/api/pith-number/FVFRBRID4B7RLVL6SFW5XVC7XG/events.json","paper":"https://pith.science/paper/FVFRBRID"},"agent_actions":{"view_html":"https://pith.science/pith/FVFRBRID4B7RLVL6SFW5XVC7XG","download_json":"https://pith.science/pith/FVFRBRID4B7RLVL6SFW5XVC7XG.json","view_paper":"https://pith.science/paper/FVFRBRID","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9807185&json=true","fetch_graph":"https://pith.science/api/pith-number/FVFRBRID4B7RLVL6SFW5XVC7XG/graph.json","fetch_events":"https://pith.science/api/pith-number/FVFRBRID4B7RLVL6SFW5XVC7XG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FVFRBRID4B7RLVL6SFW5XVC7XG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FVFRBRID4B7RLVL6SFW5XVC7XG/action/storage_attestation","attest_author":"https://pith.science/pith/FVFRBRID4B7RLVL6SFW5XVC7XG/action/author_attestation","sign_citation":"https://pith.science/pith/FVFRBRID4B7RLVL6SFW5XVC7XG/action/citation_signature","submit_replication":"https://pith.science/pith/FVFRBRID4B7RLVL6SFW5XVC7XG/action/replication_record"}},"created_at":"2026-05-18T01:05:33.829594+00:00","updated_at":"2026-05-18T01:05:33.829594+00:00"}