{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PFUDDX7VH7QHG5WKXOXQJMAN2P","short_pith_number":"pith:PFUDDX7V","canonical_record":{"source":{"id":"1511.06214","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-19T15:45:02Z","cross_cats_sorted":[],"title_canon_sha256":"400f3dafcceea597dc1ed85ac6050576f858a85d2f8636b6bfa3bf5270371349","abstract_canon_sha256":"c86c10eca01d1d8405b7459c862ab5ce63024d11dbed1f9f8e4043de1eb2b9e1"},"schema_version":"1.0"},"canonical_sha256":"796831dff53fe07376cabbaf04b00dd3e73eeec3a62588e18aeeb423208d9e42","source":{"kind":"arxiv","id":"1511.06214","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06214","created_at":"2026-05-18T01:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06214v2","created_at":"2026-05-18T01:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06214","created_at":"2026-05-18T01:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"PFUDDX7VH7QH","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PFUDDX7VH7QHG5WK","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PFUDDX7V","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PFUDDX7VH7QHG5WKXOXQJMAN2P","target":"record","payload":{"canonical_record":{"source":{"id":"1511.06214","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-19T15:45:02Z","cross_cats_sorted":[],"title_canon_sha256":"400f3dafcceea597dc1ed85ac6050576f858a85d2f8636b6bfa3bf5270371349","abstract_canon_sha256":"c86c10eca01d1d8405b7459c862ab5ce63024d11dbed1f9f8e4043de1eb2b9e1"},"schema_version":"1.0"},"canonical_sha256":"796831dff53fe07376cabbaf04b00dd3e73eeec3a62588e18aeeb423208d9e42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:36.350977Z","signature_b64":"WWzUcZMRgAE611aYwVedDR28618/2lc/GuSEiDllTEqDgWeTrPB8T0Vefuvc4FN+P8Pljo+El3CmnLuD+FFsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"796831dff53fe07376cabbaf04b00dd3e73eeec3a62588e18aeeb423208d9e42","last_reissued_at":"2026-05-18T01:09:36.350453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:36.350453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.06214","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XdHc9tN+oupR4GmuTr2asozK5tqEwJ2K8CtwVZGIWZyNaIoHqDm3nLfMbcd5sYO71CcS9qp8cNpCKJWLqMvsDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:28:22.637001Z"},"content_sha256":"1f6e98cf252ba3d129cbbd233feaebab5b8456e2f7ee12a3098d662a85cf898c","schema_version":"1.0","event_id":"sha256:1f6e98cf252ba3d129cbbd233feaebab5b8456e2f7ee12a3098d662a85cf898c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PFUDDX7VH7QHG5WKXOXQJMAN2P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automatically selecting inference algorithms for discrete energy minimisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Paul Henderson, Vittorio Ferrari","submitted_at":"2015-11-19T15:45:02Z","abstract_excerpt":"Minimisation of discrete energies defined over factors is an important problem in computer vision, and a vast number of MAP inference algorithms have been proposed. Different inference algorithms perform better on factor graph models (GMs) from different underlying problem classes, and in general it is difficult to know which algorithm will yield the lowest energy for a given GM. To mitigate this difficulty, survey papers advise the practitioner on what algorithms perform well on what classes of models. We take the next step forward, and present a technique to automatically select the best inf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06214","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nJSVhiy4VbFFBifL6ciwElkJZ4C7eO4XvXfjEBI/dJY26zi1+UNchGP1H8LID16wpxRtCFmAnXiDHX+SM1/NBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:28:22.650549Z"},"content_sha256":"9e562579c428f99bb1c982bc77fed3734a892ddb3062807febaad50fc4424b68","schema_version":"1.0","event_id":"sha256:9e562579c428f99bb1c982bc77fed3734a892ddb3062807febaad50fc4424b68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PFUDDX7VH7QHG5WKXOXQJMAN2P/bundle.json","state_url":"https://pith.science/pith/PFUDDX7VH7QHG5WKXOXQJMAN2P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PFUDDX7VH7QHG5WKXOXQJMAN2P/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-04T20:28:22Z","links":{"resolver":"https://pith.science/pith/PFUDDX7VH7QHG5WKXOXQJMAN2P","bundle":"https://pith.science/pith/PFUDDX7VH7QHG5WKXOXQJMAN2P/bundle.json","state":"https://pith.science/pith/PFUDDX7VH7QHG5WKXOXQJMAN2P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PFUDDX7VH7QHG5WKXOXQJMAN2P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PFUDDX7VH7QHG5WKXOXQJMAN2P","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c86c10eca01d1d8405b7459c862ab5ce63024d11dbed1f9f8e4043de1eb2b9e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-19T15:45:02Z","title_canon_sha256":"400f3dafcceea597dc1ed85ac6050576f858a85d2f8636b6bfa3bf5270371349"},"schema_version":"1.0","source":{"id":"1511.06214","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.06214","created_at":"2026-05-18T01:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"1511.06214v2","created_at":"2026-05-18T01:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06214","created_at":"2026-05-18T01:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"PFUDDX7VH7QH","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PFUDDX7VH7QHG5WK","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PFUDDX7V","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:9e562579c428f99bb1c982bc77fed3734a892ddb3062807febaad50fc4424b68","target":"graph","created_at":"2026-05-18T01:09:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Minimisation of discrete energies defined over factors is an important problem in computer vision, and a vast number of MAP inference algorithms have been proposed. Different inference algorithms perform better on factor graph models (GMs) from different underlying problem classes, and in general it is difficult to know which algorithm will yield the lowest energy for a given GM. To mitigate this difficulty, survey papers advise the practitioner on what algorithms perform well on what classes of models. We take the next step forward, and present a technique to automatically select the best inf","authors_text":"Paul Henderson, Vittorio Ferrari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-19T15:45:02Z","title":"Automatically selecting inference algorithms for discrete energy minimisation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06214","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1f6e98cf252ba3d129cbbd233feaebab5b8456e2f7ee12a3098d662a85cf898c","target":"record","created_at":"2026-05-18T01:09:36Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c86c10eca01d1d8405b7459c862ab5ce63024d11dbed1f9f8e4043de1eb2b9e1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-11-19T15:45:02Z","title_canon_sha256":"400f3dafcceea597dc1ed85ac6050576f858a85d2f8636b6bfa3bf5270371349"},"schema_version":"1.0","source":{"id":"1511.06214","kind":"arxiv","version":2}},"canonical_sha256":"796831dff53fe07376cabbaf04b00dd3e73eeec3a62588e18aeeb423208d9e42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"796831dff53fe07376cabbaf04b00dd3e73eeec3a62588e18aeeb423208d9e42","first_computed_at":"2026-05-18T01:09:36.350453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:36.350453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WWzUcZMRgAE611aYwVedDR28618/2lc/GuSEiDllTEqDgWeTrPB8T0Vefuvc4FN+P8Pljo+El3CmnLuD+FFsBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:36.350977Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.06214","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1f6e98cf252ba3d129cbbd233feaebab5b8456e2f7ee12a3098d662a85cf898c","sha256:9e562579c428f99bb1c982bc77fed3734a892ddb3062807febaad50fc4424b68"],"state_sha256":"f88ed32ebecbc16e127ade7149492bdd813edba01e1d73acf1e3f668f3b22323"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9tdeNjorKzGycmQm3zClUFjk8ahxAvE8tbT3WHN+bepssoEK0kWaoOfPWIegEccJsZ/HzyUDyHBx70B7/8//CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:28:22.654003Z","bundle_sha256":"16735f79ebe392ff4ae72f80c6384a704e20f22a0577f1aad87abc83b6332b40"}}