{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QT4ROUJO5ADDJH2VQFW3G3BJGT","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":"f3334d882d3d89a52781329d52132976a02592ab9ae0767589122218d25ea47e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-25T23:05:28Z","title_canon_sha256":"d4929cbed540a9295cc4ebb54c39a6f25a5836e19cb401694227e290418df65b"},"schema_version":"1.0","source":{"id":"2501.15345","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.15345","created_at":"2026-07-05T10:05:27Z"},{"alias_kind":"arxiv_version","alias_value":"2501.15345v1","created_at":"2026-07-05T10:05:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15345","created_at":"2026-07-05T10:05:27Z"},{"alias_kind":"pith_short_12","alias_value":"QT4ROUJO5ADD","created_at":"2026-07-05T10:05:27Z"},{"alias_kind":"pith_short_16","alias_value":"QT4ROUJO5ADDJH2V","created_at":"2026-07-05T10:05:27Z"},{"alias_kind":"pith_short_8","alias_value":"QT4ROUJO","created_at":"2026-07-05T10:05:27Z"}],"graph_snapshots":[{"event_id":"sha256:31cce598cd554c6ac0f1ab54957d3827968c274f2497c9667402bfb5c778583c","target":"graph","created_at":"2026-07-05T10:05:27Z","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/2501.15345/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Dimitri J. Papageorgiou, Francisco Trespalacios","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-25T23:05:28Z","title":"Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.15345","kind":"arxiv","version":1},"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:a01b2e11956f60d52b5540ffa814edbf074be58a2f79fa6b7ec71105d12d5578","target":"record","created_at":"2026-07-05T10:05:27Z","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":"f3334d882d3d89a52781329d52132976a02592ab9ae0767589122218d25ea47e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-25T23:05:28Z","title_canon_sha256":"d4929cbed540a9295cc4ebb54c39a6f25a5836e19cb401694227e290418df65b"},"schema_version":"1.0","source":{"id":"2501.15345","kind":"arxiv","version":1}},"canonical_sha256":"84f917512ee806349f55816db36c2934eca5ef8b0a3a74a63e03644619bd5d1e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84f917512ee806349f55816db36c2934eca5ef8b0a3a74a63e03644619bd5d1e","first_computed_at":"2026-07-05T10:05:27.766711Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:05:27.766711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kv5wFU430Cur0QI96ssDeMUI0ug3Ozjdhpbn1S6xEx883iihzjzumSi7gOQ0DiIW/WrdzMXA5GmS8eLGuNZRAg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:05:27.767197Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.15345","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a01b2e11956f60d52b5540ffa814edbf074be58a2f79fa6b7ec71105d12d5578","sha256:31cce598cd554c6ac0f1ab54957d3827968c274f2497c9667402bfb5c778583c"],"state_sha256":"489b5741ae719e639fb381689b6c4f24b5fc95090afea1a0c0ab7207d2591c83"}