{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:K5LLZ43WZ46QIBEPTIOVJHWY34","short_pith_number":"pith:K5LLZ43W","canonical_record":{"source":{"id":"2203.15386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-29T09:26:22Z","cross_cats_sorted":["cs.NE","math.OC"],"title_canon_sha256":"3def099beb1b7fc46fbcb826760c894dc55c59a2f5e19d552429e25807dc7209","abstract_canon_sha256":"b0387c081e494a5f087d660977ee3a0730726d3bfd0537777d95dc4a7476015a"},"schema_version":"1.0"},"canonical_sha256":"5756bcf376cf3d04048f9a1d549ed8df2b22cc2fa3c0e7c12c78faee0acb1b44","source":{"kind":"arxiv","id":"2203.15386","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.15386","created_at":"2026-07-05T04:21:11Z"},{"alias_kind":"arxiv_version","alias_value":"2203.15386v2","created_at":"2026-07-05T04:21:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.15386","created_at":"2026-07-05T04:21:11Z"},{"alias_kind":"pith_short_12","alias_value":"K5LLZ43WZ46Q","created_at":"2026-07-05T04:21:11Z"},{"alias_kind":"pith_short_16","alias_value":"K5LLZ43WZ46QIBEP","created_at":"2026-07-05T04:21:11Z"},{"alias_kind":"pith_short_8","alias_value":"K5LLZ43W","created_at":"2026-07-05T04:21:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:K5LLZ43WZ46QIBEPTIOVJHWY34","target":"record","payload":{"canonical_record":{"source":{"id":"2203.15386","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-29T09:26:22Z","cross_cats_sorted":["cs.NE","math.OC"],"title_canon_sha256":"3def099beb1b7fc46fbcb826760c894dc55c59a2f5e19d552429e25807dc7209","abstract_canon_sha256":"b0387c081e494a5f087d660977ee3a0730726d3bfd0537777d95dc4a7476015a"},"schema_version":"1.0"},"canonical_sha256":"5756bcf376cf3d04048f9a1d549ed8df2b22cc2fa3c0e7c12c78faee0acb1b44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:21:11.948638Z","signature_b64":"PDh7M+mZq6yKETIBFtQhp6uUH//Spsp40EvF+nrms3ub5BXam4ZJkWQhOUoYP+Cd3f97zcxq57p/IG6efe0WDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5756bcf376cf3d04048f9a1d549ed8df2b22cc2fa3c0e7c12c78faee0acb1b44","last_reissued_at":"2026-07-05T04:21:11.948187Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:21:11.948187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2203.15386","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-07-05T04:21:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dZMdgXzn12Z+bkcNBo1abXUGKOS+fNDEU4wY+gp/KztKbC5oz/2zww8X/UOz40fB/ERJzq5KVwDi00DF8A+NBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:19:27.845252Z"},"content_sha256":"dc1ef5f42e2f8a1a70aa0b5ae447af39565e5ab3c078cfcfbdfeded15f67ba5e","schema_version":"1.0","event_id":"sha256:dc1ef5f42e2f8a1a70aa0b5ae447af39565e5ab3c078cfcfbdfeded15f67ba5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:K5LLZ43WZ46QIBEPTIOVJHWY34","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pareto Set Learning for Neural Multi-objective Combinatorial Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NE","math.OC"],"primary_cat":"cs.LG","authors_text":"Qingfu Zhang, Xi Lin, Zhiyuan Yang","submitted_at":"2022-03-29T09:26:22Z","abstract_excerpt":"Multiobjective combinatorial optimization (MOCO) problems can be found in many real-world applications. However, exactly solving these problems would be very challenging, particularly when they are NP-hard. Many handcrafted heuristic methods have been proposed to tackle different MOCO problems over the past decades. In this work, we generalize the idea of neural combinatorial optimization, and develop a learning-based approach to approximate the whole Pareto set for a given MOCO problem without further search procedure. We propose a single preference-conditioned model to directly generate appr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.15386","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2203.15386/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:21:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K6XQcN2hALXuxAw2QBB5wYDL0BUh1uQiCrxKRz/pg6kfpkhB//lVFGbgZpfIxxzgbwchqt1Yww+Zn5oOn/kxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T09:19:27.846215Z"},"content_sha256":"de797184ed0b9abf39e33d29d7a1a764ac53c2a80de9d3198c78087731cf5829","schema_version":"1.0","event_id":"sha256:de797184ed0b9abf39e33d29d7a1a764ac53c2a80de9d3198c78087731cf5829"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K5LLZ43WZ46QIBEPTIOVJHWY34/bundle.json","state_url":"https://pith.science/pith/K5LLZ43WZ46QIBEPTIOVJHWY34/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K5LLZ43WZ46QIBEPTIOVJHWY34/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-08-06T09:19:27Z","links":{"resolver":"https://pith.science/pith/K5LLZ43WZ46QIBEPTIOVJHWY34","bundle":"https://pith.science/pith/K5LLZ43WZ46QIBEPTIOVJHWY34/bundle.json","state":"https://pith.science/pith/K5LLZ43WZ46QIBEPTIOVJHWY34/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K5LLZ43WZ46QIBEPTIOVJHWY34/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:K5LLZ43WZ46QIBEPTIOVJHWY34","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":"b0387c081e494a5f087d660977ee3a0730726d3bfd0537777d95dc4a7476015a","cross_cats_sorted":["cs.NE","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-29T09:26:22Z","title_canon_sha256":"3def099beb1b7fc46fbcb826760c894dc55c59a2f5e19d552429e25807dc7209"},"schema_version":"1.0","source":{"id":"2203.15386","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.15386","created_at":"2026-07-05T04:21:11Z"},{"alias_kind":"arxiv_version","alias_value":"2203.15386v2","created_at":"2026-07-05T04:21:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.15386","created_at":"2026-07-05T04:21:11Z"},{"alias_kind":"pith_short_12","alias_value":"K5LLZ43WZ46Q","created_at":"2026-07-05T04:21:11Z"},{"alias_kind":"pith_short_16","alias_value":"K5LLZ43WZ46QIBEP","created_at":"2026-07-05T04:21:11Z"},{"alias_kind":"pith_short_8","alias_value":"K5LLZ43W","created_at":"2026-07-05T04:21:11Z"}],"graph_snapshots":[{"event_id":"sha256:de797184ed0b9abf39e33d29d7a1a764ac53c2a80de9d3198c78087731cf5829","target":"graph","created_at":"2026-07-05T04:21:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2203.15386/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multiobjective combinatorial optimization (MOCO) problems can be found in many real-world applications. However, exactly solving these problems would be very challenging, particularly when they are NP-hard. Many handcrafted heuristic methods have been proposed to tackle different MOCO problems over the past decades. In this work, we generalize the idea of neural combinatorial optimization, and develop a learning-based approach to approximate the whole Pareto set for a given MOCO problem without further search procedure. We propose a single preference-conditioned model to directly generate appr","authors_text":"Qingfu Zhang, Xi Lin, Zhiyuan Yang","cross_cats":["cs.NE","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-29T09:26:22Z","title":"Pareto Set Learning for Neural Multi-objective Combinatorial Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.15386","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:dc1ef5f42e2f8a1a70aa0b5ae447af39565e5ab3c078cfcfbdfeded15f67ba5e","target":"record","created_at":"2026-07-05T04:21:11Z","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":"b0387c081e494a5f087d660977ee3a0730726d3bfd0537777d95dc4a7476015a","cross_cats_sorted":["cs.NE","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-03-29T09:26:22Z","title_canon_sha256":"3def099beb1b7fc46fbcb826760c894dc55c59a2f5e19d552429e25807dc7209"},"schema_version":"1.0","source":{"id":"2203.15386","kind":"arxiv","version":2}},"canonical_sha256":"5756bcf376cf3d04048f9a1d549ed8df2b22cc2fa3c0e7c12c78faee0acb1b44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5756bcf376cf3d04048f9a1d549ed8df2b22cc2fa3c0e7c12c78faee0acb1b44","first_computed_at":"2026-07-05T04:21:11.948187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:21:11.948187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PDh7M+mZq6yKETIBFtQhp6uUH//Spsp40EvF+nrms3ub5BXam4ZJkWQhOUoYP+Cd3f97zcxq57p/IG6efe0WDg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:21:11.948638Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.15386","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc1ef5f42e2f8a1a70aa0b5ae447af39565e5ab3c078cfcfbdfeded15f67ba5e","sha256:de797184ed0b9abf39e33d29d7a1a764ac53c2a80de9d3198c78087731cf5829"],"state_sha256":"77852e722fd1def8511d096ed4ecc78b7a2f208aa037bdf2ef13c326c2814510"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8wvjOcNwsIcRYJQ1fNCBXvWodcop/GVrdwwdpPSnONNowbopL0cdexLcaYipzxv+H5Uq6XhWl+zvVrwL136WBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T09:19:27.855955Z","bundle_sha256":"8ea002c1d47d6e1b907f458d3936781bfa7abcebcdbecb36809b07f193311951"}}