{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ARBORAC7PAUTL7YHHFMSWTG2PU","short_pith_number":"pith:ARBORAC7","schema_version":"1.0","canonical_sha256":"0442e8805f782935ff0739592b4cda7d35b720ff07cf63973aaa07813ceea5fc","source":{"kind":"arxiv","id":"1408.5958","version":1},"attestation_state":"computed","paper":{"title":"On the Path-Width of Integer Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.FL"],"primary_cat":"cs.LO","authors_text":"Constantin Enea, Gennaro Parlato, Omar Inverso, Peter Habermehl","submitted_at":"2014-08-26T01:15:00Z","abstract_excerpt":"We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs. For each solution there may be many graphs representing it. However, one of these graphs is of path-width at most 2n, where n is the number of variables in the instance. Since FO is decidable on graphs of bounded path- width, we obtain an alternative decidability result for ILP. The technique we use underlines a common principle to prove decidability which has previously been employed for automata with auxiliary sto"},"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":"1408.5958","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-08-26T01:15:00Z","cross_cats_sorted":["cs.CC","cs.FL"],"title_canon_sha256":"32f74e80a7bf2808ed275d4d7f47a071e14e799a69e6379e4d1c936333398b0b","abstract_canon_sha256":"6f72e9316d9ef754a422c1aeacffd9043a89844203d831cf7057a16352ee68a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:15.761720Z","signature_b64":"MHtj7a8mUHmck9elt33SbdJrSey/Q9cvcT7n0gp+BWNcxo7PGxQRo9VVSB4VdUdPQFfGXGqC9WZuvdX7Sqw9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0442e8805f782935ff0739592b4cda7d35b720ff07cf63973aaa07813ceea5fc","last_reissued_at":"2026-05-18T02:44:15.761105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:15.761105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Path-Width of Integer Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.FL"],"primary_cat":"cs.LO","authors_text":"Constantin Enea, Gennaro Parlato, Omar Inverso, Peter Habermehl","submitted_at":"2014-08-26T01:15:00Z","abstract_excerpt":"We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs. For each solution there may be many graphs representing it. However, one of these graphs is of path-width at most 2n, where n is the number of variables in the instance. Since FO is decidable on graphs of bounded path- width, we obtain an alternative decidability result for ILP. The technique we use underlines a common principle to prove decidability which has previously been employed for automata with auxiliary sto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5958","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":""},"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":"1408.5958","created_at":"2026-05-18T02:44:15.761200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.5958v1","created_at":"2026-05-18T02:44:15.761200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5958","created_at":"2026-05-18T02:44:15.761200+00:00"},{"alias_kind":"pith_short_12","alias_value":"ARBORAC7PAUT","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"ARBORAC7PAUTL7YH","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"ARBORAC7","created_at":"2026-05-18T12:28:19.803747+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/ARBORAC7PAUTL7YHHFMSWTG2PU","json":"https://pith.science/pith/ARBORAC7PAUTL7YHHFMSWTG2PU.json","graph_json":"https://pith.science/api/pith-number/ARBORAC7PAUTL7YHHFMSWTG2PU/graph.json","events_json":"https://pith.science/api/pith-number/ARBORAC7PAUTL7YHHFMSWTG2PU/events.json","paper":"https://pith.science/paper/ARBORAC7"},"agent_actions":{"view_html":"https://pith.science/pith/ARBORAC7PAUTL7YHHFMSWTG2PU","download_json":"https://pith.science/pith/ARBORAC7PAUTL7YHHFMSWTG2PU.json","view_paper":"https://pith.science/paper/ARBORAC7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.5958&json=true","fetch_graph":"https://pith.science/api/pith-number/ARBORAC7PAUTL7YHHFMSWTG2PU/graph.json","fetch_events":"https://pith.science/api/pith-number/ARBORAC7PAUTL7YHHFMSWTG2PU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ARBORAC7PAUTL7YHHFMSWTG2PU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ARBORAC7PAUTL7YHHFMSWTG2PU/action/storage_attestation","attest_author":"https://pith.science/pith/ARBORAC7PAUTL7YHHFMSWTG2PU/action/author_attestation","sign_citation":"https://pith.science/pith/ARBORAC7PAUTL7YHHFMSWTG2PU/action/citation_signature","submit_replication":"https://pith.science/pith/ARBORAC7PAUTL7YHHFMSWTG2PU/action/replication_record"}},"created_at":"2026-05-18T02:44:15.761200+00:00","updated_at":"2026-05-18T02:44:15.761200+00:00"}