{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:66CGQHR2HD3ZDKNC3TZY5MQLYS","short_pith_number":"pith:66CGQHR2","schema_version":"1.0","canonical_sha256":"f784681e3a38f791a9a2dcf38eb20bc4875f0af49ebe601067a77692cd7b13c6","source":{"kind":"arxiv","id":"1309.6813","version":1},"attestation_state":"computed","paper":{"title":"Hinge-loss Markov Random Fields: Convex Inference for Structured Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ben London, Bert Huang, Lise Getoor, Stephen Bach","submitted_at":"2013-09-26T12:28:52Z","abstract_excerpt":"Graphical models for structured domains are powerful tools, but the computational complexities of combinatorial prediction spaces can force restrictions on models, or require approximate inference in order to be tractable. Instead of working in a combinatorial space, we use hinge-loss Markov random fields (HL-MRFs), an expressive class of graphical models with log-concave density functions over continuous variables, which can represent confidences in discrete predictions. This paper demonstrates that HL-MRFs are general tools for fast and accurate structured prediction. We introduce the first "},"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":"1309.6813","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-09-26T12:28:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"c52cbd9802491b5e2e6588ccd0322f6ddce0f08f8279fb9aed0964d12a50b02a","abstract_canon_sha256":"42eb3133ba7d2c990b029af4112ef3d236cab4721140398c72711af3b5dd0879"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:10.424759Z","signature_b64":"u2Eg504Pp3xn9bFffZR4A/TrA+beUfqNILU/jHYowa8JwrASfHLRbi4/ODqAECg3Yp+78PrWSTEiym/6nR8VCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f784681e3a38f791a9a2dcf38eb20bc4875f0af49ebe601067a77692cd7b13c6","last_reissued_at":"2026-05-18T03:12:10.423979Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:10.423979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hinge-loss Markov Random Fields: Convex Inference for Structured Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ben London, Bert Huang, Lise Getoor, Stephen Bach","submitted_at":"2013-09-26T12:28:52Z","abstract_excerpt":"Graphical models for structured domains are powerful tools, but the computational complexities of combinatorial prediction spaces can force restrictions on models, or require approximate inference in order to be tractable. Instead of working in a combinatorial space, we use hinge-loss Markov random fields (HL-MRFs), an expressive class of graphical models with log-concave density functions over continuous variables, which can represent confidences in discrete predictions. This paper demonstrates that HL-MRFs are general tools for fast and accurate structured prediction. We introduce the first "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.6813","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":"1309.6813","created_at":"2026-05-18T03:12:10.424110+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.6813v1","created_at":"2026-05-18T03:12:10.424110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.6813","created_at":"2026-05-18T03:12:10.424110+00:00"},{"alias_kind":"pith_short_12","alias_value":"66CGQHR2HD3Z","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"66CGQHR2HD3ZDKNC","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"66CGQHR2","created_at":"2026-05-18T12:27:36.564083+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/66CGQHR2HD3ZDKNC3TZY5MQLYS","json":"https://pith.science/pith/66CGQHR2HD3ZDKNC3TZY5MQLYS.json","graph_json":"https://pith.science/api/pith-number/66CGQHR2HD3ZDKNC3TZY5MQLYS/graph.json","events_json":"https://pith.science/api/pith-number/66CGQHR2HD3ZDKNC3TZY5MQLYS/events.json","paper":"https://pith.science/paper/66CGQHR2"},"agent_actions":{"view_html":"https://pith.science/pith/66CGQHR2HD3ZDKNC3TZY5MQLYS","download_json":"https://pith.science/pith/66CGQHR2HD3ZDKNC3TZY5MQLYS.json","view_paper":"https://pith.science/paper/66CGQHR2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.6813&json=true","fetch_graph":"https://pith.science/api/pith-number/66CGQHR2HD3ZDKNC3TZY5MQLYS/graph.json","fetch_events":"https://pith.science/api/pith-number/66CGQHR2HD3ZDKNC3TZY5MQLYS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66CGQHR2HD3ZDKNC3TZY5MQLYS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66CGQHR2HD3ZDKNC3TZY5MQLYS/action/storage_attestation","attest_author":"https://pith.science/pith/66CGQHR2HD3ZDKNC3TZY5MQLYS/action/author_attestation","sign_citation":"https://pith.science/pith/66CGQHR2HD3ZDKNC3TZY5MQLYS/action/citation_signature","submit_replication":"https://pith.science/pith/66CGQHR2HD3ZDKNC3TZY5MQLYS/action/replication_record"}},"created_at":"2026-05-18T03:12:10.424110+00:00","updated_at":"2026-05-18T03:12:10.424110+00:00"}