{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VRCCPA2J3FTKIIUX4VS4KESRD3","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":"f237f6fc5c9650a462a8f81a4fc06175bd3c1335989446cf3f807a831d092c9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T12:36:27Z","title_canon_sha256":"ca0225c7116d53f8fda52caf5488e5c612edf89239f40ca3499b89305eb5b594"},"schema_version":"1.0","source":{"id":"1807.04575","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04575","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04575v1","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04575","created_at":"2026-05-18T00:10:53Z"},{"alias_kind":"pith_short_12","alias_value":"VRCCPA2J3FTK","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VRCCPA2J3FTKIIUX","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VRCCPA2J","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:3d842bf2152355964d78991b65343f0a6e2b0e708196b97d37cba49c80e1a26a","target":"graph","created_at":"2026-05-18T00:10:53Z","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 a monotone submodular maximization problem whose constraint is described by a logic formula on a graph. Formally, we prove the following three `algorithmic metatheorems.'\n  (1) If the constraint is specified by a monadic second-order logic on a graph of bounded treewidth, the problem is solved in $n^{O(1)}$ time with an approximation factor of $O(\\log n)$.\n  (2) If the constraint is specified by a first-order logic on a graph of low degree, the problem is solved in $O(n^{1 + \\epsilon})$ time for any $\\epsilon > 0$ with an approximation factor of $2$.\n  (3) If the constraint is spec","authors_text":"Masakazu Ishihata, Takanori Maehara, Tomas Rigaux","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T12:36:27Z","title":"Algorithmic Meta-Theorems for Monotone Submodular Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04575","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:7a85317edfd242ccba8c03026de4fd971739ce2f37fb64710133691d9280c612","target":"record","created_at":"2026-05-18T00:10:53Z","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":"f237f6fc5c9650a462a8f81a4fc06175bd3c1335989446cf3f807a831d092c9e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T12:36:27Z","title_canon_sha256":"ca0225c7116d53f8fda52caf5488e5c612edf89239f40ca3499b89305eb5b594"},"schema_version":"1.0","source":{"id":"1807.04575","kind":"arxiv","version":1}},"canonical_sha256":"ac44278349d966a42297e565c512511ec693126fcc769cd9836a7199d416cbaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac44278349d966a42297e565c512511ec693126fcc769cd9836a7199d416cbaa","first_computed_at":"2026-05-18T00:10:53.058189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:53.058189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G+r8krjzsbMAmX9WgzI+ktV5v7epWLrO6GoPJij+5sJrSmkJaFBx7RBXrCRwJ9EhpHwWpnIZCNDJ8y3m4C7VAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:53.058822Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04575","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a85317edfd242ccba8c03026de4fd971739ce2f37fb64710133691d9280c612","sha256:3d842bf2152355964d78991b65343f0a6e2b0e708196b97d37cba49c80e1a26a"],"state_sha256":"c5dc204d61c6c48d897520a3c959805d352e63e832449ac05552b3ec94314d20"}