{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:46SP755RTZ6TFHWZ7BRYRLNPY5","short_pith_number":"pith:46SP755R","canonical_record":{"source":{"id":"2606.26897","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-25T11:29:16Z","cross_cats_sorted":[],"title_canon_sha256":"32f1d1b1f4831f7fbb5b45749baafb77582be81d0015361a16ed8c0e264ae06c","abstract_canon_sha256":"9fd8fcc1a593b3e9c4475639e9427c62ed5f0dfb5ef664e51e80175d1f06741f"},"schema_version":"1.0"},"canonical_sha256":"e7a4fff7b19e7d329ed9f86388adafc75fa3f85838bd85371dcb833255c31aa3","source":{"kind":"arxiv","id":"2606.26897","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.26897","created_at":"2026-06-26T01:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"2606.26897v1","created_at":"2026-06-26T01:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26897","created_at":"2026-06-26T01:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"46SP755RTZ6T","created_at":"2026-06-26T01:16:03Z"},{"alias_kind":"pith_short_16","alias_value":"46SP755RTZ6TFHWZ","created_at":"2026-06-26T01:16:03Z"},{"alias_kind":"pith_short_8","alias_value":"46SP755R","created_at":"2026-06-26T01:16:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:46SP755RTZ6TFHWZ7BRYRLNPY5","target":"record","payload":{"canonical_record":{"source":{"id":"2606.26897","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-25T11:29:16Z","cross_cats_sorted":[],"title_canon_sha256":"32f1d1b1f4831f7fbb5b45749baafb77582be81d0015361a16ed8c0e264ae06c","abstract_canon_sha256":"9fd8fcc1a593b3e9c4475639e9427c62ed5f0dfb5ef664e51e80175d1f06741f"},"schema_version":"1.0"},"canonical_sha256":"e7a4fff7b19e7d329ed9f86388adafc75fa3f85838bd85371dcb833255c31aa3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:16:03.401158Z","signature_b64":"is01zH2QvjQ8IfZtibhAf9r08bZwLelaB3BCvWMpur2jI0BlzqPZ8edaAdtYSE1yCODf5YjzgizfHFv5KqjvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7a4fff7b19e7d329ed9f86388adafc75fa3f85838bd85371dcb833255c31aa3","last_reissued_at":"2026-06-26T01:16:03.400744Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:16:03.400744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.26897","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-26T01:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rOxxRA7HqegQJKw+jn0L/7b5nHuwaxPijuVZLMZWHagMw50ff4p07VSC32pkgt3U8SYMLBGMlnO7/7rWOCG2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:01:23.869506Z"},"content_sha256":"2dfff773451e1525a7a293161ad6880811fc003405ad6fc0e3ccf8658b592c5b","schema_version":"1.0","event_id":"sha256:2dfff773451e1525a7a293161ad6880811fc003405ad6fc0e3ccf8658b592c5b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:46SP755RTZ6TFHWZ7BRYRLNPY5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Separation, Constraint Qualifications, and Cycling in Outer Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Erik Tamm, Jan Kronqvist","submitted_at":"2026-06-25T11:29:16Z","abstract_excerpt":"The outer approximation algorithm is a widely used method for solving convex mixed-integer nonlinear programs. While the algorithm is well established in theory and practice, certain assumptions underlying its convergence are rarely discussed in the literature. In this paper, we examine two such assumptions: that a constraint qualification holds at the optimal solution of each nonlinear programming subproblem, and that these subproblems can be solved exactly. We argue that both assumptions are connected to the issue of cycling, by which we mean that the same integer assignment reappears in suc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26897","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/2606.26897/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-26T01:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sybLqzyoyr/rSrLvCID2//fwLzKWhf5/0AVHwJkJpZi6sY3c1bC4ejsii3N+o7mO9iCvxhF7XwJJ20iXru1aDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:01:23.869878Z"},"content_sha256":"c4d0c2734db2f2a5b714635709c28d25e6df82cacaa075748ab3eb4d1a681934","schema_version":"1.0","event_id":"sha256:c4d0c2734db2f2a5b714635709c28d25e6df82cacaa075748ab3eb4d1a681934"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/46SP755RTZ6TFHWZ7BRYRLNPY5/bundle.json","state_url":"https://pith.science/pith/46SP755RTZ6TFHWZ7BRYRLNPY5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/46SP755RTZ6TFHWZ7BRYRLNPY5/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T12:01:23Z","links":{"resolver":"https://pith.science/pith/46SP755RTZ6TFHWZ7BRYRLNPY5","bundle":"https://pith.science/pith/46SP755RTZ6TFHWZ7BRYRLNPY5/bundle.json","state":"https://pith.science/pith/46SP755RTZ6TFHWZ7BRYRLNPY5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/46SP755RTZ6TFHWZ7BRYRLNPY5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:46SP755RTZ6TFHWZ7BRYRLNPY5","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":"9fd8fcc1a593b3e9c4475639e9427c62ed5f0dfb5ef664e51e80175d1f06741f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-25T11:29:16Z","title_canon_sha256":"32f1d1b1f4831f7fbb5b45749baafb77582be81d0015361a16ed8c0e264ae06c"},"schema_version":"1.0","source":{"id":"2606.26897","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.26897","created_at":"2026-06-26T01:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"2606.26897v1","created_at":"2026-06-26T01:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26897","created_at":"2026-06-26T01:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"46SP755RTZ6T","created_at":"2026-06-26T01:16:03Z"},{"alias_kind":"pith_short_16","alias_value":"46SP755RTZ6TFHWZ","created_at":"2026-06-26T01:16:03Z"},{"alias_kind":"pith_short_8","alias_value":"46SP755R","created_at":"2026-06-26T01:16:03Z"}],"graph_snapshots":[{"event_id":"sha256:c4d0c2734db2f2a5b714635709c28d25e6df82cacaa075748ab3eb4d1a681934","target":"graph","created_at":"2026-06-26T01:16:03Z","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/2606.26897/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The outer approximation algorithm is a widely used method for solving convex mixed-integer nonlinear programs. While the algorithm is well established in theory and practice, certain assumptions underlying its convergence are rarely discussed in the literature. In this paper, we examine two such assumptions: that a constraint qualification holds at the optimal solution of each nonlinear programming subproblem, and that these subproblems can be solved exactly. We argue that both assumptions are connected to the issue of cycling, by which we mean that the same integer assignment reappears in suc","authors_text":"Erik Tamm, Jan Kronqvist","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-25T11:29:16Z","title":"Separation, Constraint Qualifications, and Cycling in Outer Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26897","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:2dfff773451e1525a7a293161ad6880811fc003405ad6fc0e3ccf8658b592c5b","target":"record","created_at":"2026-06-26T01:16:03Z","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":"9fd8fcc1a593b3e9c4475639e9427c62ed5f0dfb5ef664e51e80175d1f06741f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-06-25T11:29:16Z","title_canon_sha256":"32f1d1b1f4831f7fbb5b45749baafb77582be81d0015361a16ed8c0e264ae06c"},"schema_version":"1.0","source":{"id":"2606.26897","kind":"arxiv","version":1}},"canonical_sha256":"e7a4fff7b19e7d329ed9f86388adafc75fa3f85838bd85371dcb833255c31aa3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7a4fff7b19e7d329ed9f86388adafc75fa3f85838bd85371dcb833255c31aa3","first_computed_at":"2026-06-26T01:16:03.400744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-26T01:16:03.400744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"is01zH2QvjQ8IfZtibhAf9r08bZwLelaB3BCvWMpur2jI0BlzqPZ8edaAdtYSE1yCODf5YjzgizfHFv5KqjvAg==","signature_status":"signed_v1","signed_at":"2026-06-26T01:16:03.401158Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.26897","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2dfff773451e1525a7a293161ad6880811fc003405ad6fc0e3ccf8658b592c5b","sha256:c4d0c2734db2f2a5b714635709c28d25e6df82cacaa075748ab3eb4d1a681934"],"state_sha256":"4deadc4560b81f46d071938fadedf8c9d1e3d0aad7ac48bbd7ba095e5ff34f6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aXUX5WpUx7/TQWpwEsgbUiiwY11/vfrbs23vV5T87xW9SIqoNPuWI/v5KCP5jtJciZvf+2byfv3Qrnlkn++MBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T12:01:23.872047Z","bundle_sha256":"8fc3a6705cb406fbac2eb20cda6daf1bdbac872de07ef43d5d4371becf3464ac"}}