{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PI5YKO4KPNRDLP6VCCEYUKEV2J","short_pith_number":"pith:PI5YKO4K","schema_version":"1.0","canonical_sha256":"7a3b853b8a7b6235bfd510898a2895d24622649dd025431cf3a4079cbfc04a02","source":{"kind":"arxiv","id":"1803.05748","version":1},"attestation_state":"computed","paper":{"title":"Diverse M-Best Solutions by Dynamic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Carsten Haubold, Fred A. Hamprecht, Michael Unser, Virginie Uhlmann","submitted_at":"2018-03-15T13:52:01Z","abstract_excerpt":"Many computer vision pipelines involve dynamic programming primitives such as finding a shortest path or the minimum energy solution in a tree-shaped probabilistic graphical model. In such cases, extracting not merely the best, but the set of M-best solutions is useful to generate a rich collection of candidate proposals that can be used in downstream processing. In this work, we show how M-best solutions of tree-shaped graphical models can be obtained by dynamic programming on a special graph with M layers. The proposed multi-layer concept is optimal for searching M-best solutions, and so fle"},"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":"1803.05748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-03-15T13:52:01Z","cross_cats_sorted":[],"title_canon_sha256":"854e321a959b2d52bcd834ad848faf23a7c930c7da790c77dd207f78bb8c9f2d","abstract_canon_sha256":"138831c2c84a0b2ad4713dd63355468644c1e6172e75fcba9d10852e7f275c22"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:54.756795Z","signature_b64":"f8+Hx1MiVX5VPSiIhlY2Enu+BXl3xbO54/PZ/HD4wLRhj9bazLNOo3eBwCtbso80DdsgsdIB2Zn7lbFPmM56Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a3b853b8a7b6235bfd510898a2895d24622649dd025431cf3a4079cbfc04a02","last_reissued_at":"2026-05-18T00:20:54.754936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:54.754936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diverse M-Best Solutions by Dynamic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Carsten Haubold, Fred A. Hamprecht, Michael Unser, Virginie Uhlmann","submitted_at":"2018-03-15T13:52:01Z","abstract_excerpt":"Many computer vision pipelines involve dynamic programming primitives such as finding a shortest path or the minimum energy solution in a tree-shaped probabilistic graphical model. In such cases, extracting not merely the best, but the set of M-best solutions is useful to generate a rich collection of candidate proposals that can be used in downstream processing. In this work, we show how M-best solutions of tree-shaped graphical models can be obtained by dynamic programming on a special graph with M layers. The proposed multi-layer concept is optimal for searching M-best solutions, and so fle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05748","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":"1803.05748","created_at":"2026-05-18T00:20:54.756386+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.05748v1","created_at":"2026-05-18T00:20:54.756386+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05748","created_at":"2026-05-18T00:20:54.756386+00:00"},{"alias_kind":"pith_short_12","alias_value":"PI5YKO4KPNRD","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"PI5YKO4KPNRDLP6V","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"PI5YKO4K","created_at":"2026-05-18T12:32:43.782077+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/PI5YKO4KPNRDLP6VCCEYUKEV2J","json":"https://pith.science/pith/PI5YKO4KPNRDLP6VCCEYUKEV2J.json","graph_json":"https://pith.science/api/pith-number/PI5YKO4KPNRDLP6VCCEYUKEV2J/graph.json","events_json":"https://pith.science/api/pith-number/PI5YKO4KPNRDLP6VCCEYUKEV2J/events.json","paper":"https://pith.science/paper/PI5YKO4K"},"agent_actions":{"view_html":"https://pith.science/pith/PI5YKO4KPNRDLP6VCCEYUKEV2J","download_json":"https://pith.science/pith/PI5YKO4KPNRDLP6VCCEYUKEV2J.json","view_paper":"https://pith.science/paper/PI5YKO4K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.05748&json=true","fetch_graph":"https://pith.science/api/pith-number/PI5YKO4KPNRDLP6VCCEYUKEV2J/graph.json","fetch_events":"https://pith.science/api/pith-number/PI5YKO4KPNRDLP6VCCEYUKEV2J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PI5YKO4KPNRDLP6VCCEYUKEV2J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PI5YKO4KPNRDLP6VCCEYUKEV2J/action/storage_attestation","attest_author":"https://pith.science/pith/PI5YKO4KPNRDLP6VCCEYUKEV2J/action/author_attestation","sign_citation":"https://pith.science/pith/PI5YKO4KPNRDLP6VCCEYUKEV2J/action/citation_signature","submit_replication":"https://pith.science/pith/PI5YKO4KPNRDLP6VCCEYUKEV2J/action/replication_record"}},"created_at":"2026-05-18T00:20:54.756386+00:00","updated_at":"2026-05-18T00:20:54.756386+00:00"}