{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QT4ROUJO5ADDJH2VQFW3G3BJGT","short_pith_number":"pith:QT4ROUJO","schema_version":"1.0","canonical_sha256":"84f917512ee806349f55816db36c2934eca5ef8b0a3a74a63e03644619bd5d1e","source":{"kind":"arxiv","id":"2501.15345","version":1},"attestation_state":"computed","paper":{"title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dimitri J. Papageorgiou, Francisco Trespalacios","submitted_at":"2025-01-25T23:05:28Z","abstract_excerpt":"An elementary, but fundamental, operation in disjunctive programming is a basic step, which is the intersection of two disjunctions to form a new disjunction. Basic steps bring a disjunctive set in regular form closer to its disjunctive normal form and, in turn, produce relaxations that are at least as tight. An open question is: What are guaranteed bounds on the improvement from a basic step? In this paper, using properties of a convex disjunctive program's hull reformulation and multipliers from Lagrangian decomposition, we introduce an operation called a pseudo basic step and use it to prov"},"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":"2501.15345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-25T23:05:28Z","cross_cats_sorted":[],"title_canon_sha256":"d4929cbed540a9295cc4ebb54c39a6f25a5836e19cb401694227e290418df65b","abstract_canon_sha256":"f3334d882d3d89a52781329d52132976a02592ab9ae0767589122218d25ea47e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:27.767197Z","signature_b64":"Kv5wFU430Cur0QI96ssDeMUI0ug3Ozjdhpbn1S6xEx883iihzjzumSi7gOQ0DiIW/WrdzMXA5GmS8eLGuNZRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84f917512ee806349f55816db36c2934eca5ef8b0a3a74a63e03644619bd5d1e","last_reissued_at":"2026-07-05T10:05:27.766711Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:27.766711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dimitri J. Papageorgiou, Francisco Trespalacios","submitted_at":"2025-01-25T23:05:28Z","abstract_excerpt":"An elementary, but fundamental, operation in disjunctive programming is a basic step, which is the intersection of two disjunctions to form a new disjunction. Basic steps bring a disjunctive set in regular form closer to its disjunctive normal form and, in turn, produce relaxations that are at least as tight. An open question is: What are guaranteed bounds on the improvement from a basic step? In this paper, using properties of a convex disjunctive program's hull reformulation and multipliers from Lagrangian decomposition, we introduce an operation called a pseudo basic step and use it to prov"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.15345","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/2501.15345/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":"2501.15345","created_at":"2026-07-05T10:05:27.766773+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.15345v1","created_at":"2026-07-05T10:05:27.766773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15345","created_at":"2026-07-05T10:05:27.766773+00:00"},{"alias_kind":"pith_short_12","alias_value":"QT4ROUJO5ADD","created_at":"2026-07-05T10:05:27.766773+00:00"},{"alias_kind":"pith_short_16","alias_value":"QT4ROUJO5ADDJH2V","created_at":"2026-07-05T10:05:27.766773+00:00"},{"alias_kind":"pith_short_8","alias_value":"QT4ROUJO","created_at":"2026-07-05T10:05:27.766773+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/QT4ROUJO5ADDJH2VQFW3G3BJGT","json":"https://pith.science/pith/QT4ROUJO5ADDJH2VQFW3G3BJGT.json","graph_json":"https://pith.science/api/pith-number/QT4ROUJO5ADDJH2VQFW3G3BJGT/graph.json","events_json":"https://pith.science/api/pith-number/QT4ROUJO5ADDJH2VQFW3G3BJGT/events.json","paper":"https://pith.science/paper/QT4ROUJO"},"agent_actions":{"view_html":"https://pith.science/pith/QT4ROUJO5ADDJH2VQFW3G3BJGT","download_json":"https://pith.science/pith/QT4ROUJO5ADDJH2VQFW3G3BJGT.json","view_paper":"https://pith.science/paper/QT4ROUJO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.15345&json=true","fetch_graph":"https://pith.science/api/pith-number/QT4ROUJO5ADDJH2VQFW3G3BJGT/graph.json","fetch_events":"https://pith.science/api/pith-number/QT4ROUJO5ADDJH2VQFW3G3BJGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QT4ROUJO5ADDJH2VQFW3G3BJGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QT4ROUJO5ADDJH2VQFW3G3BJGT/action/storage_attestation","attest_author":"https://pith.science/pith/QT4ROUJO5ADDJH2VQFW3G3BJGT/action/author_attestation","sign_citation":"https://pith.science/pith/QT4ROUJO5ADDJH2VQFW3G3BJGT/action/citation_signature","submit_replication":"https://pith.science/pith/QT4ROUJO5ADDJH2VQFW3G3BJGT/action/replication_record"}},"created_at":"2026-07-05T10:05:27.766773+00:00","updated_at":"2026-07-05T10:05:27.766773+00:00"}