{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3NKFR37OHPLXLYALGVDKPF4OS7","short_pith_number":"pith:3NKFR37O","schema_version":"1.0","canonical_sha256":"db5458efee3bd775e00b3546a7978e97c2056c8591bc2cf105a8f4715ee95086","source":{"kind":"arxiv","id":"2411.15282","version":2},"attestation_state":"computed","paper":{"title":"Totally $\\Delta$-modular IPs with two non-zeros in most rows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.OC"],"primary_cat":"cs.DS","authors_text":"Stefan Kober","submitted_at":"2024-11-22T16:24:19Z","abstract_excerpt":"Integer programs (IPs) on constraint matrices with bounded subdeterminants are conjectured to be solvable in polynomial time. We give a strongly polynomial time algorithm to solve IPs where the constraint matrix has bounded subdeterminants and at most two non-zeros per row after removing a constant number of rows and columns. This result extends the work by Fiorini, Joret, Weltge \\& Yuditsky (J. ACM 72(1), 1-50 (2025)) by allowing for additional, unifying constraints and variables."},"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":"2411.15282","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-22T16:24:19Z","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"title_canon_sha256":"e7caea701e15b82f1fb91e542a9ddaa83764a6742d059962f38f193e7bb68ed7","abstract_canon_sha256":"eb0a6ecca719070dfc6afdbd2437cdaea2798d82ac65de81aa6b57211decdb6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:33:39.996372Z","signature_b64":"fvXRNtWYQRedcatybiISo7AtZWqKtcbPxhJCl1aGGmKn6TmdZ9wy0sPDGBXm3oOUW4IMKWIr4wOuUSlgDEMqAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db5458efee3bd775e00b3546a7978e97c2056c8591bc2cf105a8f4715ee95086","last_reissued_at":"2026-07-05T10:33:39.995565Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:33:39.995565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Totally $\\Delta$-modular IPs with two non-zeros in most rows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.OC"],"primary_cat":"cs.DS","authors_text":"Stefan Kober","submitted_at":"2024-11-22T16:24:19Z","abstract_excerpt":"Integer programs (IPs) on constraint matrices with bounded subdeterminants are conjectured to be solvable in polynomial time. We give a strongly polynomial time algorithm to solve IPs where the constraint matrix has bounded subdeterminants and at most two non-zeros per row after removing a constant number of rows and columns. This result extends the work by Fiorini, Joret, Weltge \\& Yuditsky (J. ACM 72(1), 1-50 (2025)) by allowing for additional, unifying constraints and variables."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15282","kind":"arxiv","version":2},"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/2411.15282/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":"2411.15282","created_at":"2026-07-05T10:33:39.995664+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.15282v2","created_at":"2026-07-05T10:33:39.995664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15282","created_at":"2026-07-05T10:33:39.995664+00:00"},{"alias_kind":"pith_short_12","alias_value":"3NKFR37OHPLX","created_at":"2026-07-05T10:33:39.995664+00:00"},{"alias_kind":"pith_short_16","alias_value":"3NKFR37OHPLXLYAL","created_at":"2026-07-05T10:33:39.995664+00:00"},{"alias_kind":"pith_short_8","alias_value":"3NKFR37O","created_at":"2026-07-05T10:33:39.995664+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/3NKFR37OHPLXLYALGVDKPF4OS7","json":"https://pith.science/pith/3NKFR37OHPLXLYALGVDKPF4OS7.json","graph_json":"https://pith.science/api/pith-number/3NKFR37OHPLXLYALGVDKPF4OS7/graph.json","events_json":"https://pith.science/api/pith-number/3NKFR37OHPLXLYALGVDKPF4OS7/events.json","paper":"https://pith.science/paper/3NKFR37O"},"agent_actions":{"view_html":"https://pith.science/pith/3NKFR37OHPLXLYALGVDKPF4OS7","download_json":"https://pith.science/pith/3NKFR37OHPLXLYALGVDKPF4OS7.json","view_paper":"https://pith.science/paper/3NKFR37O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.15282&json=true","fetch_graph":"https://pith.science/api/pith-number/3NKFR37OHPLXLYALGVDKPF4OS7/graph.json","fetch_events":"https://pith.science/api/pith-number/3NKFR37OHPLXLYALGVDKPF4OS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3NKFR37OHPLXLYALGVDKPF4OS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3NKFR37OHPLXLYALGVDKPF4OS7/action/storage_attestation","attest_author":"https://pith.science/pith/3NKFR37OHPLXLYALGVDKPF4OS7/action/author_attestation","sign_citation":"https://pith.science/pith/3NKFR37OHPLXLYALGVDKPF4OS7/action/citation_signature","submit_replication":"https://pith.science/pith/3NKFR37OHPLXLYALGVDKPF4OS7/action/replication_record"}},"created_at":"2026-07-05T10:33:39.995664+00:00","updated_at":"2026-07-05T10:33:39.995664+00:00"}