{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KEWXZTC47C56HJMI2JFT3IFKBP","short_pith_number":"pith:KEWXZTC4","schema_version":"1.0","canonical_sha256":"512d7ccc5cf8bbe3a588d24b3da0aa0bc0af3932916f30ae0b11396a32d1b874","source":{"kind":"arxiv","id":"2412.03826","version":2},"attestation_state":"computed","paper":{"title":"The Online Submodular Assignment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Billy Jin, Daniel Hathcock, Kalen Patton, Michael Zlatin, Sherry Sarkar","submitted_at":"2024-12-05T02:38:49Z","abstract_excerpt":"Online resource allocation is a rich and varied field. One of the most well-known problems in this area is online bipartite matching, introduced in 1990 by Karp, Vazirani, and Vazirani [KVV90]. Since then, many variants have been studied, including AdWords, the generalized assignment problem (GAP), and online submodular welfare maximization.\n  In this paper, we introduce a generalization of GAP which we call the submodular assignment problem (SAP). This generalization captures many online assignment problems, including all classical online bipartite matching problems as well as broader online "},"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":"2412.03826","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-05T02:38:49Z","cross_cats_sorted":[],"title_canon_sha256":"05158f50589d4e35fe974c77f4ea6d20da0505dd5a522414b2d36cf61aab0d09","abstract_canon_sha256":"71990cb7e0e4b1f6721f66a70a50704113f286540c10de451e99d5c489c89f8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:08.234348Z","signature_b64":"qOLXqVfOMMYNrcAtgkTfGwHX3KAFaQHgvIxICq5QV0yH1i2jotqMdkyZmRfOiL46B9D4dajyw6ZJNBt3AVGpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"512d7ccc5cf8bbe3a588d24b3da0aa0bc0af3932916f30ae0b11396a32d1b874","last_reissued_at":"2026-07-05T09:53:08.233916Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:08.233916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Online Submodular Assignment Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Billy Jin, Daniel Hathcock, Kalen Patton, Michael Zlatin, Sherry Sarkar","submitted_at":"2024-12-05T02:38:49Z","abstract_excerpt":"Online resource allocation is a rich and varied field. One of the most well-known problems in this area is online bipartite matching, introduced in 1990 by Karp, Vazirani, and Vazirani [KVV90]. Since then, many variants have been studied, including AdWords, the generalized assignment problem (GAP), and online submodular welfare maximization.\n  In this paper, we introduce a generalization of GAP which we call the submodular assignment problem (SAP). This generalization captures many online assignment problems, including all classical online bipartite matching problems as well as broader online "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03826","kind":"arxiv","version":2},"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/2412.03826/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":"2412.03826","created_at":"2026-07-05T09:53:08.233968+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.03826v2","created_at":"2026-07-05T09:53:08.233968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03826","created_at":"2026-07-05T09:53:08.233968+00:00"},{"alias_kind":"pith_short_12","alias_value":"KEWXZTC47C56","created_at":"2026-07-05T09:53:08.233968+00:00"},{"alias_kind":"pith_short_16","alias_value":"KEWXZTC47C56HJMI","created_at":"2026-07-05T09:53:08.233968+00:00"},{"alias_kind":"pith_short_8","alias_value":"KEWXZTC4","created_at":"2026-07-05T09:53:08.233968+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/KEWXZTC47C56HJMI2JFT3IFKBP","json":"https://pith.science/pith/KEWXZTC47C56HJMI2JFT3IFKBP.json","graph_json":"https://pith.science/api/pith-number/KEWXZTC47C56HJMI2JFT3IFKBP/graph.json","events_json":"https://pith.science/api/pith-number/KEWXZTC47C56HJMI2JFT3IFKBP/events.json","paper":"https://pith.science/paper/KEWXZTC4"},"agent_actions":{"view_html":"https://pith.science/pith/KEWXZTC47C56HJMI2JFT3IFKBP","download_json":"https://pith.science/pith/KEWXZTC47C56HJMI2JFT3IFKBP.json","view_paper":"https://pith.science/paper/KEWXZTC4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.03826&json=true","fetch_graph":"https://pith.science/api/pith-number/KEWXZTC47C56HJMI2JFT3IFKBP/graph.json","fetch_events":"https://pith.science/api/pith-number/KEWXZTC47C56HJMI2JFT3IFKBP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KEWXZTC47C56HJMI2JFT3IFKBP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KEWXZTC47C56HJMI2JFT3IFKBP/action/storage_attestation","attest_author":"https://pith.science/pith/KEWXZTC47C56HJMI2JFT3IFKBP/action/author_attestation","sign_citation":"https://pith.science/pith/KEWXZTC47C56HJMI2JFT3IFKBP/action/citation_signature","submit_replication":"https://pith.science/pith/KEWXZTC47C56HJMI2JFT3IFKBP/action/replication_record"}},"created_at":"2026-07-05T09:53:08.233968+00:00","updated_at":"2026-07-05T09:53:08.233968+00:00"}