{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:R57DDQUF226HLCS7JWJ2HV4RLX","short_pith_number":"pith:R57DDQUF","schema_version":"1.0","canonical_sha256":"8f7e31c285d6bc758a5f4d93a3d7915dc5787ede33c57414504b17a080bb382d","source":{"kind":"arxiv","id":"2205.12888","version":1},"attestation_state":"computed","paper":{"title":"Robust Reinforcement Learning on Graphs for Logistics optimization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Dmitrii Medvedev, Zangir Iklassov","submitted_at":"2022-05-25T16:16:28Z","abstract_excerpt":"Logistics optimization nowadays is becoming one of the hottest areas in the AI community. In the past year, significant advancements in the domain were achieved by representing the problem in a form of graph. Another promising area of research was to apply reinforcement learning algorithms to the above task. In our work, we made advantage of using both approaches and apply reinforcement learning on a graph. To do that, we have analyzed the most recent results in both fields and selected SOTA algorithms both from graph neural networks and reinforcement learning. Then, we combined selected model"},"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":"2205.12888","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2022-05-25T16:16:28Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"971f2a3d1e5f3fec9b094977f4972d328498369d7404c1038452e3b2adc108b1","abstract_canon_sha256":"0a3255865d8cc1efd50b3e203eb897d743e2fdec36bf568745a6ebfcce738074"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:26:30.544366Z","signature_b64":"oCYqm66KdSBRqdayeLcLjaU/+Xkbdal9V8oHC4kYXIoS4IeUGSefwIxgRx851sETucLS9/n8pRBpKE3X/0w2Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f7e31c285d6bc758a5f4d93a3d7915dc5787ede33c57414504b17a080bb382d","last_reissued_at":"2026-07-05T04:26:30.544015Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:26:30.544015Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Reinforcement Learning on Graphs for Logistics optimization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Dmitrii Medvedev, Zangir Iklassov","submitted_at":"2022-05-25T16:16:28Z","abstract_excerpt":"Logistics optimization nowadays is becoming one of the hottest areas in the AI community. In the past year, significant advancements in the domain were achieved by representing the problem in a form of graph. Another promising area of research was to apply reinforcement learning algorithms to the above task. In our work, we made advantage of using both approaches and apply reinforcement learning on a graph. To do that, we have analyzed the most recent results in both fields and selected SOTA algorithms both from graph neural networks and reinforcement learning. Then, we combined selected model"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.12888","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/2205.12888/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2205.12888","created_at":"2026-07-05T04:26:30.544065+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.12888v1","created_at":"2026-07-05T04:26:30.544065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.12888","created_at":"2026-07-05T04:26:30.544065+00:00"},{"alias_kind":"pith_short_12","alias_value":"R57DDQUF226H","created_at":"2026-07-05T04:26:30.544065+00:00"},{"alias_kind":"pith_short_16","alias_value":"R57DDQUF226HLCS7","created_at":"2026-07-05T04:26:30.544065+00:00"},{"alias_kind":"pith_short_8","alias_value":"R57DDQUF","created_at":"2026-07-05T04:26:30.544065+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/R57DDQUF226HLCS7JWJ2HV4RLX","json":"https://pith.science/pith/R57DDQUF226HLCS7JWJ2HV4RLX.json","graph_json":"https://pith.science/api/pith-number/R57DDQUF226HLCS7JWJ2HV4RLX/graph.json","events_json":"https://pith.science/api/pith-number/R57DDQUF226HLCS7JWJ2HV4RLX/events.json","paper":"https://pith.science/paper/R57DDQUF"},"agent_actions":{"view_html":"https://pith.science/pith/R57DDQUF226HLCS7JWJ2HV4RLX","download_json":"https://pith.science/pith/R57DDQUF226HLCS7JWJ2HV4RLX.json","view_paper":"https://pith.science/paper/R57DDQUF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.12888&json=true","fetch_graph":"https://pith.science/api/pith-number/R57DDQUF226HLCS7JWJ2HV4RLX/graph.json","fetch_events":"https://pith.science/api/pith-number/R57DDQUF226HLCS7JWJ2HV4RLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R57DDQUF226HLCS7JWJ2HV4RLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R57DDQUF226HLCS7JWJ2HV4RLX/action/storage_attestation","attest_author":"https://pith.science/pith/R57DDQUF226HLCS7JWJ2HV4RLX/action/author_attestation","sign_citation":"https://pith.science/pith/R57DDQUF226HLCS7JWJ2HV4RLX/action/citation_signature","submit_replication":"https://pith.science/pith/R57DDQUF226HLCS7JWJ2HV4RLX/action/replication_record"}},"created_at":"2026-07-05T04:26:30.544065+00:00","updated_at":"2026-07-05T04:26:30.544065+00:00"}