{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EP4FG7MJY5LI4UUKIRCKPXT5PW","short_pith_number":"pith:EP4FG7MJ","schema_version":"1.0","canonical_sha256":"23f8537d89c7568e528a4444a7de7d7da1860e17d71aed7c7299b15b00e5e9bb","source":{"kind":"arxiv","id":"1707.04318","version":1},"attestation_state":"computed","paper":{"title":"Discriminative Optimization: Theory and Applications to Computer Vision Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Fernando De la Torre, Jayakorn Vongkulbhisal, Jo\\~ao P. Costeira","submitted_at":"2017-07-13T20:58:32Z","abstract_excerpt":"Many computer vision problems are formulated as the optimization of a cost function. This approach faces two main challenges: (i) designing a cost function with a local optimum at an acceptable solution, and (ii) developing an efficient numerical method to search for one (or multiple) of these local optima. While designing such functions is feasible in the noiseless case, the stability and location of local optima are mostly unknown under noise, occlusion, or missing data. In practice, this can result in undesirable local optima or not having a local optimum in the expected place. On the other"},"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":"1707.04318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-13T20:58:32Z","cross_cats_sorted":[],"title_canon_sha256":"e4b8ee16d21c938e0f7ed6c300e886d813baaf786d220a27684fd09c82bb790b","abstract_canon_sha256":"43c1838f3adea10597f714a670531798720ea78e9214e24632a378f8527142d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:46.099727Z","signature_b64":"TpstEC1eVbwDxsQq5OR2MeVfoL/4gXpsJd8h+npbSqbCIk3sRTXo6epn5rJ3kWJcZZN3IbXJp/ZX045MfwqZBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23f8537d89c7568e528a4444a7de7d7da1860e17d71aed7c7299b15b00e5e9bb","last_reissued_at":"2026-05-17T23:48:46.099098Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:46.099098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Discriminative Optimization: Theory and Applications to Computer Vision Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Fernando De la Torre, Jayakorn Vongkulbhisal, Jo\\~ao P. Costeira","submitted_at":"2017-07-13T20:58:32Z","abstract_excerpt":"Many computer vision problems are formulated as the optimization of a cost function. This approach faces two main challenges: (i) designing a cost function with a local optimum at an acceptable solution, and (ii) developing an efficient numerical method to search for one (or multiple) of these local optima. While designing such functions is feasible in the noiseless case, the stability and location of local optima are mostly unknown under noise, occlusion, or missing data. In practice, this can result in undesirable local optima or not having a local optimum in the expected place. On the other"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04318","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":"1707.04318","created_at":"2026-05-17T23:48:46.099188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04318v1","created_at":"2026-05-17T23:48:46.099188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04318","created_at":"2026-05-17T23:48:46.099188+00:00"},{"alias_kind":"pith_short_12","alias_value":"EP4FG7MJY5LI","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EP4FG7MJY5LI4UUK","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EP4FG7MJ","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EP4FG7MJY5LI4UUKIRCKPXT5PW","json":"https://pith.science/pith/EP4FG7MJY5LI4UUKIRCKPXT5PW.json","graph_json":"https://pith.science/api/pith-number/EP4FG7MJY5LI4UUKIRCKPXT5PW/graph.json","events_json":"https://pith.science/api/pith-number/EP4FG7MJY5LI4UUKIRCKPXT5PW/events.json","paper":"https://pith.science/paper/EP4FG7MJ"},"agent_actions":{"view_html":"https://pith.science/pith/EP4FG7MJY5LI4UUKIRCKPXT5PW","download_json":"https://pith.science/pith/EP4FG7MJY5LI4UUKIRCKPXT5PW.json","view_paper":"https://pith.science/paper/EP4FG7MJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04318&json=true","fetch_graph":"https://pith.science/api/pith-number/EP4FG7MJY5LI4UUKIRCKPXT5PW/graph.json","fetch_events":"https://pith.science/api/pith-number/EP4FG7MJY5LI4UUKIRCKPXT5PW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EP4FG7MJY5LI4UUKIRCKPXT5PW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EP4FG7MJY5LI4UUKIRCKPXT5PW/action/storage_attestation","attest_author":"https://pith.science/pith/EP4FG7MJY5LI4UUKIRCKPXT5PW/action/author_attestation","sign_citation":"https://pith.science/pith/EP4FG7MJY5LI4UUKIRCKPXT5PW/action/citation_signature","submit_replication":"https://pith.science/pith/EP4FG7MJY5LI4UUKIRCKPXT5PW/action/replication_record"}},"created_at":"2026-05-17T23:48:46.099188+00:00","updated_at":"2026-05-17T23:48:46.099188+00:00"}