{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:VOUIHLOPLIBVHL6EOJOX2V4Y6J","short_pith_number":"pith:VOUIHLOP","schema_version":"1.0","canonical_sha256":"aba883adcf5a0353afc4725d7d5798f27d9b5ceed26262b055b5766ada92c895","source":{"kind":"arxiv","id":"2405.09920","version":3},"attestation_state":"computed","paper":{"title":"Dynamic online matching with budget refills","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cl\\'ement Calauz\\`enes, Maria Cherifa (ENSAE Paris), Vianney Perchet (ENSAE Paris)","submitted_at":"2024-05-16T09:19:08Z","abstract_excerpt":"Inspired by sequential budgeted allocation problems, we study the online matching problem with budget refills. In this context, we consider an online bipartite graph $G=(U,V,E)$, where the nodes in $V$ are discovered sequentially and nodes in $U$ are known beforehand. Each $u\\in U$ is endowed with a budget $b_{u,t}\\in \\mathbb{N}$ that dynamically evolves over time. Unlike the canonical setting, in many applications, the budget can be refilled from time to time, which leads to a much richer dynamic that we consider here. Intuitively, adding extra budgets in $U$ seems to ease the matching task, "},"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":"2405.09920","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-05-16T09:19:08Z","cross_cats_sorted":[],"title_canon_sha256":"fcae69f98c2c57be2607d026ac4d2fdfecebafcbb5a8d561b0b95b9238e22489","abstract_canon_sha256":"50b933cccc70e21ced1c1b639d269e184cce96a39d53006f0439378362c99f6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:32:15.290946Z","signature_b64":"j9fsTMUmsDI1+mT8zM5Fa+gGB5kf9dpTdAg3MX2OsiNSsyrFRtX57ESjZVVC/kSzrKkDRm3yraUC9lspyoG6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aba883adcf5a0353afc4725d7d5798f27d9b5ceed26262b055b5766ada92c895","last_reissued_at":"2026-07-05T11:32:15.290421Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:32:15.290421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic online matching with budget refills","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cl\\'ement Calauz\\`enes, Maria Cherifa (ENSAE Paris), Vianney Perchet (ENSAE Paris)","submitted_at":"2024-05-16T09:19:08Z","abstract_excerpt":"Inspired by sequential budgeted allocation problems, we study the online matching problem with budget refills. In this context, we consider an online bipartite graph $G=(U,V,E)$, where the nodes in $V$ are discovered sequentially and nodes in $U$ are known beforehand. Each $u\\in U$ is endowed with a budget $b_{u,t}\\in \\mathbb{N}$ that dynamically evolves over time. Unlike the canonical setting, in many applications, the budget can be refilled from time to time, which leads to a much richer dynamic that we consider here. Intuitively, adding extra budgets in $U$ seems to ease the matching task, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.09920","kind":"arxiv","version":3},"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/2405.09920/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":"2405.09920","created_at":"2026-07-05T11:32:15.290487+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.09920v3","created_at":"2026-07-05T11:32:15.290487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.09920","created_at":"2026-07-05T11:32:15.290487+00:00"},{"alias_kind":"pith_short_12","alias_value":"VOUIHLOPLIBV","created_at":"2026-07-05T11:32:15.290487+00:00"},{"alias_kind":"pith_short_16","alias_value":"VOUIHLOPLIBVHL6E","created_at":"2026-07-05T11:32:15.290487+00:00"},{"alias_kind":"pith_short_8","alias_value":"VOUIHLOP","created_at":"2026-07-05T11:32:15.290487+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.04921","citing_title":"Online matching on stochastic block model","ref_index":2024,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VOUIHLOPLIBVHL6EOJOX2V4Y6J","json":"https://pith.science/pith/VOUIHLOPLIBVHL6EOJOX2V4Y6J.json","graph_json":"https://pith.science/api/pith-number/VOUIHLOPLIBVHL6EOJOX2V4Y6J/graph.json","events_json":"https://pith.science/api/pith-number/VOUIHLOPLIBVHL6EOJOX2V4Y6J/events.json","paper":"https://pith.science/paper/VOUIHLOP"},"agent_actions":{"view_html":"https://pith.science/pith/VOUIHLOPLIBVHL6EOJOX2V4Y6J","download_json":"https://pith.science/pith/VOUIHLOPLIBVHL6EOJOX2V4Y6J.json","view_paper":"https://pith.science/paper/VOUIHLOP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.09920&json=true","fetch_graph":"https://pith.science/api/pith-number/VOUIHLOPLIBVHL6EOJOX2V4Y6J/graph.json","fetch_events":"https://pith.science/api/pith-number/VOUIHLOPLIBVHL6EOJOX2V4Y6J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VOUIHLOPLIBVHL6EOJOX2V4Y6J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VOUIHLOPLIBVHL6EOJOX2V4Y6J/action/storage_attestation","attest_author":"https://pith.science/pith/VOUIHLOPLIBVHL6EOJOX2V4Y6J/action/author_attestation","sign_citation":"https://pith.science/pith/VOUIHLOPLIBVHL6EOJOX2V4Y6J/action/citation_signature","submit_replication":"https://pith.science/pith/VOUIHLOPLIBVHL6EOJOX2V4Y6J/action/replication_record"}},"created_at":"2026-07-05T11:32:15.290487+00:00","updated_at":"2026-07-05T11:32:15.290487+00:00"}