{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:3NKFR37OHPLXLYALGVDKPF4OS7","short_pith_number":"pith:3NKFR37O","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"},"canonical_sha256":"db5458efee3bd775e00b3546a7978e97c2056c8591bc2cf105a8f4715ee95086","source":{"kind":"arxiv","id":"2411.15282","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.15282","created_at":"2026-07-05T10:33:39Z"},{"alias_kind":"arxiv_version","alias_value":"2411.15282v2","created_at":"2026-07-05T10:33:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15282","created_at":"2026-07-05T10:33:39Z"},{"alias_kind":"pith_short_12","alias_value":"3NKFR37OHPLX","created_at":"2026-07-05T10:33:39Z"},{"alias_kind":"pith_short_16","alias_value":"3NKFR37OHPLXLYAL","created_at":"2026-07-05T10:33:39Z"},{"alias_kind":"pith_short_8","alias_value":"3NKFR37O","created_at":"2026-07-05T10:33:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:3NKFR37OHPLXLYALGVDKPF4OS7","target":"record","payload":{"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"},"canonical_sha256":"db5458efee3bd775e00b3546a7978e97c2056c8591bc2cf105a8f4715ee95086","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"},"source_kind":"arxiv","source_id":"2411.15282","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:33:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gf3ERa6zGy+UPyi9tY9Krqhe2IuDxLNO4o4RRVY0J0QVvfS30Z8Sor7FgVC0hdee1qV4mbbOZs7U1k/IYBYUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:30:24.233304Z"},"content_sha256":"63103e1c73fa1af788139d79bd4c85ca798f2bdecfa893d7c8fd2e5e918f4666","schema_version":"1.0","event_id":"sha256:63103e1c73fa1af788139d79bd4c85ca798f2bdecfa893d7c8fd2e5e918f4666"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:3NKFR37OHPLXLYALGVDKPF4OS7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:33:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0jt4PalGAd6F0uv4S4XkworChSg9lMREcE6FeCnxGXPvSsv/MJZE5zcZk5mpkHUuyzWO5yojDkI7+UQ8mF3mAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:30:24.233798Z"},"content_sha256":"df214c9f73675dc4f468fb29ca8908f7c35b0c875bd353038214744c76851a65","schema_version":"1.0","event_id":"sha256:df214c9f73675dc4f468fb29ca8908f7c35b0c875bd353038214744c76851a65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3NKFR37OHPLXLYALGVDKPF4OS7/bundle.json","state_url":"https://pith.science/pith/3NKFR37OHPLXLYALGVDKPF4OS7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3NKFR37OHPLXLYALGVDKPF4OS7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-12T23:30:24Z","links":{"resolver":"https://pith.science/pith/3NKFR37OHPLXLYALGVDKPF4OS7","bundle":"https://pith.science/pith/3NKFR37OHPLXLYALGVDKPF4OS7/bundle.json","state":"https://pith.science/pith/3NKFR37OHPLXLYALGVDKPF4OS7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3NKFR37OHPLXLYALGVDKPF4OS7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:3NKFR37OHPLXLYALGVDKPF4OS7","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":"eb0a6ecca719070dfc6afdbd2437cdaea2798d82ac65de81aa6b57211decdb6c","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-22T16:24:19Z","title_canon_sha256":"e7caea701e15b82f1fb91e542a9ddaa83764a6742d059962f38f193e7bb68ed7"},"schema_version":"1.0","source":{"id":"2411.15282","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.15282","created_at":"2026-07-05T10:33:39Z"},{"alias_kind":"arxiv_version","alias_value":"2411.15282v2","created_at":"2026-07-05T10:33:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15282","created_at":"2026-07-05T10:33:39Z"},{"alias_kind":"pith_short_12","alias_value":"3NKFR37OHPLX","created_at":"2026-07-05T10:33:39Z"},{"alias_kind":"pith_short_16","alias_value":"3NKFR37OHPLXLYAL","created_at":"2026-07-05T10:33:39Z"},{"alias_kind":"pith_short_8","alias_value":"3NKFR37O","created_at":"2026-07-05T10:33:39Z"}],"graph_snapshots":[{"event_id":"sha256:df214c9f73675dc4f468fb29ca8908f7c35b0c875bd353038214744c76851a65","target":"graph","created_at":"2026-07-05T10:33:39Z","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/2411.15282/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Stefan Kober","cross_cats":["cs.DM","math.CO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-22T16:24:19Z","title":"Totally $\\Delta$-modular IPs with two non-zeros in most rows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15282","kind":"arxiv","version":2},"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:63103e1c73fa1af788139d79bd4c85ca798f2bdecfa893d7c8fd2e5e918f4666","target":"record","created_at":"2026-07-05T10:33:39Z","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":"eb0a6ecca719070dfc6afdbd2437cdaea2798d82ac65de81aa6b57211decdb6c","cross_cats_sorted":["cs.DM","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-22T16:24:19Z","title_canon_sha256":"e7caea701e15b82f1fb91e542a9ddaa83764a6742d059962f38f193e7bb68ed7"},"schema_version":"1.0","source":{"id":"2411.15282","kind":"arxiv","version":2}},"canonical_sha256":"db5458efee3bd775e00b3546a7978e97c2056c8591bc2cf105a8f4715ee95086","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db5458efee3bd775e00b3546a7978e97c2056c8591bc2cf105a8f4715ee95086","first_computed_at":"2026-07-05T10:33:39.995565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:33:39.995565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fvXRNtWYQRedcatybiISo7AtZWqKtcbPxhJCl1aGGmKn6TmdZ9wy0sPDGBXm3oOUW4IMKWIr4wOuUSlgDEMqAw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:33:39.996372Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.15282","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63103e1c73fa1af788139d79bd4c85ca798f2bdecfa893d7c8fd2e5e918f4666","sha256:df214c9f73675dc4f468fb29ca8908f7c35b0c875bd353038214744c76851a65"],"state_sha256":"ff91940737668805cf5c9202ea2b1100fa29cadefc8ba973a8445690f4919b40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dDTHkpvOIgOUiJK7KZp95+AF64wt1smXsUQ9OORhQylK37m+Tw3ly5KlHngH6HXkbqak2bobfbeIKr+gEXMoAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T23:30:24.237403Z","bundle_sha256":"1bc3a2927b10ebbe948ccfd972b2ac7b5254a6556701e19bf2910a62f43b428a"}}