{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ZGTY3PCP6UUQN7X3YEUW357SVY","short_pith_number":"pith:ZGTY3PCP","schema_version":"1.0","canonical_sha256":"c9a78dbc4ff52906fefbc1296df7f2ae3cfb1221986d29385a8a92549a1407e6","source":{"kind":"arxiv","id":"1207.6628","version":1},"attestation_state":"computed","paper":{"title":"Optimality, identifiability, and sensitivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrian S. Lewis, Dmitriy Drusvyatskiy","submitted_at":"2012-07-27T19:57:00Z","abstract_excerpt":"Around a solution of an optimization problem, an \"identifiable\" subset of the feasible region is one containing all nearby solutions after small perturbations to the problem. A quest for only the most essential ingredients of sensitivity analysis leads us to consider identifiable sets that are \"minimal\". This new notion lays a broad and intuitive variational-analytic foundation for optimality conditions, sensitivity, and active set methods."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1207.6628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-27T19:57:00Z","cross_cats_sorted":[],"title_canon_sha256":"0d42eddf555e04f155af860d363ea38429bc309af8f383efa7cdca9de5cec623","abstract_canon_sha256":"7d1e05fa9f718a09bfe9b3b63fe97c4c412699e9e291bd5dddedc632b1a62bb7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:58.944233Z","signature_b64":"LcFEd3KU77bb86bsBgEkktWMW8y17q2mtDZOel4y417cFDwvlp6qj1WxoCBksywEVUMrqsXadBMKXWl0CtSdCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9a78dbc4ff52906fefbc1296df7f2ae3cfb1221986d29385a8a92549a1407e6","last_reissued_at":"2026-05-18T03:49:58.943793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:58.943793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimality, identifiability, and sensitivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Adrian S. Lewis, Dmitriy Drusvyatskiy","submitted_at":"2012-07-27T19:57:00Z","abstract_excerpt":"Around a solution of an optimization problem, an \"identifiable\" subset of the feasible region is one containing all nearby solutions after small perturbations to the problem. A quest for only the most essential ingredients of sensitivity analysis leads us to consider identifiable sets that are \"minimal\". This new notion lays a broad and intuitive variational-analytic foundation for optimality conditions, sensitivity, and active set methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.6628","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.6628","created_at":"2026-05-18T03:49:58.943862+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.6628v1","created_at":"2026-05-18T03:49:58.943862+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.6628","created_at":"2026-05-18T03:49:58.943862+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZGTY3PCP6UUQ","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZGTY3PCP6UUQN7X3","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZGTY3PCP","created_at":"2026-05-18T12:27:30.460161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.09547","citing_title":"Stochastic algorithms with geometric step decay converge linearly on sharp functions","ref_index":17,"is_internal_anchor":true},{"citing_arxiv_id":"2605.02754","citing_title":"Identifiability and Error Bound: Metric and Geometric Perspectives","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZGTY3PCP6UUQN7X3YEUW357SVY","json":"https://pith.science/pith/ZGTY3PCP6UUQN7X3YEUW357SVY.json","graph_json":"https://pith.science/api/pith-number/ZGTY3PCP6UUQN7X3YEUW357SVY/graph.json","events_json":"https://pith.science/api/pith-number/ZGTY3PCP6UUQN7X3YEUW357SVY/events.json","paper":"https://pith.science/paper/ZGTY3PCP"},"agent_actions":{"view_html":"https://pith.science/pith/ZGTY3PCP6UUQN7X3YEUW357SVY","download_json":"https://pith.science/pith/ZGTY3PCP6UUQN7X3YEUW357SVY.json","view_paper":"https://pith.science/paper/ZGTY3PCP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.6628&json=true","fetch_graph":"https://pith.science/api/pith-number/ZGTY3PCP6UUQN7X3YEUW357SVY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZGTY3PCP6UUQN7X3YEUW357SVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZGTY3PCP6UUQN7X3YEUW357SVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZGTY3PCP6UUQN7X3YEUW357SVY/action/storage_attestation","attest_author":"https://pith.science/pith/ZGTY3PCP6UUQN7X3YEUW357SVY/action/author_attestation","sign_citation":"https://pith.science/pith/ZGTY3PCP6UUQN7X3YEUW357SVY/action/citation_signature","submit_replication":"https://pith.science/pith/ZGTY3PCP6UUQN7X3YEUW357SVY/action/replication_record"}},"created_at":"2026-05-18T03:49:58.943862+00:00","updated_at":"2026-05-18T03:49:58.943862+00:00"}