{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2DZLFLN4TEG4FG25ERPGHUXVWN","short_pith_number":"pith:2DZLFLN4","schema_version":"1.0","canonical_sha256":"d0f2b2adbc990dc29b5d245e63d2f5b36d49e6eb22b8b27b41cd02fba741c95e","source":{"kind":"arxiv","id":"1701.03151","version":1},"attestation_state":"computed","paper":{"title":"Guaranteed Parameter Estimation for Discrete Energy Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Daniel Huber, Mengtian Li","submitted_at":"2017-01-11T20:41:14Z","abstract_excerpt":"Structural learning, a method to estimate the parameters for discrete energy minimization, has been proven to be effective in solving computer vision problems, especially in 3D scene parsing. As the complexity of the models increases, structural learning algorithms turn to approximate inference to retain tractability. Unfortunately, such methods often fail because the approximation can be arbitrarily poor. In this work, we propose a method to overcome this limitation through exploiting the properties of the joint problem of training time inference and learning. With the help of the learning fr"},"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":"1701.03151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-01-11T20:41:14Z","cross_cats_sorted":[],"title_canon_sha256":"adfc873e7df67027322703d8391df94655338bd75841a80ac373997dceccb2e3","abstract_canon_sha256":"f3ea652c3a748a7d265d1bcd7525faa8ad8d4f2608bee26c151e6d2bb50c83cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:59.192055Z","signature_b64":"rbywi3Aqc8OOZUIYxiG2JwiomClLhrea6kN5NH+a5rUuncHctISEXm/n3qFwKWvToZ2uPS77kLyF6ZZUZPN0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0f2b2adbc990dc29b5d245e63d2f5b36d49e6eb22b8b27b41cd02fba741c95e","last_reissued_at":"2026-05-18T00:52:59.191648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:59.191648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guaranteed Parameter Estimation for Discrete Energy Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Daniel Huber, Mengtian Li","submitted_at":"2017-01-11T20:41:14Z","abstract_excerpt":"Structural learning, a method to estimate the parameters for discrete energy minimization, has been proven to be effective in solving computer vision problems, especially in 3D scene parsing. As the complexity of the models increases, structural learning algorithms turn to approximate inference to retain tractability. Unfortunately, such methods often fail because the approximation can be arbitrarily poor. In this work, we propose a method to overcome this limitation through exploiting the properties of the joint problem of training time inference and learning. With the help of the learning fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03151","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":"1701.03151","created_at":"2026-05-18T00:52:59.191717+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.03151v1","created_at":"2026-05-18T00:52:59.191717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03151","created_at":"2026-05-18T00:52:59.191717+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DZLFLN4TEG4","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DZLFLN4TEG4FG25","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DZLFLN4","created_at":"2026-05-18T12:30:55.937587+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/2DZLFLN4TEG4FG25ERPGHUXVWN","json":"https://pith.science/pith/2DZLFLN4TEG4FG25ERPGHUXVWN.json","graph_json":"https://pith.science/api/pith-number/2DZLFLN4TEG4FG25ERPGHUXVWN/graph.json","events_json":"https://pith.science/api/pith-number/2DZLFLN4TEG4FG25ERPGHUXVWN/events.json","paper":"https://pith.science/paper/2DZLFLN4"},"agent_actions":{"view_html":"https://pith.science/pith/2DZLFLN4TEG4FG25ERPGHUXVWN","download_json":"https://pith.science/pith/2DZLFLN4TEG4FG25ERPGHUXVWN.json","view_paper":"https://pith.science/paper/2DZLFLN4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.03151&json=true","fetch_graph":"https://pith.science/api/pith-number/2DZLFLN4TEG4FG25ERPGHUXVWN/graph.json","fetch_events":"https://pith.science/api/pith-number/2DZLFLN4TEG4FG25ERPGHUXVWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DZLFLN4TEG4FG25ERPGHUXVWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DZLFLN4TEG4FG25ERPGHUXVWN/action/storage_attestation","attest_author":"https://pith.science/pith/2DZLFLN4TEG4FG25ERPGHUXVWN/action/author_attestation","sign_citation":"https://pith.science/pith/2DZLFLN4TEG4FG25ERPGHUXVWN/action/citation_signature","submit_replication":"https://pith.science/pith/2DZLFLN4TEG4FG25ERPGHUXVWN/action/replication_record"}},"created_at":"2026-05-18T00:52:59.191717+00:00","updated_at":"2026-05-18T00:52:59.191717+00:00"}