{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:KEWXZTC47C56HJMI2JFT3IFKBP","short_pith_number":"pith:KEWXZTC4","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"},"canonical_sha256":"512d7ccc5cf8bbe3a588d24b3da0aa0bc0af3932916f30ae0b11396a32d1b874","source":{"kind":"arxiv","id":"2412.03826","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.03826","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"arxiv_version","alias_value":"2412.03826v2","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03826","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"pith_short_12","alias_value":"KEWXZTC47C56","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"pith_short_16","alias_value":"KEWXZTC47C56HJMI","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"pith_short_8","alias_value":"KEWXZTC4","created_at":"2026-07-05T09:53:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:KEWXZTC47C56HJMI2JFT3IFKBP","target":"record","payload":{"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"},"canonical_sha256":"512d7ccc5cf8bbe3a588d24b3da0aa0bc0af3932916f30ae0b11396a32d1b874","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"},"source_kind":"arxiv","source_id":"2412.03826","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P8PPsRIb0YiG2fFG6w+LQVfdwGR6UTv+Z8ziWOtt3ModEUHNNJrrQ1S/z+5p/YyGMLqvvFlS1d9arPC3AtwLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T17:41:43.779319Z"},"content_sha256":"80de935d8cae389808ff5c11399d89f8002d66fb44066910b69b7a8c551b0dec","schema_version":"1.0","event_id":"sha256:80de935d8cae389808ff5c11399d89f8002d66fb44066910b69b7a8c551b0dec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:KEWXZTC47C56HJMI2JFT3IFKBP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:53:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SPLYix7AvHcESJcNIW3gJKBL+LnYOvhsiRYBMhutq+tdeMH3yhjQNhEf7jVg17a+MiLdSMyrmEAKIqXm+Rq/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-31T17:41:43.779601Z"},"content_sha256":"36b8122f21c8663c69ac55e589e434b206a19fd497255f5dcd80417001c9c465","schema_version":"1.0","event_id":"sha256:36b8122f21c8663c69ac55e589e434b206a19fd497255f5dcd80417001c9c465"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KEWXZTC47C56HJMI2JFT3IFKBP/bundle.json","state_url":"https://pith.science/pith/KEWXZTC47C56HJMI2JFT3IFKBP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KEWXZTC47C56HJMI2JFT3IFKBP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-31T17:41:43Z","links":{"resolver":"https://pith.science/pith/KEWXZTC47C56HJMI2JFT3IFKBP","bundle":"https://pith.science/pith/KEWXZTC47C56HJMI2JFT3IFKBP/bundle.json","state":"https://pith.science/pith/KEWXZTC47C56HJMI2JFT3IFKBP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KEWXZTC47C56HJMI2JFT3IFKBP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:KEWXZTC47C56HJMI2JFT3IFKBP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"71990cb7e0e4b1f6721f66a70a50704113f286540c10de451e99d5c489c89f8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-05T02:38:49Z","title_canon_sha256":"05158f50589d4e35fe974c77f4ea6d20da0505dd5a522414b2d36cf61aab0d09"},"schema_version":"1.0","source":{"id":"2412.03826","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.03826","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"arxiv_version","alias_value":"2412.03826v2","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03826","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"pith_short_12","alias_value":"KEWXZTC47C56","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"pith_short_16","alias_value":"KEWXZTC47C56HJMI","created_at":"2026-07-05T09:53:08Z"},{"alias_kind":"pith_short_8","alias_value":"KEWXZTC4","created_at":"2026-07-05T09:53:08Z"}],"graph_snapshots":[{"event_id":"sha256:36b8122f21c8663c69ac55e589e434b206a19fd497255f5dcd80417001c9c465","target":"graph","created_at":"2026-07-05T09:53:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.03826/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Billy Jin, Daniel Hathcock, Kalen Patton, Michael Zlatin, Sherry Sarkar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-05T02:38:49Z","title":"The Online Submodular Assignment Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03826","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:80de935d8cae389808ff5c11399d89f8002d66fb44066910b69b7a8c551b0dec","target":"record","created_at":"2026-07-05T09:53:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"71990cb7e0e4b1f6721f66a70a50704113f286540c10de451e99d5c489c89f8d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-12-05T02:38:49Z","title_canon_sha256":"05158f50589d4e35fe974c77f4ea6d20da0505dd5a522414b2d36cf61aab0d09"},"schema_version":"1.0","source":{"id":"2412.03826","kind":"arxiv","version":2}},"canonical_sha256":"512d7ccc5cf8bbe3a588d24b3da0aa0bc0af3932916f30ae0b11396a32d1b874","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"512d7ccc5cf8bbe3a588d24b3da0aa0bc0af3932916f30ae0b11396a32d1b874","first_computed_at":"2026-07-05T09:53:08.233916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:53:08.233916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qOLXqVfOMMYNrcAtgkTfGwHX3KAFaQHgvIxICq5QV0yH1i2jotqMdkyZmRfOiL46B9D4dajyw6ZJNBt3AVGpBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:53:08.234348Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.03826","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80de935d8cae389808ff5c11399d89f8002d66fb44066910b69b7a8c551b0dec","sha256:36b8122f21c8663c69ac55e589e434b206a19fd497255f5dcd80417001c9c465"],"state_sha256":"c0a08b3a3687af5bf89014c09e461a836eb05b154a301f4ffe34698028b803f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fMyCayYXG80zkldqVanfL5iI1IW7a6bh59DQnmyrJaWJOw1w4hD9A3+vudK9j9+LEN2UamQNBP2CrHHnjDVHCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-31T17:41:43.781788Z","bundle_sha256":"6d24c47ff1cf48e72aa42e76342d05cca3855320f654d9481be8735a24967c34"}}