{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CDCNATTLPWMEXKZRMGYSA5QAXY","short_pith_number":"pith:CDCNATTL","canonical_record":{"source":{"id":"1608.01093","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-03T07:23:48Z","cross_cats_sorted":[],"title_canon_sha256":"d517328b771bb7e9072dec81ab91425538353f7dd9d3b392dec3c979dca6d86c","abstract_canon_sha256":"259e532b724053ccca4f14fa9299ab03ef29dc974c62355508f2c04a05f34f1a"},"schema_version":"1.0"},"canonical_sha256":"10c4d04e6b7d984bab3161b1207600be219e9cf7a013eb6bdc2c221ebc6555d0","source":{"kind":"arxiv","id":"1608.01093","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01093","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01093v2","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01093","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"CDCNATTLPWME","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CDCNATTLPWMEXKZR","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CDCNATTL","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CDCNATTLPWMEXKZRMGYSA5QAXY","target":"record","payload":{"canonical_record":{"source":{"id":"1608.01093","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-03T07:23:48Z","cross_cats_sorted":[],"title_canon_sha256":"d517328b771bb7e9072dec81ab91425538353f7dd9d3b392dec3c979dca6d86c","abstract_canon_sha256":"259e532b724053ccca4f14fa9299ab03ef29dc974c62355508f2c04a05f34f1a"},"schema_version":"1.0"},"canonical_sha256":"10c4d04e6b7d984bab3161b1207600be219e9cf7a013eb6bdc2c221ebc6555d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:34.365445Z","signature_b64":"ZrtfG7ACeCPqxyWgmKaPyZKUvcGqc84PQ2D/KWOG0/PW+3af4GoB2UrjsjJ+UgAzTS5bq3jcLu4X812A63nADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10c4d04e6b7d984bab3161b1207600be219e9cf7a013eb6bdc2c221ebc6555d0","last_reissued_at":"2026-05-18T00:59:34.364768Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:34.364768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.01093","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-18T00:59:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K4GE2OHnNfwCrHlmBPJnMELihtlDfK9gymAuizC1FB1FOBWu0tU5y7hYLgS9QCBln0u47zLVDu/pG0CB1Vl5DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T21:41:13.630126Z"},"content_sha256":"b33ac97418fc72b78155718205dd4ad70f6a9cccd3c287c00fd3ca20f95b0381","schema_version":"1.0","event_id":"sha256:b33ac97418fc72b78155718205dd4ad70f6a9cccd3c287c00fd3ca20f95b0381"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CDCNATTLPWMEXKZRMGYSA5QAXY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generation of Near-Optimal Solutions Using ILP-Guided Sampling","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, Sarmimala Saikia","submitted_at":"2016-08-03T07:23:48Z","abstract_excerpt":"Our interest in this paper is in optimisation problems that are intractable to solve by direct numerical optimisation, but nevertheless have significant amounts of relevant domain-specific knowledge. The category of heuristic search techniques known as estimation of distribution algorithms (EDAs) seek to incrementally sample from probability distributions in which optimal (or near-optimal) solutions have increasingly higher probabilities. Can we use domain knowledge to assist the estimation of these distributions? To answer this in the affirmative, we need: (a)a general-purpose technique for t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01093","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-18T00:59:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W1IU+DPtHfMXa0fGFE5Q2onF7/cBk32nASkt7+0l1EmJTLRppboybLC+N3QwIQEozKrEnonptPblW2t7tbFFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T21:41:13.630519Z"},"content_sha256":"ad96684aaabfdc47306d5bea0b268e96314216088c38625a5323fc1176b44c93","schema_version":"1.0","event_id":"sha256:ad96684aaabfdc47306d5bea0b268e96314216088c38625a5323fc1176b44c93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CDCNATTLPWMEXKZRMGYSA5QAXY/bundle.json","state_url":"https://pith.science/pith/CDCNATTLPWMEXKZRMGYSA5QAXY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CDCNATTLPWMEXKZRMGYSA5QAXY/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-25T21:41:13Z","links":{"resolver":"https://pith.science/pith/CDCNATTLPWMEXKZRMGYSA5QAXY","bundle":"https://pith.science/pith/CDCNATTLPWMEXKZRMGYSA5QAXY/bundle.json","state":"https://pith.science/pith/CDCNATTLPWMEXKZRMGYSA5QAXY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CDCNATTLPWMEXKZRMGYSA5QAXY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CDCNATTLPWMEXKZRMGYSA5QAXY","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":"259e532b724053ccca4f14fa9299ab03ef29dc974c62355508f2c04a05f34f1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-03T07:23:48Z","title_canon_sha256":"d517328b771bb7e9072dec81ab91425538353f7dd9d3b392dec3c979dca6d86c"},"schema_version":"1.0","source":{"id":"1608.01093","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.01093","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1608.01093v2","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01093","created_at":"2026-05-18T00:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"CDCNATTLPWME","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CDCNATTLPWMEXKZR","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CDCNATTL","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:ad96684aaabfdc47306d5bea0b268e96314216088c38625a5323fc1176b44c93","target":"graph","created_at":"2026-05-18T00:59:34Z","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":"Our interest in this paper is in optimisation problems that are intractable to solve by direct numerical optimisation, but nevertheless have significant amounts of relevant domain-specific knowledge. The category of heuristic search techniques known as estimation of distribution algorithms (EDAs) seek to incrementally sample from probability distributions in which optimal (or near-optimal) solutions have increasingly higher probabilities. Can we use domain knowledge to assist the estimation of these distributions? To answer this in the affirmative, we need: (a)a general-purpose technique for t","authors_text":"Ashwin Srinivasan, Gautam Shroff, Lovekesh Vig, Puneet Agarwal, Sarmimala Saikia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-03T07:23:48Z","title":"Generation of Near-Optimal Solutions Using ILP-Guided Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.01093","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:b33ac97418fc72b78155718205dd4ad70f6a9cccd3c287c00fd3ca20f95b0381","target":"record","created_at":"2026-05-18T00:59:34Z","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":"259e532b724053ccca4f14fa9299ab03ef29dc974c62355508f2c04a05f34f1a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-03T07:23:48Z","title_canon_sha256":"d517328b771bb7e9072dec81ab91425538353f7dd9d3b392dec3c979dca6d86c"},"schema_version":"1.0","source":{"id":"1608.01093","kind":"arxiv","version":2}},"canonical_sha256":"10c4d04e6b7d984bab3161b1207600be219e9cf7a013eb6bdc2c221ebc6555d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10c4d04e6b7d984bab3161b1207600be219e9cf7a013eb6bdc2c221ebc6555d0","first_computed_at":"2026-05-18T00:59:34.364768Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:34.364768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZrtfG7ACeCPqxyWgmKaPyZKUvcGqc84PQ2D/KWOG0/PW+3af4GoB2UrjsjJ+UgAzTS5bq3jcLu4X812A63nADA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:34.365445Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.01093","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b33ac97418fc72b78155718205dd4ad70f6a9cccd3c287c00fd3ca20f95b0381","sha256:ad96684aaabfdc47306d5bea0b268e96314216088c38625a5323fc1176b44c93"],"state_sha256":"d1dcbe01775ea43522f3372687cb3b916a9b154a4d77541b3cedeeaff084a289"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EVntShPYZTZjYqzjVZwcrp9pqrMisDooqFiv763fd/pqOiM5ECBaC5WNldeciN4mvTcBKKWl7se+2jSJfCOcCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T21:41:13.632734Z","bundle_sha256":"a734baaae7c6ca4a79060519a6a10a131195442783a9a4bb80582b0039b3a5f2"}}