{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YOBMGQH3VALGXNI7DE5UPUXFF7","short_pith_number":"pith:YOBMGQH3","canonical_record":{"source":{"id":"1707.07165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-22T13:45:28Z","cross_cats_sorted":[],"title_canon_sha256":"303c7509f30ec45521c0d2fcb0e2fea37b138554291f296d4f0efb4e879d999d","abstract_canon_sha256":"e8b99d9c6ac09235274b96ff7690d5d38f42dccf366ec6ced96589eb8c1893d9"},"schema_version":"1.0"},"canonical_sha256":"c382c340fba8166bb51f193b47d2e52fff56e491ec353e6d55334f71fbe21d12","source":{"kind":"arxiv","id":"1707.07165","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07165","created_at":"2026-05-18T00:36:21Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07165v1","created_at":"2026-05-18T00:36:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07165","created_at":"2026-05-18T00:36:21Z"},{"alias_kind":"pith_short_12","alias_value":"YOBMGQH3VALG","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YOBMGQH3VALGXNI7","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YOBMGQH3","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YOBMGQH3VALGXNI7DE5UPUXFF7","target":"record","payload":{"canonical_record":{"source":{"id":"1707.07165","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-22T13:45:28Z","cross_cats_sorted":[],"title_canon_sha256":"303c7509f30ec45521c0d2fcb0e2fea37b138554291f296d4f0efb4e879d999d","abstract_canon_sha256":"e8b99d9c6ac09235274b96ff7690d5d38f42dccf366ec6ced96589eb8c1893d9"},"schema_version":"1.0"},"canonical_sha256":"c382c340fba8166bb51f193b47d2e52fff56e491ec353e6d55334f71fbe21d12","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:21.853056Z","signature_b64":"9ncMWSInWozS55cJ5YZbx51zjsC5293Fhv7wDcM0L/HBQjG3TL+Ir8t8DARq2kGIKE1BveHqi+SzM9p/3ggoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c382c340fba8166bb51f193b47d2e52fff56e491ec353e6d55334f71fbe21d12","last_reissued_at":"2026-05-18T00:36:21.852461Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:21.852461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.07165","source_version":1,"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-18T00:36:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d5azNI2PMfvT800rwtQeE2kH128oGqvBRawiYz3i0orYnPl+vWdPhSdVazbX1bIJl1hpPG6v7cherW/kXHo8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:10:22.190272Z"},"content_sha256":"4c17b5f87541f078750360552f98ccadcd8fb4b3314150c75077f14066f5db3c","schema_version":"1.0","event_id":"sha256:4c17b5f87541f078750360552f98ccadcd8fb4b3314150c75077f14066f5db3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YOBMGQH3VALGXNI7DE5UPUXFF7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Coarse-to-Fine Lifted MAP Inference in Computer Vision","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Ankit Anand, Haroun Habeeb, Mausam, Parag Singla","submitted_at":"2017-07-22T13:45:28Z","abstract_excerpt":"There is a vast body of theoretical research on lifted inference in probabilistic graphical models (PGMs). However, few demonstrations exist where lifting is applied in conjunction with top of the line applied algorithms. We pursue the applicability of lifted inference for computer vision (CV), with the insight that a globally optimal (MAP) labeling will likely have the same label for two symmetric pixels. The success of our approach lies in efficiently handling a distinct unary potential on every node (pixel), typical of CV applications. This allows us to lift the large class of algorithms th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07165","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"},"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-18T00:36:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xww/wa1h/ns++5tU6urP3gFRMyfEN+9vGTuXyUuJkhWIxv5PtcCOLZfo/hJqgTsUaFk7Gx6BRHpeRPvnN7pKBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:10:22.190729Z"},"content_sha256":"00a057db6d4388015db3aec477e77853ad0e4bf37b81b9ef474f6347ee390010","schema_version":"1.0","event_id":"sha256:00a057db6d4388015db3aec477e77853ad0e4bf37b81b9ef474f6347ee390010"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YOBMGQH3VALGXNI7DE5UPUXFF7/bundle.json","state_url":"https://pith.science/pith/YOBMGQH3VALGXNI7DE5UPUXFF7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YOBMGQH3VALGXNI7DE5UPUXFF7/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-05-26T07:10:22Z","links":{"resolver":"https://pith.science/pith/YOBMGQH3VALGXNI7DE5UPUXFF7","bundle":"https://pith.science/pith/YOBMGQH3VALGXNI7DE5UPUXFF7/bundle.json","state":"https://pith.science/pith/YOBMGQH3VALGXNI7DE5UPUXFF7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YOBMGQH3VALGXNI7DE5UPUXFF7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YOBMGQH3VALGXNI7DE5UPUXFF7","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":"e8b99d9c6ac09235274b96ff7690d5d38f42dccf366ec6ced96589eb8c1893d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-22T13:45:28Z","title_canon_sha256":"303c7509f30ec45521c0d2fcb0e2fea37b138554291f296d4f0efb4e879d999d"},"schema_version":"1.0","source":{"id":"1707.07165","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.07165","created_at":"2026-05-18T00:36:21Z"},{"alias_kind":"arxiv_version","alias_value":"1707.07165v1","created_at":"2026-05-18T00:36:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.07165","created_at":"2026-05-18T00:36:21Z"},{"alias_kind":"pith_short_12","alias_value":"YOBMGQH3VALG","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YOBMGQH3VALGXNI7","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YOBMGQH3","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:00a057db6d4388015db3aec477e77853ad0e4bf37b81b9ef474f6347ee390010","target":"graph","created_at":"2026-05-18T00:36:21Z","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":"There is a vast body of theoretical research on lifted inference in probabilistic graphical models (PGMs). However, few demonstrations exist where lifting is applied in conjunction with top of the line applied algorithms. We pursue the applicability of lifted inference for computer vision (CV), with the insight that a globally optimal (MAP) labeling will likely have the same label for two symmetric pixels. The success of our approach lies in efficiently handling a distinct unary potential on every node (pixel), typical of CV applications. This allows us to lift the large class of algorithms th","authors_text":"Ankit Anand, Haroun Habeeb, Mausam, Parag Singla","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-22T13:45:28Z","title":"Coarse-to-Fine Lifted MAP Inference in Computer Vision"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.07165","kind":"arxiv","version":1},"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:4c17b5f87541f078750360552f98ccadcd8fb4b3314150c75077f14066f5db3c","target":"record","created_at":"2026-05-18T00:36:21Z","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":"e8b99d9c6ac09235274b96ff7690d5d38f42dccf366ec6ced96589eb8c1893d9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-22T13:45:28Z","title_canon_sha256":"303c7509f30ec45521c0d2fcb0e2fea37b138554291f296d4f0efb4e879d999d"},"schema_version":"1.0","source":{"id":"1707.07165","kind":"arxiv","version":1}},"canonical_sha256":"c382c340fba8166bb51f193b47d2e52fff56e491ec353e6d55334f71fbe21d12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c382c340fba8166bb51f193b47d2e52fff56e491ec353e6d55334f71fbe21d12","first_computed_at":"2026-05-18T00:36:21.852461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:21.852461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9ncMWSInWozS55cJ5YZbx51zjsC5293Fhv7wDcM0L/HBQjG3TL+Ir8t8DARq2kGIKE1BveHqi+SzM9p/3ggoCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:21.853056Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.07165","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c17b5f87541f078750360552f98ccadcd8fb4b3314150c75077f14066f5db3c","sha256:00a057db6d4388015db3aec477e77853ad0e4bf37b81b9ef474f6347ee390010"],"state_sha256":"77646f5c7143d425c9703c037b31b0111fdfae505bd85f63d34da23ed8844c4e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ulLJJ8glUmSQm6KL2FJDdZ/LLI+Cy/VZ8DA5RLpGu81kytArwXnL4vkHU/OoLYjR5d6bre5iSx6RW/9/AOf5Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:10:22.194091Z","bundle_sha256":"788b3168592c738703d7c96067a2a3b882066e2f0a2c865b1bcd4ec2b3e1442c"}}