{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HOGDNQZSN2JB4QSCM7K2KU2WBG","short_pith_number":"pith:HOGDNQZS","schema_version":"1.0","canonical_sha256":"3b8c36c3326e921e424267d5a5535609b2239c2e2b256c8a6a7bc0ccc6bdc045","source":{"kind":"arxiv","id":"1904.08080","version":2},"attestation_state":"computed","paper":{"title":"Bottleneck potentials in Markov Random Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ahmed Abbas, Paul Swoboda (Max Planck Institute for Informatics, Saarbr\\\"ucken)","submitted_at":"2019-04-17T04:43:38Z","abstract_excerpt":"We consider general discrete Markov Random Fields(MRFs) with additional bottleneck potentials which penalize the maximum (instead of the sum) over local potential value taken by the MRF-assignment. Bottleneck potentials or analogous constructions have been considered in (i) combinatorial optimization (e.g. bottleneck shortest path problem, the minimum bottleneck spanning tree problem, bottleneck function minimization in greedoids), (ii) inverse problems with $L_{\\infty}$-norm regularization, and (iii) valued constraint satisfaction on the $(\\min,\\max)$-pre-semirings. Bottleneck potentials for "},"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":"1904.08080","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-17T04:43:38Z","cross_cats_sorted":[],"title_canon_sha256":"0704606841bb635aac885ec7074df877d815780520a77642c621d3ce43a40b9f","abstract_canon_sha256":"7d9f67735a34f88d88f7c707b583f773050bdb4354b324c566b39638c5b61466"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:57:50.062781Z","signature_b64":"MAiz+wL2tsQw7IhCMamM2+uQTcSF5gVdyPYlZ1jhMIxOaKq0hbTqWn+2ppFqp6y3T10aRLKx4ZCvq7vtqANMDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b8c36c3326e921e424267d5a5535609b2239c2e2b256c8a6a7bc0ccc6bdc045","last_reissued_at":"2026-07-04T23:57:50.062388Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:57:50.062388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bottleneck potentials in Markov Random Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ahmed Abbas, Paul Swoboda (Max Planck Institute for Informatics, Saarbr\\\"ucken)","submitted_at":"2019-04-17T04:43:38Z","abstract_excerpt":"We consider general discrete Markov Random Fields(MRFs) with additional bottleneck potentials which penalize the maximum (instead of the sum) over local potential value taken by the MRF-assignment. Bottleneck potentials or analogous constructions have been considered in (i) combinatorial optimization (e.g. bottleneck shortest path problem, the minimum bottleneck spanning tree problem, bottleneck function minimization in greedoids), (ii) inverse problems with $L_{\\infty}$-norm regularization, and (iii) valued constraint satisfaction on the $(\\min,\\max)$-pre-semirings. Bottleneck potentials for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.08080","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1904.08080/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1904.08080","created_at":"2026-07-04T23:57:50.062444+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.08080v2","created_at":"2026-07-04T23:57:50.062444+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.08080","created_at":"2026-07-04T23:57:50.062444+00:00"},{"alias_kind":"pith_short_12","alias_value":"HOGDNQZSN2JB","created_at":"2026-07-04T23:57:50.062444+00:00"},{"alias_kind":"pith_short_16","alias_value":"HOGDNQZSN2JB4QSC","created_at":"2026-07-04T23:57:50.062444+00:00"},{"alias_kind":"pith_short_8","alias_value":"HOGDNQZS","created_at":"2026-07-04T23:57:50.062444+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/HOGDNQZSN2JB4QSCM7K2KU2WBG","json":"https://pith.science/pith/HOGDNQZSN2JB4QSCM7K2KU2WBG.json","graph_json":"https://pith.science/api/pith-number/HOGDNQZSN2JB4QSCM7K2KU2WBG/graph.json","events_json":"https://pith.science/api/pith-number/HOGDNQZSN2JB4QSCM7K2KU2WBG/events.json","paper":"https://pith.science/paper/HOGDNQZS"},"agent_actions":{"view_html":"https://pith.science/pith/HOGDNQZSN2JB4QSCM7K2KU2WBG","download_json":"https://pith.science/pith/HOGDNQZSN2JB4QSCM7K2KU2WBG.json","view_paper":"https://pith.science/paper/HOGDNQZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.08080&json=true","fetch_graph":"https://pith.science/api/pith-number/HOGDNQZSN2JB4QSCM7K2KU2WBG/graph.json","fetch_events":"https://pith.science/api/pith-number/HOGDNQZSN2JB4QSCM7K2KU2WBG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HOGDNQZSN2JB4QSCM7K2KU2WBG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HOGDNQZSN2JB4QSCM7K2KU2WBG/action/storage_attestation","attest_author":"https://pith.science/pith/HOGDNQZSN2JB4QSCM7K2KU2WBG/action/author_attestation","sign_citation":"https://pith.science/pith/HOGDNQZSN2JB4QSCM7K2KU2WBG/action/citation_signature","submit_replication":"https://pith.science/pith/HOGDNQZSN2JB4QSCM7K2KU2WBG/action/replication_record"}},"created_at":"2026-07-04T23:57:50.062444+00:00","updated_at":"2026-07-04T23:57:50.062444+00:00"}