{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GHL5N2KTQ6WAJU2VFAHDN3463Y","short_pith_number":"pith:GHL5N2KT","canonical_record":{"source":{"id":"1201.0232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:36:12Z","cross_cats_sorted":[],"title_canon_sha256":"8bf8bfaf0de1dee7e43b11011905e8315f794c40151070de36ff0669b8a406ff","abstract_canon_sha256":"9e74a74be94d7661b231fa4fb7a570652bb824d550b16db7cafaed22b7eac8fa"},"schema_version":"1.0"},"canonical_sha256":"31d7d6e95387ac04d355280e36ef9ede1d1a3746a03b7d3ff974db232fd58bfa","source":{"kind":"arxiv","id":"1201.0232","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0232","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0232v1","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0232","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"GHL5N2KTQ6WA","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"GHL5N2KTQ6WAJU2V","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"GHL5N2KT","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GHL5N2KTQ6WAJU2VFAHDN3463Y","target":"record","payload":{"canonical_record":{"source":{"id":"1201.0232","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:36:12Z","cross_cats_sorted":[],"title_canon_sha256":"8bf8bfaf0de1dee7e43b11011905e8315f794c40151070de36ff0669b8a406ff","abstract_canon_sha256":"9e74a74be94d7661b231fa4fb7a570652bb824d550b16db7cafaed22b7eac8fa"},"schema_version":"1.0"},"canonical_sha256":"31d7d6e95387ac04d355280e36ef9ede1d1a3746a03b7d3ff974db232fd58bfa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:25.741694Z","signature_b64":"hI/8GjQ/OLRovGGWp4U08njfvSHZ/CQqVFcmKiVQSN7rdgs1zQzU4jzjOp2mYBjdL9s55XPFJTTTSKEDE7JvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31d7d6e95387ac04d355280e36ef9ede1d1a3746a03b7d3ff974db232fd58bfa","last_reissued_at":"2026-05-18T04:05:25.741064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:25.741064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.0232","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-18T04:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MfS/xfGGtW17d7QmrWVzVqRRXTNSfUm1pk4idHqZm0w5Iuv0Wkm+FM3l94F3WjNk4H8P/C4zppLJdLh1xSVhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:17:00.381776Z"},"content_sha256":"297f67677066ec2d0edf943c05283b53f80b9d469ba9b6334771372ab2983313","schema_version":"1.0","event_id":"sha256:297f67677066ec2d0edf943c05283b53f80b9d469ba9b6334771372ab2983313"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GHL5N2KTQ6WAJU2VFAHDN3463Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relational Approach for Shortest Path Discovery over Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Jeffrey Xu Yu, Jiashuai Zhou, Jun Gao, Ruoming Jin, Tengjiao Wang, Xiao Jiang","submitted_at":"2011-12-31T05:36:12Z","abstract_excerpt":"With the rapid growth of large graphs, we cannot assume that graphs can still be fully loaded into memory, thus the disk-based graph operation is inevitable. In this paper, we take the shortest path discovery as an example to investigate the technique issues when leveraging existing infrastructure of relational database (RDB) in the graph data management. Based on the observation that a variety of graph search queries can be implemented by iterative operations including selecting frontier nodes from visited nodes, making expansion from the selected frontier nodes, and merging the expanded node"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0232","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-18T04:05:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9DwEeDJFria5Q30R9xpyIXYDlILuojOufBGVN+3uXCEvqQMB+sfHNvX2zxBJL0AhHg+uC3gzNnR6HLm4OLU/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T03:17:00.382501Z"},"content_sha256":"8a849881cc8f9cd67732a52eb288c8423ec69b2da3f6dae8e0cc2fc12cee6bb8","schema_version":"1.0","event_id":"sha256:8a849881cc8f9cd67732a52eb288c8423ec69b2da3f6dae8e0cc2fc12cee6bb8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GHL5N2KTQ6WAJU2VFAHDN3463Y/bundle.json","state_url":"https://pith.science/pith/GHL5N2KTQ6WAJU2VFAHDN3463Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GHL5N2KTQ6WAJU2VFAHDN3463Y/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-12T03:17:00Z","links":{"resolver":"https://pith.science/pith/GHL5N2KTQ6WAJU2VFAHDN3463Y","bundle":"https://pith.science/pith/GHL5N2KTQ6WAJU2VFAHDN3463Y/bundle.json","state":"https://pith.science/pith/GHL5N2KTQ6WAJU2VFAHDN3463Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GHL5N2KTQ6WAJU2VFAHDN3463Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GHL5N2KTQ6WAJU2VFAHDN3463Y","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":"9e74a74be94d7661b231fa4fb7a570652bb824d550b16db7cafaed22b7eac8fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:36:12Z","title_canon_sha256":"8bf8bfaf0de1dee7e43b11011905e8315f794c40151070de36ff0669b8a406ff"},"schema_version":"1.0","source":{"id":"1201.0232","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.0232","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"1201.0232v1","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.0232","created_at":"2026-05-18T04:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"GHL5N2KTQ6WA","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"GHL5N2KTQ6WAJU2V","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"GHL5N2KT","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:8a849881cc8f9cd67732a52eb288c8423ec69b2da3f6dae8e0cc2fc12cee6bb8","target":"graph","created_at":"2026-05-18T04:05:25Z","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":"With the rapid growth of large graphs, we cannot assume that graphs can still be fully loaded into memory, thus the disk-based graph operation is inevitable. In this paper, we take the shortest path discovery as an example to investigate the technique issues when leveraging existing infrastructure of relational database (RDB) in the graph data management. Based on the observation that a variety of graph search queries can be implemented by iterative operations including selecting frontier nodes from visited nodes, making expansion from the selected frontier nodes, and merging the expanded node","authors_text":"Jeffrey Xu Yu, Jiashuai Zhou, Jun Gao, Ruoming Jin, Tengjiao Wang, Xiao Jiang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:36:12Z","title":"Relational Approach for Shortest Path Discovery over Large Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.0232","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:297f67677066ec2d0edf943c05283b53f80b9d469ba9b6334771372ab2983313","target":"record","created_at":"2026-05-18T04:05:25Z","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":"9e74a74be94d7661b231fa4fb7a570652bb824d550b16db7cafaed22b7eac8fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2011-12-31T05:36:12Z","title_canon_sha256":"8bf8bfaf0de1dee7e43b11011905e8315f794c40151070de36ff0669b8a406ff"},"schema_version":"1.0","source":{"id":"1201.0232","kind":"arxiv","version":1}},"canonical_sha256":"31d7d6e95387ac04d355280e36ef9ede1d1a3746a03b7d3ff974db232fd58bfa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31d7d6e95387ac04d355280e36ef9ede1d1a3746a03b7d3ff974db232fd58bfa","first_computed_at":"2026-05-18T04:05:25.741064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:25.741064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hI/8GjQ/OLRovGGWp4U08njfvSHZ/CQqVFcmKiVQSN7rdgs1zQzU4jzjOp2mYBjdL9s55XPFJTTTSKEDE7JvCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:25.741694Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.0232","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:297f67677066ec2d0edf943c05283b53f80b9d469ba9b6334771372ab2983313","sha256:8a849881cc8f9cd67732a52eb288c8423ec69b2da3f6dae8e0cc2fc12cee6bb8"],"state_sha256":"c86bf4b6753073c62fade14c51d15a9b7a5c95715dec7fad2447dd8621d307ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8rWOb96PxzowlmkdQpDmQplam3ZNJCiLxtkuUFD3I8m03952KY+uws+n+wQfbuooul7dXoxee+NykU143klAAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T03:17:00.386837Z","bundle_sha256":"47a2c7337307a9ddd6da8d731a7b21502ed3404e3d1417fcc4308a7b43a5a41f"}}