{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:U6OBELHRAHZLI7D5MM6YPAPXRC","short_pith_number":"pith:U6OBELHR","schema_version":"1.0","canonical_sha256":"a79c122cf101f2b47c7d633d8781f788b0c5d2ace0e6a0e8dae4b8773a7dfd25","source":{"kind":"arxiv","id":"2011.11743","version":2},"attestation_state":"computed","paper":{"title":"Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Benjamin Moseley, Chenyang Xu, R. Ravi, Thomas Lavastida","submitted_at":"2020-11-23T21:38:57Z","abstract_excerpt":"We propose a new model for augmenting algorithms with predictions by requiring that they are formally learnable and instance robust. Learnability ensures that predictions can be efficiently constructed from a reasonable amount of past data. Instance robustness ensures that the prediction is robust to modest changes in the problem input, where the measure of the change may be problem specific. Instance robustness insists on a smooth degradation in performance as a function of the change. Ideally, the performance is never worse than worst-case bounds. This also allows predictions to be objective"},"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":"2011.11743","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-23T21:38:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"91fcf498d58bc025c67c0d73690a1fa1b5f0890f399200852651e13e1f7b0ab7","abstract_canon_sha256":"e8ca9a9f32bd71d86876c86d104aaca3450c64c3d8d303abb9ece0a56959572d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:54:29.650821Z","signature_b64":"gi/EHmsqWWnU/H3BD8MdbVXyad4uNabz9Tx6tJ9NWlW0weuHdEAYLdSGRkco5BkZKUqMxdaAuj/PkmJqfuWPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a79c122cf101f2b47c7d633d8781f788b0c5d2ace0e6a0e8dae4b8773a7dfd25","last_reissued_at":"2026-07-05T02:54:29.650348Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:54:29.650348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Benjamin Moseley, Chenyang Xu, R. Ravi, Thomas Lavastida","submitted_at":"2020-11-23T21:38:57Z","abstract_excerpt":"We propose a new model for augmenting algorithms with predictions by requiring that they are formally learnable and instance robust. Learnability ensures that predictions can be efficiently constructed from a reasonable amount of past data. Instance robustness ensures that the prediction is robust to modest changes in the problem input, where the measure of the change may be problem specific. Instance robustness insists on a smooth degradation in performance as a function of the change. Ideally, the performance is never worse than worst-case bounds. This also allows predictions to be objective"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.11743","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.11743/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2011.11743","created_at":"2026-07-05T02:54:29.650407+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.11743v2","created_at":"2026-07-05T02:54:29.650407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.11743","created_at":"2026-07-05T02:54:29.650407+00:00"},{"alias_kind":"pith_short_12","alias_value":"U6OBELHRAHZL","created_at":"2026-07-05T02:54:29.650407+00:00"},{"alias_kind":"pith_short_16","alias_value":"U6OBELHRAHZLI7D5","created_at":"2026-07-05T02:54:29.650407+00:00"},{"alias_kind":"pith_short_8","alias_value":"U6OBELHR","created_at":"2026-07-05T02:54:29.650407+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.02894","citing_title":"How much data is sufficient to learn high-performing algorithms? Generalization guarantees for data-driven algorithm design","ref_index":65,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U6OBELHRAHZLI7D5MM6YPAPXRC","json":"https://pith.science/pith/U6OBELHRAHZLI7D5MM6YPAPXRC.json","graph_json":"https://pith.science/api/pith-number/U6OBELHRAHZLI7D5MM6YPAPXRC/graph.json","events_json":"https://pith.science/api/pith-number/U6OBELHRAHZLI7D5MM6YPAPXRC/events.json","paper":"https://pith.science/paper/U6OBELHR"},"agent_actions":{"view_html":"https://pith.science/pith/U6OBELHRAHZLI7D5MM6YPAPXRC","download_json":"https://pith.science/pith/U6OBELHRAHZLI7D5MM6YPAPXRC.json","view_paper":"https://pith.science/paper/U6OBELHR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.11743&json=true","fetch_graph":"https://pith.science/api/pith-number/U6OBELHRAHZLI7D5MM6YPAPXRC/graph.json","fetch_events":"https://pith.science/api/pith-number/U6OBELHRAHZLI7D5MM6YPAPXRC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U6OBELHRAHZLI7D5MM6YPAPXRC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U6OBELHRAHZLI7D5MM6YPAPXRC/action/storage_attestation","attest_author":"https://pith.science/pith/U6OBELHRAHZLI7D5MM6YPAPXRC/action/author_attestation","sign_citation":"https://pith.science/pith/U6OBELHRAHZLI7D5MM6YPAPXRC/action/citation_signature","submit_replication":"https://pith.science/pith/U6OBELHRAHZLI7D5MM6YPAPXRC/action/replication_record"}},"created_at":"2026-07-05T02:54:29.650407+00:00","updated_at":"2026-07-05T02:54:29.650407+00:00"}