{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:WQMHAQTSLFPM5H6K2T2OGDQQO2","short_pith_number":"pith:WQMHAQTS","schema_version":"1.0","canonical_sha256":"b418704272595ece9fcad4f4e30e1076bd9928f7410146f2550165effc1ce618","source":{"kind":"arxiv","id":"1511.07147","version":2},"attestation_state":"computed","paper":{"title":"A PAC Approach to Application-Specific Algorithm Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Rishi Gupta, Tim Roughgarden","submitted_at":"2015-11-23T09:30:19Z","abstract_excerpt":"The best algorithm for a computational problem generally depends on the \"relevant inputs,\" a concept that depends on the application domain and often defies formal articulation. While there is a large literature on empirical approaches to selecting the best algorithm for a given application domain, there has been surprisingly little theoretical analysis of the problem.\n  This paper adapts concepts from statistical and online learning theory to reason about application-specific algorithm selection. Our models capture several state-of-the-art empirical and theoretical approaches to the problem, "},"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":"1511.07147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-23T09:30:19Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"50aee00a4b2be376830369353c7e458990c274590469686db8f48cd43549558c","abstract_canon_sha256":"d85ac8bf02f641f42d2553dd85eb98311c1646adca5b97bad2a1929402202aff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:21.105141Z","signature_b64":"2Hg9Ag71Pn1bv+FrmO6By/AwHW9wMiVB1Vooy57cDK1nAqvxZw3GViAgYBbHiP3UA1Uevjfmk11+Dd2sD5eYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b418704272595ece9fcad4f4e30e1076bd9928f7410146f2550165effc1ce618","last_reissued_at":"2026-05-18T01:06:21.104476Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:21.104476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A PAC Approach to Application-Specific Algorithm Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Rishi Gupta, Tim Roughgarden","submitted_at":"2015-11-23T09:30:19Z","abstract_excerpt":"The best algorithm for a computational problem generally depends on the \"relevant inputs,\" a concept that depends on the application domain and often defies formal articulation. While there is a large literature on empirical approaches to selecting the best algorithm for a given application domain, there has been surprisingly little theoretical analysis of the problem.\n  This paper adapts concepts from statistical and online learning theory to reason about application-specific algorithm selection. Our models capture several state-of-the-art empirical and theoretical approaches to the problem, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07147","kind":"arxiv","version":2},"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":"1511.07147","created_at":"2026-05-18T01:06:21.104570+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07147v2","created_at":"2026-05-18T01:06:21.104570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07147","created_at":"2026-05-18T01:06:21.104570+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQMHAQTSLFPM","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQMHAQTSLFPM5H6K","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQMHAQTS","created_at":"2026-05-18T12:29:47.479230+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/WQMHAQTSLFPM5H6K2T2OGDQQO2","json":"https://pith.science/pith/WQMHAQTSLFPM5H6K2T2OGDQQO2.json","graph_json":"https://pith.science/api/pith-number/WQMHAQTSLFPM5H6K2T2OGDQQO2/graph.json","events_json":"https://pith.science/api/pith-number/WQMHAQTSLFPM5H6K2T2OGDQQO2/events.json","paper":"https://pith.science/paper/WQMHAQTS"},"agent_actions":{"view_html":"https://pith.science/pith/WQMHAQTSLFPM5H6K2T2OGDQQO2","download_json":"https://pith.science/pith/WQMHAQTSLFPM5H6K2T2OGDQQO2.json","view_paper":"https://pith.science/paper/WQMHAQTS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07147&json=true","fetch_graph":"https://pith.science/api/pith-number/WQMHAQTSLFPM5H6K2T2OGDQQO2/graph.json","fetch_events":"https://pith.science/api/pith-number/WQMHAQTSLFPM5H6K2T2OGDQQO2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQMHAQTSLFPM5H6K2T2OGDQQO2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQMHAQTSLFPM5H6K2T2OGDQQO2/action/storage_attestation","attest_author":"https://pith.science/pith/WQMHAQTSLFPM5H6K2T2OGDQQO2/action/author_attestation","sign_citation":"https://pith.science/pith/WQMHAQTSLFPM5H6K2T2OGDQQO2/action/citation_signature","submit_replication":"https://pith.science/pith/WQMHAQTSLFPM5H6K2T2OGDQQO2/action/replication_record"}},"created_at":"2026-05-18T01:06:21.104570+00:00","updated_at":"2026-05-18T01:06:21.104570+00:00"}