{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ODXFMZK4NDC7LIVLS673HNVOH6","short_pith_number":"pith:ODXFMZK4","canonical_record":{"source":{"id":"1612.06528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-20T06:56:12Z","cross_cats_sorted":[],"title_canon_sha256":"e1a16829a0f3c9d32ebe8722431a162127f14c72262551dcb5421496744f9315","abstract_canon_sha256":"4fcdf640a6b471b9f9544e5241dab7178d4e01a9b384c0eeffc225445da75099"},"schema_version":"1.0"},"canonical_sha256":"70ee56655c68c5f5a2ab97bfb3b6ae3f84324f093d068a72b3a7f62774e2b18f","source":{"kind":"arxiv","id":"1612.06528","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.06528","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1612.06528v1","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06528","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"ODXFMZK4NDC7","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"ODXFMZK4NDC7LIVL","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"ODXFMZK4","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ODXFMZK4NDC7LIVLS673HNVOH6","target":"record","payload":{"canonical_record":{"source":{"id":"1612.06528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-20T06:56:12Z","cross_cats_sorted":[],"title_canon_sha256":"e1a16829a0f3c9d32ebe8722431a162127f14c72262551dcb5421496744f9315","abstract_canon_sha256":"4fcdf640a6b471b9f9544e5241dab7178d4e01a9b384c0eeffc225445da75099"},"schema_version":"1.0"},"canonical_sha256":"70ee56655c68c5f5a2ab97bfb3b6ae3f84324f093d068a72b3a7f62774e2b18f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:45.830925Z","signature_b64":"dJIig/yy4wL7As0Ooi5F8xgBlzdm5JGF91+67oZhtxpq7NfKfNEgzPL2bwn5b27HGmREuXR7dZbykzEmpZ/aCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70ee56655c68c5f5a2ab97bfb3b6ae3f84324f093d068a72b3a7f62774e2b18f","last_reissued_at":"2026-05-18T00:53:45.830574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:45.830574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.06528","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:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zT3qo1TMqC8zZiWXylJv8OgAKgQMo3KXv28AOBwU6o5oI0hI5Poq5xuJF1qyKnc0h8UMI4cl4oRY0/CetEntDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:54:35.826466Z"},"content_sha256":"354dc8f2ebe3ad2a22b336016e2b77868a4243cc497aba7ae206f64c764e37cb","schema_version":"1.0","event_id":"sha256:354dc8f2ebe3ad2a22b336016e2b77868a4243cc497aba7ae206f64c764e37cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ODXFMZK4NDC7LIVLS673HNVOH6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Neuro-symbolic EDA-based Optimisation using ILP-enhanced DBNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Ashwin Srinivasan, Gautam Shroff, Lovekesh Vig, Puneet Agarwal, Richa Rawat, Sarmimala Saikia","submitted_at":"2016-12-20T06:56:12Z","abstract_excerpt":"We investigate solving discrete optimisation problems using the estimation of distribution (EDA) approach via a novel combination of deep belief networks(DBN) and inductive logic programming (ILP).While DBNs are used to learn the structure of successively better feasible solutions,ILP enables the incorporation of domain-based background knowledge related to the goodness of solutions.Recent work showed that ILP could be an effective way to use domain knowledge in an EDA scenario.However,in a purely ILP-based EDA,sampling successive populations is either inefficient or not straightforward.In our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06528","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:53:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oLJko4AosPLrfXPb4/wbM6w6nXI2E+Rfa03onr7M0ds0Zs8n1r3/Ok0twDlLPN1v7L6Xu+0nJf8L+cV4vbM9Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T22:54:35.827087Z"},"content_sha256":"ce0c48b6f498f464bdc7d324c7b4a610f3057ab38c41e2d9d3dc678be547295f","schema_version":"1.0","event_id":"sha256:ce0c48b6f498f464bdc7d324c7b4a610f3057ab38c41e2d9d3dc678be547295f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ODXFMZK4NDC7LIVLS673HNVOH6/bundle.json","state_url":"https://pith.science/pith/ODXFMZK4NDC7LIVLS673HNVOH6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ODXFMZK4NDC7LIVLS673HNVOH6/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-25T22:54:35Z","links":{"resolver":"https://pith.science/pith/ODXFMZK4NDC7LIVLS673HNVOH6","bundle":"https://pith.science/pith/ODXFMZK4NDC7LIVLS673HNVOH6/bundle.json","state":"https://pith.science/pith/ODXFMZK4NDC7LIVLS673HNVOH6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ODXFMZK4NDC7LIVLS673HNVOH6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ODXFMZK4NDC7LIVLS673HNVOH6","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":"4fcdf640a6b471b9f9544e5241dab7178d4e01a9b384c0eeffc225445da75099","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-20T06:56:12Z","title_canon_sha256":"e1a16829a0f3c9d32ebe8722431a162127f14c72262551dcb5421496744f9315"},"schema_version":"1.0","source":{"id":"1612.06528","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.06528","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"arxiv_version","alias_value":"1612.06528v1","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.06528","created_at":"2026-05-18T00:53:45Z"},{"alias_kind":"pith_short_12","alias_value":"ODXFMZK4NDC7","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"ODXFMZK4NDC7LIVL","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"ODXFMZK4","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:ce0c48b6f498f464bdc7d324c7b4a610f3057ab38c41e2d9d3dc678be547295f","target":"graph","created_at":"2026-05-18T00:53:45Z","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":"We investigate solving discrete optimisation problems using the estimation of distribution (EDA) approach via a novel combination of deep belief networks(DBN) and inductive logic programming (ILP).While DBNs are used to learn the structure of successively better feasible solutions,ILP enables the incorporation of domain-based background knowledge related to the goodness of solutions.Recent work showed that ILP could be an effective way to use domain knowledge in an EDA scenario.However,in a purely ILP-based EDA,sampling successive populations is either inefficient or not straightforward.In our","authors_text":"Ashwin Srinivasan, Gautam Shroff, Lovekesh Vig, Puneet Agarwal, Richa Rawat, Sarmimala Saikia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-20T06:56:12Z","title":"Neuro-symbolic EDA-based Optimisation using ILP-enhanced DBNs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.06528","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:354dc8f2ebe3ad2a22b336016e2b77868a4243cc497aba7ae206f64c764e37cb","target":"record","created_at":"2026-05-18T00:53:45Z","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":"4fcdf640a6b471b9f9544e5241dab7178d4e01a9b384c0eeffc225445da75099","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-20T06:56:12Z","title_canon_sha256":"e1a16829a0f3c9d32ebe8722431a162127f14c72262551dcb5421496744f9315"},"schema_version":"1.0","source":{"id":"1612.06528","kind":"arxiv","version":1}},"canonical_sha256":"70ee56655c68c5f5a2ab97bfb3b6ae3f84324f093d068a72b3a7f62774e2b18f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"70ee56655c68c5f5a2ab97bfb3b6ae3f84324f093d068a72b3a7f62774e2b18f","first_computed_at":"2026-05-18T00:53:45.830574Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:45.830574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dJIig/yy4wL7As0Ooi5F8xgBlzdm5JGF91+67oZhtxpq7NfKfNEgzPL2bwn5b27HGmREuXR7dZbykzEmpZ/aCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:45.830925Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.06528","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:354dc8f2ebe3ad2a22b336016e2b77868a4243cc497aba7ae206f64c764e37cb","sha256:ce0c48b6f498f464bdc7d324c7b4a610f3057ab38c41e2d9d3dc678be547295f"],"state_sha256":"254f1d31f305ce9c0f6e28c680530782e3359de176d81e89f22056a1701d362f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PkZEylVuw3A8TXdry/nKV6BoXtdyhxbapI9DE4tWMkO2vOuJauT8iJ8mVYBysrZWtz5/v/HdITFNWvrTeabnBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T22:54:35.830165Z","bundle_sha256":"880502764c068e2b908c4b12073636a7c4ddfbe66313b70b1a5c168c92367b20"}}