{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZVKLY7R7NGD4242MWLGDIO7KV2","short_pith_number":"pith:ZVKLY7R7","schema_version":"1.0","canonical_sha256":"cd54bc7e3f6987cd734cb2cc343beaaeafac17a7b8ed394ab77685253e6490eb","source":{"kind":"arxiv","id":"1403.7057","version":1},"attestation_state":"computed","paper":{"title":"Closed-Form Training of Conditional Random Fields for Large Scale Image Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Alexander Kolesnikov, Christoph H. Lampert, Matthieu Guillaumin, Vittorio Ferrari","submitted_at":"2014-03-27T14:38:23Z","abstract_excerpt":"We present LS-CRF, a new method for very efficient large-scale training of Conditional Random Fields (CRFs). It is inspired by existing closed-form expressions for the maximum likelihood parameters of a generative graphical model with tree topology. LS-CRF training requires only solving a set of independent regression problems, for which closed-form expression as well as efficient iterative solvers are available. This makes it orders of magnitude faster than conventional maximum likelihood learning for CRFs that require repeated runs of probabilistic inference. At the same time, the models lea"},"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":"1403.7057","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-03-27T14:38:23Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"206f41ecfb2a34f874083c949640f09f3fd4d5bf974e482eb04106e470df4b5e","abstract_canon_sha256":"5d753a30f96a13d40711e58bf7b08a0111e32dc83ebea412b7d1dabc20e3414d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:26.611069Z","signature_b64":"udaeJxb3sF1Q5FhOtnDMba0JalFkCNQj61rVD8s1BEkgZvMLpAUb+fDIktTGMYOSDBeIp1e5YVVFlXP3S2URCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd54bc7e3f6987cd734cb2cc343beaaeafac17a7b8ed394ab77685253e6490eb","last_reissued_at":"2026-05-18T02:55:26.610469Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:26.610469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Closed-Form Training of Conditional Random Fields for Large Scale Image Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Alexander Kolesnikov, Christoph H. Lampert, Matthieu Guillaumin, Vittorio Ferrari","submitted_at":"2014-03-27T14:38:23Z","abstract_excerpt":"We present LS-CRF, a new method for very efficient large-scale training of Conditional Random Fields (CRFs). It is inspired by existing closed-form expressions for the maximum likelihood parameters of a generative graphical model with tree topology. LS-CRF training requires only solving a set of independent regression problems, for which closed-form expression as well as efficient iterative solvers are available. This makes it orders of magnitude faster than conventional maximum likelihood learning for CRFs that require repeated runs of probabilistic inference. At the same time, the models lea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.7057","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":"1403.7057","created_at":"2026-05-18T02:55:26.610564+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.7057v1","created_at":"2026-05-18T02:55:26.610564+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.7057","created_at":"2026-05-18T02:55:26.610564+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZVKLY7R7NGD4","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZVKLY7R7NGD4242M","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZVKLY7R7","created_at":"2026-05-18T12:28:59.999130+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/ZVKLY7R7NGD4242MWLGDIO7KV2","json":"https://pith.science/pith/ZVKLY7R7NGD4242MWLGDIO7KV2.json","graph_json":"https://pith.science/api/pith-number/ZVKLY7R7NGD4242MWLGDIO7KV2/graph.json","events_json":"https://pith.science/api/pith-number/ZVKLY7R7NGD4242MWLGDIO7KV2/events.json","paper":"https://pith.science/paper/ZVKLY7R7"},"agent_actions":{"view_html":"https://pith.science/pith/ZVKLY7R7NGD4242MWLGDIO7KV2","download_json":"https://pith.science/pith/ZVKLY7R7NGD4242MWLGDIO7KV2.json","view_paper":"https://pith.science/paper/ZVKLY7R7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.7057&json=true","fetch_graph":"https://pith.science/api/pith-number/ZVKLY7R7NGD4242MWLGDIO7KV2/graph.json","fetch_events":"https://pith.science/api/pith-number/ZVKLY7R7NGD4242MWLGDIO7KV2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZVKLY7R7NGD4242MWLGDIO7KV2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZVKLY7R7NGD4242MWLGDIO7KV2/action/storage_attestation","attest_author":"https://pith.science/pith/ZVKLY7R7NGD4242MWLGDIO7KV2/action/author_attestation","sign_citation":"https://pith.science/pith/ZVKLY7R7NGD4242MWLGDIO7KV2/action/citation_signature","submit_replication":"https://pith.science/pith/ZVKLY7R7NGD4242MWLGDIO7KV2/action/replication_record"}},"created_at":"2026-05-18T02:55:26.610564+00:00","updated_at":"2026-05-18T02:55:26.610564+00:00"}