{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MIFXTFZTJZIRGHUYJWFPLQVONT","short_pith_number":"pith:MIFXTFZT","canonical_record":{"source":{"id":"1201.2241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-01-11T04:59:57Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c61bcc35faa40e4386b1f15eb582cfcda94d7a0e90459609bd32bdd78bacd55d","abstract_canon_sha256":"74a43ff4e697b95a55b8b68c6694094e020abe6fe600601042a4f35d4517cbab"},"schema_version":"1.0"},"canonical_sha256":"620b7997334e51131e984d8af5c2ae6cdf0d1ac851f8aecd723b6643fed51839","source":{"kind":"arxiv","id":"1201.2241","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2241","created_at":"2026-05-18T04:04:52Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2241v1","created_at":"2026-05-18T04:04:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2241","created_at":"2026-05-18T04:04:52Z"},{"alias_kind":"pith_short_12","alias_value":"MIFXTFZTJZIR","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MIFXTFZTJZIRGHUY","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MIFXTFZT","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MIFXTFZTJZIRGHUYJWFPLQVONT","target":"record","payload":{"canonical_record":{"source":{"id":"1201.2241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-01-11T04:59:57Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c61bcc35faa40e4386b1f15eb582cfcda94d7a0e90459609bd32bdd78bacd55d","abstract_canon_sha256":"74a43ff4e697b95a55b8b68c6694094e020abe6fe600601042a4f35d4517cbab"},"schema_version":"1.0"},"canonical_sha256":"620b7997334e51131e984d8af5c2ae6cdf0d1ac851f8aecd723b6643fed51839","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:52.798413Z","signature_b64":"3Qsn71OltHAG53H1QvDhXpYBjzzEniOzbq7qwaIDztOObB85NBD7K5dDitIAr/pjpjn2rydJLmK9cM9AKez6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"620b7997334e51131e984d8af5c2ae6cdf0d1ac851f8aecd723b6643fed51839","last_reissued_at":"2026-05-18T04:04:52.797811Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:52.797811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.2241","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-18T04:04:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d/BXt+VWr6Bp6A21q+ElaGPeilgMBb3yo0C0Lpo4dLSJARCwNkIeffJNZI+47gm6N8DtEMfJBJq5pNPkJ1iODg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:45:00.299145Z"},"content_sha256":"212dd6023e4984715602b6ba703412b6fa18025bf98a81b7622b87edf4049d22","schema_version":"1.0","event_id":"sha256:212dd6023e4984715602b6ba703412b6fa18025bf98a81b7622b87edf4049d22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MIFXTFZTJZIRGHUYJWFPLQVONT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distance-Based Bias in Model-Directed Optimization of Additively Decomposable Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Mark W. Hauschild, Martin Pelikan","submitted_at":"2012-01-11T04:59:57Z","abstract_excerpt":"For many optimization problems it is possible to define a distance metric between problem variables that correlates with the likelihood and strength of interactions between the variables. For example, one may define a metric so that the dependencies between variables that are closer to each other with respect to the metric are expected to be stronger than the dependencies between variables that are further apart. The purpose of this paper is to describe a method that combines such a problem-specific distance metric with information mined from probabilistic models obtained in previous runs of e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2241","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-18T04:04:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CxbgNpDv3dyvg3v/LIkuBdLZw1SAwohzst9UdKXnMTVYcysEHd3p4DuR48gNu84/427hJ6fISSR4k2r82puSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:45:00.299513Z"},"content_sha256":"e02a965b672bf5b6bc2ca31c59ce5fbf2ee8939fcb586d62f1c53396c2ab98a3","schema_version":"1.0","event_id":"sha256:e02a965b672bf5b6bc2ca31c59ce5fbf2ee8939fcb586d62f1c53396c2ab98a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MIFXTFZTJZIRGHUYJWFPLQVONT/bundle.json","state_url":"https://pith.science/pith/MIFXTFZTJZIRGHUYJWFPLQVONT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MIFXTFZTJZIRGHUYJWFPLQVONT/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-03T20:45:00Z","links":{"resolver":"https://pith.science/pith/MIFXTFZTJZIRGHUYJWFPLQVONT","bundle":"https://pith.science/pith/MIFXTFZTJZIRGHUYJWFPLQVONT/bundle.json","state":"https://pith.science/pith/MIFXTFZTJZIRGHUYJWFPLQVONT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MIFXTFZTJZIRGHUYJWFPLQVONT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MIFXTFZTJZIRGHUYJWFPLQVONT","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":"74a43ff4e697b95a55b8b68c6694094e020abe6fe600601042a4f35d4517cbab","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-01-11T04:59:57Z","title_canon_sha256":"c61bcc35faa40e4386b1f15eb582cfcda94d7a0e90459609bd32bdd78bacd55d"},"schema_version":"1.0","source":{"id":"1201.2241","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2241","created_at":"2026-05-18T04:04:52Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2241v1","created_at":"2026-05-18T04:04:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2241","created_at":"2026-05-18T04:04:52Z"},{"alias_kind":"pith_short_12","alias_value":"MIFXTFZTJZIR","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MIFXTFZTJZIRGHUY","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MIFXTFZT","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:e02a965b672bf5b6bc2ca31c59ce5fbf2ee8939fcb586d62f1c53396c2ab98a3","target":"graph","created_at":"2026-05-18T04:04:52Z","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":"For many optimization problems it is possible to define a distance metric between problem variables that correlates with the likelihood and strength of interactions between the variables. For example, one may define a metric so that the dependencies between variables that are closer to each other with respect to the metric are expected to be stronger than the dependencies between variables that are further apart. The purpose of this paper is to describe a method that combines such a problem-specific distance metric with information mined from probabilistic models obtained in previous runs of e","authors_text":"Mark W. Hauschild, Martin Pelikan","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-01-11T04:59:57Z","title":"Distance-Based Bias in Model-Directed Optimization of Additively Decomposable Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2241","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:212dd6023e4984715602b6ba703412b6fa18025bf98a81b7622b87edf4049d22","target":"record","created_at":"2026-05-18T04:04:52Z","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":"74a43ff4e697b95a55b8b68c6694094e020abe6fe600601042a4f35d4517cbab","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2012-01-11T04:59:57Z","title_canon_sha256":"c61bcc35faa40e4386b1f15eb582cfcda94d7a0e90459609bd32bdd78bacd55d"},"schema_version":"1.0","source":{"id":"1201.2241","kind":"arxiv","version":1}},"canonical_sha256":"620b7997334e51131e984d8af5c2ae6cdf0d1ac851f8aecd723b6643fed51839","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"620b7997334e51131e984d8af5c2ae6cdf0d1ac851f8aecd723b6643fed51839","first_computed_at":"2026-05-18T04:04:52.797811Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:52.797811Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Qsn71OltHAG53H1QvDhXpYBjzzEniOzbq7qwaIDztOObB85NBD7K5dDitIAr/pjpjn2rydJLmK9cM9AKez6Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:52.798413Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.2241","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:212dd6023e4984715602b6ba703412b6fa18025bf98a81b7622b87edf4049d22","sha256:e02a965b672bf5b6bc2ca31c59ce5fbf2ee8939fcb586d62f1c53396c2ab98a3"],"state_sha256":"de96701c6400982f412fc79072aac3ea0966baa9fa19d1f92517b79cb720c2fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPJV43mZJWWNJ/e2J5zPAjU5vk13AaoO/9p11owMRuyf4m9gaofTNBa5YYTj90VqfSOdE0ssuOzGmF+Y0aCPCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:45:00.301536Z","bundle_sha256":"37878870f4711efd27907a641187663a714020d7fc1d6ba1ef4568c5085536bd"}}