{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:DEDKUZO7ROGRZLY2WGBD6NBYT3","short_pith_number":"pith:DEDKUZO7","canonical_record":{"source":{"id":"2603.08337","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-03-09T12:54:00Z","cross_cats_sorted":[],"title_canon_sha256":"af5b71320c70def6c44701fa7ac81aff1fb8a8eb6318614dfb0a6e2e49ed56e9","abstract_canon_sha256":"61079eb52bcc3be7ff1a9f2bfdc101245c8b049fbd5fd7e0f63723c8264f2ad9"},"schema_version":"1.0"},"canonical_sha256":"1906aa65df8b8d1caf1ab1823f34389ee8a7a4f01d0b4522b9b58afc9dd439a4","source":{"kind":"arxiv","id":"2603.08337","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.08337","created_at":"2026-07-20T01:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"2603.08337v2","created_at":"2026-07-20T01:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.08337","created_at":"2026-07-20T01:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"DEDKUZO7ROGR","created_at":"2026-07-20T01:18:28Z"},{"alias_kind":"pith_short_16","alias_value":"DEDKUZO7ROGRZLY2","created_at":"2026-07-20T01:18:28Z"},{"alias_kind":"pith_short_8","alias_value":"DEDKUZO7","created_at":"2026-07-20T01:18:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:DEDKUZO7ROGRZLY2WGBD6NBYT3","target":"record","payload":{"canonical_record":{"source":{"id":"2603.08337","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-03-09T12:54:00Z","cross_cats_sorted":[],"title_canon_sha256":"af5b71320c70def6c44701fa7ac81aff1fb8a8eb6318614dfb0a6e2e49ed56e9","abstract_canon_sha256":"61079eb52bcc3be7ff1a9f2bfdc101245c8b049fbd5fd7e0f63723c8264f2ad9"},"schema_version":"1.0"},"canonical_sha256":"1906aa65df8b8d1caf1ab1823f34389ee8a7a4f01d0b4522b9b58afc9dd439a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-20T01:18:28.609667Z","signature_b64":"zCIWOGkYQfS02uYOKp0OzItI6JSzJwqT7UNGGVDS1APQi63a5rxDzH/ccruPCz6HTI9gwS7Eul+MwH2jaWgDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1906aa65df8b8d1caf1ab1823f34389ee8a7a4f01d0b4522b9b58afc9dd439a4","last_reissued_at":"2026-07-20T01:18:28.608644Z","signature_status":"signed_v1","first_computed_at":"2026-07-20T01:18:28.608644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2603.08337","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-20T01:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l12BjAwQcQr/pS4NNquro8g8wWLHGu/yZLhBnP+mfPS4pGK1ZMc0wJJQVooTFrKk8/qTmK74HyXdxsdu/b86AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T05:23:20.132627Z"},"content_sha256":"a101d2a56b86c9ab987ee3345e602eafe1ada58c037c152962b299a4c72a643c","schema_version":"1.0","event_id":"sha256:a101d2a56b86c9ab987ee3345e602eafe1ada58c037c152962b299a4c72a643c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:DEDKUZO7ROGRZLY2WGBD6NBYT3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PRIME: Efficient Algorithm for Token Graph Routing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Haotian Xu, Jing Tang, Yuming Huang, Yuqing Zhu","submitted_at":"2026-03-09T12:54:00Z","abstract_excerpt":"Optimizing asset exchanges on blockchain-driven platforms poses a novel and challenging graph query optimization problem. In this model, assets represent vertices and exchanges form edges, recasting the graph query task as a routing problem over a large-scale, dynamic graph. However, the existing solutions fail to solve the problem efficiently due to the non-linear nature of the edge weights defined by a concave swap function. To address the challenge, we propose PRIME, a two-stage iterative graph algorithm designed for the Token Graph Routing Problem (TGRP). The first stage employs a pruned g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.08337","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/2603.08337/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-20T01:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PP7aaZ3easpFDNiKvOtTl868TAVBXT7o+09s5Fl/WtgQ/ao4NGa4NWIcg4mySJijFNl+LeJwUCy973PvzWn5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T05:23:20.133214Z"},"content_sha256":"ced319062dc6876ad72cb7d2ecdc9d3a7f7bf0cba8d306f2a195e5badaa9aad2","schema_version":"1.0","event_id":"sha256:ced319062dc6876ad72cb7d2ecdc9d3a7f7bf0cba8d306f2a195e5badaa9aad2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DEDKUZO7ROGRZLY2WGBD6NBYT3/bundle.json","state_url":"https://pith.science/pith/DEDKUZO7ROGRZLY2WGBD6NBYT3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DEDKUZO7ROGRZLY2WGBD6NBYT3/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-18T05:23:20Z","links":{"resolver":"https://pith.science/pith/DEDKUZO7ROGRZLY2WGBD6NBYT3","bundle":"https://pith.science/pith/DEDKUZO7ROGRZLY2WGBD6NBYT3/bundle.json","state":"https://pith.science/pith/DEDKUZO7ROGRZLY2WGBD6NBYT3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DEDKUZO7ROGRZLY2WGBD6NBYT3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DEDKUZO7ROGRZLY2WGBD6NBYT3","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":"61079eb52bcc3be7ff1a9f2bfdc101245c8b049fbd5fd7e0f63723c8264f2ad9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-03-09T12:54:00Z","title_canon_sha256":"af5b71320c70def6c44701fa7ac81aff1fb8a8eb6318614dfb0a6e2e49ed56e9"},"schema_version":"1.0","source":{"id":"2603.08337","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.08337","created_at":"2026-07-20T01:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"2603.08337v2","created_at":"2026-07-20T01:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.08337","created_at":"2026-07-20T01:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"DEDKUZO7ROGR","created_at":"2026-07-20T01:18:28Z"},{"alias_kind":"pith_short_16","alias_value":"DEDKUZO7ROGRZLY2","created_at":"2026-07-20T01:18:28Z"},{"alias_kind":"pith_short_8","alias_value":"DEDKUZO7","created_at":"2026-07-20T01:18:28Z"}],"graph_snapshots":[{"event_id":"sha256:ced319062dc6876ad72cb7d2ecdc9d3a7f7bf0cba8d306f2a195e5badaa9aad2","target":"graph","created_at":"2026-07-20T01:18:28Z","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/2603.08337/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Optimizing asset exchanges on blockchain-driven platforms poses a novel and challenging graph query optimization problem. In this model, assets represent vertices and exchanges form edges, recasting the graph query task as a routing problem over a large-scale, dynamic graph. However, the existing solutions fail to solve the problem efficiently due to the non-linear nature of the edge weights defined by a concave swap function. To address the challenge, we propose PRIME, a two-stage iterative graph algorithm designed for the Token Graph Routing Problem (TGRP). The first stage employs a pruned g","authors_text":"Haotian Xu, Jing Tang, Yuming Huang, Yuqing Zhu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-03-09T12:54:00Z","title":"PRIME: Efficient Algorithm for Token Graph Routing Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.08337","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:a101d2a56b86c9ab987ee3345e602eafe1ada58c037c152962b299a4c72a643c","target":"record","created_at":"2026-07-20T01:18:28Z","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":"61079eb52bcc3be7ff1a9f2bfdc101245c8b049fbd5fd7e0f63723c8264f2ad9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2026-03-09T12:54:00Z","title_canon_sha256":"af5b71320c70def6c44701fa7ac81aff1fb8a8eb6318614dfb0a6e2e49ed56e9"},"schema_version":"1.0","source":{"id":"2603.08337","kind":"arxiv","version":2}},"canonical_sha256":"1906aa65df8b8d1caf1ab1823f34389ee8a7a4f01d0b4522b9b58afc9dd439a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1906aa65df8b8d1caf1ab1823f34389ee8a7a4f01d0b4522b9b58afc9dd439a4","first_computed_at":"2026-07-20T01:18:28.608644Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-20T01:18:28.608644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zCIWOGkYQfS02uYOKp0OzItI6JSzJwqT7UNGGVDS1APQi63a5rxDzH/ccruPCz6HTI9gwS7Eul+MwH2jaWgDBA==","signature_status":"signed_v1","signed_at":"2026-07-20T01:18:28.609667Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.08337","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a101d2a56b86c9ab987ee3345e602eafe1ada58c037c152962b299a4c72a643c","sha256:ced319062dc6876ad72cb7d2ecdc9d3a7f7bf0cba8d306f2a195e5badaa9aad2"],"state_sha256":"66cdf77a1a3ec74b8d7ab2c4f79f9beb95fe4583f405089bfaba9147f0bc04eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s1kjsSa34Bxs7MK84THEi+f+mFQmn/laj+wsiVRM2u1Y21E7VzCyM310HUJk/VMrLiIgAO/vLwh5C7I/e2hxDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T05:23:20.138422Z","bundle_sha256":"2094d184293089597708dee03fbf6cfc8cfeefd56266d8a77af95fbfcd49378d"}}