{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:BTHYBAPCU2W5YWGPOKNJICFAQJ","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":"8802210f13e4a478450eaa074fbfc6b1e9cc402d56a8a7b71bc53070c2ce932b","cross_cats_sorted":["cs.DM","cs.DS","cs.MS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-16T16:25:29Z","title_canon_sha256":"2100d4ba8e31aa9c0b05c5cf7b9dbc1b910433de52d7bc9b78876a3bbc048452"},"schema_version":"1.0","source":{"id":"2009.07785","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.07785","created_at":"2026-07-05T03:08:42Z"},{"alias_kind":"arxiv_version","alias_value":"2009.07785v5","created_at":"2026-07-05T03:08:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.07785","created_at":"2026-07-05T03:08:42Z"},{"alias_kind":"pith_short_12","alias_value":"BTHYBAPCU2W5","created_at":"2026-07-05T03:08:42Z"},{"alias_kind":"pith_short_16","alias_value":"BTHYBAPCU2W5YWGP","created_at":"2026-07-05T03:08:42Z"},{"alias_kind":"pith_short_8","alias_value":"BTHYBAPC","created_at":"2026-07-05T03:08:42Z"}],"graph_snapshots":[{"event_id":"sha256:9cf9f4948306673ee239f448e3517b51f88b462a2c599c1619c3e6d3a235e616","target":"graph","created_at":"2026-07-05T03:08:42Z","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/2009.07785/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Fast domain propagation of linear constraints has become a crucial component of today's best algorithms and solvers for mixed integer programming and pseudo-boolean optimization to achieve peak solving performance. Irregularities in the form of dynamic algorithmic behaviour, dependency structures, and sparsity patterns in the input data make efficient implementations of domain propagation on GPUs and, more generally, on parallel architectures challenging. This is one of the main reasons why domain propagation in state-of-the-art solvers is single thread only. In this paper, we present a new al","authors_text":"Ambros Gleixner, Boro Sofranac, Sebastian Pokutta","cross_cats":["cs.DM","cs.DS","cs.MS","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-16T16:25:29Z","title":"Accelerating Domain Propagation: an Efficient GPU-Parallel Algorithm over Sparse Matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.07785","kind":"arxiv","version":5},"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:1e7b66b29856fc56006aaa343b198f3b33d01306a902de8029a597ec8c12fbd5","target":"record","created_at":"2026-07-05T03:08:42Z","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":"8802210f13e4a478450eaa074fbfc6b1e9cc402d56a8a7b71bc53070c2ce932b","cross_cats_sorted":["cs.DM","cs.DS","cs.MS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-16T16:25:29Z","title_canon_sha256":"2100d4ba8e31aa9c0b05c5cf7b9dbc1b910433de52d7bc9b78876a3bbc048452"},"schema_version":"1.0","source":{"id":"2009.07785","kind":"arxiv","version":5}},"canonical_sha256":"0ccf8081e2a6addc58cf729a9408a08272f683d99c1e1358cc1abc508e54ca39","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0ccf8081e2a6addc58cf729a9408a08272f683d99c1e1358cc1abc508e54ca39","first_computed_at":"2026-07-05T03:08:42.884548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:08:42.884548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"35TRVhomnAls8yJA4WLK+kXpevOHrSE323KOoVnkxfAKN6JE/iS5vD4TibdFjKLc23cCOMx5ktXiOZtxFnY/Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:08:42.884897Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.07785","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e7b66b29856fc56006aaa343b198f3b33d01306a902de8029a597ec8c12fbd5","sha256:9cf9f4948306673ee239f448e3517b51f88b462a2c599c1619c3e6d3a235e616"],"state_sha256":"228c831ffa154db4776462d396a72bf6992b21c0d54d344f6c827104a656ebac"}