{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VRCCPA2J3FTKIIUX4VS4KESRD3","short_pith_number":"pith:VRCCPA2J","schema_version":"1.0","canonical_sha256":"ac44278349d966a42297e565c512511ec693126fcc769cd9836a7199d416cbaa","source":{"kind":"arxiv","id":"1807.04575","version":1},"attestation_state":"computed","paper":{"title":"Algorithmic Meta-Theorems for Monotone Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Masakazu Ishihata, Takanori Maehara, Tomas Rigaux","submitted_at":"2018-07-12T12:36:27Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1807.04575","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-12T12:36:27Z","cross_cats_sorted":[],"title_canon_sha256":"ca0225c7116d53f8fda52caf5488e5c612edf89239f40ca3499b89305eb5b594","abstract_canon_sha256":"f237f6fc5c9650a462a8f81a4fc06175bd3c1335989446cf3f807a831d092c9e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:53.058822Z","signature_b64":"G+r8krjzsbMAmX9WgzI+ktV5v7epWLrO6GoPJij+5sJrSmkJaFBx7RBXrCRwJ9EhpHwWpnIZCNDJ8y3m4C7VAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac44278349d966a42297e565c512511ec693126fcc769cd9836a7199d416cbaa","last_reissued_at":"2026-05-18T00:10:53.058189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:53.058189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithmic Meta-Theorems for Monotone Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Masakazu Ishihata, Takanori Maehara, Tomas Rigaux","submitted_at":"2018-07-12T12:36:27Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04575","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.04575","created_at":"2026-05-18T00:10:53.058303+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.04575v1","created_at":"2026-05-18T00:10:53.058303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04575","created_at":"2026-05-18T00:10:53.058303+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRCCPA2J3FTK","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRCCPA2J3FTKIIUX","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRCCPA2J","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VRCCPA2J3FTKIIUX4VS4KESRD3","json":"https://pith.science/pith/VRCCPA2J3FTKIIUX4VS4KESRD3.json","graph_json":"https://pith.science/api/pith-number/VRCCPA2J3FTKIIUX4VS4KESRD3/graph.json","events_json":"https://pith.science/api/pith-number/VRCCPA2J3FTKIIUX4VS4KESRD3/events.json","paper":"https://pith.science/paper/VRCCPA2J"},"agent_actions":{"view_html":"https://pith.science/pith/VRCCPA2J3FTKIIUX4VS4KESRD3","download_json":"https://pith.science/pith/VRCCPA2J3FTKIIUX4VS4KESRD3.json","view_paper":"https://pith.science/paper/VRCCPA2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.04575&json=true","fetch_graph":"https://pith.science/api/pith-number/VRCCPA2J3FTKIIUX4VS4KESRD3/graph.json","fetch_events":"https://pith.science/api/pith-number/VRCCPA2J3FTKIIUX4VS4KESRD3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRCCPA2J3FTKIIUX4VS4KESRD3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRCCPA2J3FTKIIUX4VS4KESRD3/action/storage_attestation","attest_author":"https://pith.science/pith/VRCCPA2J3FTKIIUX4VS4KESRD3/action/author_attestation","sign_citation":"https://pith.science/pith/VRCCPA2J3FTKIIUX4VS4KESRD3/action/citation_signature","submit_replication":"https://pith.science/pith/VRCCPA2J3FTKIIUX4VS4KESRD3/action/replication_record"}},"created_at":"2026-05-18T00:10:53.058303+00:00","updated_at":"2026-05-18T00:10:53.058303+00:00"}