{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TREWDHE3IS5WIOWL2KW22452TJ","short_pith_number":"pith:TREWDHE3","schema_version":"1.0","canonical_sha256":"9c49619c9b44bb643acbd2adad73ba9a78c598da7659dd6182a4b960864d3fb2","source":{"kind":"arxiv","id":"2506.04452","version":1},"attestation_state":"computed","paper":{"title":"An Expansion-Based Approach for Quantified Integer Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LO"],"primary_cat":"cs.DM","authors_text":"Leroy Chew, Michael Hartisch","submitted_at":"2025-06-04T21:14:14Z","abstract_excerpt":"Quantified Integer Programming (QIP) bridges multiple domains by extending Quantified Boolean Formulas (QBF) to incorporate general integer variables and linear constraints while also generalizing Integer Programming through variable quantification. As a special case of Quantified Constraint Satisfaction Problems (QCSP), QIP provides a versatile framework for addressing complex decision-making scenarios. Additionally, the inclusion of a linear objective function enables QIP to effectively model multistage robust discrete linear optimization problems, making it a powerful tool for tackling unce"},"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":"2506.04452","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-06-04T21:14:14Z","cross_cats_sorted":["cs.AI","cs.LO"],"title_canon_sha256":"c7ae0dfa14ab1264becf9d19c90f0ec74b70e77719f2b5cc86e8941e33119ddf","abstract_canon_sha256":"3b127c9c730caaeb3a5ff316b7bd49dee2bd74f29dce257fe62da3853d78d914"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:14.668852Z","signature_b64":"wl9Gbt9aPAp20mcIQvWmc8Z7zuFJrN8RCa8Kc+1heLFTr3T9myHU93wsPvDLMQXhre+vjSwwBS/AtP1r2r87CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c49619c9b44bb643acbd2adad73ba9a78c598da7659dd6182a4b960864d3fb2","last_reissued_at":"2026-07-05T11:16:14.668434Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:14.668434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Expansion-Based Approach for Quantified Integer Programming","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LO"],"primary_cat":"cs.DM","authors_text":"Leroy Chew, Michael Hartisch","submitted_at":"2025-06-04T21:14:14Z","abstract_excerpt":"Quantified Integer Programming (QIP) bridges multiple domains by extending Quantified Boolean Formulas (QBF) to incorporate general integer variables and linear constraints while also generalizing Integer Programming through variable quantification. As a special case of Quantified Constraint Satisfaction Problems (QCSP), QIP provides a versatile framework for addressing complex decision-making scenarios. Additionally, the inclusion of a linear objective function enables QIP to effectively model multistage robust discrete linear optimization problems, making it a powerful tool for tackling unce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04452","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/2506.04452/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":"2506.04452","created_at":"2026-07-05T11:16:14.668505+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.04452v1","created_at":"2026-07-05T11:16:14.668505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04452","created_at":"2026-07-05T11:16:14.668505+00:00"},{"alias_kind":"pith_short_12","alias_value":"TREWDHE3IS5W","created_at":"2026-07-05T11:16:14.668505+00:00"},{"alias_kind":"pith_short_16","alias_value":"TREWDHE3IS5WIOWL","created_at":"2026-07-05T11:16:14.668505+00:00"},{"alias_kind":"pith_short_8","alias_value":"TREWDHE3","created_at":"2026-07-05T11:16:14.668505+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/TREWDHE3IS5WIOWL2KW22452TJ","json":"https://pith.science/pith/TREWDHE3IS5WIOWL2KW22452TJ.json","graph_json":"https://pith.science/api/pith-number/TREWDHE3IS5WIOWL2KW22452TJ/graph.json","events_json":"https://pith.science/api/pith-number/TREWDHE3IS5WIOWL2KW22452TJ/events.json","paper":"https://pith.science/paper/TREWDHE3"},"agent_actions":{"view_html":"https://pith.science/pith/TREWDHE3IS5WIOWL2KW22452TJ","download_json":"https://pith.science/pith/TREWDHE3IS5WIOWL2KW22452TJ.json","view_paper":"https://pith.science/paper/TREWDHE3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.04452&json=true","fetch_graph":"https://pith.science/api/pith-number/TREWDHE3IS5WIOWL2KW22452TJ/graph.json","fetch_events":"https://pith.science/api/pith-number/TREWDHE3IS5WIOWL2KW22452TJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TREWDHE3IS5WIOWL2KW22452TJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TREWDHE3IS5WIOWL2KW22452TJ/action/storage_attestation","attest_author":"https://pith.science/pith/TREWDHE3IS5WIOWL2KW22452TJ/action/author_attestation","sign_citation":"https://pith.science/pith/TREWDHE3IS5WIOWL2KW22452TJ/action/citation_signature","submit_replication":"https://pith.science/pith/TREWDHE3IS5WIOWL2KW22452TJ/action/replication_record"}},"created_at":"2026-07-05T11:16:14.668505+00:00","updated_at":"2026-07-05T11:16:14.668505+00:00"}