{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RFR5TJCV2RY5HVXOXWZVEAQSXL","short_pith_number":"pith:RFR5TJCV","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"},"canonical_sha256":"8963d9a455d471d3d6eebdb3520212bad943f982fea67cf6602db4671e214a03","source":{"kind":"arxiv","id":"1712.05450","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05450","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05450v1","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05450","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"RFR5TJCV2RY5","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RFR5TJCV2RY5HVXO","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RFR5TJCV","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RFR5TJCV2RY5HVXOXWZVEAQSXL","target":"record","payload":{"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"},"canonical_sha256":"8963d9a455d471d3d6eebdb3520212bad943f982fea67cf6602db4671e214a03","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"},"source_kind":"arxiv","source_id":"1712.05450","source_version":1,"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-05-18T00:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2XAenYLsptDhcEnCZJAkLA/u4x9cTXm60ayMINzSZc0puzJN33HiNiLGaQfGYUu9j4qBvwssZqFAVzHPxMEBBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:06:02.082139Z"},"content_sha256":"53fc86339f439998ee8e8b4eb682793d4b8ad9b1001f1ffe769709493c168bfe","schema_version":"1.0","event_id":"sha256:53fc86339f439998ee8e8b4eb682793d4b8ad9b1001f1ffe769709493c168bfe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RFR5TJCV2RY5HVXOXWZVEAQSXL","target":"graph","payload":{"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"},"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-05-18T00:27:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AtpgEKV58bDucivIGoxAPljmTS4AZDQpU0lzrZ5n5LgVbnbUfg4Y3Ksp/ZnsEVeKV2eUvxqG0+QM91At5dBkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:06:02.082883Z"},"content_sha256":"ff55da308696e701460fd8a1c8c7b437ffbbedac025f02e790205852d756710e","schema_version":"1.0","event_id":"sha256:ff55da308696e701460fd8a1c8c7b437ffbbedac025f02e790205852d756710e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RFR5TJCV2RY5HVXOXWZVEAQSXL/bundle.json","state_url":"https://pith.science/pith/RFR5TJCV2RY5HVXOXWZVEAQSXL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RFR5TJCV2RY5HVXOXWZVEAQSXL/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-05-26T10:06:02Z","links":{"resolver":"https://pith.science/pith/RFR5TJCV2RY5HVXOXWZVEAQSXL","bundle":"https://pith.science/pith/RFR5TJCV2RY5HVXOXWZVEAQSXL/bundle.json","state":"https://pith.science/pith/RFR5TJCV2RY5HVXOXWZVEAQSXL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RFR5TJCV2RY5HVXOXWZVEAQSXL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RFR5TJCV2RY5HVXOXWZVEAQSXL","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":"0f9fa45a101d305794e627db243bcb4291581e9de364d33876a0d2be713a4de9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-12-14T20:47:22Z","title_canon_sha256":"a138abb35eed6edc7e8859bc4b2fd7b5123442df151d15a68d2caa6ea2e80f36"},"schema_version":"1.0","source":{"id":"1712.05450","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05450","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05450v1","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05450","created_at":"2026-05-18T00:27:56Z"},{"alias_kind":"pith_short_12","alias_value":"RFR5TJCV2RY5","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"RFR5TJCV2RY5HVXO","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"RFR5TJCV","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:ff55da308696e701460fd8a1c8c7b437ffbbedac025f02e790205852d756710e","target":"graph","created_at":"2026-05-18T00:27:56Z","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"},"paper":{"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 ","authors_text":"Morteza Zadimoghaddam, Nitish Korula, Vahab Mirrokni","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-12-14T20:47:22Z","title":"Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05450","kind":"arxiv","version":1},"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:53fc86339f439998ee8e8b4eb682793d4b8ad9b1001f1ffe769709493c168bfe","target":"record","created_at":"2026-05-18T00:27:56Z","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":"0f9fa45a101d305794e627db243bcb4291581e9de364d33876a0d2be713a4de9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-12-14T20:47:22Z","title_canon_sha256":"a138abb35eed6edc7e8859bc4b2fd7b5123442df151d15a68d2caa6ea2e80f36"},"schema_version":"1.0","source":{"id":"1712.05450","kind":"arxiv","version":1}},"canonical_sha256":"8963d9a455d471d3d6eebdb3520212bad943f982fea67cf6602db4671e214a03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8963d9a455d471d3d6eebdb3520212bad943f982fea67cf6602db4671e214a03","first_computed_at":"2026-05-18T00:27:56.407292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:56.407292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U8CWru5MAcipRgFO1QuNKCvpygmWlG+zVnEnhT6/1+l52z0HSOqR7/LdHIJ+M4fdsGtYwOj2CTjJfARg+rvIBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:56.407952Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05450","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53fc86339f439998ee8e8b4eb682793d4b8ad9b1001f1ffe769709493c168bfe","sha256:ff55da308696e701460fd8a1c8c7b437ffbbedac025f02e790205852d756710e"],"state_sha256":"1a504743b93d0a00a8e05a33533f1201fa6e04130fe6dbb838ace441bf530bc7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Us69oFPW0nkKiba/MjLSQhMLPr8IXuMqw8/H/mvRxZ/OauPM949jZrPDEyOJJCZ6Bu/1YtVj4ih9AtSskocsBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:06:02.086409Z","bundle_sha256":"19b89522723433600e86a750f286ac33697456e1c9c055c29d5d2bc19ebfdd72"}}