{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LADT3RGXLLQOLFKS5NEBQNOZTM","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":"e7f47a9f562e3233adf9089c3c6e40de2028bf291163097585f71a966e8f6102","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-28T10:39:56Z","title_canon_sha256":"b0ed020e57959537fa163827bf2df275ea0512a11aaef84a799308b7b33d6fe4"},"schema_version":"1.0","source":{"id":"2505.22212","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.22212","created_at":"2026-07-05T11:11:11Z"},{"alias_kind":"arxiv_version","alias_value":"2505.22212v1","created_at":"2026-07-05T11:11:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22212","created_at":"2026-07-05T11:11:11Z"},{"alias_kind":"pith_short_12","alias_value":"LADT3RGXLLQO","created_at":"2026-07-05T11:11:11Z"},{"alias_kind":"pith_short_16","alias_value":"LADT3RGXLLQOLFKS","created_at":"2026-07-05T11:11:11Z"},{"alias_kind":"pith_short_8","alias_value":"LADT3RGX","created_at":"2026-07-05T11:11:11Z"}],"graph_snapshots":[{"event_id":"sha256:25c9176df583be70c78c3708c43466e0c18b18e78cb8be2755bede53ebfb4346","target":"graph","created_at":"2026-07-05T11:11:11Z","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/2505.22212/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the general integer programming (IP) problem of optimizing a separable convex function over the integer points of a polytope: $\\min \\{f(\\mathbf{x}) \\mid A\\mathbf{x} = \\mathbf{b}, \\, \\mathbf{l} \\leq \\mathbf{x} \\leq \\mathbf{u}, \\, \\mathbf{x} \\in \\mathbb{Z}^n\\}$. The number of variables $n$ is a variable part of the input, and we consider the regime where the constraint matrix $A$ has small coefficients $\\|A\\|_\\infty$ and small primal or dual treedepth $\\mathrm{td}_P(A)$ or $\\mathrm{td}_D(A)$, respectively. Equivalently, we consider block-structured matrices, in particular $n$-fold, tree","authors_text":"Asaf Levin, Christoph Hunkenschr\\\"oder, Martin Kouteck\\'y, Tung Anh Vu","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-28T10:39:56Z","title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22212","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:bbe3f07cef1758074fbdd1b92e446d18bcb40c65c78ab4b2925797d96abad8c5","target":"record","created_at":"2026-07-05T11:11:11Z","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":"e7f47a9f562e3233adf9089c3c6e40de2028bf291163097585f71a966e8f6102","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-28T10:39:56Z","title_canon_sha256":"b0ed020e57959537fa163827bf2df275ea0512a11aaef84a799308b7b33d6fe4"},"schema_version":"1.0","source":{"id":"2505.22212","kind":"arxiv","version":1}},"canonical_sha256":"58073dc4d75ae0e59552eb481835d99b17d9c768dee3b8145dc4660d570fe0b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"58073dc4d75ae0e59552eb481835d99b17d9c768dee3b8145dc4660d570fe0b9","first_computed_at":"2026-07-05T11:11:11.538629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:11:11.538629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cYHxeXnMjH7XxhCw2vaToF7RbssPrvqFgt7oykjH09Bbgv0uwSBJw/LEDvlrYLTwYUpKrWBd42wbI8K9LjUxCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:11:11.539082Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.22212","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbe3f07cef1758074fbdd1b92e446d18bcb40c65c78ab4b2925797d96abad8c5","sha256:25c9176df583be70c78c3708c43466e0c18b18e78cb8be2755bede53ebfb4346"],"state_sha256":"91ddaefa3d1eeefedd98531226d5063687b32cb2fe441fba4c4dee1fcec05e9d"}