{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2FA62HAD2CZTBPRBFVNU2MM5SK","short_pith_number":"pith:2FA62HAD","schema_version":"1.0","canonical_sha256":"d141ed1c03d0b330be212d5b4d319d929d864216400089b9e2712ebf9beb9f13","source":{"kind":"arxiv","id":"1012.2034","version":1},"attestation_state":"computed","paper":{"title":"Robust Simulations and Significant Separations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Lance Fortnow, Rahul Santhanam","submitted_at":"2010-12-09T15:47:35Z","abstract_excerpt":"We define and study a new notion of \"robust simulations\" between complexity classes which is intermediate between the traditional notions of infinitely-often and almost-everywhere, as well as a corresponding notion of \"significant separations\". A language L has a robust simulation in a complexity class C if there is a language in C which agrees with L on arbitrarily large polynomial stretches of input lengths. There is a significant separation of L from C if there is no robust simulation of L in C. The new notion of simulation is a cleaner and more natural notion of simulation than the infinit"},"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":"1012.2034","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-12-09T15:47:35Z","cross_cats_sorted":[],"title_canon_sha256":"47d719cb960abfe9e680530300f2a71a11f0b71749fe10f811fe055ac0032c58","abstract_canon_sha256":"0d58c2c6cb61369b40569cb60d4ec640a0d00219de967ef4e2278efec589f730"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:49.143601Z","signature_b64":"8a/kSZeYATWjsih+PcbG6tKcraXt87csHXQVOdYUhWxbPosH7NcDwFPPCJVPzAt9pV74BtXKfaCT+GoWS64VCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d141ed1c03d0b330be212d5b4d319d929d864216400089b9e2712ebf9beb9f13","last_reissued_at":"2026-05-18T04:33:49.142736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:49.142736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Simulations and Significant Separations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Lance Fortnow, Rahul Santhanam","submitted_at":"2010-12-09T15:47:35Z","abstract_excerpt":"We define and study a new notion of \"robust simulations\" between complexity classes which is intermediate between the traditional notions of infinitely-often and almost-everywhere, as well as a corresponding notion of \"significant separations\". A language L has a robust simulation in a complexity class C if there is a language in C which agrees with L on arbitrarily large polynomial stretches of input lengths. There is a significant separation of L from C if there is no robust simulation of L in C. The new notion of simulation is a cleaner and more natural notion of simulation than the infinit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2034","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":"1012.2034","created_at":"2026-05-18T04:33:49.142899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.2034v1","created_at":"2026-05-18T04:33:49.142899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2034","created_at":"2026-05-18T04:33:49.142899+00:00"},{"alias_kind":"pith_short_12","alias_value":"2FA62HAD2CZT","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2FA62HAD2CZTBPRB","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2FA62HAD","created_at":"2026-05-18T12:26:03.138858+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/2FA62HAD2CZTBPRBFVNU2MM5SK","json":"https://pith.science/pith/2FA62HAD2CZTBPRBFVNU2MM5SK.json","graph_json":"https://pith.science/api/pith-number/2FA62HAD2CZTBPRBFVNU2MM5SK/graph.json","events_json":"https://pith.science/api/pith-number/2FA62HAD2CZTBPRBFVNU2MM5SK/events.json","paper":"https://pith.science/paper/2FA62HAD"},"agent_actions":{"view_html":"https://pith.science/pith/2FA62HAD2CZTBPRBFVNU2MM5SK","download_json":"https://pith.science/pith/2FA62HAD2CZTBPRBFVNU2MM5SK.json","view_paper":"https://pith.science/paper/2FA62HAD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.2034&json=true","fetch_graph":"https://pith.science/api/pith-number/2FA62HAD2CZTBPRBFVNU2MM5SK/graph.json","fetch_events":"https://pith.science/api/pith-number/2FA62HAD2CZTBPRBFVNU2MM5SK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2FA62HAD2CZTBPRBFVNU2MM5SK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2FA62HAD2CZTBPRBFVNU2MM5SK/action/storage_attestation","attest_author":"https://pith.science/pith/2FA62HAD2CZTBPRBFVNU2MM5SK/action/author_attestation","sign_citation":"https://pith.science/pith/2FA62HAD2CZTBPRBFVNU2MM5SK/action/citation_signature","submit_replication":"https://pith.science/pith/2FA62HAD2CZTBPRBFVNU2MM5SK/action/replication_record"}},"created_at":"2026-05-18T04:33:49.142899+00:00","updated_at":"2026-05-18T04:33:49.142899+00:00"}