{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:3TJIFD66XLUGF4IS3S3ZKWCEGM","short_pith_number":"pith:3TJIFD66","canonical_record":{"source":{"id":"1411.7542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-11-27T10:49:19Z","cross_cats_sorted":[],"title_canon_sha256":"0ec6f77a77e434689c3378edffed23d7bfdab779b7474caa937f23ee64f02525","abstract_canon_sha256":"e62f51c831ec4af56cfce122e6f476908f3fe5567f59ecfadb103dc4804ed51a"},"schema_version":"1.0"},"canonical_sha256":"dcd2828fdebae862f112dcb795584433398c90ce4c33131f6ec66710ed957a78","source":{"kind":"arxiv","id":"1411.7542","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7542","created_at":"2026-05-18T02:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7542v1","created_at":"2026-05-18T02:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7542","created_at":"2026-05-18T02:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"3TJIFD66XLUG","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3TJIFD66XLUGF4IS","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3TJIFD66","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:3TJIFD66XLUGF4IS3S3ZKWCEGM","target":"record","payload":{"canonical_record":{"source":{"id":"1411.7542","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-11-27T10:49:19Z","cross_cats_sorted":[],"title_canon_sha256":"0ec6f77a77e434689c3378edffed23d7bfdab779b7474caa937f23ee64f02525","abstract_canon_sha256":"e62f51c831ec4af56cfce122e6f476908f3fe5567f59ecfadb103dc4804ed51a"},"schema_version":"1.0"},"canonical_sha256":"dcd2828fdebae862f112dcb795584433398c90ce4c33131f6ec66710ed957a78","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:37.716049Z","signature_b64":"jdTB7iWKkwNKFruhbBF86WdstX1bhy1jcfTwPTokkj7J3m7WG6Zix3LTSZZCmXbvhf/jm7nB+/eyi6u5EvA3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcd2828fdebae862f112dcb795584433398c90ce4c33131f6ec66710ed957a78","last_reissued_at":"2026-05-18T02:32:37.715586Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:37.715586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.7542","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:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ulQA6vvdVH0C315vLOix2LGiHq4JWVtO6MDCACW7cgJ39RjprqAEmXnCLVOtLwVl61suc57Xr2ubemv2ttkXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T05:03:06.991701Z"},"content_sha256":"97cc72d2780bbe21625536f41eef91008eb18966315c8fa23df5f7a90c5d203d","schema_version":"1.0","event_id":"sha256:97cc72d2780bbe21625536f41eef91008eb18966315c8fa23df5f7a90c5d203d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:3TJIFD66XLUGF4IS3S3ZKWCEGM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalability of using Restricted Boltzmann Machines for Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Franz Rothlauf, J\\\"orn Grahl, Malte Probst","submitted_at":"2014-11-27T10:49:19Z","abstract_excerpt":"Estimation of Distribution Algorithms (EDAs) require flexible probability models that can be efficiently learned and sampled. Restricted Boltzmann Machines (RBMs) are generative neural networks with these desired properties. We integrate an RBM into an EDA and evaluate the performance of this system in solving combinatorial optimization problems with a single objective. We assess how the number of fitness evaluations and the CPU time scale with problem size and with problem complexity. The results are compared to the Bayesian Optimization Algorithm, a state-of-the-art EDA. Although RBM-EDA req"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7542","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:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CiP9qcVYprMC9abo0oyyeLPXbjd7/mn8a2CyiFNOVNIBWd/PXYxyUZ/bre1K9Do1u0H+hzLNnvk1HPQsg/x5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T05:03:06.992043Z"},"content_sha256":"aa07ff2db21f1cd0fd8c8fbc6b91004a68e5565338ae284619ce0a267486d147","schema_version":"1.0","event_id":"sha256:aa07ff2db21f1cd0fd8c8fbc6b91004a68e5565338ae284619ce0a267486d147"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3TJIFD66XLUGF4IS3S3ZKWCEGM/bundle.json","state_url":"https://pith.science/pith/3TJIFD66XLUGF4IS3S3ZKWCEGM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3TJIFD66XLUGF4IS3S3ZKWCEGM/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-07-02T05:03:06Z","links":{"resolver":"https://pith.science/pith/3TJIFD66XLUGF4IS3S3ZKWCEGM","bundle":"https://pith.science/pith/3TJIFD66XLUGF4IS3S3ZKWCEGM/bundle.json","state":"https://pith.science/pith/3TJIFD66XLUGF4IS3S3ZKWCEGM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3TJIFD66XLUGF4IS3S3ZKWCEGM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:3TJIFD66XLUGF4IS3S3ZKWCEGM","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":"e62f51c831ec4af56cfce122e6f476908f3fe5567f59ecfadb103dc4804ed51a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-11-27T10:49:19Z","title_canon_sha256":"0ec6f77a77e434689c3378edffed23d7bfdab779b7474caa937f23ee64f02525"},"schema_version":"1.0","source":{"id":"1411.7542","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.7542","created_at":"2026-05-18T02:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1411.7542v1","created_at":"2026-05-18T02:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.7542","created_at":"2026-05-18T02:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"3TJIFD66XLUG","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"3TJIFD66XLUGF4IS","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"3TJIFD66","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:aa07ff2db21f1cd0fd8c8fbc6b91004a68e5565338ae284619ce0a267486d147","target":"graph","created_at":"2026-05-18T02:32:37Z","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":"Estimation of Distribution Algorithms (EDAs) require flexible probability models that can be efficiently learned and sampled. Restricted Boltzmann Machines (RBMs) are generative neural networks with these desired properties. We integrate an RBM into an EDA and evaluate the performance of this system in solving combinatorial optimization problems with a single objective. We assess how the number of fitness evaluations and the CPU time scale with problem size and with problem complexity. The results are compared to the Bayesian Optimization Algorithm, a state-of-the-art EDA. Although RBM-EDA req","authors_text":"Franz Rothlauf, J\\\"orn Grahl, Malte Probst","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-11-27T10:49:19Z","title":"Scalability of using Restricted Boltzmann Machines for Combinatorial Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.7542","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:97cc72d2780bbe21625536f41eef91008eb18966315c8fa23df5f7a90c5d203d","target":"record","created_at":"2026-05-18T02:32:37Z","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":"e62f51c831ec4af56cfce122e6f476908f3fe5567f59ecfadb103dc4804ed51a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2014-11-27T10:49:19Z","title_canon_sha256":"0ec6f77a77e434689c3378edffed23d7bfdab779b7474caa937f23ee64f02525"},"schema_version":"1.0","source":{"id":"1411.7542","kind":"arxiv","version":1}},"canonical_sha256":"dcd2828fdebae862f112dcb795584433398c90ce4c33131f6ec66710ed957a78","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dcd2828fdebae862f112dcb795584433398c90ce4c33131f6ec66710ed957a78","first_computed_at":"2026-05-18T02:32:37.715586Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:37.715586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jdTB7iWKkwNKFruhbBF86WdstX1bhy1jcfTwPTokkj7J3m7WG6Zix3LTSZZCmXbvhf/jm7nB+/eyi6u5EvA3Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:37.716049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.7542","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97cc72d2780bbe21625536f41eef91008eb18966315c8fa23df5f7a90c5d203d","sha256:aa07ff2db21f1cd0fd8c8fbc6b91004a68e5565338ae284619ce0a267486d147"],"state_sha256":"52115e6e4e076c10d53e40ee76a39c18ef4b1dfe0ef760385394f209f57745a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xVnfdQf5CyyrWqQNL/s9y4u1Jg0EcToYi1qG2R6L1+CMtDkm/FUOC2Mvh3TV+UlHGz1b4JmL5DmylSr0cg9eAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T05:03:06.993961Z","bundle_sha256":"ec1c1c63dd3c96e72fe250b3070d060467dfcb23659b0b5a77a15316b44b6ef6"}}