{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:IYQBYXI2G5NHUHJISUDEE3FL2M","short_pith_number":"pith:IYQBYXI2","canonical_record":{"source":{"id":"2104.12225","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-04-25T18:21:59Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"0c15ce3491daffbff19d770e901ac7173a613ac14d4a7ccf36fd068bdf022e8c","abstract_canon_sha256":"02c7760975b11fe8b4a2927fda4514b16696c104f9e398a03d082c5392ab7234"},"schema_version":"1.0"},"canonical_sha256":"46201c5d1a375a7a1d289506426cabd333814ba3928c2345cb9902a3e73653a7","source":{"kind":"arxiv","id":"2104.12225","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.12225","created_at":"2026-07-05T02:34:54Z"},{"alias_kind":"arxiv_version","alias_value":"2104.12225v1","created_at":"2026-07-05T02:34:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.12225","created_at":"2026-07-05T02:34:54Z"},{"alias_kind":"pith_short_12","alias_value":"IYQBYXI2G5NH","created_at":"2026-07-05T02:34:54Z"},{"alias_kind":"pith_short_16","alias_value":"IYQBYXI2G5NHUHJI","created_at":"2026-07-05T02:34:54Z"},{"alias_kind":"pith_short_8","alias_value":"IYQBYXI2","created_at":"2026-07-05T02:34:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:IYQBYXI2G5NHUHJISUDEE3FL2M","target":"record","payload":{"canonical_record":{"source":{"id":"2104.12225","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-04-25T18:21:59Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"0c15ce3491daffbff19d770e901ac7173a613ac14d4a7ccf36fd068bdf022e8c","abstract_canon_sha256":"02c7760975b11fe8b4a2927fda4514b16696c104f9e398a03d082c5392ab7234"},"schema_version":"1.0"},"canonical_sha256":"46201c5d1a375a7a1d289506426cabd333814ba3928c2345cb9902a3e73653a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:34:54.619248Z","signature_b64":"SgvLrzuwJx2RLSEl3TQatSfGduO+8labHz3JfboPQUvHbkCBPQcY0UpoVuh34Iv9BV1UsSTA4D5I9TH6tNNKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46201c5d1a375a7a1d289506426cabd333814ba3928c2345cb9902a3e73653a7","last_reissued_at":"2026-07-05T02:34:54.618802Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:34:54.618802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2104.12225","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-07-05T02:34:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WCd5XtiKUUxNX0NxV7c5ctS1noPAQFDCPmC8c9/0JRTjDrnFhE29eyxidYHMXKqBR8uSXHVQkC9wWxBGg57vAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T12:43:47.447356Z"},"content_sha256":"03510c7f0e034ad1ac7bb904c40d46f84dbe4df681d18759e6c6ce2dc95b6537","schema_version":"1.0","event_id":"sha256:03510c7f0e034ad1ac7bb904c40d46f84dbe4df681d18759e6c6ce2dc95b6537"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:IYQBYXI2G5NHUHJISUDEE3FL2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DC3: A learning method for optimization with hard constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"David Rolnick, J. Zico Kolter, Priya L. Donti","submitted_at":"2021-04-25T18:21:59Z","abstract_excerpt":"Large optimization problems with hard constraints arise in many settings, yet classical solvers are often prohibitively slow, motivating the use of deep networks as cheap \"approximate solvers.\" Unfortunately, naive deep learning approaches typically cannot enforce the hard constraints of such problems, leading to infeasible solutions. In this work, we present Deep Constraint Completion and Correction (DC3), an algorithm to address this challenge. Specifically, this method enforces feasibility via a differentiable procedure, which implicitly completes partial solutions to satisfy equality const"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.12225","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/2104.12225/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-05T02:34:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i/gFVoohEweaLEt0EqG//HQVlg7/NammhpFh0bBo7hzMT5MkTtPozqcMdhqGVs7X9EW3VFupd4b506arEK3fCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T12:43:47.447857Z"},"content_sha256":"cbf12c3655a2be209940b405c828fd66fe1ae2c49828d868500a96559e490ac2","schema_version":"1.0","event_id":"sha256:cbf12c3655a2be209940b405c828fd66fe1ae2c49828d868500a96559e490ac2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IYQBYXI2G5NHUHJISUDEE3FL2M/bundle.json","state_url":"https://pith.science/pith/IYQBYXI2G5NHUHJISUDEE3FL2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IYQBYXI2G5NHUHJISUDEE3FL2M/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-09T12:43:47Z","links":{"resolver":"https://pith.science/pith/IYQBYXI2G5NHUHJISUDEE3FL2M","bundle":"https://pith.science/pith/IYQBYXI2G5NHUHJISUDEE3FL2M/bundle.json","state":"https://pith.science/pith/IYQBYXI2G5NHUHJISUDEE3FL2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IYQBYXI2G5NHUHJISUDEE3FL2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:IYQBYXI2G5NHUHJISUDEE3FL2M","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":"02c7760975b11fe8b4a2927fda4514b16696c104f9e398a03d082c5392ab7234","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-04-25T18:21:59Z","title_canon_sha256":"0c15ce3491daffbff19d770e901ac7173a613ac14d4a7ccf36fd068bdf022e8c"},"schema_version":"1.0","source":{"id":"2104.12225","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.12225","created_at":"2026-07-05T02:34:54Z"},{"alias_kind":"arxiv_version","alias_value":"2104.12225v1","created_at":"2026-07-05T02:34:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.12225","created_at":"2026-07-05T02:34:54Z"},{"alias_kind":"pith_short_12","alias_value":"IYQBYXI2G5NH","created_at":"2026-07-05T02:34:54Z"},{"alias_kind":"pith_short_16","alias_value":"IYQBYXI2G5NHUHJI","created_at":"2026-07-05T02:34:54Z"},{"alias_kind":"pith_short_8","alias_value":"IYQBYXI2","created_at":"2026-07-05T02:34:54Z"}],"graph_snapshots":[{"event_id":"sha256:cbf12c3655a2be209940b405c828fd66fe1ae2c49828d868500a96559e490ac2","target":"graph","created_at":"2026-07-05T02:34:54Z","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/2104.12225/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large optimization problems with hard constraints arise in many settings, yet classical solvers are often prohibitively slow, motivating the use of deep networks as cheap \"approximate solvers.\" Unfortunately, naive deep learning approaches typically cannot enforce the hard constraints of such problems, leading to infeasible solutions. In this work, we present Deep Constraint Completion and Correction (DC3), an algorithm to address this challenge. Specifically, this method enforces feasibility via a differentiable procedure, which implicitly completes partial solutions to satisfy equality const","authors_text":"David Rolnick, J. Zico Kolter, Priya L. Donti","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-04-25T18:21:59Z","title":"DC3: A learning method for optimization with hard constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.12225","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:03510c7f0e034ad1ac7bb904c40d46f84dbe4df681d18759e6c6ce2dc95b6537","target":"record","created_at":"2026-07-05T02:34:54Z","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":"02c7760975b11fe8b4a2927fda4514b16696c104f9e398a03d082c5392ab7234","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-04-25T18:21:59Z","title_canon_sha256":"0c15ce3491daffbff19d770e901ac7173a613ac14d4a7ccf36fd068bdf022e8c"},"schema_version":"1.0","source":{"id":"2104.12225","kind":"arxiv","version":1}},"canonical_sha256":"46201c5d1a375a7a1d289506426cabd333814ba3928c2345cb9902a3e73653a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46201c5d1a375a7a1d289506426cabd333814ba3928c2345cb9902a3e73653a7","first_computed_at":"2026-07-05T02:34:54.618802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:34:54.618802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SgvLrzuwJx2RLSEl3TQatSfGduO+8labHz3JfboPQUvHbkCBPQcY0UpoVuh34Iv9BV1UsSTA4D5I9TH6tNNKDg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:34:54.619248Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.12225","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03510c7f0e034ad1ac7bb904c40d46f84dbe4df681d18759e6c6ce2dc95b6537","sha256:cbf12c3655a2be209940b405c828fd66fe1ae2c49828d868500a96559e490ac2"],"state_sha256":"5aeb24eee3998b71f5ceb145bed0206c23970bb49c7318ead58b758e7ff4d0d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rQs3GMaYE15MG2zYEVveeZpy7JM3pd/sow+OPkSSvqBVGckutyCQigWoG8a+1LYz3pzbJjXtoPum+VghzEHLCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T12:43:47.452718Z","bundle_sha256":"889b07380f790c44a621b24900c89a983e66ca5c1aa0d1f91eb3d84c8915fa55"}}