{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:EIMCAQHZCPXTGR7QHHDCBR5YMA","short_pith_number":"pith:EIMCAQHZ","canonical_record":{"source":{"id":"2201.00695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-12-24T10:52:47Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"1a33f7c1db54770a96afcf250b0a47ea5cb5245fca2dbca1a0d489cd522fed28","abstract_canon_sha256":"1423022f00d681a2c768783f2cb089ab8cfd57afa9b21c5c37ad3937c3728126"},"schema_version":"1.0"},"canonical_sha256":"22182040f913ef3347f039c620c7b8602f0b9a80e3b7b7ee0ad7cec00b4d2837","source":{"kind":"arxiv","id":"2201.00695","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.00695","created_at":"2026-07-05T03:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"2201.00695v1","created_at":"2026-07-05T03:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.00695","created_at":"2026-07-05T03:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"EIMCAQHZCPXT","created_at":"2026-07-05T03:45:05Z"},{"alias_kind":"pith_short_16","alias_value":"EIMCAQHZCPXTGR7Q","created_at":"2026-07-05T03:45:05Z"},{"alias_kind":"pith_short_8","alias_value":"EIMCAQHZ","created_at":"2026-07-05T03:45:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:EIMCAQHZCPXTGR7QHHDCBR5YMA","target":"record","payload":{"canonical_record":{"source":{"id":"2201.00695","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-12-24T10:52:47Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"1a33f7c1db54770a96afcf250b0a47ea5cb5245fca2dbca1a0d489cd522fed28","abstract_canon_sha256":"1423022f00d681a2c768783f2cb089ab8cfd57afa9b21c5c37ad3937c3728126"},"schema_version":"1.0"},"canonical_sha256":"22182040f913ef3347f039c620c7b8602f0b9a80e3b7b7ee0ad7cec00b4d2837","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:45:05.529981Z","signature_b64":"TxvmvRXtsrqxTEVu+641ZbpQoMQtyjICzYg+pwYpj8j+nj+bRh+F6OJ5hCTXJ+jbBgSO6eCV+OXTL1Vb+liEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22182040f913ef3347f039c620c7b8602f0b9a80e3b7b7ee0ad7cec00b4d2837","last_reissued_at":"2026-07-05T03:45:05.529519Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:45:05.529519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2201.00695","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-07-05T03:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dwZf28SmJfkiKXjv5vL5a/2iBWKOQUv3KB5Gz1H/I73zfr9zWWmvWnP1m51Q5AVWtYtH0toDb+SIynKJnaEVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T18:24:11.276914Z"},"content_sha256":"6107cb458af71f57ac5fe8929a4732ab41586b7b76a21c3001ae43165b9bfedc","schema_version":"1.0","event_id":"sha256:6107cb458af71f57ac5fe8929a4732ab41586b7b76a21c3001ae43165b9bfedc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:EIMCAQHZCPXTGR7QHHDCBR5YMA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Combinatorial Optimization Model Using Learning-to-Rank Distillation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.IR","authors_text":"Honguk Woo, Hyunsung Lee, Sangwoo Cho","submitted_at":"2021-12-24T10:52:47Z","abstract_excerpt":"Recently, deep reinforcement learning (RL) has proven its feasibility in solving combinatorial optimization problems (COPs). The learning-to-rank techniques have been studied in the field of information retrieval. While several COPs can be formulated as the prioritization of input items, as is common in the information retrieval, it has not been fully explored how the learning-to-rank techniques can be incorporated into deep RL for COPs. In this paper, we present the learning-to-rank distillation-based COP framework, where a high-performance ranking policy obtained by RL for a COP can be disti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.00695","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2201.00695/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-05T03:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lY/UYGdADGzv6AQ+EyYEejNMEaDoWLu061P5H05zxa9ByDLt2q9l0QnmnoMJ2WXf5gY1j4Ooa+xiy42ymr3yCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T18:24:11.277863Z"},"content_sha256":"c57b3f227fbdef30b4398954fe4056a90898686eb9fab3be64c571e9a9c6a968","schema_version":"1.0","event_id":"sha256:c57b3f227fbdef30b4398954fe4056a90898686eb9fab3be64c571e9a9c6a968"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EIMCAQHZCPXTGR7QHHDCBR5YMA/bundle.json","state_url":"https://pith.science/pith/EIMCAQHZCPXTGR7QHHDCBR5YMA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EIMCAQHZCPXTGR7QHHDCBR5YMA/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-12T18:24:11Z","links":{"resolver":"https://pith.science/pith/EIMCAQHZCPXTGR7QHHDCBR5YMA","bundle":"https://pith.science/pith/EIMCAQHZCPXTGR7QHHDCBR5YMA/bundle.json","state":"https://pith.science/pith/EIMCAQHZCPXTGR7QHHDCBR5YMA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EIMCAQHZCPXTGR7QHHDCBR5YMA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:EIMCAQHZCPXTGR7QHHDCBR5YMA","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":"1423022f00d681a2c768783f2cb089ab8cfd57afa9b21c5c37ad3937c3728126","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-12-24T10:52:47Z","title_canon_sha256":"1a33f7c1db54770a96afcf250b0a47ea5cb5245fca2dbca1a0d489cd522fed28"},"schema_version":"1.0","source":{"id":"2201.00695","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2201.00695","created_at":"2026-07-05T03:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"2201.00695v1","created_at":"2026-07-05T03:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.00695","created_at":"2026-07-05T03:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"EIMCAQHZCPXT","created_at":"2026-07-05T03:45:05Z"},{"alias_kind":"pith_short_16","alias_value":"EIMCAQHZCPXTGR7Q","created_at":"2026-07-05T03:45:05Z"},{"alias_kind":"pith_short_8","alias_value":"EIMCAQHZ","created_at":"2026-07-05T03:45:05Z"}],"graph_snapshots":[{"event_id":"sha256:c57b3f227fbdef30b4398954fe4056a90898686eb9fab3be64c571e9a9c6a968","target":"graph","created_at":"2026-07-05T03:45:05Z","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/2201.00695/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Recently, deep reinforcement learning (RL) has proven its feasibility in solving combinatorial optimization problems (COPs). The learning-to-rank techniques have been studied in the field of information retrieval. While several COPs can be formulated as the prioritization of input items, as is common in the information retrieval, it has not been fully explored how the learning-to-rank techniques can be incorporated into deep RL for COPs. In this paper, we present the learning-to-rank distillation-based COP framework, where a high-performance ranking policy obtained by RL for a COP can be disti","authors_text":"Honguk Woo, Hyunsung Lee, Sangwoo Cho","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-12-24T10:52:47Z","title":"An Efficient Combinatorial Optimization Model Using Learning-to-Rank Distillation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.00695","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:6107cb458af71f57ac5fe8929a4732ab41586b7b76a21c3001ae43165b9bfedc","target":"record","created_at":"2026-07-05T03:45:05Z","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":"1423022f00d681a2c768783f2cb089ab8cfd57afa9b21c5c37ad3937c3728126","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2021-12-24T10:52:47Z","title_canon_sha256":"1a33f7c1db54770a96afcf250b0a47ea5cb5245fca2dbca1a0d489cd522fed28"},"schema_version":"1.0","source":{"id":"2201.00695","kind":"arxiv","version":1}},"canonical_sha256":"22182040f913ef3347f039c620c7b8602f0b9a80e3b7b7ee0ad7cec00b4d2837","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22182040f913ef3347f039c620c7b8602f0b9a80e3b7b7ee0ad7cec00b4d2837","first_computed_at":"2026-07-05T03:45:05.529519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:45:05.529519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TxvmvRXtsrqxTEVu+641ZbpQoMQtyjICzYg+pwYpj8j+nj+bRh+F6OJ5hCTXJ+jbBgSO6eCV+OXTL1Vb+liEDg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:45:05.529981Z","signed_message":"canonical_sha256_bytes"},"source_id":"2201.00695","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6107cb458af71f57ac5fe8929a4732ab41586b7b76a21c3001ae43165b9bfedc","sha256:c57b3f227fbdef30b4398954fe4056a90898686eb9fab3be64c571e9a9c6a968"],"state_sha256":"0543c9b9471ff6b6ba5ba59f31cfc97406fcebc366ec37aba05c9769702f7b59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E5EtgPqszttADmGANOi5jLpelPwKlePsQaw1qOtV/ZQeL0SyRzcs4ZmqbJfb/0HkLlFIOcUIb7nmmIm3g/xcAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T18:24:11.285532Z","bundle_sha256":"05342bb74fd3beec8d7ac1e2250aab06d668eefac36d7ddf4205a9a96c772da7"}}