{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4X7MNHX4K255HGKE4ENRQ4DOW2","short_pith_number":"pith:4X7MNHX4","schema_version":"1.0","canonical_sha256":"e5fec69efc56bbd39944e11b18706eb6bd6582d85d1981eb582adb2365818bc8","source":{"kind":"arxiv","id":"2505.22243","version":1},"attestation_state":"computed","paper":{"title":"UDuo: Universal Dual Optimization Framework for Online Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Bin Li, Diwei Liu, Jia Jia, Zehong Hu","submitted_at":"2025-05-28T11:25:50Z","abstract_excerpt":"Online resource allocation under budget constraints critically depends on proper modeling of user arrival dynamics. Classical approaches employ stochastic user arrival models to derive near-optimal solutions through fractional matching formulations of exposed users for downstream allocation tasks. However, this is no longer a reasonable assumption when the environment changes dynamically. In this work, We propose the Universal Dual optimization framework UDuo, a novel paradigm that fundamentally rethinks online allocation through three key innovations: (i) a temporal user arrival representatio"},"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":"2505.22243","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2025-05-28T11:25:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"aa77d099fd8f58a271d5035f5971ed63d04d52a2f24509e0e1a23e0f2bdddb51","abstract_canon_sha256":"0b5d31b9e24474d20489481f7eb99a1feeb4bf998e82a1e72693bc605be135e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:11.854815Z","signature_b64":"OUD7ufCL/wNe8v+G7TMIXyuuDhzf2qX4hiexfGCq9G2xPGe5uDzsmqasffsjBxdz/pFqA0IZFgbKqKmWQWuCCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5fec69efc56bbd39944e11b18706eb6bd6582d85d1981eb582adb2365818bc8","last_reissued_at":"2026-07-05T11:11:11.854360Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:11.854360Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"UDuo: Universal Dual Optimization Framework for Online Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Bin Li, Diwei Liu, Jia Jia, Zehong Hu","submitted_at":"2025-05-28T11:25:50Z","abstract_excerpt":"Online resource allocation under budget constraints critically depends on proper modeling of user arrival dynamics. Classical approaches employ stochastic user arrival models to derive near-optimal solutions through fractional matching formulations of exposed users for downstream allocation tasks. However, this is no longer a reasonable assumption when the environment changes dynamically. In this work, We propose the Universal Dual optimization framework UDuo, a novel paradigm that fundamentally rethinks online allocation through three key innovations: (i) a temporal user arrival representatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22243","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/2505.22243/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":"2505.22243","created_at":"2026-07-05T11:11:11.854420+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22243v1","created_at":"2026-07-05T11:11:11.854420+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22243","created_at":"2026-07-05T11:11:11.854420+00:00"},{"alias_kind":"pith_short_12","alias_value":"4X7MNHX4K255","created_at":"2026-07-05T11:11:11.854420+00:00"},{"alias_kind":"pith_short_16","alias_value":"4X7MNHX4K255HGKE","created_at":"2026-07-05T11:11:11.854420+00:00"},{"alias_kind":"pith_short_8","alias_value":"4X7MNHX4","created_at":"2026-07-05T11:11:11.854420+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/4X7MNHX4K255HGKE4ENRQ4DOW2","json":"https://pith.science/pith/4X7MNHX4K255HGKE4ENRQ4DOW2.json","graph_json":"https://pith.science/api/pith-number/4X7MNHX4K255HGKE4ENRQ4DOW2/graph.json","events_json":"https://pith.science/api/pith-number/4X7MNHX4K255HGKE4ENRQ4DOW2/events.json","paper":"https://pith.science/paper/4X7MNHX4"},"agent_actions":{"view_html":"https://pith.science/pith/4X7MNHX4K255HGKE4ENRQ4DOW2","download_json":"https://pith.science/pith/4X7MNHX4K255HGKE4ENRQ4DOW2.json","view_paper":"https://pith.science/paper/4X7MNHX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22243&json=true","fetch_graph":"https://pith.science/api/pith-number/4X7MNHX4K255HGKE4ENRQ4DOW2/graph.json","fetch_events":"https://pith.science/api/pith-number/4X7MNHX4K255HGKE4ENRQ4DOW2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4X7MNHX4K255HGKE4ENRQ4DOW2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4X7MNHX4K255HGKE4ENRQ4DOW2/action/storage_attestation","attest_author":"https://pith.science/pith/4X7MNHX4K255HGKE4ENRQ4DOW2/action/author_attestation","sign_citation":"https://pith.science/pith/4X7MNHX4K255HGKE4ENRQ4DOW2/action/citation_signature","submit_replication":"https://pith.science/pith/4X7MNHX4K255HGKE4ENRQ4DOW2/action/replication_record"}},"created_at":"2026-07-05T11:11:11.854420+00:00","updated_at":"2026-07-05T11:11:11.854420+00:00"}