{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RFR5TJCV2RY5HVXOXWZVEAQSXL","short_pith_number":"pith:RFR5TJCV","schema_version":"1.0","canonical_sha256":"8963d9a455d471d3d6eebdb3520212bad943f982fea67cf6602db4671e214a03","source":{"kind":"arxiv","id":"1712.05450","version":1},"attestation_state":"computed","paper":{"title":"Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Morteza Zadimoghaddam, Nitish Korula, Vahab Mirrokni","submitted_at":"2017-12-14T20:47:22Z","abstract_excerpt":"In the Submodular Welfare Maximization (SWM) problem, the input consists of a set of $n$ items, each of which must be allocated to one of $m$ agents. Each agent $\\ell$ has a valuation function $v_\\ell$, where $v_\\ell(S)$ denotes the welfare obtained by this agent if she receives the set of items $S$. The functions $v_\\ell$ are all submodular; as is standard, we assume that they are monotone and $v_\\ell(\\emptyset) = 0$. The goal is to partition the items into $m$ disjoint subsets $S_1, S_2, \\ldots S_m$ in order to maximize the social welfare, defined as $\\sum_{\\ell = 1}^m v_\\ell(S_\\ell)$.\n  In "},"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":"1712.05450","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-12-14T20:47:22Z","cross_cats_sorted":[],"title_canon_sha256":"a138abb35eed6edc7e8859bc4b2fd7b5123442df151d15a68d2caa6ea2e80f36","abstract_canon_sha256":"0f9fa45a101d305794e627db243bcb4291581e9de364d33876a0d2be713a4de9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:56.407952Z","signature_b64":"U8CWru5MAcipRgFO1QuNKCvpygmWlG+zVnEnhT6/1+l52z0HSOqR7/LdHIJ+M4fdsGtYwOj2CTjJfARg+rvIBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8963d9a455d471d3d6eebdb3520212bad943f982fea67cf6602db4671e214a03","last_reissued_at":"2026-05-18T00:27:56.407292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:56.407292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Morteza Zadimoghaddam, Nitish Korula, Vahab Mirrokni","submitted_at":"2017-12-14T20:47:22Z","abstract_excerpt":"In the Submodular Welfare Maximization (SWM) problem, the input consists of a set of $n$ items, each of which must be allocated to one of $m$ agents. Each agent $\\ell$ has a valuation function $v_\\ell$, where $v_\\ell(S)$ denotes the welfare obtained by this agent if she receives the set of items $S$. The functions $v_\\ell$ are all submodular; as is standard, we assume that they are monotone and $v_\\ell(\\emptyset) = 0$. The goal is to partition the items into $m$ disjoint subsets $S_1, S_2, \\ldots S_m$ in order to maximize the social welfare, defined as $\\sum_{\\ell = 1}^m v_\\ell(S_\\ell)$.\n  In "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05450","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":"1712.05450","created_at":"2026-05-18T00:27:56.407414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.05450v1","created_at":"2026-05-18T00:27:56.407414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05450","created_at":"2026-05-18T00:27:56.407414+00:00"},{"alias_kind":"pith_short_12","alias_value":"RFR5TJCV2RY5","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RFR5TJCV2RY5HVXO","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RFR5TJCV","created_at":"2026-05-18T12:31:39.905425+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/RFR5TJCV2RY5HVXOXWZVEAQSXL","json":"https://pith.science/pith/RFR5TJCV2RY5HVXOXWZVEAQSXL.json","graph_json":"https://pith.science/api/pith-number/RFR5TJCV2RY5HVXOXWZVEAQSXL/graph.json","events_json":"https://pith.science/api/pith-number/RFR5TJCV2RY5HVXOXWZVEAQSXL/events.json","paper":"https://pith.science/paper/RFR5TJCV"},"agent_actions":{"view_html":"https://pith.science/pith/RFR5TJCV2RY5HVXOXWZVEAQSXL","download_json":"https://pith.science/pith/RFR5TJCV2RY5HVXOXWZVEAQSXL.json","view_paper":"https://pith.science/paper/RFR5TJCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.05450&json=true","fetch_graph":"https://pith.science/api/pith-number/RFR5TJCV2RY5HVXOXWZVEAQSXL/graph.json","fetch_events":"https://pith.science/api/pith-number/RFR5TJCV2RY5HVXOXWZVEAQSXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RFR5TJCV2RY5HVXOXWZVEAQSXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RFR5TJCV2RY5HVXOXWZVEAQSXL/action/storage_attestation","attest_author":"https://pith.science/pith/RFR5TJCV2RY5HVXOXWZVEAQSXL/action/author_attestation","sign_citation":"https://pith.science/pith/RFR5TJCV2RY5HVXOXWZVEAQSXL/action/citation_signature","submit_replication":"https://pith.science/pith/RFR5TJCV2RY5HVXOXWZVEAQSXL/action/replication_record"}},"created_at":"2026-05-18T00:27:56.407414+00:00","updated_at":"2026-05-18T00:27:56.407414+00:00"}