{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:J5NFV26SCUZP6ZK3Q25VABD5AI","short_pith_number":"pith:J5NFV26S","canonical_record":{"source":{"id":"1411.4266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-11-16T14:59:24Z","cross_cats_sorted":[],"title_canon_sha256":"1ca3fc4d4a8476ec750e16e3722ec7ec0a97f1b49903315c8a2084f34cf71b57","abstract_canon_sha256":"c3763090bcfe3880fab1feb76e392abba5015dc9f49563a2d9c080fc82cc5c5a"},"schema_version":"1.0"},"canonical_sha256":"4f5a5aebd21532ff655b86bb50047d021df4a61f1d369f3a1b7fc09eaa5dd103","source":{"kind":"arxiv","id":"1411.4266","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4266","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4266v1","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4266","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"J5NFV26SCUZP","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J5NFV26SCUZP6ZK3","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J5NFV26S","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:J5NFV26SCUZP6ZK3Q25VABD5AI","target":"record","payload":{"canonical_record":{"source":{"id":"1411.4266","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-11-16T14:59:24Z","cross_cats_sorted":[],"title_canon_sha256":"1ca3fc4d4a8476ec750e16e3722ec7ec0a97f1b49903315c8a2084f34cf71b57","abstract_canon_sha256":"c3763090bcfe3880fab1feb76e392abba5015dc9f49563a2d9c080fc82cc5c5a"},"schema_version":"1.0"},"canonical_sha256":"4f5a5aebd21532ff655b86bb50047d021df4a61f1d369f3a1b7fc09eaa5dd103","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:02.208424Z","signature_b64":"7HM/agJcd+eGPQUJVUGf6Ma+s/KgPFBNBZdptEr+WuntEuGkJZYsRgTWv79FZkTjZIxsXzIvuQLg64wromv3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f5a5aebd21532ff655b86bb50047d021df4a61f1d369f3a1b7fc09eaa5dd103","last_reissued_at":"2026-05-18T00:50:02.207789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:02.207789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.4266","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:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BMKw7CaYOaZUputKcx7GryUItQx9e01df8z8+Qp3nivYwAw3Dxdb3VM0YRnbl/8sZHa9Ou5DjTkRq0y5D/8OCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:02:17.618187Z"},"content_sha256":"4d779daa074d750a041034732214cf8e755ca275e57a4c240072bfbb1467e4d2","schema_version":"1.0","event_id":"sha256:4d779daa074d750a041034732214cf8e755ca275e57a4c240072bfbb1467e4d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:J5NFV26SCUZP6ZK3Q25VABD5AI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Big Graph Search: Challenges and Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Chunming Hu, Jia Li, Jinpeng Huai, Shuai Ma, Xuelian Lin","submitted_at":"2014-11-16T14:59:24Z","abstract_excerpt":"On one hand, compared with traditional relational and XML models, graphs have more expressive power and are widely used today. On the other hand, various applications of social computing trigger the pressing need of a new search paradigm. In this article, we argue that big graph search is the one filling this gap. To show this, we first introduce the application of graph search in various scenarios. We then formalize the graph search problem, and give an analysis of graph search from an evolutionary point of view, followed by the evidences from both the industry and academia. After that, we an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4266","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:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wSbEEZyHxhkSCnf6n801sCij4ZdNtw/083xWI5MEsIAPc9LRjxeT43Ar6mszoWQbwXHk8n6LwqiHGBTqBMOyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T13:02:17.618549Z"},"content_sha256":"9c3a677e0309b5792f71a228f2f5bfb1dccf9a01f0f51054ef89869cbbda7fa3","schema_version":"1.0","event_id":"sha256:9c3a677e0309b5792f71a228f2f5bfb1dccf9a01f0f51054ef89869cbbda7fa3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J5NFV26SCUZP6ZK3Q25VABD5AI/bundle.json","state_url":"https://pith.science/pith/J5NFV26SCUZP6ZK3Q25VABD5AI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J5NFV26SCUZP6ZK3Q25VABD5AI/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-26T13:02:17Z","links":{"resolver":"https://pith.science/pith/J5NFV26SCUZP6ZK3Q25VABD5AI","bundle":"https://pith.science/pith/J5NFV26SCUZP6ZK3Q25VABD5AI/bundle.json","state":"https://pith.science/pith/J5NFV26SCUZP6ZK3Q25VABD5AI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J5NFV26SCUZP6ZK3Q25VABD5AI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:J5NFV26SCUZP6ZK3Q25VABD5AI","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":"c3763090bcfe3880fab1feb76e392abba5015dc9f49563a2d9c080fc82cc5c5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-11-16T14:59:24Z","title_canon_sha256":"1ca3fc4d4a8476ec750e16e3722ec7ec0a97f1b49903315c8a2084f34cf71b57"},"schema_version":"1.0","source":{"id":"1411.4266","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.4266","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1411.4266v1","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.4266","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"J5NFV26SCUZP","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"J5NFV26SCUZP6ZK3","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"J5NFV26S","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:9c3a677e0309b5792f71a228f2f5bfb1dccf9a01f0f51054ef89869cbbda7fa3","target":"graph","created_at":"2026-05-18T00:50:02Z","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":"On one hand, compared with traditional relational and XML models, graphs have more expressive power and are widely used today. On the other hand, various applications of social computing trigger the pressing need of a new search paradigm. In this article, we argue that big graph search is the one filling this gap. To show this, we first introduce the application of graph search in various scenarios. We then formalize the graph search problem, and give an analysis of graph search from an evolutionary point of view, followed by the evidences from both the industry and academia. After that, we an","authors_text":"Chunming Hu, Jia Li, Jinpeng Huai, Shuai Ma, Xuelian Lin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-11-16T14:59:24Z","title":"Big Graph Search: Challenges and Techniques"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.4266","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:4d779daa074d750a041034732214cf8e755ca275e57a4c240072bfbb1467e4d2","target":"record","created_at":"2026-05-18T00:50:02Z","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":"c3763090bcfe3880fab1feb76e392abba5015dc9f49563a2d9c080fc82cc5c5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-11-16T14:59:24Z","title_canon_sha256":"1ca3fc4d4a8476ec750e16e3722ec7ec0a97f1b49903315c8a2084f34cf71b57"},"schema_version":"1.0","source":{"id":"1411.4266","kind":"arxiv","version":1}},"canonical_sha256":"4f5a5aebd21532ff655b86bb50047d021df4a61f1d369f3a1b7fc09eaa5dd103","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f5a5aebd21532ff655b86bb50047d021df4a61f1d369f3a1b7fc09eaa5dd103","first_computed_at":"2026-05-18T00:50:02.207789Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:02.207789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7HM/agJcd+eGPQUJVUGf6Ma+s/KgPFBNBZdptEr+WuntEuGkJZYsRgTWv79FZkTjZIxsXzIvuQLg64wromv3CQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:02.208424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.4266","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d779daa074d750a041034732214cf8e755ca275e57a4c240072bfbb1467e4d2","sha256:9c3a677e0309b5792f71a228f2f5bfb1dccf9a01f0f51054ef89869cbbda7fa3"],"state_sha256":"a41c876576dbcca523429aab4629125ee32f1525dba66c7cbed5c4e17f1fe9e2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r2R9PVLRwGbUx7bAGFvNKkjcC44X2SqGOqyT7vNKYF6PcAAEY5IDRafzgn6Gzy0ZQsd7dSEcrPmy46OfYOUPDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T13:02:17.620677Z","bundle_sha256":"5480134edd7c9dfda665ac8f0c1992a86a0a031465ebe9e1eb761f37e23644e0"}}