{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:CJM7MNBWGT277J3XKD3NXO2D5G","short_pith_number":"pith:CJM7MNBW","canonical_record":{"source":{"id":"2605.20711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-20T05:09:00Z","cross_cats_sorted":[],"title_canon_sha256":"f86089752260697d00fd0cc26429b601ffe5b66a86422bcd7c69e34b027b72e1","abstract_canon_sha256":"8b521606d9e2c1f2745a85e5fd59fbd9d539c2426022c39666908eafbc7ec0c1"},"schema_version":"1.0"},"canonical_sha256":"1259f6343634f5ffa77750f6dbbb43e99c2af7f87f7d7445e4bd9d1d318ad957","source":{"kind":"arxiv","id":"2605.20711","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20711","created_at":"2026-05-21T01:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20711v1","created_at":"2026-05-21T01:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20711","created_at":"2026-05-21T01:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"CJM7MNBWGT27","created_at":"2026-05-21T01:04:50Z"},{"alias_kind":"pith_short_16","alias_value":"CJM7MNBWGT277J3X","created_at":"2026-05-21T01:04:50Z"},{"alias_kind":"pith_short_8","alias_value":"CJM7MNBW","created_at":"2026-05-21T01:04:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:CJM7MNBWGT277J3XKD3NXO2D5G","target":"record","payload":{"canonical_record":{"source":{"id":"2605.20711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-20T05:09:00Z","cross_cats_sorted":[],"title_canon_sha256":"f86089752260697d00fd0cc26429b601ffe5b66a86422bcd7c69e34b027b72e1","abstract_canon_sha256":"8b521606d9e2c1f2745a85e5fd59fbd9d539c2426022c39666908eafbc7ec0c1"},"schema_version":"1.0"},"canonical_sha256":"1259f6343634f5ffa77750f6dbbb43e99c2af7f87f7d7445e4bd9d1d318ad957","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:50.339241Z","signature_b64":"YHSDHGGvmhO3kewlcOEoQt6y+vL+JJB6WpY/9iWQsbGqS+8wHWal8XjVjMeFA3/xM06L3dXTf+XFTX8bldVqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1259f6343634f5ffa77750f6dbbb43e99c2af7f87f7d7445e4bd9d1d318ad957","last_reissued_at":"2026-05-21T01:04:50.338747Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:50.338747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.20711","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-05-21T01:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vTLcZH2SputwfUmEB3zJPCD7+GTtS0fWEj5G674yiTxMFkkwa/cUtyR1YSZwJusMXd32TnStoftPdKwnFluLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T06:01:35.656078Z"},"content_sha256":"4b8ec1b41e0567fb064c42cc54ea9ca8afb26bb55f350cabd6304f8b45aa0eff","schema_version":"1.0","event_id":"sha256:4b8ec1b41e0567fb064c42cc54ea9ca8afb26bb55f350cabd6304f8b45aa0eff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:CJM7MNBWGT277J3XKD3NXO2D5G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Augmented Lagrangian methods for convex optimization with priority constraints via an infeasibility control framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nobuo Yamashita, Shota Yamanaka, Yuya Yamakawa","submitted_at":"2026-05-20T05:09:00Z","abstract_excerpt":"We consider convex optimization problems with prioritized equality constraints, which may be infeasible. In many applications, such as network optimization and image reconstruction, it is often desirable to compute solutions that satisfy higher-priority constraints as much as possible even when no feasible solution exists. To address this issue, we introduce a new solution framework based on the notion of a hierarchically optimal shift, which captures the hierarchy among constraints by sequentially minimizing constraint violations according to their priorities. Based on this concept, we define"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20711","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/2605.20711/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-05-21T01:04:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lr9KesqVJdcJlY+bJXd4VyYAv+9DMyq0J15oOJPZGQKUIw3hYFklCrp7zubAghUc4ixwKafW1dWhkZVJg30DAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T06:01:35.656795Z"},"content_sha256":"9254ee02827ca4b44f4e63cbe5924017ef46b3eaef51280d470a1e1928fa1b58","schema_version":"1.0","event_id":"sha256:9254ee02827ca4b44f4e63cbe5924017ef46b3eaef51280d470a1e1928fa1b58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJM7MNBWGT277J3XKD3NXO2D5G/bundle.json","state_url":"https://pith.science/pith/CJM7MNBWGT277J3XKD3NXO2D5G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJM7MNBWGT277J3XKD3NXO2D5G/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-05-24T06:01:35Z","links":{"resolver":"https://pith.science/pith/CJM7MNBWGT277J3XKD3NXO2D5G","bundle":"https://pith.science/pith/CJM7MNBWGT277J3XKD3NXO2D5G/bundle.json","state":"https://pith.science/pith/CJM7MNBWGT277J3XKD3NXO2D5G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJM7MNBWGT277J3XKD3NXO2D5G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CJM7MNBWGT277J3XKD3NXO2D5G","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":"8b521606d9e2c1f2745a85e5fd59fbd9d539c2426022c39666908eafbc7ec0c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-20T05:09:00Z","title_canon_sha256":"f86089752260697d00fd0cc26429b601ffe5b66a86422bcd7c69e34b027b72e1"},"schema_version":"1.0","source":{"id":"2605.20711","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.20711","created_at":"2026-05-21T01:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"2605.20711v1","created_at":"2026-05-21T01:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20711","created_at":"2026-05-21T01:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"CJM7MNBWGT27","created_at":"2026-05-21T01:04:50Z"},{"alias_kind":"pith_short_16","alias_value":"CJM7MNBWGT277J3X","created_at":"2026-05-21T01:04:50Z"},{"alias_kind":"pith_short_8","alias_value":"CJM7MNBW","created_at":"2026-05-21T01:04:50Z"}],"graph_snapshots":[{"event_id":"sha256:9254ee02827ca4b44f4e63cbe5924017ef46b3eaef51280d470a1e1928fa1b58","target":"graph","created_at":"2026-05-21T01:04:50Z","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/2605.20711/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider convex optimization problems with prioritized equality constraints, which may be infeasible. In many applications, such as network optimization and image reconstruction, it is often desirable to compute solutions that satisfy higher-priority constraints as much as possible even when no feasible solution exists. To address this issue, we introduce a new solution framework based on the notion of a hierarchically optimal shift, which captures the hierarchy among constraints by sequentially minimizing constraint violations according to their priorities. Based on this concept, we define","authors_text":"Nobuo Yamashita, Shota Yamanaka, Yuya Yamakawa","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-20T05:09:00Z","title":"Augmented Lagrangian methods for convex optimization with priority constraints via an infeasibility control framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20711","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:4b8ec1b41e0567fb064c42cc54ea9ca8afb26bb55f350cabd6304f8b45aa0eff","target":"record","created_at":"2026-05-21T01:04:50Z","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":"8b521606d9e2c1f2745a85e5fd59fbd9d539c2426022c39666908eafbc7ec0c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-20T05:09:00Z","title_canon_sha256":"f86089752260697d00fd0cc26429b601ffe5b66a86422bcd7c69e34b027b72e1"},"schema_version":"1.0","source":{"id":"2605.20711","kind":"arxiv","version":1}},"canonical_sha256":"1259f6343634f5ffa77750f6dbbb43e99c2af7f87f7d7445e4bd9d1d318ad957","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1259f6343634f5ffa77750f6dbbb43e99c2af7f87f7d7445e4bd9d1d318ad957","first_computed_at":"2026-05-21T01:04:50.338747Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:04:50.338747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YHSDHGGvmhO3kewlcOEoQt6y+vL+JJB6WpY/9iWQsbGqS+8wHWal8XjVjMeFA3/xM06L3dXTf+XFTX8bldVqCw==","signature_status":"signed_v1","signed_at":"2026-05-21T01:04:50.339241Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.20711","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b8ec1b41e0567fb064c42cc54ea9ca8afb26bb55f350cabd6304f8b45aa0eff","sha256:9254ee02827ca4b44f4e63cbe5924017ef46b3eaef51280d470a1e1928fa1b58"],"state_sha256":"dc028abdea8a84f540f862fe6e8fb4f0e10e7fdef2bb0a66dca2715783d6f4b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JlgQ+ztyuXArrfbBoaS88dvtGbsGNQdgJ1AE43P3LTq4F7dqTLpvU5mNkPDpR8ddIOLkSUqIqUVgOGJvSgL0Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T06:01:35.660310Z","bundle_sha256":"b0f52aedfdaef6ecaa3d3f370acfd117f9d53640e20cf9ddbd2ee656a86f9491"}}