{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HI73NG2ERZCKHLZ6RESTAO263E","short_pith_number":"pith:HI73NG2E","schema_version":"1.0","canonical_sha256":"3a3fb69b448e44a3af3e8925303b5ed92d20c9aada08a7f290abbb5a15f7e0f4","source":{"kind":"arxiv","id":"1606.00581","version":1},"attestation_state":"computed","paper":{"title":"Online Budgeted Truthful Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Marceau Coupechoux, Rahul Vaze","submitted_at":"2016-06-02T08:32:08Z","abstract_excerpt":"An online truthful budgeted matching problem is considered for a bipartite graph, where the right vertices are available ahead of time, and individual left vertices arrive sequentially. On arrival of a left vertex, its edge utilities (or weights) to all the right vertices and a corresponding cost (or bid) are revealed. If a left vertex is matched to any of the right vertices, then it has to be paid at least as much as its cost. The problem is to match each left vertex instantaneously and irrevocably to any one of the right vertices, if at all, to find the maximum weight matching that is truthf"},"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":"1606.00581","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-02T08:32:08Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"9988a5eff249c8a2b0f2fd7645d0e6387a467fb0bddb37e2cfb55e44b576edf2","abstract_canon_sha256":"6c56cb98cee29f38e814f1c261047eb2f36c25c47c2bdce59272d1b6b3e41647"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:04.121624Z","signature_b64":"gTO2MHGFv62pQUplzKDeXT2uasPM5WaPD1Mz34vKAO0U51Yn+XBCwTvBgNdeLaW4W54ZeoF30QT2GEDW34e7Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a3fb69b448e44a3af3e8925303b5ed92d20c9aada08a7f290abbb5a15f7e0f4","last_reissued_at":"2026-05-18T01:13:04.121273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:04.121273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Budgeted Truthful Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Marceau Coupechoux, Rahul Vaze","submitted_at":"2016-06-02T08:32:08Z","abstract_excerpt":"An online truthful budgeted matching problem is considered for a bipartite graph, where the right vertices are available ahead of time, and individual left vertices arrive sequentially. On arrival of a left vertex, its edge utilities (or weights) to all the right vertices and a corresponding cost (or bid) are revealed. If a left vertex is matched to any of the right vertices, then it has to be paid at least as much as its cost. The problem is to match each left vertex instantaneously and irrevocably to any one of the right vertices, if at all, to find the maximum weight matching that is truthf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00581","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":""},"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":"1606.00581","created_at":"2026-05-18T01:13:04.121335+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.00581v1","created_at":"2026-05-18T01:13:04.121335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00581","created_at":"2026-05-18T01:13:04.121335+00:00"},{"alias_kind":"pith_short_12","alias_value":"HI73NG2ERZCK","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HI73NG2ERZCKHLZ6","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HI73NG2E","created_at":"2026-05-18T12:30:19.053100+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/HI73NG2ERZCKHLZ6RESTAO263E","json":"https://pith.science/pith/HI73NG2ERZCKHLZ6RESTAO263E.json","graph_json":"https://pith.science/api/pith-number/HI73NG2ERZCKHLZ6RESTAO263E/graph.json","events_json":"https://pith.science/api/pith-number/HI73NG2ERZCKHLZ6RESTAO263E/events.json","paper":"https://pith.science/paper/HI73NG2E"},"agent_actions":{"view_html":"https://pith.science/pith/HI73NG2ERZCKHLZ6RESTAO263E","download_json":"https://pith.science/pith/HI73NG2ERZCKHLZ6RESTAO263E.json","view_paper":"https://pith.science/paper/HI73NG2E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.00581&json=true","fetch_graph":"https://pith.science/api/pith-number/HI73NG2ERZCKHLZ6RESTAO263E/graph.json","fetch_events":"https://pith.science/api/pith-number/HI73NG2ERZCKHLZ6RESTAO263E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HI73NG2ERZCKHLZ6RESTAO263E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HI73NG2ERZCKHLZ6RESTAO263E/action/storage_attestation","attest_author":"https://pith.science/pith/HI73NG2ERZCKHLZ6RESTAO263E/action/author_attestation","sign_citation":"https://pith.science/pith/HI73NG2ERZCKHLZ6RESTAO263E/action/citation_signature","submit_replication":"https://pith.science/pith/HI73NG2ERZCKHLZ6RESTAO263E/action/replication_record"}},"created_at":"2026-05-18T01:13:04.121335+00:00","updated_at":"2026-05-18T01:13:04.121335+00:00"}