{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:XOTELUIP2R6R7E4JRDZLMDEXHG","short_pith_number":"pith:XOTELUIP","canonical_record":{"source":{"id":"2106.07573","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-06-14T16:25:01Z","cross_cats_sorted":[],"title_canon_sha256":"90ec1048550dbfc25b718179fe12481b5ed584728ec1a668075e39813f248d04","abstract_canon_sha256":"26b173a0aa82843fc02edba6e7b376a2bc2229d086d2678d9a8a2ac6846b62f7"},"schema_version":"1.0"},"canonical_sha256":"bba645d10fd47d1f938988f2b60c97399be640a277b117bbe3e1a10a201181e1","source":{"kind":"arxiv","id":"2106.07573","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.07573","created_at":"2026-07-05T03:08:32Z"},{"alias_kind":"arxiv_version","alias_value":"2106.07573v3","created_at":"2026-07-05T03:08:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.07573","created_at":"2026-07-05T03:08:32Z"},{"alias_kind":"pith_short_12","alias_value":"XOTELUIP2R6R","created_at":"2026-07-05T03:08:32Z"},{"alias_kind":"pith_short_16","alias_value":"XOTELUIP2R6R7E4J","created_at":"2026-07-05T03:08:32Z"},{"alias_kind":"pith_short_8","alias_value":"XOTELUIP","created_at":"2026-07-05T03:08:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:XOTELUIP2R6R7E4JRDZLMDEXHG","target":"record","payload":{"canonical_record":{"source":{"id":"2106.07573","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-06-14T16:25:01Z","cross_cats_sorted":[],"title_canon_sha256":"90ec1048550dbfc25b718179fe12481b5ed584728ec1a668075e39813f248d04","abstract_canon_sha256":"26b173a0aa82843fc02edba6e7b376a2bc2229d086d2678d9a8a2ac6846b62f7"},"schema_version":"1.0"},"canonical_sha256":"bba645d10fd47d1f938988f2b60c97399be640a277b117bbe3e1a10a201181e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:08:32.253190Z","signature_b64":"hgRCTd2bTvhljy5FbFwPY1zWLD4oxDLznYrSoU5MocogfHEIVRVSY++n/vs1pYf5znQ+APufgIBmMki0Jx43AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bba645d10fd47d1f938988f2b60c97399be640a277b117bbe3e1a10a201181e1","last_reissued_at":"2026-07-05T03:08:32.252810Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:08:32.252810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2106.07573","source_version":3,"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-07-05T03:08:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UQfk1TqO7JpZceLXokeLhyokq1ZQ+z/rgMNllABFEu1LK2mDcP0QcmA4HJvIg+k8Yum5ZGzqMV7FVo9FjgLaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:34:15.111841Z"},"content_sha256":"c87914f6a131282629329cc564391992ebb33373459106b1bc32a031a16107d6","schema_version":"1.0","event_id":"sha256:c87914f6a131282629329cc564391992ebb33373459106b1bc32a031a16107d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:XOTELUIP2R6R7E4JRDZLMDEXHG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithm-Independent Measure of Progress for Linear Constraint Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ambros Gleixner, Boro Sofranac, Sebastian Pokutta","submitted_at":"2021-06-14T16:25:01Z","abstract_excerpt":"Propagation of linear constraints has become a crucial sub-routine in modern Mixed-Integer Programming (MIP) solvers. In practice, iterative algorithms with tolerance-based stopping criteria are used to avoid problems with slow or infinite convergence. However, these heuristic stopping criteria can pose difficulties for fairly comparing the efficiency of different implementations of iterative propagation algorithms in a real-world setting. Most significantly, the presence of unbounded variable domains in the problem formulation makes it difficult to quantify the relative size of reductions per"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.07573","kind":"arxiv","version":3},"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/2106.07573/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-07-05T03:08:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pEyf+JXijqkhXmKRZncC9B+2za9O77h6+h0+h44qNzB1TqpmbMsx/hWxNKhYzBkOTDXEcrTdEV//X4SPWOAyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:34:15.112219Z"},"content_sha256":"4e370a0de1565b7037e7cdca64584e6fad9d9f07d4d489e54e3a7036dad0f1f4","schema_version":"1.0","event_id":"sha256:4e370a0de1565b7037e7cdca64584e6fad9d9f07d4d489e54e3a7036dad0f1f4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XOTELUIP2R6R7E4JRDZLMDEXHG/bundle.json","state_url":"https://pith.science/pith/XOTELUIP2R6R7E4JRDZLMDEXHG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XOTELUIP2R6R7E4JRDZLMDEXHG/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-08-03T17:34:15Z","links":{"resolver":"https://pith.science/pith/XOTELUIP2R6R7E4JRDZLMDEXHG","bundle":"https://pith.science/pith/XOTELUIP2R6R7E4JRDZLMDEXHG/bundle.json","state":"https://pith.science/pith/XOTELUIP2R6R7E4JRDZLMDEXHG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XOTELUIP2R6R7E4JRDZLMDEXHG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:XOTELUIP2R6R7E4JRDZLMDEXHG","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":"26b173a0aa82843fc02edba6e7b376a2bc2229d086d2678d9a8a2ac6846b62f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-06-14T16:25:01Z","title_canon_sha256":"90ec1048550dbfc25b718179fe12481b5ed584728ec1a668075e39813f248d04"},"schema_version":"1.0","source":{"id":"2106.07573","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2106.07573","created_at":"2026-07-05T03:08:32Z"},{"alias_kind":"arxiv_version","alias_value":"2106.07573v3","created_at":"2026-07-05T03:08:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.07573","created_at":"2026-07-05T03:08:32Z"},{"alias_kind":"pith_short_12","alias_value":"XOTELUIP2R6R","created_at":"2026-07-05T03:08:32Z"},{"alias_kind":"pith_short_16","alias_value":"XOTELUIP2R6R7E4J","created_at":"2026-07-05T03:08:32Z"},{"alias_kind":"pith_short_8","alias_value":"XOTELUIP","created_at":"2026-07-05T03:08:32Z"}],"graph_snapshots":[{"event_id":"sha256:4e370a0de1565b7037e7cdca64584e6fad9d9f07d4d489e54e3a7036dad0f1f4","target":"graph","created_at":"2026-07-05T03:08:32Z","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/2106.07573/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Propagation of linear constraints has become a crucial sub-routine in modern Mixed-Integer Programming (MIP) solvers. In practice, iterative algorithms with tolerance-based stopping criteria are used to avoid problems with slow or infinite convergence. However, these heuristic stopping criteria can pose difficulties for fairly comparing the efficiency of different implementations of iterative propagation algorithms in a real-world setting. Most significantly, the presence of unbounded variable domains in the problem formulation makes it difficult to quantify the relative size of reductions per","authors_text":"Ambros Gleixner, Boro Sofranac, Sebastian Pokutta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-06-14T16:25:01Z","title":"An Algorithm-Independent Measure of Progress for Linear Constraint Propagation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.07573","kind":"arxiv","version":3},"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:c87914f6a131282629329cc564391992ebb33373459106b1bc32a031a16107d6","target":"record","created_at":"2026-07-05T03:08:32Z","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":"26b173a0aa82843fc02edba6e7b376a2bc2229d086d2678d9a8a2ac6846b62f7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-06-14T16:25:01Z","title_canon_sha256":"90ec1048550dbfc25b718179fe12481b5ed584728ec1a668075e39813f248d04"},"schema_version":"1.0","source":{"id":"2106.07573","kind":"arxiv","version":3}},"canonical_sha256":"bba645d10fd47d1f938988f2b60c97399be640a277b117bbe3e1a10a201181e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bba645d10fd47d1f938988f2b60c97399be640a277b117bbe3e1a10a201181e1","first_computed_at":"2026-07-05T03:08:32.252810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:08:32.252810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hgRCTd2bTvhljy5FbFwPY1zWLD4oxDLznYrSoU5MocogfHEIVRVSY++n/vs1pYf5znQ+APufgIBmMki0Jx43AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:08:32.253190Z","signed_message":"canonical_sha256_bytes"},"source_id":"2106.07573","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c87914f6a131282629329cc564391992ebb33373459106b1bc32a031a16107d6","sha256:4e370a0de1565b7037e7cdca64584e6fad9d9f07d4d489e54e3a7036dad0f1f4"],"state_sha256":"6e38f5dad8afaf23c29d4f8d76d4239ea1be563135568e67f8e81e22b7e2fa6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MsX4KOToFHKSBQCo6TlTFcPNfvF1ljxZfmw/aYYwxIigk+IIXhq5qownrDERgoIC8mRMNk6vgKVjrHl25erSDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:34:15.115384Z","bundle_sha256":"6ebc9cc1229c23ac9667653be75acd293d8f69c1fb9dc1f0a6dddf6d68c3fb68"}}