{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:XQYZNRLO4TZTULZW777LJ25WZ3","short_pith_number":"pith:XQYZNRLO","canonical_record":{"source":{"id":"2010.11420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-22T03:52:08Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"3d5456d415149e05e48a0344092891beb5a5af2f2249cf554135616cd1287a83","abstract_canon_sha256":"98edef453a5fd2caa185a9598bd721687e79192aa092deffc91143e01a68e9fd"},"schema_version":"1.0"},"canonical_sha256":"bc3196c56ee4f33a2f36fffeb4ebb6cec7f99e2e5c802094c681cd263b40e9b4","source":{"kind":"arxiv","id":"2010.11420","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.11420","created_at":"2026-07-05T01:45:09Z"},{"alias_kind":"arxiv_version","alias_value":"2010.11420v1","created_at":"2026-07-05T01:45:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.11420","created_at":"2026-07-05T01:45:09Z"},{"alias_kind":"pith_short_12","alias_value":"XQYZNRLO4TZT","created_at":"2026-07-05T01:45:09Z"},{"alias_kind":"pith_short_16","alias_value":"XQYZNRLO4TZTULZW","created_at":"2026-07-05T01:45:09Z"},{"alias_kind":"pith_short_8","alias_value":"XQYZNRLO","created_at":"2026-07-05T01:45:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:XQYZNRLO4TZTULZW777LJ25WZ3","target":"record","payload":{"canonical_record":{"source":{"id":"2010.11420","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-22T03:52:08Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"3d5456d415149e05e48a0344092891beb5a5af2f2249cf554135616cd1287a83","abstract_canon_sha256":"98edef453a5fd2caa185a9598bd721687e79192aa092deffc91143e01a68e9fd"},"schema_version":"1.0"},"canonical_sha256":"bc3196c56ee4f33a2f36fffeb4ebb6cec7f99e2e5c802094c681cd263b40e9b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:45:09.996201Z","signature_b64":"JDk0xQvncOTz3aYfJaClxGKA7DA38jlwSEz+XzrajZNa26WPUrhH/tmzIQQIgqIl5nF2bBBIANNnwkXnV/A5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc3196c56ee4f33a2f36fffeb4ebb6cec7f99e2e5c802094c681cd263b40e9b4","last_reissued_at":"2026-07-05T01:45:09.995775Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:45:09.995775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.11420","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-07-05T01:45:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fnDGzNjiI6R6z81/6tj6aSKR6RBke+Fhqv2zXTBOm0oKPx3hVIHlIwd1pEw1IX5RKYsKsG8O94Ti2s5ZOIfvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T00:19:18.350261Z"},"content_sha256":"c9a835ce814bd06b1b27ce7123c54031f9a24054bcdd2c4e16bfb694e3eb63fa","schema_version":"1.0","event_id":"sha256:c9a835ce814bd06b1b27ce7123c54031f9a24054bcdd2c4e16bfb694e3eb63fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:XQYZNRLO4TZTULZW777LJ25WZ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.DS","authors_text":"Benwei Wu, Kai Han, Shuang Cui, Zongmai Cao","submitted_at":"2020-10-22T03:52:08Z","abstract_excerpt":"We study the problem of maximizing a non-monotone, non-negative submodular function subject to a matroid constraint. The prior best-known deterministic approximation ratio for this problem is $\\frac{1}{4}-\\epsilon$ under $\\mathcal{O}(({n^4}/{\\epsilon})\\log n)$ time complexity. We show that this deterministic ratio can be improved to $\\frac{1}{4}$ under $\\mathcal{O}(nr)$ time complexity, and then present a more practical algorithm dubbed TwinGreedyFast which achieves $\\frac{1}{4}-\\epsilon$ deterministic ratio in nearly-linear running time of $\\mathcal{O}(\\frac{n}{\\epsilon}\\log\\frac{r}{\\epsilon}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.11420","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.11420/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-05T01:45:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GQL9JPkTdZZuXZvH+RBw1IhSoxSDsiwxKAjXSBMv52sgZNR0M8wLVWNgIJHjAJv8QE/7l06mDM6QhYMyhIiKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-22T00:19:18.350834Z"},"content_sha256":"5003beed281c60c8341014efc6573e34de33df2187e78419ed7890ebf63ff4c3","schema_version":"1.0","event_id":"sha256:5003beed281c60c8341014efc6573e34de33df2187e78419ed7890ebf63ff4c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XQYZNRLO4TZTULZW777LJ25WZ3/bundle.json","state_url":"https://pith.science/pith/XQYZNRLO4TZTULZW777LJ25WZ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XQYZNRLO4TZTULZW777LJ25WZ3/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-08-22T00:19:18Z","links":{"resolver":"https://pith.science/pith/XQYZNRLO4TZTULZW777LJ25WZ3","bundle":"https://pith.science/pith/XQYZNRLO4TZTULZW777LJ25WZ3/bundle.json","state":"https://pith.science/pith/XQYZNRLO4TZTULZW777LJ25WZ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XQYZNRLO4TZTULZW777LJ25WZ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:XQYZNRLO4TZTULZW777LJ25WZ3","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":"98edef453a5fd2caa185a9598bd721687e79192aa092deffc91143e01a68e9fd","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-22T03:52:08Z","title_canon_sha256":"3d5456d415149e05e48a0344092891beb5a5af2f2249cf554135616cd1287a83"},"schema_version":"1.0","source":{"id":"2010.11420","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.11420","created_at":"2026-07-05T01:45:09Z"},{"alias_kind":"arxiv_version","alias_value":"2010.11420v1","created_at":"2026-07-05T01:45:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.11420","created_at":"2026-07-05T01:45:09Z"},{"alias_kind":"pith_short_12","alias_value":"XQYZNRLO4TZT","created_at":"2026-07-05T01:45:09Z"},{"alias_kind":"pith_short_16","alias_value":"XQYZNRLO4TZTULZW","created_at":"2026-07-05T01:45:09Z"},{"alias_kind":"pith_short_8","alias_value":"XQYZNRLO","created_at":"2026-07-05T01:45:09Z"}],"graph_snapshots":[{"event_id":"sha256:5003beed281c60c8341014efc6573e34de33df2187e78419ed7890ebf63ff4c3","target":"graph","created_at":"2026-07-05T01:45:09Z","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/2010.11420/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of maximizing a non-monotone, non-negative submodular function subject to a matroid constraint. The prior best-known deterministic approximation ratio for this problem is $\\frac{1}{4}-\\epsilon$ under $\\mathcal{O}(({n^4}/{\\epsilon})\\log n)$ time complexity. We show that this deterministic ratio can be improved to $\\frac{1}{4}$ under $\\mathcal{O}(nr)$ time complexity, and then present a more practical algorithm dubbed TwinGreedyFast which achieves $\\frac{1}{4}-\\epsilon$ deterministic ratio in nearly-linear running time of $\\mathcal{O}(\\frac{n}{\\epsilon}\\log\\frac{r}{\\epsilon}","authors_text":"Benwei Wu, Kai Han, Shuang Cui, Zongmai Cao","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-22T03:52:08Z","title":"Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.11420","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:c9a835ce814bd06b1b27ce7123c54031f9a24054bcdd2c4e16bfb694e3eb63fa","target":"record","created_at":"2026-07-05T01:45:09Z","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":"98edef453a5fd2caa185a9598bd721687e79192aa092deffc91143e01a68e9fd","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-10-22T03:52:08Z","title_canon_sha256":"3d5456d415149e05e48a0344092891beb5a5af2f2249cf554135616cd1287a83"},"schema_version":"1.0","source":{"id":"2010.11420","kind":"arxiv","version":1}},"canonical_sha256":"bc3196c56ee4f33a2f36fffeb4ebb6cec7f99e2e5c802094c681cd263b40e9b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc3196c56ee4f33a2f36fffeb4ebb6cec7f99e2e5c802094c681cd263b40e9b4","first_computed_at":"2026-07-05T01:45:09.995775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:45:09.995775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JDk0xQvncOTz3aYfJaClxGKA7DA38jlwSEz+XzrajZNa26WPUrhH/tmzIQQIgqIl5nF2bBBIANNnwkXnV/A5AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:45:09.996201Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.11420","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9a835ce814bd06b1b27ce7123c54031f9a24054bcdd2c4e16bfb694e3eb63fa","sha256:5003beed281c60c8341014efc6573e34de33df2187e78419ed7890ebf63ff4c3"],"state_sha256":"19e5b941a3bdb50595d999972d153e9cc76a311c2e8865aa0e65ed5d8e685aa2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+YFv2CkySF1J9SPNbmLs8aG2fTLafwegdiH0gtHyZ5/X03DErYXFqG/8s3kciqHJVbUbNBjZPBIq/lntpepwDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-22T00:19:18.355769Z","bundle_sha256":"c98363a442d7165160a9df708a64944f3a72cb48faa040b11441a0ea9369fac6"}}