{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UAKGXGVULHJWKMJGC7OH65HVXB","short_pith_number":"pith:UAKGXGVU","schema_version":"1.0","canonical_sha256":"a0146b9ab459d365312617dc7f74f5b84c70fac9a326039759af001bf59f7d6d","source":{"kind":"arxiv","id":"2606.26651","version":1},"attestation_state":"computed","paper":{"title":"Learning Anonymous Pricing for Online Resource Allocation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Yifan Wang, Yifeng Teng","submitted_at":"2026-06-25T06:25:09Z","abstract_excerpt":"We study the online resource allocation problem, where a seller sequentially receives independent requests for $m$ types of resources with limited supplies from $n$ heterogeneous agents arriving in an unknown order. Each request from an agent can be fulfilled in different ways, with resource consumption in $[0,1]^m$, and generates different values for the agent. The objective of the seller is to maximize the social welfare, which is the sum of the values obtained from each agent.\n  Recently, Ghuge, Singla, and Wang [GSW STOC'25] studied the learnability of the online resource allocation proble"},"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":"2606.26651","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-06-25T06:25:09Z","cross_cats_sorted":[],"title_canon_sha256":"004cdc38c4e48e977416b2f7546be852de9d9163a9324e38950d479e5e3668f3","abstract_canon_sha256":"624eedb05511dc3fa9e97cae1bef741c2912d3d38c227d5dae3b805b00aa3c8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:37.288439Z","signature_b64":"bW9xE57rB9xR9RC0HnYpHWzXPsxc/EQZD688rphFzyvFoo82Ccr3e+Z6Tn28tCGz7+alr/f0DADFtq0q8g9xBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0146b9ab459d365312617dc7f74f5b84c70fac9a326039759af001bf59f7d6d","last_reissued_at":"2026-06-26T01:15:37.288006Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:37.288006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Anonymous Pricing for Online Resource Allocation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Yifan Wang, Yifeng Teng","submitted_at":"2026-06-25T06:25:09Z","abstract_excerpt":"We study the online resource allocation problem, where a seller sequentially receives independent requests for $m$ types of resources with limited supplies from $n$ heterogeneous agents arriving in an unknown order. Each request from an agent can be fulfilled in different ways, with resource consumption in $[0,1]^m$, and generates different values for the agent. The objective of the seller is to maximize the social welfare, which is the sum of the values obtained from each agent.\n  Recently, Ghuge, Singla, and Wang [GSW STOC'25] studied the learnability of the online resource allocation proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26651","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/2606.26651/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":"2606.26651","created_at":"2026-06-26T01:15:37.288061+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.26651v1","created_at":"2026-06-26T01:15:37.288061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26651","created_at":"2026-06-26T01:15:37.288061+00:00"},{"alias_kind":"pith_short_12","alias_value":"UAKGXGVULHJW","created_at":"2026-06-26T01:15:37.288061+00:00"},{"alias_kind":"pith_short_16","alias_value":"UAKGXGVULHJWKMJG","created_at":"2026-06-26T01:15:37.288061+00:00"},{"alias_kind":"pith_short_8","alias_value":"UAKGXGVU","created_at":"2026-06-26T01:15:37.288061+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/UAKGXGVULHJWKMJGC7OH65HVXB","json":"https://pith.science/pith/UAKGXGVULHJWKMJGC7OH65HVXB.json","graph_json":"https://pith.science/api/pith-number/UAKGXGVULHJWKMJGC7OH65HVXB/graph.json","events_json":"https://pith.science/api/pith-number/UAKGXGVULHJWKMJGC7OH65HVXB/events.json","paper":"https://pith.science/paper/UAKGXGVU"},"agent_actions":{"view_html":"https://pith.science/pith/UAKGXGVULHJWKMJGC7OH65HVXB","download_json":"https://pith.science/pith/UAKGXGVULHJWKMJGC7OH65HVXB.json","view_paper":"https://pith.science/paper/UAKGXGVU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.26651&json=true","fetch_graph":"https://pith.science/api/pith-number/UAKGXGVULHJWKMJGC7OH65HVXB/graph.json","fetch_events":"https://pith.science/api/pith-number/UAKGXGVULHJWKMJGC7OH65HVXB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UAKGXGVULHJWKMJGC7OH65HVXB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UAKGXGVULHJWKMJGC7OH65HVXB/action/storage_attestation","attest_author":"https://pith.science/pith/UAKGXGVULHJWKMJGC7OH65HVXB/action/author_attestation","sign_citation":"https://pith.science/pith/UAKGXGVULHJWKMJGC7OH65HVXB/action/citation_signature","submit_replication":"https://pith.science/pith/UAKGXGVULHJWKMJGC7OH65HVXB/action/replication_record"}},"created_at":"2026-06-26T01:15:37.288061+00:00","updated_at":"2026-06-26T01:15:37.288061+00:00"}