{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NLGLKJ5F566D34HHTZ2AE3NMJ5","short_pith_number":"pith:NLGLKJ5F","canonical_record":{"source":{"id":"1809.03359","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-10T14:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"2152f645b5f9463ea2c1afe1861fd67cd2906e75b072ecf47dfba36f85c82e5f","abstract_canon_sha256":"6b824164968945614e8eb2ef5b020607fdc29217fe93f2327fae933ae9e4dddb"},"schema_version":"1.0"},"canonical_sha256":"6accb527a5efbc3df0e79e74026dac4f614c7e42406497eb69a14b11fc4c3003","source":{"kind":"arxiv","id":"1809.03359","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03359","created_at":"2026-05-17T23:52:33Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03359v2","created_at":"2026-05-17T23:52:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03359","created_at":"2026-05-17T23:52:33Z"},{"alias_kind":"pith_short_12","alias_value":"NLGLKJ5F566D","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NLGLKJ5F566D34HH","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NLGLKJ5F","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NLGLKJ5F566D34HHTZ2AE3NMJ5","target":"record","payload":{"canonical_record":{"source":{"id":"1809.03359","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-10T14:41:17Z","cross_cats_sorted":[],"title_canon_sha256":"2152f645b5f9463ea2c1afe1861fd67cd2906e75b072ecf47dfba36f85c82e5f","abstract_canon_sha256":"6b824164968945614e8eb2ef5b020607fdc29217fe93f2327fae933ae9e4dddb"},"schema_version":"1.0"},"canonical_sha256":"6accb527a5efbc3df0e79e74026dac4f614c7e42406497eb69a14b11fc4c3003","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:33.820637Z","signature_b64":"wFlRoSTeJ3pzRuSZzZCS6ERt1fMdEQSXOWju4etDY0a1AS1BBqiyI58Es0movsr2lvEUI/KUSiluTBRe6ciiCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6accb527a5efbc3df0e79e74026dac4f614c7e42406497eb69a14b11fc4c3003","last_reissued_at":"2026-05-17T23:52:33.820151Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:33.820151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.03359","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-17T23:52:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xKJg2mwWzg3x5xov4WvDNC595mtotWJwB3HXbhIZxZnpuMmaMGn+8rW7oZ3YQniAds78C4VuTAP0M8lo2HihCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:01:19.539662Z"},"content_sha256":"79d452846b2a392692b3b97386ed438cd8b04ae135051de8ff29e748a7c01fab","schema_version":"1.0","event_id":"sha256:79d452846b2a392692b3b97386ed438cd8b04ae135051de8ff29e748a7c01fab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NLGLKJ5F566D34HHTZ2AE3NMJ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David Bergman, Emmanuel Goutierre, Louis-Martin Rousseau, Quentin Cappart","submitted_at":"2018-09-10T14:41:17Z","abstract_excerpt":"Finding tight bounds on the optimal solution is a critical element of practical solution methods for discrete optimization problems. In the last decade, decision diagrams (DDs) have brought a new perspective on obtaining upper and lower bounds that can be significantly better than classical bounding mechanisms, such as linear relaxations. It is well known that the quality of the bounds achieved through this flexible bounding method is highly reliant on the ordering of variables chosen for building the diagram, and finding an ordering that optimizes standard metrics is an NP-hard problem. In th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03359","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-17T23:52:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h6RjZioHzREEJ7RLSmusGMr62md57Pn7Ju9HPcxNjHv3/0yvTjfNEej9YiHwRnrJTahzlgkvLBGTztehmadFCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T18:01:19.540008Z"},"content_sha256":"a84a756d5851adc724ec279dc6bc438cee0a57b55c76d3d428b7a00f4ef6b75c","schema_version":"1.0","event_id":"sha256:a84a756d5851adc724ec279dc6bc438cee0a57b55c76d3d428b7a00f4ef6b75c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NLGLKJ5F566D34HHTZ2AE3NMJ5/bundle.json","state_url":"https://pith.science/pith/NLGLKJ5F566D34HHTZ2AE3NMJ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NLGLKJ5F566D34HHTZ2AE3NMJ5/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-25T18:01:19Z","links":{"resolver":"https://pith.science/pith/NLGLKJ5F566D34HHTZ2AE3NMJ5","bundle":"https://pith.science/pith/NLGLKJ5F566D34HHTZ2AE3NMJ5/bundle.json","state":"https://pith.science/pith/NLGLKJ5F566D34HHTZ2AE3NMJ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NLGLKJ5F566D34HHTZ2AE3NMJ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NLGLKJ5F566D34HHTZ2AE3NMJ5","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":"6b824164968945614e8eb2ef5b020607fdc29217fe93f2327fae933ae9e4dddb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-10T14:41:17Z","title_canon_sha256":"2152f645b5f9463ea2c1afe1861fd67cd2906e75b072ecf47dfba36f85c82e5f"},"schema_version":"1.0","source":{"id":"1809.03359","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.03359","created_at":"2026-05-17T23:52:33Z"},{"alias_kind":"arxiv_version","alias_value":"1809.03359v2","created_at":"2026-05-17T23:52:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03359","created_at":"2026-05-17T23:52:33Z"},{"alias_kind":"pith_short_12","alias_value":"NLGLKJ5F566D","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NLGLKJ5F566D34HH","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NLGLKJ5F","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:a84a756d5851adc724ec279dc6bc438cee0a57b55c76d3d428b7a00f4ef6b75c","target":"graph","created_at":"2026-05-17T23:52:33Z","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":"Finding tight bounds on the optimal solution is a critical element of practical solution methods for discrete optimization problems. In the last decade, decision diagrams (DDs) have brought a new perspective on obtaining upper and lower bounds that can be significantly better than classical bounding mechanisms, such as linear relaxations. It is well known that the quality of the bounds achieved through this flexible bounding method is highly reliant on the ordering of variables chosen for building the diagram, and finding an ordering that optimizes standard metrics is an NP-hard problem. In th","authors_text":"David Bergman, Emmanuel Goutierre, Louis-Martin Rousseau, Quentin Cappart","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-10T14:41:17Z","title":"Improving Optimization Bounds using Machine Learning: Decision Diagrams meet Deep Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03359","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:79d452846b2a392692b3b97386ed438cd8b04ae135051de8ff29e748a7c01fab","target":"record","created_at":"2026-05-17T23:52:33Z","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":"6b824164968945614e8eb2ef5b020607fdc29217fe93f2327fae933ae9e4dddb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-09-10T14:41:17Z","title_canon_sha256":"2152f645b5f9463ea2c1afe1861fd67cd2906e75b072ecf47dfba36f85c82e5f"},"schema_version":"1.0","source":{"id":"1809.03359","kind":"arxiv","version":2}},"canonical_sha256":"6accb527a5efbc3df0e79e74026dac4f614c7e42406497eb69a14b11fc4c3003","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6accb527a5efbc3df0e79e74026dac4f614c7e42406497eb69a14b11fc4c3003","first_computed_at":"2026-05-17T23:52:33.820151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:33.820151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wFlRoSTeJ3pzRuSZzZCS6ERt1fMdEQSXOWju4etDY0a1AS1BBqiyI58Es0movsr2lvEUI/KUSiluTBRe6ciiCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:33.820637Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.03359","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79d452846b2a392692b3b97386ed438cd8b04ae135051de8ff29e748a7c01fab","sha256:a84a756d5851adc724ec279dc6bc438cee0a57b55c76d3d428b7a00f4ef6b75c"],"state_sha256":"427107994f45fab48dd75ecee8c8776456017e4d25674e1914b76f2507362dfb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aF6r5juJVWIkEZnwe5qDLEaS1Ubvp0MA9u5qe7Edn/0/gOP337B9NYHODmYXKNEbfZqoY6IelNN44jdgmsKDBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T18:01:19.541943Z","bundle_sha256":"3d22cd4bd4bb75c5be8bb89bf3d1bb42ca64ccaf499b0f920d6fd2919781ddeb"}}