{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PLM7GRYHH2NHS4PXYHUKKB6KC5","short_pith_number":"pith:PLM7GRYH","canonical_record":{"source":{"id":"1303.1749","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-03-07T16:59:11Z","cross_cats_sorted":[],"title_canon_sha256":"69077f598efa5471f66dfc628fc72127a043d91569dd4db4dca1e731a4ebdd53","abstract_canon_sha256":"4b6141238e267af413f655e89487f50d7a1c5dbbd25fd8a94119856fc9673bc6"},"schema_version":"1.0"},"canonical_sha256":"7ad9f347073e9a7971f7c1e8a507ca17533943d9875dca676538a0751d47a3ba","source":{"kind":"arxiv","id":"1303.1749","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1749","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1749v2","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1749","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"PLM7GRYHH2NH","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PLM7GRYHH2NHS4PX","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PLM7GRYH","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PLM7GRYHH2NHS4PXYHUKKB6KC5","target":"record","payload":{"canonical_record":{"source":{"id":"1303.1749","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-03-07T16:59:11Z","cross_cats_sorted":[],"title_canon_sha256":"69077f598efa5471f66dfc628fc72127a043d91569dd4db4dca1e731a4ebdd53","abstract_canon_sha256":"4b6141238e267af413f655e89487f50d7a1c5dbbd25fd8a94119856fc9673bc6"},"schema_version":"1.0"},"canonical_sha256":"7ad9f347073e9a7971f7c1e8a507ca17533943d9875dca676538a0751d47a3ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:09.355580Z","signature_b64":"7AQZbMddWaq+5+EwqKkZ3FCrQcCBt8Eds8h02xDuPmT+VixG68B7GogHhW1E2iBf7Rml2uJfu/7Xx0RhJpauBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ad9f347073e9a7971f7c1e8a507ca17533943d9875dca676538a0751d47a3ba","last_reissued_at":"2026-05-18T03:11:09.354822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:09.354822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.1749","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-18T03:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kVUb37ArZb5RrRX8lbq8ws+FwCf62n2QAKh9g4GWCQ5y6wkw/e5Vk214nyB+hAaALscPHu84LofoXFAlBxkUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:39:24.094175Z"},"content_sha256":"6cf927be048a360b2cffd9595eaf7858225a9fe22fec465737bb00c58d346768","schema_version":"1.0","event_id":"sha256:6cf927be048a360b2cffd9595eaf7858225a9fe22fec465737bb00c58d346768"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PLM7GRYHH2NHS4PXYHUKKB6KC5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simplifying Energy Optimization using Partial Enumeration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Carl Olsson, Johannes Ulen, Vladimir Kolmogorov, Yuri Boykov","submitted_at":"2013-03-07T16:59:11Z","abstract_excerpt":"Energies with high-order non-submodular interactions have been shown to be very useful in vision due to their high modeling power. Optimization of such energies, however, is generally NP-hard. A naive approach that works for small problem instances is exhaustive search, that is, enumeration of all possible labelings of the underlying graph. We propose a general minimization approach for large graphs based on enumeration of labelings of certain small patches. This partial enumeration technique reduces complex high-order energy formulations to pairwise Constraint Satisfaction Problems with unary"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1749","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-18T03:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PqGAyL6Ef9drjiiWpG4zpod3y4q3jk5zido0lG2LPHU1YT2QWx3QQ/Wr8xoEEd5phcCfKijXN1WXqytonuuECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T05:39:24.094538Z"},"content_sha256":"b87b68a9d4abac0a46df8af7ed7ea15c324d3572936d2768b8d2dad2c5395864","schema_version":"1.0","event_id":"sha256:b87b68a9d4abac0a46df8af7ed7ea15c324d3572936d2768b8d2dad2c5395864"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PLM7GRYHH2NHS4PXYHUKKB6KC5/bundle.json","state_url":"https://pith.science/pith/PLM7GRYHH2NHS4PXYHUKKB6KC5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PLM7GRYHH2NHS4PXYHUKKB6KC5/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-25T05:39:24Z","links":{"resolver":"https://pith.science/pith/PLM7GRYHH2NHS4PXYHUKKB6KC5","bundle":"https://pith.science/pith/PLM7GRYHH2NHS4PXYHUKKB6KC5/bundle.json","state":"https://pith.science/pith/PLM7GRYHH2NHS4PXYHUKKB6KC5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PLM7GRYHH2NHS4PXYHUKKB6KC5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PLM7GRYHH2NHS4PXYHUKKB6KC5","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":"4b6141238e267af413f655e89487f50d7a1c5dbbd25fd8a94119856fc9673bc6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-03-07T16:59:11Z","title_canon_sha256":"69077f598efa5471f66dfc628fc72127a043d91569dd4db4dca1e731a4ebdd53"},"schema_version":"1.0","source":{"id":"1303.1749","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1749","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1749v2","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1749","created_at":"2026-05-18T03:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"PLM7GRYHH2NH","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PLM7GRYHH2NHS4PX","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PLM7GRYH","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:b87b68a9d4abac0a46df8af7ed7ea15c324d3572936d2768b8d2dad2c5395864","target":"graph","created_at":"2026-05-18T03:11:09Z","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":"Energies with high-order non-submodular interactions have been shown to be very useful in vision due to their high modeling power. Optimization of such energies, however, is generally NP-hard. A naive approach that works for small problem instances is exhaustive search, that is, enumeration of all possible labelings of the underlying graph. We propose a general minimization approach for large graphs based on enumeration of labelings of certain small patches. This partial enumeration technique reduces complex high-order energy formulations to pairwise Constraint Satisfaction Problems with unary","authors_text":"Carl Olsson, Johannes Ulen, Vladimir Kolmogorov, Yuri Boykov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-03-07T16:59:11Z","title":"Simplifying Energy Optimization using Partial Enumeration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1749","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:6cf927be048a360b2cffd9595eaf7858225a9fe22fec465737bb00c58d346768","target":"record","created_at":"2026-05-18T03:11:09Z","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":"4b6141238e267af413f655e89487f50d7a1c5dbbd25fd8a94119856fc9673bc6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-03-07T16:59:11Z","title_canon_sha256":"69077f598efa5471f66dfc628fc72127a043d91569dd4db4dca1e731a4ebdd53"},"schema_version":"1.0","source":{"id":"1303.1749","kind":"arxiv","version":2}},"canonical_sha256":"7ad9f347073e9a7971f7c1e8a507ca17533943d9875dca676538a0751d47a3ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ad9f347073e9a7971f7c1e8a507ca17533943d9875dca676538a0751d47a3ba","first_computed_at":"2026-05-18T03:11:09.354822Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:09.354822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7AQZbMddWaq+5+EwqKkZ3FCrQcCBt8Eds8h02xDuPmT+VixG68B7GogHhW1E2iBf7Rml2uJfu/7Xx0RhJpauBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:09.355580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.1749","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cf927be048a360b2cffd9595eaf7858225a9fe22fec465737bb00c58d346768","sha256:b87b68a9d4abac0a46df8af7ed7ea15c324d3572936d2768b8d2dad2c5395864"],"state_sha256":"842263a5206c30fc7674c43bf28f88a2fd9eeddefd3ee7929f49a64c205eb89b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"STN8yjqendEckOW7YMEmlCGHlyVOkr3dYY3UwyQLsyp8fMymnJikwkxgBzo4CE43/Xkvtp186Vc8K16ffCoABQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T05:39:24.096598Z","bundle_sha256":"c75f43db35475e200ac9e9c430d3dde83ce10b15c8cddec0b8b7853dcbe3d93e"}}