{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EAXNUOCKJQEQ3PUUIW5UURUBKD","short_pith_number":"pith:EAXNUOCK","schema_version":"1.0","canonical_sha256":"202eda384a4c090dbe9445bb4a468150eff6f624bdb65516e1a0340beeb03c0d","source":{"kind":"arxiv","id":"1412.3369","version":1},"attestation_state":"computed","paper":{"title":"Candidate Constrained CRFs for Loss-Aware Structured Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Daniel Tarlow, Dhruv Batra, Faruk Ahmed","submitted_at":"2014-12-10T16:58:44Z","abstract_excerpt":"When evaluating computer vision systems, we are often concerned with performance on a task-specific evaluation measure such as the Intersection-Over-Union score used in the PASCAL VOC image segmentation challenge. Ideally, our systems would be tuned specifically to these evaluation measures. However, despite much work on loss-aware structured prediction, top performing systems do not use these techniques. In this work, we seek to address this problem, incorporating loss-aware prediction in a manner that is amenable to the approaches taken by top performing systems. Our main idea is to simultan"},"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":"1412.3369","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-12-10T16:58:44Z","cross_cats_sorted":[],"title_canon_sha256":"3d060a036dfadd36651aac56c41f68060b1c82bfa1981d6be0905f4471d85b6c","abstract_canon_sha256":"cdff5540fe67f0e60e79389d8610159883364d6a08670d031e70a729ea6ca250"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:36.833415Z","signature_b64":"g1yET87qbLk7K5fnJLvr1DIwnMQV3O4ztQvgqxjeOgAjyqeB0kqRfXyGGupNEqF5LQ4DTxkA1zxG74hN+nYwCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"202eda384a4c090dbe9445bb4a468150eff6f624bdb65516e1a0340beeb03c0d","last_reissued_at":"2026-05-18T02:31:36.832740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:36.832740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Candidate Constrained CRFs for Loss-Aware Structured Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Daniel Tarlow, Dhruv Batra, Faruk Ahmed","submitted_at":"2014-12-10T16:58:44Z","abstract_excerpt":"When evaluating computer vision systems, we are often concerned with performance on a task-specific evaluation measure such as the Intersection-Over-Union score used in the PASCAL VOC image segmentation challenge. Ideally, our systems would be tuned specifically to these evaluation measures. However, despite much work on loss-aware structured prediction, top performing systems do not use these techniques. In this work, we seek to address this problem, incorporating loss-aware prediction in a manner that is amenable to the approaches taken by top performing systems. Our main idea is to simultan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3369","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":"1412.3369","created_at":"2026-05-18T02:31:36.832854+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.3369v1","created_at":"2026-05-18T02:31:36.832854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3369","created_at":"2026-05-18T02:31:36.832854+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAXNUOCKJQEQ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAXNUOCKJQEQ3PUU","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAXNUOCK","created_at":"2026-05-18T12:28:25.294606+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/EAXNUOCKJQEQ3PUUIW5UURUBKD","json":"https://pith.science/pith/EAXNUOCKJQEQ3PUUIW5UURUBKD.json","graph_json":"https://pith.science/api/pith-number/EAXNUOCKJQEQ3PUUIW5UURUBKD/graph.json","events_json":"https://pith.science/api/pith-number/EAXNUOCKJQEQ3PUUIW5UURUBKD/events.json","paper":"https://pith.science/paper/EAXNUOCK"},"agent_actions":{"view_html":"https://pith.science/pith/EAXNUOCKJQEQ3PUUIW5UURUBKD","download_json":"https://pith.science/pith/EAXNUOCKJQEQ3PUUIW5UURUBKD.json","view_paper":"https://pith.science/paper/EAXNUOCK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.3369&json=true","fetch_graph":"https://pith.science/api/pith-number/EAXNUOCKJQEQ3PUUIW5UURUBKD/graph.json","fetch_events":"https://pith.science/api/pith-number/EAXNUOCKJQEQ3PUUIW5UURUBKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAXNUOCKJQEQ3PUUIW5UURUBKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAXNUOCKJQEQ3PUUIW5UURUBKD/action/storage_attestation","attest_author":"https://pith.science/pith/EAXNUOCKJQEQ3PUUIW5UURUBKD/action/author_attestation","sign_citation":"https://pith.science/pith/EAXNUOCKJQEQ3PUUIW5UURUBKD/action/citation_signature","submit_replication":"https://pith.science/pith/EAXNUOCKJQEQ3PUUIW5UURUBKD/action/replication_record"}},"created_at":"2026-05-18T02:31:36.832854+00:00","updated_at":"2026-05-18T02:31:36.832854+00:00"}