{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JGWMHGVEDIJIJJSJYZNPNMQOKN","short_pith_number":"pith:JGWMHGVE","canonical_record":{"source":{"id":"1809.07912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-09-21T01:58:00Z","cross_cats_sorted":[],"title_canon_sha256":"d956c3e1133d209e84f81997c2946c29f10bfeefc9a38946adbc1faa5c8d3f45","abstract_canon_sha256":"b1a34df6bd02a41b993fa9c32951dd05db7764f1eecbc7ec66ad2919d0aee252"},"schema_version":"1.0"},"canonical_sha256":"49acc39aa41a1284a649c65af6b20e537ae842e380d971894485ceafd7c6d19d","source":{"kind":"arxiv","id":"1809.07912","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07912","created_at":"2026-05-18T00:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07912v1","created_at":"2026-05-18T00:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07912","created_at":"2026-05-18T00:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"JGWMHGVEDIJI","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JGWMHGVEDIJIJJSJ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JGWMHGVE","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JGWMHGVEDIJIJJSJYZNPNMQOKN","target":"record","payload":{"canonical_record":{"source":{"id":"1809.07912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-09-21T01:58:00Z","cross_cats_sorted":[],"title_canon_sha256":"d956c3e1133d209e84f81997c2946c29f10bfeefc9a38946adbc1faa5c8d3f45","abstract_canon_sha256":"b1a34df6bd02a41b993fa9c32951dd05db7764f1eecbc7ec66ad2919d0aee252"},"schema_version":"1.0"},"canonical_sha256":"49acc39aa41a1284a649c65af6b20e537ae842e380d971894485ceafd7c6d19d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:10.932065Z","signature_b64":"7IN/pEXsxFiFsdNUuxFKitBLA7wQSYnu/y/r5fkCRo/8amUesN9ahR0myP0iJ9khbjtuwyqDr3hHEQN3ySFdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49acc39aa41a1284a649c65af6b20e537ae842e380d971894485ceafd7c6d19d","last_reissued_at":"2026-05-18T00:05:10.931414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:10.931414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.07912","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-05-18T00:05:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uDHqu2seCuwiZBpp3B/iIwBHNEL7180ZxxbQNL7DBysRVusYKKx0a7jF2UgwGqU7w1XhUn/E1wWaPVwVpggUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:55:21.009591Z"},"content_sha256":"ed2e62a43ac20901bafb99e9b37a2a812cda2837e18ea50a96fa728ccb8e20ed","schema_version":"1.0","event_id":"sha256:ed2e62a43ac20901bafb99e9b37a2a812cda2837e18ea50a96fa728ccb8e20ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JGWMHGVEDIJIJJSJYZNPNMQOKN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cloud-Based Approximate Constrained Shortest Distance Queries Over Encrypted Graphs With Privacy Protection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Baoli Ma, Jiankun Hu, Liehuang Zhu, Meng Shen, Rashid Mijumbi, Xiaojiang Du","submitted_at":"2018-09-21T01:58:00Z","abstract_excerpt":"Constrained shortest distance (CSD) querying is one of the fundamental graph query primitives, which finds the shortest distance from an origin to a destination in a graph with a constraint that the total cost does not exceed a given threshold. CSD querying has a wide range of applications, such as routing in telecommunications and transportation. With an increasing prevalence of cloud computing paradigm, graph owners desire to outsource their graphs to cloud servers. In order to protect sensitive information, these graphs are usually encrypted before being outsourced to the cloud. This, howev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07912","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":""},"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-05-18T00:05:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s/nBJRpXU85fKcPlZeW1oFWgiehhti2N146E+ZP5Ba9cMiq17RyLveP+TICQHDU2UCBi9xKQbzPlNQ0wiMDoCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:55:21.009942Z"},"content_sha256":"c0b431337655e704631e70975cd0a80721e90c6509c3fd303912fba0496239a5","schema_version":"1.0","event_id":"sha256:c0b431337655e704631e70975cd0a80721e90c6509c3fd303912fba0496239a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JGWMHGVEDIJIJJSJYZNPNMQOKN/bundle.json","state_url":"https://pith.science/pith/JGWMHGVEDIJIJJSJYZNPNMQOKN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JGWMHGVEDIJIJJSJYZNPNMQOKN/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-06-02T03:55:21Z","links":{"resolver":"https://pith.science/pith/JGWMHGVEDIJIJJSJYZNPNMQOKN","bundle":"https://pith.science/pith/JGWMHGVEDIJIJJSJYZNPNMQOKN/bundle.json","state":"https://pith.science/pith/JGWMHGVEDIJIJJSJYZNPNMQOKN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JGWMHGVEDIJIJJSJYZNPNMQOKN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JGWMHGVEDIJIJJSJYZNPNMQOKN","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":"b1a34df6bd02a41b993fa9c32951dd05db7764f1eecbc7ec66ad2919d0aee252","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-09-21T01:58:00Z","title_canon_sha256":"d956c3e1133d209e84f81997c2946c29f10bfeefc9a38946adbc1faa5c8d3f45"},"schema_version":"1.0","source":{"id":"1809.07912","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.07912","created_at":"2026-05-18T00:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"1809.07912v1","created_at":"2026-05-18T00:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07912","created_at":"2026-05-18T00:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"JGWMHGVEDIJI","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JGWMHGVEDIJIJJSJ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JGWMHGVE","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:c0b431337655e704631e70975cd0a80721e90c6509c3fd303912fba0496239a5","target":"graph","created_at":"2026-05-18T00:05:10Z","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"},"paper":{"abstract_excerpt":"Constrained shortest distance (CSD) querying is one of the fundamental graph query primitives, which finds the shortest distance from an origin to a destination in a graph with a constraint that the total cost does not exceed a given threshold. CSD querying has a wide range of applications, such as routing in telecommunications and transportation. With an increasing prevalence of cloud computing paradigm, graph owners desire to outsource their graphs to cloud servers. In order to protect sensitive information, these graphs are usually encrypted before being outsourced to the cloud. This, howev","authors_text":"Baoli Ma, Jiankun Hu, Liehuang Zhu, Meng Shen, Rashid Mijumbi, Xiaojiang Du","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-09-21T01:58:00Z","title":"Cloud-Based Approximate Constrained Shortest Distance Queries Over Encrypted Graphs With Privacy Protection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07912","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:ed2e62a43ac20901bafb99e9b37a2a812cda2837e18ea50a96fa728ccb8e20ed","target":"record","created_at":"2026-05-18T00:05:10Z","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":"b1a34df6bd02a41b993fa9c32951dd05db7764f1eecbc7ec66ad2919d0aee252","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-09-21T01:58:00Z","title_canon_sha256":"d956c3e1133d209e84f81997c2946c29f10bfeefc9a38946adbc1faa5c8d3f45"},"schema_version":"1.0","source":{"id":"1809.07912","kind":"arxiv","version":1}},"canonical_sha256":"49acc39aa41a1284a649c65af6b20e537ae842e380d971894485ceafd7c6d19d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49acc39aa41a1284a649c65af6b20e537ae842e380d971894485ceafd7c6d19d","first_computed_at":"2026-05-18T00:05:10.931414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:10.931414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7IN/pEXsxFiFsdNUuxFKitBLA7wQSYnu/y/r5fkCRo/8amUesN9ahR0myP0iJ9khbjtuwyqDr3hHEQN3ySFdAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:10.932065Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.07912","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed2e62a43ac20901bafb99e9b37a2a812cda2837e18ea50a96fa728ccb8e20ed","sha256:c0b431337655e704631e70975cd0a80721e90c6509c3fd303912fba0496239a5"],"state_sha256":"1fe39f0ac32f28c3d62bcb202f01a79cdb396223b1e2f4709e619056ed19af77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lgd3e0ZQWCl+otwqCNSCEidLofA3WhdbdWW/lO14x9BU6O+qDkHfx5HtlFigoPQ5spBxeYS8UZH1zbZPMqKjCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:55:21.012002Z","bundle_sha256":"de27ac248e14da3074a4d573d6f304161cbcad7a32a21b51916a49122254a305"}}