{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KMOFN2JPWIMTNGDFZZCUV3IO6V","short_pith_number":"pith:KMOFN2JP","canonical_record":{"source":{"id":"1811.07464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-19T02:22:48Z","cross_cats_sorted":[],"title_canon_sha256":"610a1b01643613af89876b9c11f6d0a71dded0591930d2a31171c7bcc89925c2","abstract_canon_sha256":"cc30a17fbf5c879f2ac5b661cf7da502dba0fc8ec03f99bb1bf92d2e0df30342"},"schema_version":"1.0"},"canonical_sha256":"531c56e92fb219369865ce454aed0ef5424ec3602952d2c3057125386593fc49","source":{"kind":"arxiv","id":"1811.07464","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07464","created_at":"2026-05-18T00:00:24Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07464v1","created_at":"2026-05-18T00:00:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07464","created_at":"2026-05-18T00:00:24Z"},{"alias_kind":"pith_short_12","alias_value":"KMOFN2JPWIMT","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KMOFN2JPWIMTNGDF","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KMOFN2JP","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KMOFN2JPWIMTNGDFZZCUV3IO6V","target":"record","payload":{"canonical_record":{"source":{"id":"1811.07464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-19T02:22:48Z","cross_cats_sorted":[],"title_canon_sha256":"610a1b01643613af89876b9c11f6d0a71dded0591930d2a31171c7bcc89925c2","abstract_canon_sha256":"cc30a17fbf5c879f2ac5b661cf7da502dba0fc8ec03f99bb1bf92d2e0df30342"},"schema_version":"1.0"},"canonical_sha256":"531c56e92fb219369865ce454aed0ef5424ec3602952d2c3057125386593fc49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:24.430679Z","signature_b64":"QMZmVfH/pE05JTm4jiIiKD5PDG8fB2UKuoitYhazNKBgB1LUUmD2UHPmxJz/B+9eFfr8YVOayMIfvdhsjMsGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"531c56e92fb219369865ce454aed0ef5424ec3602952d2c3057125386593fc49","last_reissued_at":"2026-05-18T00:00:24.430080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:24.430080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.07464","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:00:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qa78a32cKOBaGwbnZburQ43o0lvaC9tUbinfXbtaj5QwYPJFB3+3XOM7wlQQOujZ0ZnzFXS9cd12brUzk8HxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:33:43.568849Z"},"content_sha256":"b4bdc017b60280c37faad19b2c457e90a4f5f680788991a61b352c3561914d60","schema_version":"1.0","event_id":"sha256:b4bdc017b60280c37faad19b2c457e90a4f5f680788991a61b352c3561914d60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KMOFN2JPWIMTNGDFZZCUV3IO6V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Nearly-linear Time Algorithms for Submodular Maximization with a Matroid Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alina Ene, Huy L. Nguyen","submitted_at":"2018-11-19T02:22:48Z","abstract_excerpt":"We consider fast algorithms for monotone submodular maximization subject to a matroid constraint. We assume that the matroid is given as input in an explicit form, and the goal is to obtain the best possible running times for important matroids. We develop a new algorithm for a \\emph{general matroid constraint} with a $1 - 1/e - \\epsilon$ approximation that achieves a fast running time provided we have a fast data structure for maintaining a maximum weight base in the matroid through a sequence of decrease weight operations. We construct such data structures for graphic matroids and partition "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07464","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:00:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"29AzCmiVYQZjMggpUjGw+4S59sST2nirxTMwvuFhVe+cFCtmh0UizY9dEm4xW+iWZ1WsPf6H5DfEO6Ll4gtHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:33:43.569556Z"},"content_sha256":"52b72450743593ed0c724957f098d4a37865f052e2921012e109e0e82ca7bbcf","schema_version":"1.0","event_id":"sha256:52b72450743593ed0c724957f098d4a37865f052e2921012e109e0e82ca7bbcf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KMOFN2JPWIMTNGDFZZCUV3IO6V/bundle.json","state_url":"https://pith.science/pith/KMOFN2JPWIMTNGDFZZCUV3IO6V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KMOFN2JPWIMTNGDFZZCUV3IO6V/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-06-11T23:33:43Z","links":{"resolver":"https://pith.science/pith/KMOFN2JPWIMTNGDFZZCUV3IO6V","bundle":"https://pith.science/pith/KMOFN2JPWIMTNGDFZZCUV3IO6V/bundle.json","state":"https://pith.science/pith/KMOFN2JPWIMTNGDFZZCUV3IO6V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KMOFN2JPWIMTNGDFZZCUV3IO6V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KMOFN2JPWIMTNGDFZZCUV3IO6V","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":"cc30a17fbf5c879f2ac5b661cf7da502dba0fc8ec03f99bb1bf92d2e0df30342","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-19T02:22:48Z","title_canon_sha256":"610a1b01643613af89876b9c11f6d0a71dded0591930d2a31171c7bcc89925c2"},"schema_version":"1.0","source":{"id":"1811.07464","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.07464","created_at":"2026-05-18T00:00:24Z"},{"alias_kind":"arxiv_version","alias_value":"1811.07464v1","created_at":"2026-05-18T00:00:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.07464","created_at":"2026-05-18T00:00:24Z"},{"alias_kind":"pith_short_12","alias_value":"KMOFN2JPWIMT","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KMOFN2JPWIMTNGDF","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KMOFN2JP","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:52b72450743593ed0c724957f098d4a37865f052e2921012e109e0e82ca7bbcf","target":"graph","created_at":"2026-05-18T00:00:24Z","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 consider fast algorithms for monotone submodular maximization subject to a matroid constraint. We assume that the matroid is given as input in an explicit form, and the goal is to obtain the best possible running times for important matroids. We develop a new algorithm for a \\emph{general matroid constraint} with a $1 - 1/e - \\epsilon$ approximation that achieves a fast running time provided we have a fast data structure for maintaining a maximum weight base in the matroid through a sequence of decrease weight operations. We construct such data structures for graphic matroids and partition ","authors_text":"Alina Ene, Huy L. Nguyen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-19T02:22:48Z","title":"Towards Nearly-linear Time Algorithms for Submodular Maximization with a Matroid Constraint"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.07464","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:b4bdc017b60280c37faad19b2c457e90a4f5f680788991a61b352c3561914d60","target":"record","created_at":"2026-05-18T00:00:24Z","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":"cc30a17fbf5c879f2ac5b661cf7da502dba0fc8ec03f99bb1bf92d2e0df30342","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-19T02:22:48Z","title_canon_sha256":"610a1b01643613af89876b9c11f6d0a71dded0591930d2a31171c7bcc89925c2"},"schema_version":"1.0","source":{"id":"1811.07464","kind":"arxiv","version":1}},"canonical_sha256":"531c56e92fb219369865ce454aed0ef5424ec3602952d2c3057125386593fc49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"531c56e92fb219369865ce454aed0ef5424ec3602952d2c3057125386593fc49","first_computed_at":"2026-05-18T00:00:24.430080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:24.430080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QMZmVfH/pE05JTm4jiIiKD5PDG8fB2UKuoitYhazNKBgB1LUUmD2UHPmxJz/B+9eFfr8YVOayMIfvdhsjMsGBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:24.430679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.07464","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4bdc017b60280c37faad19b2c457e90a4f5f680788991a61b352c3561914d60","sha256:52b72450743593ed0c724957f098d4a37865f052e2921012e109e0e82ca7bbcf"],"state_sha256":"f85aee511d3919ef85c30028450bd97f95e41a87dbbf316cee86d8352f07fce4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fxsi3bGVWMcC6q7HY0lh+CNF9K0YHhzWL2GQtWw4E3EOGlYtDiEkwdRo7a2pPSqM5Y0mILr9gXwKtw2bkMvIBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:33:43.573508Z","bundle_sha256":"306f73cb55d91eb5ecb1b4bf32a029443b30cb2ee3ee3918df1c5bcf5ea722be"}}