{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5SAH62WD7HRP4ZBGQCU4JKKWNC","short_pith_number":"pith:5SAH62WD","canonical_record":{"source":{"id":"1610.07770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-25T07:53:29Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1a5ae9ee70f728662b705e06a033cf31d1b3cf1222bbb6cf583a9c8f3ff7506e","abstract_canon_sha256":"fbc99b59de7703ebeb912290a4ac422fba1c5a0f97087d1b8c42b6a88c8e6ff2"},"schema_version":"1.0"},"canonical_sha256":"ec807f6ac3f9e2fe642680a9c4a95668ae70e4e8bd7cd4d90bdc9019d5ee8b12","source":{"kind":"arxiv","id":"1610.07770","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07770","created_at":"2026-05-18T01:01:17Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07770v1","created_at":"2026-05-18T01:01:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07770","created_at":"2026-05-18T01:01:17Z"},{"alias_kind":"pith_short_12","alias_value":"5SAH62WD7HRP","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5SAH62WD7HRP4ZBG","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5SAH62WD","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5SAH62WD7HRP4ZBGQCU4JKKWNC","target":"record","payload":{"canonical_record":{"source":{"id":"1610.07770","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-25T07:53:29Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1a5ae9ee70f728662b705e06a033cf31d1b3cf1222bbb6cf583a9c8f3ff7506e","abstract_canon_sha256":"fbc99b59de7703ebeb912290a4ac422fba1c5a0f97087d1b8c42b6a88c8e6ff2"},"schema_version":"1.0"},"canonical_sha256":"ec807f6ac3f9e2fe642680a9c4a95668ae70e4e8bd7cd4d90bdc9019d5ee8b12","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:17.641282Z","signature_b64":"eI4dHdkT8UA6jdbu3jxw84nzKOb+Zt3II1lv+WsqrZOaj/01M+fC/rKb5/c/eil1aq8jXz9XxKuahWyREMZ1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec807f6ac3f9e2fe642680a9c4a95668ae70e4e8bd7cd4d90bdc9019d5ee8b12","last_reissued_at":"2026-05-18T01:01:17.640526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:17.640526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.07770","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-18T01:01:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AfdF30y7MkTUARkgpWcd9/Ps5FOTlJ/XJf1KOYVsPixC9yJ/egUhvoQkOcP3ZNQ1MFMHeE7BXES0D7peL2GtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:54:56.778372Z"},"content_sha256":"0a01ac8254ad71657c1a2afcc1c14c330b094c2beb680fc26ab46e61079d5eda","schema_version":"1.0","event_id":"sha256:0a01ac8254ad71657c1a2afcc1c14c330b094c2beb680fc26ab46e61079d5eda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5SAH62WD7HRP4ZBGQCU4JKKWNC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Ning Kang, Shaofeng H.-C. Jiang, T-H. Hubert Chan, Zhihao Gavin Tang, Zhiyi Huang","submitted_at":"2016-10-25T07:53:29Z","abstract_excerpt":"We study the online submodular maximization problem with free disposal under a matroid constraint. Elements from some ground set arrive one by one in rounds, and the algorithm maintains a feasible set that is independent in the underlying matroid. In each round when a new element arrives, the algorithm may accept the new element into its feasible set and possibly remove elements from it, provided that the resulting set is still independent. The goal is to maximize the value of the final feasible set under some monotone submodular function, to which the algorithm has oracle access.\n  For $k$-un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07770","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-18T01:01:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oU6IjXcl9458lS4xbcut6TptVCItCjRN85n2s7I7LeROJ92IvIrR8aU/1li2DaYws4HswsmVBvZhmOuReTjlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:54:56.778976Z"},"content_sha256":"3370b4e6d1426b7ae3032c26b56c6157d14429adc5cfe91547610dc048105024","schema_version":"1.0","event_id":"sha256:3370b4e6d1426b7ae3032c26b56c6157d14429adc5cfe91547610dc048105024"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5SAH62WD7HRP4ZBGQCU4JKKWNC/bundle.json","state_url":"https://pith.science/pith/5SAH62WD7HRP4ZBGQCU4JKKWNC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5SAH62WD7HRP4ZBGQCU4JKKWNC/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-27T03:54:56Z","links":{"resolver":"https://pith.science/pith/5SAH62WD7HRP4ZBGQCU4JKKWNC","bundle":"https://pith.science/pith/5SAH62WD7HRP4ZBGQCU4JKKWNC/bundle.json","state":"https://pith.science/pith/5SAH62WD7HRP4ZBGQCU4JKKWNC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5SAH62WD7HRP4ZBGQCU4JKKWNC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5SAH62WD7HRP4ZBGQCU4JKKWNC","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":"fbc99b59de7703ebeb912290a4ac422fba1c5a0f97087d1b8c42b6a88c8e6ff2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-25T07:53:29Z","title_canon_sha256":"1a5ae9ee70f728662b705e06a033cf31d1b3cf1222bbb6cf583a9c8f3ff7506e"},"schema_version":"1.0","source":{"id":"1610.07770","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07770","created_at":"2026-05-18T01:01:17Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07770v1","created_at":"2026-05-18T01:01:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07770","created_at":"2026-05-18T01:01:17Z"},{"alias_kind":"pith_short_12","alias_value":"5SAH62WD7HRP","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5SAH62WD7HRP4ZBG","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5SAH62WD","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:3370b4e6d1426b7ae3032c26b56c6157d14429adc5cfe91547610dc048105024","target":"graph","created_at":"2026-05-18T01:01:17Z","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":"We study the online submodular maximization problem with free disposal under a matroid constraint. Elements from some ground set arrive one by one in rounds, and the algorithm maintains a feasible set that is independent in the underlying matroid. In each round when a new element arrives, the algorithm may accept the new element into its feasible set and possibly remove elements from it, provided that the resulting set is still independent. The goal is to maximize the value of the final feasible set under some monotone submodular function, to which the algorithm has oracle access.\n  For $k$-un","authors_text":"Ning Kang, Shaofeng H.-C. Jiang, T-H. Hubert Chan, Zhihao Gavin Tang, Zhiyi Huang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-25T07:53:29Z","title":"Online Submodular Maximization with Free Disposal: Randomization Beats 0.25 for Partition Matroids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07770","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:0a01ac8254ad71657c1a2afcc1c14c330b094c2beb680fc26ab46e61079d5eda","target":"record","created_at":"2026-05-18T01:01:17Z","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":"fbc99b59de7703ebeb912290a4ac422fba1c5a0f97087d1b8c42b6a88c8e6ff2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-10-25T07:53:29Z","title_canon_sha256":"1a5ae9ee70f728662b705e06a033cf31d1b3cf1222bbb6cf583a9c8f3ff7506e"},"schema_version":"1.0","source":{"id":"1610.07770","kind":"arxiv","version":1}},"canonical_sha256":"ec807f6ac3f9e2fe642680a9c4a95668ae70e4e8bd7cd4d90bdc9019d5ee8b12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec807f6ac3f9e2fe642680a9c4a95668ae70e4e8bd7cd4d90bdc9019d5ee8b12","first_computed_at":"2026-05-18T01:01:17.640526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:01:17.640526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eI4dHdkT8UA6jdbu3jxw84nzKOb+Zt3II1lv+WsqrZOaj/01M+fC/rKb5/c/eil1aq8jXz9XxKuahWyREMZ1Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:01:17.641282Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.07770","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a01ac8254ad71657c1a2afcc1c14c330b094c2beb680fc26ab46e61079d5eda","sha256:3370b4e6d1426b7ae3032c26b56c6157d14429adc5cfe91547610dc048105024"],"state_sha256":"550bfb764e8343a0d4992f843a9e032c52fc13f3ad2f79bcc491db04e643e355"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"66XmHlzP966AclZ6PddowrSSj4VxOCV6m90Ac4beTUJpyDXW9qfQ2wXg7j9Wt4B22KOirgqRI+LjsVrs6SLACw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:54:56.782185Z","bundle_sha256":"ff94de490ef3eb4d22bf4e54773a2cfc39097e792aa53edf05fbd7e7f27ca0d4"}}