{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CR3XVVP73CE3PIMCNKB5EVHQWX","short_pith_number":"pith:CR3XVVP7","canonical_record":{"source":{"id":"1607.05447","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-19T08:09:30Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"4ecc9cc25850e43a16e6fec35dcc13540a87441714128a53535568c3aab7c024","abstract_canon_sha256":"35ec46c91fae16f3405fc93eda6b68993407a33dc23bf939d29c1576f0057f44"},"schema_version":"1.0"},"canonical_sha256":"14777ad5ffd889b7a1826a83d254f0b5f9a243f7db810bfc3128cc908a8ed483","source":{"kind":"arxiv","id":"1607.05447","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05447","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05447v2","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05447","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"pith_short_12","alias_value":"CR3XVVP73CE3","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CR3XVVP73CE3PIMC","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CR3XVVP7","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CR3XVVP73CE3PIMCNKB5EVHQWX","target":"record","payload":{"canonical_record":{"source":{"id":"1607.05447","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-19T08:09:30Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"4ecc9cc25850e43a16e6fec35dcc13540a87441714128a53535568c3aab7c024","abstract_canon_sha256":"35ec46c91fae16f3405fc93eda6b68993407a33dc23bf939d29c1576f0057f44"},"schema_version":"1.0"},"canonical_sha256":"14777ad5ffd889b7a1826a83d254f0b5f9a243f7db810bfc3128cc908a8ed483","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:42.480860Z","signature_b64":"sPbxzCxXfeOfOhRJyGpPK6aaO6PLe1USagEwH+fTHldZZTvmLzJNLTaHMLlBXJNrnhrOWf0VvjxQ96rWmuUoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14777ad5ffd889b7a1826a83d254f0b5f9a243f7db810bfc3128cc908a8ed483","last_reissued_at":"2026-05-18T01:10:42.480477Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:42.480477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.05447","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-05-18T01:10:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ecmMufviZR/QouHp373jf3pQkfWx+kEUsUwt5Ee5F0Lqb7ikk4gIsvTTmnGHW4KOns00dC0HrtilEDVCAaKwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:10:26.539540Z"},"content_sha256":"098fd847cb33ab768eb4c11c3b9329c963ed1dee34f50ab2ffbae247e67e78e8","schema_version":"1.0","event_id":"sha256:098fd847cb33ab768eb4c11c3b9329c963ed1dee34f50ab2ffbae247e67e78e8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CR3XVVP73CE3PIMCNKB5EVHQWX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Differentiating Parameterized Argmin and Argmax Problems with Application to Bi-level Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.CV","authors_text":"Anoop Cherian, Basura Fernando, Edison Guo, Peter Anderson, Rodrigo Santa Cruz, Stephen Gould","submitted_at":"2016-07-19T08:09:30Z","abstract_excerpt":"Some recent works in machine learning and computer vision involve the solution of a bi-level optimization problem. Here the solution of a parameterized lower-level problem binds variables that appear in the objective of an upper-level problem. The lower-level problem typically appears as an argmin or argmax optimization problem. Many techniques have been proposed to solve bi-level optimization problems, including gradient descent, which is popular with current end-to-end learning approaches. In this technical report we collect some results on differentiating argmin and argmax optimization prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05447","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":""},"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-18T01:10:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PObaR5N4nxA4ZddhiyESHz2AevY9Tvu9C/TTYfW96osN/ElRd/pSXd3pIzxWHQpkR5eMiFPmZohcSHfRZuH6BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:10:26.539898Z"},"content_sha256":"cab31659eaa95984d6bb5071f70552a11449100d1bab8c3c52c7db25374ef9b3","schema_version":"1.0","event_id":"sha256:cab31659eaa95984d6bb5071f70552a11449100d1bab8c3c52c7db25374ef9b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CR3XVVP73CE3PIMCNKB5EVHQWX/bundle.json","state_url":"https://pith.science/pith/CR3XVVP73CE3PIMCNKB5EVHQWX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CR3XVVP73CE3PIMCNKB5EVHQWX/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-01T03:10:26Z","links":{"resolver":"https://pith.science/pith/CR3XVVP73CE3PIMCNKB5EVHQWX","bundle":"https://pith.science/pith/CR3XVVP73CE3PIMCNKB5EVHQWX/bundle.json","state":"https://pith.science/pith/CR3XVVP73CE3PIMCNKB5EVHQWX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CR3XVVP73CE3PIMCNKB5EVHQWX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CR3XVVP73CE3PIMCNKB5EVHQWX","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":"35ec46c91fae16f3405fc93eda6b68993407a33dc23bf939d29c1576f0057f44","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-19T08:09:30Z","title_canon_sha256":"4ecc9cc25850e43a16e6fec35dcc13540a87441714128a53535568c3aab7c024"},"schema_version":"1.0","source":{"id":"1607.05447","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.05447","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"arxiv_version","alias_value":"1607.05447v2","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.05447","created_at":"2026-05-18T01:10:42Z"},{"alias_kind":"pith_short_12","alias_value":"CR3XVVP73CE3","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CR3XVVP73CE3PIMC","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CR3XVVP7","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:cab31659eaa95984d6bb5071f70552a11449100d1bab8c3c52c7db25374ef9b3","target":"graph","created_at":"2026-05-18T01:10: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"},"paper":{"abstract_excerpt":"Some recent works in machine learning and computer vision involve the solution of a bi-level optimization problem. Here the solution of a parameterized lower-level problem binds variables that appear in the objective of an upper-level problem. The lower-level problem typically appears as an argmin or argmax optimization problem. Many techniques have been proposed to solve bi-level optimization problems, including gradient descent, which is popular with current end-to-end learning approaches. In this technical report we collect some results on differentiating argmin and argmax optimization prob","authors_text":"Anoop Cherian, Basura Fernando, Edison Guo, Peter Anderson, Rodrigo Santa Cruz, Stephen Gould","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-19T08:09:30Z","title":"On Differentiating Parameterized Argmin and Argmax Problems with Application to Bi-level Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.05447","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:098fd847cb33ab768eb4c11c3b9329c963ed1dee34f50ab2ffbae247e67e78e8","target":"record","created_at":"2026-05-18T01:10: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":"35ec46c91fae16f3405fc93eda6b68993407a33dc23bf939d29c1576f0057f44","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-07-19T08:09:30Z","title_canon_sha256":"4ecc9cc25850e43a16e6fec35dcc13540a87441714128a53535568c3aab7c024"},"schema_version":"1.0","source":{"id":"1607.05447","kind":"arxiv","version":2}},"canonical_sha256":"14777ad5ffd889b7a1826a83d254f0b5f9a243f7db810bfc3128cc908a8ed483","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14777ad5ffd889b7a1826a83d254f0b5f9a243f7db810bfc3128cc908a8ed483","first_computed_at":"2026-05-18T01:10:42.480477Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:42.480477Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sPbxzCxXfeOfOhRJyGpPK6aaO6PLe1USagEwH+fTHldZZTvmLzJNLTaHMLlBXJNrnhrOWf0VvjxQ96rWmuUoCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:42.480860Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.05447","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:098fd847cb33ab768eb4c11c3b9329c963ed1dee34f50ab2ffbae247e67e78e8","sha256:cab31659eaa95984d6bb5071f70552a11449100d1bab8c3c52c7db25374ef9b3"],"state_sha256":"4d4671e5ecfa005e0988fb7df8b78fe3776d0ff1413374d3e61af9e8460c6ca9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"edsPLPdU4RDMlmcKFK5hL7ddHFN9rHX/ZzWS30NVvkDikjt1wgjeZ6vsd139Wv6Wcsh5LBvW3LbWhP0yDU8nAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:10:26.542303Z","bundle_sha256":"f8c7f155ee016dd6bfbcd89c61b94bd073258b670db429203fb5618b287a553d"}}