{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:J4MKQSXSAEPGD4KLEG2AFN4D5E","short_pith_number":"pith:J4MKQSXS","canonical_record":{"source":{"id":"1407.5754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-22T06:43:41Z","cross_cats_sorted":["cs.CV","math.OC"],"title_canon_sha256":"fbaeb59caec0b624a79559ed720c009a140b280b760ab0930cb12ae5b1305756","abstract_canon_sha256":"648101ffd1e77cd29e29127ab8eb90cfa6b24be479e504301efdc81379f30339"},"schema_version":"1.0"},"canonical_sha256":"4f18a84af2011e61f14b21b402b783e91ea73aec3aa03ad394cb472419f9cdf4","source":{"kind":"arxiv","id":"1407.5754","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5754","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5754v1","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5754","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"J4MKQSXSAEPG","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J4MKQSXSAEPGD4KL","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J4MKQSXS","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:J4MKQSXSAEPGD4KLEG2AFN4D5E","target":"record","payload":{"canonical_record":{"source":{"id":"1407.5754","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-22T06:43:41Z","cross_cats_sorted":["cs.CV","math.OC"],"title_canon_sha256":"fbaeb59caec0b624a79559ed720c009a140b280b760ab0930cb12ae5b1305756","abstract_canon_sha256":"648101ffd1e77cd29e29127ab8eb90cfa6b24be479e504301efdc81379f30339"},"schema_version":"1.0"},"canonical_sha256":"4f18a84af2011e61f14b21b402b783e91ea73aec3aa03ad394cb472419f9cdf4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:06.697813Z","signature_b64":"D8RU/bcY7GrnHAFcOvyH06VNLix+hsWpE/duDwucAfuG6ezV98pfQcCQ7+KmZrxTVLPDnCBXYWK8ywwehJRnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f18a84af2011e61f14b21b402b783e91ea73aec3aa03ad394cb472419f9cdf4","last_reissued_at":"2026-05-18T02:47:06.697450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:06.697450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.5754","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-18T02:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ir3yp0WJT4UI2wv2Y0sfCEhSSlyhZT1c4JE93+bCR4+6G8XF+Kpak0xGg/LAQ50Hn7Fk1m4QKWv+k+o6sDcUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:57:42.313066Z"},"content_sha256":"80cc126bc2cd8e4ba807912423ccbc0d695dcd677c2058c059639b9f42f15d9f","schema_version":"1.0","event_id":"sha256:80cc126bc2cd8e4ba807912423ccbc0d695dcd677c2058c059639b9f42f15d9f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:J4MKQSXSAEPGD4KLEG2AFN4D5E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree-based iterated local search for Markov random fields with applications in image analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.OC"],"primary_cat":"cs.AI","authors_text":"Dinh Phung, Svetha Venkatesh, Truyen Tran","submitted_at":"2014-07-22T06:43:41Z","abstract_excerpt":"The \\emph{maximum a posteriori} (MAP) assignment for general structure Markov random fields (MRFs) is computationally intractable. In this paper, we exploit tree-based methods to efficiently address this problem. Our novel method, named Tree-based Iterated Local Search (T-ILS) takes advantage of the tractability of tree-structures embedded within MRFs to derive strong local search in an ILS framework. The method efficiently explores exponentially large neighborhood and does so with limited memory without any requirement on the cost functions. We evaluate the T-ILS in a simulation of Ising mode"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5754","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-18T02:47:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uIhhuH/I+u5OIzC1UeXbAE1zU+d7JoIGB3wYpXynFhEjPPEJx33QxXjptLiD80fllV3YkUDrnWDL3yoDtGyPCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:57:42.313691Z"},"content_sha256":"9ff84e8ece6f72d55dd78ceddba57cc2003283e04485617cdf79144d8e73ec06","schema_version":"1.0","event_id":"sha256:9ff84e8ece6f72d55dd78ceddba57cc2003283e04485617cdf79144d8e73ec06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J4MKQSXSAEPGD4KLEG2AFN4D5E/bundle.json","state_url":"https://pith.science/pith/J4MKQSXSAEPGD4KLEG2AFN4D5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J4MKQSXSAEPGD4KLEG2AFN4D5E/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-31T09:57:42Z","links":{"resolver":"https://pith.science/pith/J4MKQSXSAEPGD4KLEG2AFN4D5E","bundle":"https://pith.science/pith/J4MKQSXSAEPGD4KLEG2AFN4D5E/bundle.json","state":"https://pith.science/pith/J4MKQSXSAEPGD4KLEG2AFN4D5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J4MKQSXSAEPGD4KLEG2AFN4D5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:J4MKQSXSAEPGD4KLEG2AFN4D5E","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":"648101ffd1e77cd29e29127ab8eb90cfa6b24be479e504301efdc81379f30339","cross_cats_sorted":["cs.CV","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-22T06:43:41Z","title_canon_sha256":"fbaeb59caec0b624a79559ed720c009a140b280b760ab0930cb12ae5b1305756"},"schema_version":"1.0","source":{"id":"1407.5754","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5754","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5754v1","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5754","created_at":"2026-05-18T02:47:06Z"},{"alias_kind":"pith_short_12","alias_value":"J4MKQSXSAEPG","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J4MKQSXSAEPGD4KL","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J4MKQSXS","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:9ff84e8ece6f72d55dd78ceddba57cc2003283e04485617cdf79144d8e73ec06","target":"graph","created_at":"2026-05-18T02:47:06Z","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":"The \\emph{maximum a posteriori} (MAP) assignment for general structure Markov random fields (MRFs) is computationally intractable. In this paper, we exploit tree-based methods to efficiently address this problem. Our novel method, named Tree-based Iterated Local Search (T-ILS) takes advantage of the tractability of tree-structures embedded within MRFs to derive strong local search in an ILS framework. The method efficiently explores exponentially large neighborhood and does so with limited memory without any requirement on the cost functions. We evaluate the T-ILS in a simulation of Ising mode","authors_text":"Dinh Phung, Svetha Venkatesh, Truyen Tran","cross_cats":["cs.CV","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-22T06:43:41Z","title":"Tree-based iterated local search for Markov random fields with applications in image analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5754","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:80cc126bc2cd8e4ba807912423ccbc0d695dcd677c2058c059639b9f42f15d9f","target":"record","created_at":"2026-05-18T02:47:06Z","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":"648101ffd1e77cd29e29127ab8eb90cfa6b24be479e504301efdc81379f30339","cross_cats_sorted":["cs.CV","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-22T06:43:41Z","title_canon_sha256":"fbaeb59caec0b624a79559ed720c009a140b280b760ab0930cb12ae5b1305756"},"schema_version":"1.0","source":{"id":"1407.5754","kind":"arxiv","version":1}},"canonical_sha256":"4f18a84af2011e61f14b21b402b783e91ea73aec3aa03ad394cb472419f9cdf4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f18a84af2011e61f14b21b402b783e91ea73aec3aa03ad394cb472419f9cdf4","first_computed_at":"2026-05-18T02:47:06.697450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:06.697450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D8RU/bcY7GrnHAFcOvyH06VNLix+hsWpE/duDwucAfuG6ezV98pfQcCQ7+KmZrxTVLPDnCBXYWK8ywwehJRnCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:06.697813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5754","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80cc126bc2cd8e4ba807912423ccbc0d695dcd677c2058c059639b9f42f15d9f","sha256:9ff84e8ece6f72d55dd78ceddba57cc2003283e04485617cdf79144d8e73ec06"],"state_sha256":"bbb349a02efba1fdcd5012a5335edff6f610c91063a8646f53d24d22df20a57e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A1p8Yuv0g8jEapdIwDm6gKdnFnxRxvb1EGXgnDVNgFzQtXzfEmmJ7SWNXm9BcS0r8haGQ84YK9Lmz4K9KHzwBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:57:42.316881Z","bundle_sha256":"a217d83185b28f4952de755dd3950d4c4c6972baa307ac3db4ae4ebd682c85ea"}}