{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:4A5PB5676GGNMKU5XHGFQGZBUN","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":"dd400d032b075da725822418d7ad2a6aa6258cfe2d8bfa6eeccbc0d901688860","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-09T10:44:15Z","title_canon_sha256":"4dffa5eb797dcf6d98c32eb1401f999733159c1028baa8bb37571df900234818"},"schema_version":"1.0","source":{"id":"2211.04797","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.04797","created_at":"2026-07-05T05:14:42Z"},{"alias_kind":"arxiv_version","alias_value":"2211.04797v1","created_at":"2026-07-05T05:14:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.04797","created_at":"2026-07-05T05:14:42Z"},{"alias_kind":"pith_short_12","alias_value":"4A5PB5676GGN","created_at":"2026-07-05T05:14:42Z"},{"alias_kind":"pith_short_16","alias_value":"4A5PB5676GGNMKU5","created_at":"2026-07-05T05:14:42Z"},{"alias_kind":"pith_short_8","alias_value":"4A5PB567","created_at":"2026-07-05T05:14:42Z"}],"graph_snapshots":[{"event_id":"sha256:be1a10b06c2f5c3c5798a09207d33a20c93571df3bc539cbfab10fc4b4ddfd1a","target":"graph","created_at":"2026-07-05T05:14:42Z","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/2211.04797/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Daniel Lokshtanov, Fedor V. Fomin, Giannos Stamoulis, Petr A. Golovach, Tuukka Korhonen","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-09T10:44:15Z","title":"Shortest Cycles With Monotone Submodular Costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.04797","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:b44858a9d93b42e1aad216c6452b60aa3e9373f44f17bc9fa13ffef9d50ff81a","target":"record","created_at":"2026-07-05T05:14:42Z","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":"dd400d032b075da725822418d7ad2a6aa6258cfe2d8bfa6eeccbc0d901688860","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-11-09T10:44:15Z","title_canon_sha256":"4dffa5eb797dcf6d98c32eb1401f999733159c1028baa8bb37571df900234818"},"schema_version":"1.0","source":{"id":"2211.04797","kind":"arxiv","version":1}},"canonical_sha256":"e03af0f7dff18cd62a9db9cc581b21a36e548ddc3fcf70d4c7b00cf3dc629017","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e03af0f7dff18cd62a9db9cc581b21a36e548ddc3fcf70d4c7b00cf3dc629017","first_computed_at":"2026-07-05T05:14:42.051859Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:14:42.051859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RWhU3w4f9bcpT8mlfbb3x3iMNuyjqRzADIxKYX+fBKQRf5qrtMfBYbzSpi7SQ4UyFsLTeWNAJN/s9sQ+epFFDA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:14:42.052257Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.04797","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b44858a9d93b42e1aad216c6452b60aa3e9373f44f17bc9fa13ffef9d50ff81a","sha256:be1a10b06c2f5c3c5798a09207d33a20c93571df3bc539cbfab10fc4b4ddfd1a"],"state_sha256":"618a97531fd2a92f6ca21973ffb48702acdf197b04055c80e840a31016ebbbec"}