{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:B54VWAM6Z4CJR3WA442FQ33FLY","short_pith_number":"pith:B54VWAM6","canonical_record":{"source":{"id":"2601.04120","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-01-07T17:30:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cc73f97e4e8d1f7849dcbe431b5fcd2de115f881b7bf075012323a34fb81c20a","abstract_canon_sha256":"1f3330102e25ef17b9e6b6a61e5d390117d8f328dfae3863b0d494a1dd594c9f"},"schema_version":"1.0"},"canonical_sha256":"0f795b019ecf0498eec0e734586f655e0eb7a80932174552d2a6a1d90bb95da0","source":{"kind":"arxiv","id":"2601.04120","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.04120","created_at":"2026-06-03T01:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"2601.04120v2","created_at":"2026-06-03T01:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.04120","created_at":"2026-06-03T01:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"B54VWAM6Z4CJ","created_at":"2026-06-03T01:05:47Z"},{"alias_kind":"pith_short_16","alias_value":"B54VWAM6Z4CJR3WA","created_at":"2026-06-03T01:05:47Z"},{"alias_kind":"pith_short_8","alias_value":"B54VWAM6","created_at":"2026-06-03T01:05:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:B54VWAM6Z4CJR3WA442FQ33FLY","target":"record","payload":{"canonical_record":{"source":{"id":"2601.04120","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-01-07T17:30:42Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cc73f97e4e8d1f7849dcbe431b5fcd2de115f881b7bf075012323a34fb81c20a","abstract_canon_sha256":"1f3330102e25ef17b9e6b6a61e5d390117d8f328dfae3863b0d494a1dd594c9f"},"schema_version":"1.0"},"canonical_sha256":"0f795b019ecf0498eec0e734586f655e0eb7a80932174552d2a6a1d90bb95da0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:47.460002Z","signature_b64":"E7eW3I5HTsRugfjy/uBouzn1VSXdDjK1iWhajRUEA0KkSFcwbaKtyEPQdGVEqCnzsVGs4wGWmzZaK+0+dw5aAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f795b019ecf0498eec0e734586f655e0eb7a80932174552d2a6a1d90bb95da0","last_reissued_at":"2026-06-03T01:05:47.459505Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:47.459505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2601.04120","source_version":2,"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-03T01:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bmyzm3D+AQ1aBoUWd5NAKygxDnRQrAOTcrPq/GvhfiRuyyRZ2ReNhMoAKlKNvI25YEasTeQskn53u2TfbBuFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:57:12.719838Z"},"content_sha256":"956fae5b4c1365957ba1c572c43b22b89578b832960a50442277db326e4cd284","schema_version":"1.0","event_id":"sha256:956fae5b4c1365957ba1c572c43b22b89578b832960a50442277db326e4cd284"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:B54VWAM6Z4CJR3WA442FQ33FLY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Single-Loop Bilevel Deep Learning Method for Optimal Control of Obstacle Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Jin Zhang, Lvgang Zhang, Shangzhi Zeng, Yongcun Song","submitted_at":"2026-01-07T17:30:42Z","abstract_excerpt":"Optimal control of obstacle problems arises in a wide range of applications and is computationally challenging due to its nonsmoothness, nonlinearity, and bilevel structure. Classical numerical approaches rely on mesh-based discretization and typically require solving a sequence of costly subproblems. In this work, we propose a single-loop bilevel deep learning method, which is mesh-free, scalable to high-dimensional and complex domains, and avoids repeated solution of discretized subproblems. The method employs constraint-embedding neural networks to approximate the state and control and pres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.04120","kind":"arxiv","version":2},"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/2601.04120/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-03T01:05:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q/+b9n0Iw//IL1l/l2Onq3LjsTZx8LO4HY9IRUjZmyThMQAoGbmLfeW6DollPFcWR6Gsnk1/D9WRj+ZluoivAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:57:12.720217Z"},"content_sha256":"ebd887992968dfbbab760ce2e3c5ad8354ba35fa83110040ca71ea0a05eb3a59","schema_version":"1.0","event_id":"sha256:ebd887992968dfbbab760ce2e3c5ad8354ba35fa83110040ca71ea0a05eb3a59"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B54VWAM6Z4CJR3WA442FQ33FLY/bundle.json","state_url":"https://pith.science/pith/B54VWAM6Z4CJR3WA442FQ33FLY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B54VWAM6Z4CJR3WA442FQ33FLY/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-04T03:57:12Z","links":{"resolver":"https://pith.science/pith/B54VWAM6Z4CJR3WA442FQ33FLY","bundle":"https://pith.science/pith/B54VWAM6Z4CJR3WA442FQ33FLY/bundle.json","state":"https://pith.science/pith/B54VWAM6Z4CJR3WA442FQ33FLY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B54VWAM6Z4CJR3WA442FQ33FLY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:B54VWAM6Z4CJR3WA442FQ33FLY","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":"1f3330102e25ef17b9e6b6a61e5d390117d8f328dfae3863b0d494a1dd594c9f","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-01-07T17:30:42Z","title_canon_sha256":"cc73f97e4e8d1f7849dcbe431b5fcd2de115f881b7bf075012323a34fb81c20a"},"schema_version":"1.0","source":{"id":"2601.04120","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.04120","created_at":"2026-06-03T01:05:47Z"},{"alias_kind":"arxiv_version","alias_value":"2601.04120v2","created_at":"2026-06-03T01:05:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.04120","created_at":"2026-06-03T01:05:47Z"},{"alias_kind":"pith_short_12","alias_value":"B54VWAM6Z4CJ","created_at":"2026-06-03T01:05:47Z"},{"alias_kind":"pith_short_16","alias_value":"B54VWAM6Z4CJR3WA","created_at":"2026-06-03T01:05:47Z"},{"alias_kind":"pith_short_8","alias_value":"B54VWAM6","created_at":"2026-06-03T01:05:47Z"}],"graph_snapshots":[{"event_id":"sha256:ebd887992968dfbbab760ce2e3c5ad8354ba35fa83110040ca71ea0a05eb3a59","target":"graph","created_at":"2026-06-03T01:05:47Z","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/2601.04120/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimal control of obstacle problems arises in a wide range of applications and is computationally challenging due to its nonsmoothness, nonlinearity, and bilevel structure. Classical numerical approaches rely on mesh-based discretization and typically require solving a sequence of costly subproblems. In this work, we propose a single-loop bilevel deep learning method, which is mesh-free, scalable to high-dimensional and complex domains, and avoids repeated solution of discretized subproblems. The method employs constraint-embedding neural networks to approximate the state and control and pres","authors_text":"Jin Zhang, Lvgang Zhang, Shangzhi Zeng, Yongcun Song","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-01-07T17:30:42Z","title":"A Single-Loop Bilevel Deep Learning Method for Optimal Control of Obstacle Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.04120","kind":"arxiv","version":2},"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:956fae5b4c1365957ba1c572c43b22b89578b832960a50442277db326e4cd284","target":"record","created_at":"2026-06-03T01:05:47Z","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":"1f3330102e25ef17b9e6b6a61e5d390117d8f328dfae3863b0d494a1dd594c9f","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2026-01-07T17:30:42Z","title_canon_sha256":"cc73f97e4e8d1f7849dcbe431b5fcd2de115f881b7bf075012323a34fb81c20a"},"schema_version":"1.0","source":{"id":"2601.04120","kind":"arxiv","version":2}},"canonical_sha256":"0f795b019ecf0498eec0e734586f655e0eb7a80932174552d2a6a1d90bb95da0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f795b019ecf0498eec0e734586f655e0eb7a80932174552d2a6a1d90bb95da0","first_computed_at":"2026-06-03T01:05:47.459505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:47.459505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E7eW3I5HTsRugfjy/uBouzn1VSXdDjK1iWhajRUEA0KkSFcwbaKtyEPQdGVEqCnzsVGs4wGWmzZaK+0+dw5aAQ==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:47.460002Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.04120","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:956fae5b4c1365957ba1c572c43b22b89578b832960a50442277db326e4cd284","sha256:ebd887992968dfbbab760ce2e3c5ad8354ba35fa83110040ca71ea0a05eb3a59"],"state_sha256":"7896e156c567ecb504790ba817478a875c8948eef9e7733efd815590fc4a44bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cz6Db5u2fodDTQrR+xVIfi5ABYcaWzdrByWxomCyoIS4/VkQIK78v5tOoyKgh0xYdwl9HwBYS9EvKnnYcRFkAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:57:12.722206Z","bundle_sha256":"f793990e06ae12629e8cfb330974039f0534228ef29a2d2a439b4be0722cd657"}}