{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:4A5PB5676GGNMKU5XHGFQGZBUN","short_pith_number":"pith:4A5PB567","schema_version":"1.0","canonical_sha256":"e03af0f7dff18cd62a9db9cc581b21a36e548ddc3fcf70d4c7b00cf3dc629017","source":{"kind":"arxiv","id":"2211.04797","version":1},"attestation_state":"computed","paper":{"title":"Shortest Cycles With Monotone Submodular Costs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Giannos Stamoulis, Petr A. Golovach, Tuukka Korhonen","submitted_at":"2022-11-09T10:44:15Z","abstract_excerpt":"We introduce the following submodular generalization of the Shortest Cycle problem. For a nonnegative monotone submodular cost function $f$ defined on the edges (or the vertices) of an undirected graph $G$, we seek for a cycle $C$ in $G$ of minimum cost $\\textsf{OPT}=f(C)$. We give an algorithm that given an $n$-vertex graph $G$, parameter $\\varepsilon > 0$, and the function $f$ represented by an oracle, in time $n^{\\mathcal{O}(\\log 1/\\varepsilon)}$ finds a cycle $C$ in $G$ with $f(C)\\leq (1+\\varepsilon)\\cdot \\textsf{OPT}$. This is in sharp contrast with the non-approximability of the closely "},"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":"2211.04797","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-09T10:44:15Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4dffa5eb797dcf6d98c32eb1401f999733159c1028baa8bb37571df900234818","abstract_canon_sha256":"dd400d032b075da725822418d7ad2a6aa6258cfe2d8bfa6eeccbc0d901688860"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:14:42.052257Z","signature_b64":"RWhU3w4f9bcpT8mlfbb3x3iMNuyjqRzADIxKYX+fBKQRf5qrtMfBYbzSpi7SQ4UyFsLTeWNAJN/s9sQ+epFFDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e03af0f7dff18cd62a9db9cc581b21a36e548ddc3fcf70d4c7b00cf3dc629017","last_reissued_at":"2026-07-05T05:14:42.051859Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:14:42.051859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Shortest Cycles With Monotone Submodular Costs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Giannos Stamoulis, Petr A. Golovach, Tuukka Korhonen","submitted_at":"2022-11-09T10:44:15Z","abstract_excerpt":"We introduce the following submodular generalization of the Shortest Cycle problem. For a nonnegative monotone submodular cost function $f$ defined on the edges (or the vertices) of an undirected graph $G$, we seek for a cycle $C$ in $G$ of minimum cost $\\textsf{OPT}=f(C)$. We give an algorithm that given an $n$-vertex graph $G$, parameter $\\varepsilon > 0$, and the function $f$ represented by an oracle, in time $n^{\\mathcal{O}(\\log 1/\\varepsilon)}$ finds a cycle $C$ in $G$ with $f(C)\\leq (1+\\varepsilon)\\cdot \\textsf{OPT}$. This is in sharp contrast with the non-approximability of the closely "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.04797","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/2211.04797/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2211.04797","created_at":"2026-07-05T05:14:42.051914+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.04797v1","created_at":"2026-07-05T05:14:42.051914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04797","created_at":"2026-07-05T05:14:42.051914+00:00"},{"alias_kind":"pith_short_12","alias_value":"4A5PB5676GGN","created_at":"2026-07-05T05:14:42.051914+00:00"},{"alias_kind":"pith_short_16","alias_value":"4A5PB5676GGNMKU5","created_at":"2026-07-05T05:14:42.051914+00:00"},{"alias_kind":"pith_short_8","alias_value":"4A5PB567","created_at":"2026-07-05T05:14:42.051914+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/4A5PB5676GGNMKU5XHGFQGZBUN","json":"https://pith.science/pith/4A5PB5676GGNMKU5XHGFQGZBUN.json","graph_json":"https://pith.science/api/pith-number/4A5PB5676GGNMKU5XHGFQGZBUN/graph.json","events_json":"https://pith.science/api/pith-number/4A5PB5676GGNMKU5XHGFQGZBUN/events.json","paper":"https://pith.science/paper/4A5PB567"},"agent_actions":{"view_html":"https://pith.science/pith/4A5PB5676GGNMKU5XHGFQGZBUN","download_json":"https://pith.science/pith/4A5PB5676GGNMKU5XHGFQGZBUN.json","view_paper":"https://pith.science/paper/4A5PB567","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.04797&json=true","fetch_graph":"https://pith.science/api/pith-number/4A5PB5676GGNMKU5XHGFQGZBUN/graph.json","fetch_events":"https://pith.science/api/pith-number/4A5PB5676GGNMKU5XHGFQGZBUN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4A5PB5676GGNMKU5XHGFQGZBUN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4A5PB5676GGNMKU5XHGFQGZBUN/action/storage_attestation","attest_author":"https://pith.science/pith/4A5PB5676GGNMKU5XHGFQGZBUN/action/author_attestation","sign_citation":"https://pith.science/pith/4A5PB5676GGNMKU5XHGFQGZBUN/action/citation_signature","submit_replication":"https://pith.science/pith/4A5PB5676GGNMKU5XHGFQGZBUN/action/replication_record"}},"created_at":"2026-07-05T05:14:42.051914+00:00","updated_at":"2026-07-05T05:14:42.051914+00:00"}