{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HWAY2O3YJTUU3GZFET2Q7M4PW4","short_pith_number":"pith:HWAY2O3Y","schema_version":"1.0","canonical_sha256":"3d818d3b784ce94d9b2524f50fb38fb72c06741c606c5244f5e4a579a83144d9","source":{"kind":"arxiv","id":"2501.02749","version":2},"attestation_state":"computed","paper":{"title":"Intelligent logistics management robot path planning algorithm integrating transformer and GCN network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Ankai Liang, Hao Luo, Jianjun Wei, Ruxue Jiang, Shuchen Zhao, Zhongjin Xu","submitted_at":"2025-01-06T03:53:02Z","abstract_excerpt":"This research delves into advanced route optimization for robots in smart logistics, leveraging a fusion of Transformer architectures, Graph Neural Networks (GNNs), and Generative Adversarial Networks (GANs). The approach utilizes a graph-based representation encompassing geographical data, cargo allocation, and robot dynamics, addressing both spatial and resource limitations to refine route efficiency. Through extensive testing with authentic logistics datasets, the proposed method achieves notable improvements, including a 15% reduction in travel distance, a 20% boost in time efficiency, and"},"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":"2501.02749","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-01-06T03:53:02Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"33113a023efd725783e9e7d7ad4e1fb9fdd4a268093e6564f2faab7e21255252","abstract_canon_sha256":"e954ed4caa7e7fe2a07a9bd77ad29e40a233ff7cae6794022fa1becee7cc7cfd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:29:32.131763Z","signature_b64":"iyGktsxmzMQD32jUIYHZX6JitoZwHeJ3qYNHzcpH7bR/hhg0O9nwo9i0thyx4VvBcFaDUNJYDnZ3Q9IbaGdQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d818d3b784ce94d9b2524f50fb38fb72c06741c606c5244f5e4a579a83144d9","last_reissued_at":"2026-07-05T10:29:32.130939Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:29:32.130939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Intelligent logistics management robot path planning algorithm integrating transformer and GCN network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Ankai Liang, Hao Luo, Jianjun Wei, Ruxue Jiang, Shuchen Zhao, Zhongjin Xu","submitted_at":"2025-01-06T03:53:02Z","abstract_excerpt":"This research delves into advanced route optimization for robots in smart logistics, leveraging a fusion of Transformer architectures, Graph Neural Networks (GNNs), and Generative Adversarial Networks (GANs). The approach utilizes a graph-based representation encompassing geographical data, cargo allocation, and robot dynamics, addressing both spatial and resource limitations to refine route efficiency. Through extensive testing with authentic logistics datasets, the proposed method achieves notable improvements, including a 15% reduction in travel distance, a 20% boost in time efficiency, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.02749","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/2501.02749/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":"2501.02749","created_at":"2026-07-05T10:29:32.131046+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.02749v2","created_at":"2026-07-05T10:29:32.131046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.02749","created_at":"2026-07-05T10:29:32.131046+00:00"},{"alias_kind":"pith_short_12","alias_value":"HWAY2O3YJTUU","created_at":"2026-07-05T10:29:32.131046+00:00"},{"alias_kind":"pith_short_16","alias_value":"HWAY2O3YJTUU3GZF","created_at":"2026-07-05T10:29:32.131046+00:00"},{"alias_kind":"pith_short_8","alias_value":"HWAY2O3Y","created_at":"2026-07-05T10:29:32.131046+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.05907","citing_title":"EvolvingAgent: Curriculum Self-evolving Agent with Continual World Model for Long-Horizon Tasks","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HWAY2O3YJTUU3GZFET2Q7M4PW4","json":"https://pith.science/pith/HWAY2O3YJTUU3GZFET2Q7M4PW4.json","graph_json":"https://pith.science/api/pith-number/HWAY2O3YJTUU3GZFET2Q7M4PW4/graph.json","events_json":"https://pith.science/api/pith-number/HWAY2O3YJTUU3GZFET2Q7M4PW4/events.json","paper":"https://pith.science/paper/HWAY2O3Y"},"agent_actions":{"view_html":"https://pith.science/pith/HWAY2O3YJTUU3GZFET2Q7M4PW4","download_json":"https://pith.science/pith/HWAY2O3YJTUU3GZFET2Q7M4PW4.json","view_paper":"https://pith.science/paper/HWAY2O3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.02749&json=true","fetch_graph":"https://pith.science/api/pith-number/HWAY2O3YJTUU3GZFET2Q7M4PW4/graph.json","fetch_events":"https://pith.science/api/pith-number/HWAY2O3YJTUU3GZFET2Q7M4PW4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HWAY2O3YJTUU3GZFET2Q7M4PW4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HWAY2O3YJTUU3GZFET2Q7M4PW4/action/storage_attestation","attest_author":"https://pith.science/pith/HWAY2O3YJTUU3GZFET2Q7M4PW4/action/author_attestation","sign_citation":"https://pith.science/pith/HWAY2O3YJTUU3GZFET2Q7M4PW4/action/citation_signature","submit_replication":"https://pith.science/pith/HWAY2O3YJTUU3GZFET2Q7M4PW4/action/replication_record"}},"created_at":"2026-07-05T10:29:32.131046+00:00","updated_at":"2026-07-05T10:29:32.131046+00:00"}