{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LADT3RGXLLQOLFKS5NEBQNOZTM","short_pith_number":"pith:LADT3RGX","schema_version":"1.0","canonical_sha256":"58073dc4d75ae0e59552eb481835d99b17d9c768dee3b8145dc4660d570fe0b9","source":{"kind":"arxiv","id":"2505.22212","version":1},"attestation_state":"computed","paper":{"title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Asaf Levin, Christoph Hunkenschr\\\"oder, Martin Kouteck\\'y, Tung Anh Vu","submitted_at":"2025-05-28T10:39:56Z","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"},"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":"2505.22212","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2025-05-28T10:39:56Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b0ed020e57959537fa163827bf2df275ea0512a11aaef84a799308b7b33d6fe4","abstract_canon_sha256":"e7f47a9f562e3233adf9089c3c6e40de2028bf291163097585f71a966e8f6102"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:11.539082Z","signature_b64":"cYHxeXnMjH7XxhCw2vaToF7RbssPrvqFgt7oykjH09Bbgv0uwSBJw/LEDvlrYLTwYUpKrWBd42wbI8K9LjUxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58073dc4d75ae0e59552eb481835d99b17d9c768dee3b8145dc4660d570fe0b9","last_reissued_at":"2026-07-05T11:11:11.538629Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:11.538629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Asaf Levin, Christoph Hunkenschr\\\"oder, Martin Kouteck\\'y, Tung Anh Vu","submitted_at":"2025-05-28T10:39:56Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22212","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/2505.22212/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":"2505.22212","created_at":"2026-07-05T11:11:11.538686+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22212v1","created_at":"2026-07-05T11:11:11.538686+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22212","created_at":"2026-07-05T11:11:11.538686+00:00"},{"alias_kind":"pith_short_12","alias_value":"LADT3RGXLLQO","created_at":"2026-07-05T11:11:11.538686+00:00"},{"alias_kind":"pith_short_16","alias_value":"LADT3RGXLLQOLFKS","created_at":"2026-07-05T11:11:11.538686+00:00"},{"alias_kind":"pith_short_8","alias_value":"LADT3RGX","created_at":"2026-07-05T11:11:11.538686+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/LADT3RGXLLQOLFKS5NEBQNOZTM","json":"https://pith.science/pith/LADT3RGXLLQOLFKS5NEBQNOZTM.json","graph_json":"https://pith.science/api/pith-number/LADT3RGXLLQOLFKS5NEBQNOZTM/graph.json","events_json":"https://pith.science/api/pith-number/LADT3RGXLLQOLFKS5NEBQNOZTM/events.json","paper":"https://pith.science/paper/LADT3RGX"},"agent_actions":{"view_html":"https://pith.science/pith/LADT3RGXLLQOLFKS5NEBQNOZTM","download_json":"https://pith.science/pith/LADT3RGXLLQOLFKS5NEBQNOZTM.json","view_paper":"https://pith.science/paper/LADT3RGX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22212&json=true","fetch_graph":"https://pith.science/api/pith-number/LADT3RGXLLQOLFKS5NEBQNOZTM/graph.json","fetch_events":"https://pith.science/api/pith-number/LADT3RGXLLQOLFKS5NEBQNOZTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LADT3RGXLLQOLFKS5NEBQNOZTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LADT3RGXLLQOLFKS5NEBQNOZTM/action/storage_attestation","attest_author":"https://pith.science/pith/LADT3RGXLLQOLFKS5NEBQNOZTM/action/author_attestation","sign_citation":"https://pith.science/pith/LADT3RGXLLQOLFKS5NEBQNOZTM/action/citation_signature","submit_replication":"https://pith.science/pith/LADT3RGXLLQOLFKS5NEBQNOZTM/action/replication_record"}},"created_at":"2026-07-05T11:11:11.538686+00:00","updated_at":"2026-07-05T11:11:11.538686+00:00"}