{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4FPPZWOYZ2ECMKHHWRG6ZC6UFA","short_pith_number":"pith:4FPPZWOY","schema_version":"1.0","canonical_sha256":"e15efcd9d8ce882628e7b44dec8bd4280a660f2b232c87a113e4836bf30bbac7","source":{"kind":"arxiv","id":"2605.26886","version":1},"attestation_state":"computed","paper":{"title":"Parsimonious Learning-Augmented Online Metric Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Phanu Vajanopath, Yongho Shin","submitted_at":"2026-05-26T11:47:58Z","abstract_excerpt":"Learning-augmented algorithms have received significant attention in recent years, particularly in the context of online optimization. Motivated by the high computational cost of generating predictions, a growing line of work studies the tradeoff between performance guarantees and the number of predictions used in learning-augmented algorithms for problems such as caching and metrical task systems. In this paper, we extend this line of research to online metric matching by developing parsimonious learning-augmented algorithms and establishing lower bounds on their performance. Our approach ext"},"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":"2605.26886","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-05-26T11:47:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6e158f7dca0263a930c658a677bee7f14c8dfa764148ea64ed49f464a31fd3f6","abstract_canon_sha256":"73b80c1d672c65868fcc7d2af08a8a5a23323fa5619463fd67d60259db95182c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:06:18.162359Z","signature_b64":"tTBWUgO7weqBppPAEe+fE0hx2lBIOYpCUf41dUTO/+TsLjNCHdmCdZ2bpxRrbU99zgx+WNSq0SUxyc6JJabeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e15efcd9d8ce882628e7b44dec8bd4280a660f2b232c87a113e4836bf30bbac7","last_reissued_at":"2026-05-27T01:06:18.161647Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:06:18.161647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parsimonious Learning-Augmented Online Metric Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Phanu Vajanopath, Yongho Shin","submitted_at":"2026-05-26T11:47:58Z","abstract_excerpt":"Learning-augmented algorithms have received significant attention in recent years, particularly in the context of online optimization. Motivated by the high computational cost of generating predictions, a growing line of work studies the tradeoff between performance guarantees and the number of predictions used in learning-augmented algorithms for problems such as caching and metrical task systems. In this paper, we extend this line of research to online metric matching by developing parsimonious learning-augmented algorithms and establishing lower bounds on their performance. Our approach ext"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26886","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.26886/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":"2605.26886","created_at":"2026-05-27T01:06:18.161760+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.26886v1","created_at":"2026-05-27T01:06:18.161760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26886","created_at":"2026-05-27T01:06:18.161760+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FPPZWOYZ2EC","created_at":"2026-05-27T01:06:18.161760+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FPPZWOYZ2ECMKHH","created_at":"2026-05-27T01:06:18.161760+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FPPZWOY","created_at":"2026-05-27T01:06:18.161760+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/4FPPZWOYZ2ECMKHHWRG6ZC6UFA","json":"https://pith.science/pith/4FPPZWOYZ2ECMKHHWRG6ZC6UFA.json","graph_json":"https://pith.science/api/pith-number/4FPPZWOYZ2ECMKHHWRG6ZC6UFA/graph.json","events_json":"https://pith.science/api/pith-number/4FPPZWOYZ2ECMKHHWRG6ZC6UFA/events.json","paper":"https://pith.science/paper/4FPPZWOY"},"agent_actions":{"view_html":"https://pith.science/pith/4FPPZWOYZ2ECMKHHWRG6ZC6UFA","download_json":"https://pith.science/pith/4FPPZWOYZ2ECMKHHWRG6ZC6UFA.json","view_paper":"https://pith.science/paper/4FPPZWOY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.26886&json=true","fetch_graph":"https://pith.science/api/pith-number/4FPPZWOYZ2ECMKHHWRG6ZC6UFA/graph.json","fetch_events":"https://pith.science/api/pith-number/4FPPZWOYZ2ECMKHHWRG6ZC6UFA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FPPZWOYZ2ECMKHHWRG6ZC6UFA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FPPZWOYZ2ECMKHHWRG6ZC6UFA/action/storage_attestation","attest_author":"https://pith.science/pith/4FPPZWOYZ2ECMKHHWRG6ZC6UFA/action/author_attestation","sign_citation":"https://pith.science/pith/4FPPZWOYZ2ECMKHHWRG6ZC6UFA/action/citation_signature","submit_replication":"https://pith.science/pith/4FPPZWOYZ2ECMKHHWRG6ZC6UFA/action/replication_record"}},"created_at":"2026-05-27T01:06:18.161760+00:00","updated_at":"2026-05-27T01:06:18.161760+00:00"}