{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WQMHAQTSLFPM5H6K2T2OGDQQO2","short_pith_number":"pith:WQMHAQTS","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"},"canonical_sha256":"b418704272595ece9fcad4f4e30e1076bd9928f7410146f2550165effc1ce618","source":{"kind":"arxiv","id":"1511.07147","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07147","created_at":"2026-05-18T01:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07147v2","created_at":"2026-05-18T01:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07147","created_at":"2026-05-18T01:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"WQMHAQTSLFPM","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WQMHAQTSLFPM5H6K","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WQMHAQTS","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WQMHAQTSLFPM5H6K2T2OGDQQO2","target":"record","payload":{"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"},"canonical_sha256":"b418704272595ece9fcad4f4e30e1076bd9928f7410146f2550165effc1ce618","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"},"source_kind":"arxiv","source_id":"1511.07147","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hzao3Usp+FlIbCGlTNToBoxKGkLaqh+EBKK3+ut/U7JqimKNSSC0gPAn5+XK5KRk+rsktA/V8LVj9a/eYJaXCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:43:35.338280Z"},"content_sha256":"dac0818426cefdb69abb308591152ee131d8c1cd2ece3d847e7280192c4a5451","schema_version":"1.0","event_id":"sha256:dac0818426cefdb69abb308591152ee131d8c1cd2ece3d847e7280192c4a5451"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WQMHAQTSLFPM5H6K2T2OGDQQO2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KVE62OiBMw50+CdvHJmaGzdw0QfAV+T7eZUX6WMTfr081kJG35ZbN0oNy99Dr0U/qoAIKln+1eLo0eGQQdSLDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T13:43:35.338641Z"},"content_sha256":"06ded23838062e25e715a8e1d9fd945abd5921a3ec102f308b94e8a3a089e904","schema_version":"1.0","event_id":"sha256:06ded23838062e25e715a8e1d9fd945abd5921a3ec102f308b94e8a3a089e904"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WQMHAQTSLFPM5H6K2T2OGDQQO2/bundle.json","state_url":"https://pith.science/pith/WQMHAQTSLFPM5H6K2T2OGDQQO2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WQMHAQTSLFPM5H6K2T2OGDQQO2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T13:43:35Z","links":{"resolver":"https://pith.science/pith/WQMHAQTSLFPM5H6K2T2OGDQQO2","bundle":"https://pith.science/pith/WQMHAQTSLFPM5H6K2T2OGDQQO2/bundle.json","state":"https://pith.science/pith/WQMHAQTSLFPM5H6K2T2OGDQQO2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WQMHAQTSLFPM5H6K2T2OGDQQO2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WQMHAQTSLFPM5H6K2T2OGDQQO2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d85ac8bf02f641f42d2553dd85eb98311c1646adca5b97bad2a1929402202aff","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-23T09:30:19Z","title_canon_sha256":"50aee00a4b2be376830369353c7e458990c274590469686db8f48cd43549558c"},"schema_version":"1.0","source":{"id":"1511.07147","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07147","created_at":"2026-05-18T01:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07147v2","created_at":"2026-05-18T01:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07147","created_at":"2026-05-18T01:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"WQMHAQTSLFPM","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WQMHAQTSLFPM5H6K","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WQMHAQTS","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:06ded23838062e25e715a8e1d9fd945abd5921a3ec102f308b94e8a3a089e904","target":"graph","created_at":"2026-05-18T01:06:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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, ","authors_text":"Rishi Gupta, Tim Roughgarden","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-23T09:30:19Z","title":"A PAC Approach to Application-Specific Algorithm Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07147","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dac0818426cefdb69abb308591152ee131d8c1cd2ece3d847e7280192c4a5451","target":"record","created_at":"2026-05-18T01:06:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d85ac8bf02f641f42d2553dd85eb98311c1646adca5b97bad2a1929402202aff","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-23T09:30:19Z","title_canon_sha256":"50aee00a4b2be376830369353c7e458990c274590469686db8f48cd43549558c"},"schema_version":"1.0","source":{"id":"1511.07147","kind":"arxiv","version":2}},"canonical_sha256":"b418704272595ece9fcad4f4e30e1076bd9928f7410146f2550165effc1ce618","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b418704272595ece9fcad4f4e30e1076bd9928f7410146f2550165effc1ce618","first_computed_at":"2026-05-18T01:06:21.104476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:21.104476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Hg9Ag71Pn1bv+FrmO6By/AwHW9wMiVB1Vooy57cDK1nAqvxZw3GViAgYBbHiP3UA1Uevjfmk11+Dd2sD5eYDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:21.105141Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07147","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dac0818426cefdb69abb308591152ee131d8c1cd2ece3d847e7280192c4a5451","sha256:06ded23838062e25e715a8e1d9fd945abd5921a3ec102f308b94e8a3a089e904"],"state_sha256":"d2d6ed0eb751156af3fc453f4afe221b31641bdf1b47f9d9a9c6c4861ad596fa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZuqaqUKu5OS59qdnFHay9CLwiEyhiXBMvK0RIDyHDjGiaQGMob4FkrB+eTDvpK9bB+f6TttPIqvAZYsQkj4wAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T13:43:35.340590Z","bundle_sha256":"edeee935af0098b3fbdc4e13a60f4169f0bb3c5abb66d3325ccd8ccefd324992"}}