{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:AHJ4XNADHZWNETDCENJ7O5XU2R","short_pith_number":"pith:AHJ4XNAD","schema_version":"1.0","canonical_sha256":"01d3cbb4033e6cd24c622353f776f4d463d7d4a2d733114f2e3fdfebd1305a69","source":{"kind":"arxiv","id":"cs/0508044","version":5},"attestation_state":"computed","paper":{"title":"Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Randal E. Bryant, Sanjit A. Seshia","submitted_at":"2005-08-05T11:09:32Z","abstract_excerpt":"Given a formula in quantifier-free Presburger arithmetic, if it has a satisfying solution, there is one whose size, measured in bits, is polynomially bounded in the size of the formula. In this paper, we consider a special class of quantifier-free Presburger formulas in which most linear constraints are difference (separation) constraints, and the non-difference constraints are sparse. This class has been observed to commonly occur in software verification. We derive a new solution bound in terms of parameters characterizing the sparseness of linear constraints and the number of non-difference"},"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":"cs/0508044","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2005-08-05T11:09:32Z","cross_cats_sorted":[],"title_canon_sha256":"91baea52421fd48e58bbf75c5fbdd57f8d78fa3c09a2dc8f5aa8dd34421a8531","abstract_canon_sha256":"dcdc8c6b2a059cbb5dc5587146f1edd4a7af05a7c1ee663fc08ae558276bae42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:03.470963Z","signature_b64":"pA2MiQYjEBAi46Vqjb46LzdEP2SVX6V8iF0FIkPQbSM5/Im9jpRmjgEx9le1rsHAeWGGzNjRgJo6x5z7Q/CaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01d3cbb4033e6cd24c622353f776f4d463d7d4a2d733114f2e3fdfebd1305a69","last_reissued_at":"2026-05-18T00:53:03.470553Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:03.470553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Randal E. Bryant, Sanjit A. Seshia","submitted_at":"2005-08-05T11:09:32Z","abstract_excerpt":"Given a formula in quantifier-free Presburger arithmetic, if it has a satisfying solution, there is one whose size, measured in bits, is polynomially bounded in the size of the formula. In this paper, we consider a special class of quantifier-free Presburger formulas in which most linear constraints are difference (separation) constraints, and the non-difference constraints are sparse. This class has been observed to commonly occur in software verification. We derive a new solution bound in terms of parameters characterizing the sparseness of linear constraints and the number of non-difference"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508044","kind":"arxiv","version":5},"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":"cs/0508044","created_at":"2026-05-18T00:53:03.470620+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0508044v5","created_at":"2026-05-18T00:53:03.470620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508044","created_at":"2026-05-18T00:53:03.470620+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHJ4XNADHZWN","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHJ4XNADHZWNETDC","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHJ4XNAD","created_at":"2026-05-18T12:25:53.335082+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/AHJ4XNADHZWNETDCENJ7O5XU2R","json":"https://pith.science/pith/AHJ4XNADHZWNETDCENJ7O5XU2R.json","graph_json":"https://pith.science/api/pith-number/AHJ4XNADHZWNETDCENJ7O5XU2R/graph.json","events_json":"https://pith.science/api/pith-number/AHJ4XNADHZWNETDCENJ7O5XU2R/events.json","paper":"https://pith.science/paper/AHJ4XNAD"},"agent_actions":{"view_html":"https://pith.science/pith/AHJ4XNADHZWNETDCENJ7O5XU2R","download_json":"https://pith.science/pith/AHJ4XNADHZWNETDCENJ7O5XU2R.json","view_paper":"https://pith.science/paper/AHJ4XNAD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0508044&json=true","fetch_graph":"https://pith.science/api/pith-number/AHJ4XNADHZWNETDCENJ7O5XU2R/graph.json","fetch_events":"https://pith.science/api/pith-number/AHJ4XNADHZWNETDCENJ7O5XU2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHJ4XNADHZWNETDCENJ7O5XU2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHJ4XNADHZWNETDCENJ7O5XU2R/action/storage_attestation","attest_author":"https://pith.science/pith/AHJ4XNADHZWNETDCENJ7O5XU2R/action/author_attestation","sign_citation":"https://pith.science/pith/AHJ4XNADHZWNETDCENJ7O5XU2R/action/citation_signature","submit_replication":"https://pith.science/pith/AHJ4XNADHZWNETDCENJ7O5XU2R/action/replication_record"}},"created_at":"2026-05-18T00:53:03.470620+00:00","updated_at":"2026-05-18T00:53:03.470620+00:00"}