{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UU2UTSO62O4IQQPO4SASIQEBEL","short_pith_number":"pith:UU2UTSO6","schema_version":"1.0","canonical_sha256":"a53549c9ded3b88841eee48124408122d5d802ee90ae8230fb1e3c339dde8abc","source":{"kind":"arxiv","id":"1509.08123","version":1},"attestation_state":"computed","paper":{"title":"Amplification and Derandomization Without Slowdown","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Dana Moshkovitz, Ofer Grossman","submitted_at":"2015-09-27T19:01:47Z","abstract_excerpt":"We present techniques for decreasing the error probability of randomized algorithms and for converting randomized algorithms to deterministic (non-uniform) algorithms. Unlike most existing techniques that involve repetition of the randomized algorithm and hence a slowdown, our techniques produce algorithms with a similar run-time to the original randomized algorithms. The amplification technique is related to a certain stochastic multi-armed bandit problem. The derandomization technique - which is the main contribution of this work - points to an intriguing connection between derandomization a"},"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":"1509.08123","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-27T19:01:47Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"79fd4b84bbd0492626ff6778478f0496c1ea9fceaf0d4d0cd59e3230ae570045","abstract_canon_sha256":"03da34732686af29cc4e005d19103cd8247dcec6bf775aa890237b9c535369a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:54.672430Z","signature_b64":"ur2DAK+ZUc1jeOQ4pxd28dZ4SEBHnW1p2+RfYrJvCcxe2HsGM7K39KzVNnEdRzdkFSoPvr6MAuxtQoYLZoyPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a53549c9ded3b88841eee48124408122d5d802ee90ae8230fb1e3c339dde8abc","last_reissued_at":"2026-05-18T01:31:54.671985Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:54.671985Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Amplification and Derandomization Without Slowdown","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Dana Moshkovitz, Ofer Grossman","submitted_at":"2015-09-27T19:01:47Z","abstract_excerpt":"We present techniques for decreasing the error probability of randomized algorithms and for converting randomized algorithms to deterministic (non-uniform) algorithms. Unlike most existing techniques that involve repetition of the randomized algorithm and hence a slowdown, our techniques produce algorithms with a similar run-time to the original randomized algorithms. The amplification technique is related to a certain stochastic multi-armed bandit problem. The derandomization technique - which is the main contribution of this work - points to an intriguing connection between derandomization a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08123","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":"1509.08123","created_at":"2026-05-18T01:31:54.672054+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.08123v1","created_at":"2026-05-18T01:31:54.672054+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08123","created_at":"2026-05-18T01:31:54.672054+00:00"},{"alias_kind":"pith_short_12","alias_value":"UU2UTSO62O4I","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UU2UTSO62O4IQQPO","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UU2UTSO6","created_at":"2026-05-18T12:29:44.643036+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/UU2UTSO62O4IQQPO4SASIQEBEL","json":"https://pith.science/pith/UU2UTSO62O4IQQPO4SASIQEBEL.json","graph_json":"https://pith.science/api/pith-number/UU2UTSO62O4IQQPO4SASIQEBEL/graph.json","events_json":"https://pith.science/api/pith-number/UU2UTSO62O4IQQPO4SASIQEBEL/events.json","paper":"https://pith.science/paper/UU2UTSO6"},"agent_actions":{"view_html":"https://pith.science/pith/UU2UTSO62O4IQQPO4SASIQEBEL","download_json":"https://pith.science/pith/UU2UTSO62O4IQQPO4SASIQEBEL.json","view_paper":"https://pith.science/paper/UU2UTSO6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.08123&json=true","fetch_graph":"https://pith.science/api/pith-number/UU2UTSO62O4IQQPO4SASIQEBEL/graph.json","fetch_events":"https://pith.science/api/pith-number/UU2UTSO62O4IQQPO4SASIQEBEL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UU2UTSO62O4IQQPO4SASIQEBEL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UU2UTSO62O4IQQPO4SASIQEBEL/action/storage_attestation","attest_author":"https://pith.science/pith/UU2UTSO62O4IQQPO4SASIQEBEL/action/author_attestation","sign_citation":"https://pith.science/pith/UU2UTSO62O4IQQPO4SASIQEBEL/action/citation_signature","submit_replication":"https://pith.science/pith/UU2UTSO62O4IQQPO4SASIQEBEL/action/replication_record"}},"created_at":"2026-05-18T01:31:54.672054+00:00","updated_at":"2026-05-18T01:31:54.672054+00:00"}