{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CDCNATTLPWMEXKZRMGYSA5QAXY","short_pith_number":"pith:CDCNATTL","schema_version":"1.0","canonical_sha256":"10c4d04e6b7d984bab3161b1207600be219e9cf7a013eb6bdc2c221ebc6555d0","source":{"kind":"arxiv","id":"1608.01093","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.01093","created_at":"2026-05-18T00:59:34.364877+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.01093v2","created_at":"2026-05-18T00:59:34.364877+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.01093","created_at":"2026-05-18T00:59:34.364877+00:00"},{"alias_kind":"pith_short_12","alias_value":"CDCNATTLPWME","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CDCNATTLPWMEXKZR","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CDCNATTL","created_at":"2026-05-18T12:30:09.641336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CDCNATTLPWMEXKZRMGYSA5QAXY","json":"https://pith.science/pith/CDCNATTLPWMEXKZRMGYSA5QAXY.json","graph_json":"https://pith.science/api/pith-number/CDCNATTLPWMEXKZRMGYSA5QAXY/graph.json","events_json":"https://pith.science/api/pith-number/CDCNATTLPWMEXKZRMGYSA5QAXY/events.json","paper":"https://pith.science/paper/CDCNATTL"},"agent_actions":{"view_html":"https://pith.science/pith/CDCNATTLPWMEXKZRMGYSA5QAXY","download_json":"https://pith.science/pith/CDCNATTLPWMEXKZRMGYSA5QAXY.json","view_paper":"https://pith.science/paper/CDCNATTL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.01093&json=true","fetch_graph":"https://pith.science/api/pith-number/CDCNATTLPWMEXKZRMGYSA5QAXY/graph.json","fetch_events":"https://pith.science/api/pith-number/CDCNATTLPWMEXKZRMGYSA5QAXY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CDCNATTLPWMEXKZRMGYSA5QAXY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CDCNATTLPWMEXKZRMGYSA5QAXY/action/storage_attestation","attest_author":"https://pith.science/pith/CDCNATTLPWMEXKZRMGYSA5QAXY/action/author_attestation","sign_citation":"https://pith.science/pith/CDCNATTLPWMEXKZRMGYSA5QAXY/action/citation_signature","submit_replication":"https://pith.science/pith/CDCNATTLPWMEXKZRMGYSA5QAXY/action/replication_record"}},"created_at":"2026-05-18T00:59:34.364877+00:00","updated_at":"2026-05-18T00:59:34.364877+00:00"}