{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BI3TUHCPBOFB2RESJJMFBQHQQF","short_pith_number":"pith:BI3TUHCP","canonical_record":{"source":{"id":"1807.05529","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-15T11:31:40Z","cross_cats_sorted":[],"title_canon_sha256":"202eec870eeb45d171abd9e71dc43637c3825c5e87c028d00fb51da8e9ddbf6e","abstract_canon_sha256":"bdcfff21cb0fe5a5536d977e7a17f05c0cd6a68aced601dae2b0cd5bf273f506"},"schema_version":"1.0"},"canonical_sha256":"0a373a1c4f0b8a1d44924a5850c0f08151900197437b96cb249bab50921bd1df","source":{"kind":"arxiv","id":"1807.05529","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05529","created_at":"2026-05-18T00:00:29Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05529v2","created_at":"2026-05-18T00:00:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05529","created_at":"2026-05-18T00:00:29Z"},{"alias_kind":"pith_short_12","alias_value":"BI3TUHCPBOFB","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BI3TUHCPBOFB2RES","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BI3TUHCP","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BI3TUHCPBOFB2RESJJMFBQHQQF","target":"record","payload":{"canonical_record":{"source":{"id":"1807.05529","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-15T11:31:40Z","cross_cats_sorted":[],"title_canon_sha256":"202eec870eeb45d171abd9e71dc43637c3825c5e87c028d00fb51da8e9ddbf6e","abstract_canon_sha256":"bdcfff21cb0fe5a5536d977e7a17f05c0cd6a68aced601dae2b0cd5bf273f506"},"schema_version":"1.0"},"canonical_sha256":"0a373a1c4f0b8a1d44924a5850c0f08151900197437b96cb249bab50921bd1df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:29.970006Z","signature_b64":"3S3Nt1HNzkx5EzoDiEEOfbaaCZgu0N5zEmSjiMl20slXb34IxQq6vnj0kjqLVqZDqts9B8RmiLR0jJ4vpRjCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a373a1c4f0b8a1d44924a5850c0f08151900197437b96cb249bab50921bd1df","last_reissued_at":"2026-05-18T00:00:29.969553Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:29.969553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.05529","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-05-18T00:00:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CyKkaaEnxMJz5PtSgTxtz0BLznY1ec6K0w0TUkQuKI7uJnEEVuIjEjiw5imh7wy0eODlNxyl3DrRGVlU5upACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:21:31.610828Z"},"content_sha256":"5cf750a69e6802fe51f4c8d334eaa8230d2a8e3b084dc08a96156b46e50f7446","schema_version":"1.0","event_id":"sha256:5cf750a69e6802fe51f4c8d334eaa8230d2a8e3b084dc08a96156b46e50f7446"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BI3TUHCPBOFB2RESJJMFBQHQQF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Submodular Maximization: Beating 1/2 Made Simple","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mohit Garg, Moran Feldman, Niv Buchbinder, Yuval Filmus","submitted_at":"2018-07-15T11:31:40Z","abstract_excerpt":"The Submodular Welfare Maximization problem (SWM) captures an important subclass of combinatorial auctions and has been studied extensively from both computational and economic perspectives. In particular, it has been studied in a natural online setting in which items arrive one-by-one and should be allocated irrevocably upon arrival. In this setting, it is well known that the greedy algorithm achieves a competitive ratio of 1/2, and recently Kapralov et al. (2013) showed that this ratio is optimal for the problem. Surprisingly, despite this impossibility result, Korula et al. (2015) were able"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05529","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":""},"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:00:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ZKf+pOvGYKq5FhwxuKvXWa9FOukaFd6ZzGdodRZQwx4JPC/SOn4pK1yheYLXSaQbsaNgI9GHd96ZXDAsJkEBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:21:31.611170Z"},"content_sha256":"0ba2004c25484daccb3497490c79f86777d1083bf0b7e11eec68378e51fbe1cc","schema_version":"1.0","event_id":"sha256:0ba2004c25484daccb3497490c79f86777d1083bf0b7e11eec68378e51fbe1cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BI3TUHCPBOFB2RESJJMFBQHQQF/bundle.json","state_url":"https://pith.science/pith/BI3TUHCPBOFB2RESJJMFBQHQQF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BI3TUHCPBOFB2RESJJMFBQHQQF/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-28T02:21:31Z","links":{"resolver":"https://pith.science/pith/BI3TUHCPBOFB2RESJJMFBQHQQF","bundle":"https://pith.science/pith/BI3TUHCPBOFB2RESJJMFBQHQQF/bundle.json","state":"https://pith.science/pith/BI3TUHCPBOFB2RESJJMFBQHQQF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BI3TUHCPBOFB2RESJJMFBQHQQF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BI3TUHCPBOFB2RESJJMFBQHQQF","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":"bdcfff21cb0fe5a5536d977e7a17f05c0cd6a68aced601dae2b0cd5bf273f506","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-15T11:31:40Z","title_canon_sha256":"202eec870eeb45d171abd9e71dc43637c3825c5e87c028d00fb51da8e9ddbf6e"},"schema_version":"1.0","source":{"id":"1807.05529","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05529","created_at":"2026-05-18T00:00:29Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05529v2","created_at":"2026-05-18T00:00:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05529","created_at":"2026-05-18T00:00:29Z"},{"alias_kind":"pith_short_12","alias_value":"BI3TUHCPBOFB","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BI3TUHCPBOFB2RES","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BI3TUHCP","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:0ba2004c25484daccb3497490c79f86777d1083bf0b7e11eec68378e51fbe1cc","target":"graph","created_at":"2026-05-18T00:00:29Z","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":"The Submodular Welfare Maximization problem (SWM) captures an important subclass of combinatorial auctions and has been studied extensively from both computational and economic perspectives. In particular, it has been studied in a natural online setting in which items arrive one-by-one and should be allocated irrevocably upon arrival. In this setting, it is well known that the greedy algorithm achieves a competitive ratio of 1/2, and recently Kapralov et al. (2013) showed that this ratio is optimal for the problem. Surprisingly, despite this impossibility result, Korula et al. (2015) were able","authors_text":"Mohit Garg, Moran Feldman, Niv Buchbinder, Yuval Filmus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-15T11:31:40Z","title":"Online Submodular Maximization: Beating 1/2 Made Simple"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05529","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:5cf750a69e6802fe51f4c8d334eaa8230d2a8e3b084dc08a96156b46e50f7446","target":"record","created_at":"2026-05-18T00:00:29Z","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":"bdcfff21cb0fe5a5536d977e7a17f05c0cd6a68aced601dae2b0cd5bf273f506","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-15T11:31:40Z","title_canon_sha256":"202eec870eeb45d171abd9e71dc43637c3825c5e87c028d00fb51da8e9ddbf6e"},"schema_version":"1.0","source":{"id":"1807.05529","kind":"arxiv","version":2}},"canonical_sha256":"0a373a1c4f0b8a1d44924a5850c0f08151900197437b96cb249bab50921bd1df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a373a1c4f0b8a1d44924a5850c0f08151900197437b96cb249bab50921bd1df","first_computed_at":"2026-05-18T00:00:29.969553Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:29.969553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3S3Nt1HNzkx5EzoDiEEOfbaaCZgu0N5zEmSjiMl20slXb34IxQq6vnj0kjqLVqZDqts9B8RmiLR0jJ4vpRjCBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:29.970006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.05529","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5cf750a69e6802fe51f4c8d334eaa8230d2a8e3b084dc08a96156b46e50f7446","sha256:0ba2004c25484daccb3497490c79f86777d1083bf0b7e11eec68378e51fbe1cc"],"state_sha256":"3cfacc8fb431325b72f6ed88472777177411e514a66c7a85e44b8f1e46c73c69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ylrCgHfG1Qy1zmaWh+lXrS88LKJ6vUAgM2PmIBOfNQ0wSDwCQc74bpc2SLl0yaGNWs1Fa+6Jlg/30yjPtZhzBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:21:31.613267Z","bundle_sha256":"7b9977410763f3c1d19a734942b5cae7ffc511ee8b60d5000ac8ba5e8b225274"}}