{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GRKRIWWRRSGQPRZMXIUTPDMUCX","short_pith_number":"pith:GRKRIWWR","schema_version":"1.0","canonical_sha256":"3455145ad18c8d07c72cba29378d9415cf2def9583bd80cee16c90bffdb0b540","source":{"kind":"arxiv","id":"1712.09710","version":1},"attestation_state":"computed","paper":{"title":"On low for speed oracles","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.CC","authors_text":"Laurent Bienvenu, Rod Downey","submitted_at":"2017-12-27T23:27:47Z","abstract_excerpt":"Relativizing computations of Turing machines to an oracle is a central concept in the theory of computation, both in complexity theory and in computability theory(!). Inspired by lowness notions from computability theory, Allender introduced the concept of \"low for speed\" oracles. An oracle A is low for speed if relativizing to A has essentially no effect on computational complexity, meaning that if a decidable language can be decided in time $f(n)$ with access to oracle A, then it can be decided in time poly(f(n)) without any oracle. The existence of non-computable such A's was later proven b"},"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":"1712.09710","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2017-12-27T23:27:47Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"e83d7771c35119173fca3cd16150b0f90160f0ccb6b1e18a5e57bfd68a162477","abstract_canon_sha256":"a496325b7fa5b80cf10cb22483ea61d90b6df3ebddf228d16bf1c31a43ce4e97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:07.551278Z","signature_b64":"I2KXbjHwog3TEyXqJNCnJk4OlvdgQpjxP8LYSH8+/F6fD9txU+jEiCGdNo4EVe6HF4AHfqQR4JKrhE0szeyjDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3455145ad18c8d07c72cba29378d9415cf2def9583bd80cee16c90bffdb0b540","last_reissued_at":"2026-05-18T00:27:07.550752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:07.550752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On low for speed oracles","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.CC","authors_text":"Laurent Bienvenu, Rod Downey","submitted_at":"2017-12-27T23:27:47Z","abstract_excerpt":"Relativizing computations of Turing machines to an oracle is a central concept in the theory of computation, both in complexity theory and in computability theory(!). Inspired by lowness notions from computability theory, Allender introduced the concept of \"low for speed\" oracles. An oracle A is low for speed if relativizing to A has essentially no effect on computational complexity, meaning that if a decidable language can be decided in time $f(n)$ with access to oracle A, then it can be decided in time poly(f(n)) without any oracle. The existence of non-computable such A's was later proven b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09710","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":"1712.09710","created_at":"2026-05-18T00:27:07.550833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.09710v1","created_at":"2026-05-18T00:27:07.550833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09710","created_at":"2026-05-18T00:27:07.550833+00:00"},{"alias_kind":"pith_short_12","alias_value":"GRKRIWWRRSGQ","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GRKRIWWRRSGQPRZM","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GRKRIWWR","created_at":"2026-05-18T12:31:18.294218+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/GRKRIWWRRSGQPRZMXIUTPDMUCX","json":"https://pith.science/pith/GRKRIWWRRSGQPRZMXIUTPDMUCX.json","graph_json":"https://pith.science/api/pith-number/GRKRIWWRRSGQPRZMXIUTPDMUCX/graph.json","events_json":"https://pith.science/api/pith-number/GRKRIWWRRSGQPRZMXIUTPDMUCX/events.json","paper":"https://pith.science/paper/GRKRIWWR"},"agent_actions":{"view_html":"https://pith.science/pith/GRKRIWWRRSGQPRZMXIUTPDMUCX","download_json":"https://pith.science/pith/GRKRIWWRRSGQPRZMXIUTPDMUCX.json","view_paper":"https://pith.science/paper/GRKRIWWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.09710&json=true","fetch_graph":"https://pith.science/api/pith-number/GRKRIWWRRSGQPRZMXIUTPDMUCX/graph.json","fetch_events":"https://pith.science/api/pith-number/GRKRIWWRRSGQPRZMXIUTPDMUCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GRKRIWWRRSGQPRZMXIUTPDMUCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GRKRIWWRRSGQPRZMXIUTPDMUCX/action/storage_attestation","attest_author":"https://pith.science/pith/GRKRIWWRRSGQPRZMXIUTPDMUCX/action/author_attestation","sign_citation":"https://pith.science/pith/GRKRIWWRRSGQPRZMXIUTPDMUCX/action/citation_signature","submit_replication":"https://pith.science/pith/GRKRIWWRRSGQPRZMXIUTPDMUCX/action/replication_record"}},"created_at":"2026-05-18T00:27:07.550833+00:00","updated_at":"2026-05-18T00:27:07.550833+00:00"}