{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JCBBVBIFJ7CJKEAZJT2LFYYNYJ","short_pith_number":"pith:JCBBVBIF","canonical_record":{"source":{"id":"1405.6500","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-05-26T08:29:19Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"9b3eecb7f9557f4355a6a5dcdc14f0bed91a763510d4013f6d4c3b1243d0bd5f","abstract_canon_sha256":"a3068fd79cc0be4c5b3b799f36e9ac7453bfc84f1ab4d6a92d4b1cc37e920444"},"schema_version":"1.0"},"canonical_sha256":"48821a85054fc49510194cf4b2e30dc2678864208b35cad1ae47bbd89dbdccd3","source":{"kind":"arxiv","id":"1405.6500","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6500","created_at":"2026-05-18T00:56:59Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6500v2","created_at":"2026-05-18T00:56:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6500","created_at":"2026-05-18T00:56:59Z"},{"alias_kind":"pith_short_12","alias_value":"JCBBVBIFJ7CJ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JCBBVBIFJ7CJKEAZ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JCBBVBIF","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JCBBVBIFJ7CJKEAZJT2LFYYNYJ","target":"record","payload":{"canonical_record":{"source":{"id":"1405.6500","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-05-26T08:29:19Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"9b3eecb7f9557f4355a6a5dcdc14f0bed91a763510d4013f6d4c3b1243d0bd5f","abstract_canon_sha256":"a3068fd79cc0be4c5b3b799f36e9ac7453bfc84f1ab4d6a92d4b1cc37e920444"},"schema_version":"1.0"},"canonical_sha256":"48821a85054fc49510194cf4b2e30dc2678864208b35cad1ae47bbd89dbdccd3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:59.182069Z","signature_b64":"ngNxUaChljAQuAyCA8603sF4pAT2QtmwqOBGjXT9kozPZPza6gFDrNu7UptzlorHqk2hJoXSV+i2h7Zi3H53Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48821a85054fc49510194cf4b2e30dc2678864208b35cad1ae47bbd89dbdccd3","last_reissued_at":"2026-05-18T00:56:59.181634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:59.181634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.6500","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-05-18T00:56:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DViGm1ICskwQxgssIv3c65fz7EBrHLuiV2mwonpQ5G8SNlyflnizCMyKjkNDfBc0cFKEUu3E3VNRa4DgO/oxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:09:33.678865Z"},"content_sha256":"96c104d2a92e2e859d22e9c0ca571fd4667797fd6f5b150e66f4a6989fc84f56","schema_version":"1.0","event_id":"sha256:96c104d2a92e2e859d22e9c0ca571fd4667797fd6f5b150e66f4a6989fc84f56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JCBBVBIFJ7CJKEAZJT2LFYYNYJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards Efficient Path Query on Social Network with Hybrid RDF Management","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.DB","authors_text":"Changhe Qiu, Lei Gai, Tengjiao Wang, Wei Chen, Zhichao Xu","submitted_at":"2014-05-26T08:29:19Z","abstract_excerpt":"The scalability and exibility of Resource Description Framework(RDF) model make it ideally suited for representing online social networks(OSN). One basic operation in OSN is to find chains of relations,such as k-Hop friends. Property path query in SPARQL can express this type of operation, but its implementation suffers from performance problem considering the ever growing data size and complexity of OSN.In this paper, we present a main memory/disk based hybrid RDF data management framework for efficient property path query. In this hybrid framework, we realize an efficient in-memory algebra o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6500","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":""},"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:56:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MEu3NKIQvy3QYRxystfWLEQrJQ5qFhT30n39T1Ak+dljX81HzeufLsdM9f/WaUzSXnkuDDbqkgGOUSfjHclwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:09:33.679254Z"},"content_sha256":"086698a12a114bfe602302c252ca823cb9c4ff99ab2dcc4322df02912d11b7a3","schema_version":"1.0","event_id":"sha256:086698a12a114bfe602302c252ca823cb9c4ff99ab2dcc4322df02912d11b7a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JCBBVBIFJ7CJKEAZJT2LFYYNYJ/bundle.json","state_url":"https://pith.science/pith/JCBBVBIFJ7CJKEAZJT2LFYYNYJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JCBBVBIFJ7CJKEAZJT2LFYYNYJ/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-05-31T19:09:33Z","links":{"resolver":"https://pith.science/pith/JCBBVBIFJ7CJKEAZJT2LFYYNYJ","bundle":"https://pith.science/pith/JCBBVBIFJ7CJKEAZJT2LFYYNYJ/bundle.json","state":"https://pith.science/pith/JCBBVBIFJ7CJKEAZJT2LFYYNYJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JCBBVBIFJ7CJKEAZJT2LFYYNYJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JCBBVBIFJ7CJKEAZJT2LFYYNYJ","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":"a3068fd79cc0be4c5b3b799f36e9ac7453bfc84f1ab4d6a92d4b1cc37e920444","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-05-26T08:29:19Z","title_canon_sha256":"9b3eecb7f9557f4355a6a5dcdc14f0bed91a763510d4013f6d4c3b1243d0bd5f"},"schema_version":"1.0","source":{"id":"1405.6500","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6500","created_at":"2026-05-18T00:56:59Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6500v2","created_at":"2026-05-18T00:56:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6500","created_at":"2026-05-18T00:56:59Z"},{"alias_kind":"pith_short_12","alias_value":"JCBBVBIFJ7CJ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"JCBBVBIFJ7CJKEAZ","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"JCBBVBIF","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:086698a12a114bfe602302c252ca823cb9c4ff99ab2dcc4322df02912d11b7a3","target":"graph","created_at":"2026-05-18T00:56:59Z","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":"The scalability and exibility of Resource Description Framework(RDF) model make it ideally suited for representing online social networks(OSN). One basic operation in OSN is to find chains of relations,such as k-Hop friends. Property path query in SPARQL can express this type of operation, but its implementation suffers from performance problem considering the ever growing data size and complexity of OSN.In this paper, we present a main memory/disk based hybrid RDF data management framework for efficient property path query. In this hybrid framework, we realize an efficient in-memory algebra o","authors_text":"Changhe Qiu, Lei Gai, Tengjiao Wang, Wei Chen, Zhichao Xu","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-05-26T08:29:19Z","title":"Towards Efficient Path Query on Social Network with Hybrid RDF Management"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6500","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:96c104d2a92e2e859d22e9c0ca571fd4667797fd6f5b150e66f4a6989fc84f56","target":"record","created_at":"2026-05-18T00:56:59Z","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":"a3068fd79cc0be4c5b3b799f36e9ac7453bfc84f1ab4d6a92d4b1cc37e920444","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-05-26T08:29:19Z","title_canon_sha256":"9b3eecb7f9557f4355a6a5dcdc14f0bed91a763510d4013f6d4c3b1243d0bd5f"},"schema_version":"1.0","source":{"id":"1405.6500","kind":"arxiv","version":2}},"canonical_sha256":"48821a85054fc49510194cf4b2e30dc2678864208b35cad1ae47bbd89dbdccd3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48821a85054fc49510194cf4b2e30dc2678864208b35cad1ae47bbd89dbdccd3","first_computed_at":"2026-05-18T00:56:59.181634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:59.181634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ngNxUaChljAQuAyCA8603sF4pAT2QtmwqOBGjXT9kozPZPza6gFDrNu7UptzlorHqk2hJoXSV+i2h7Zi3H53Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:59.182069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6500","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96c104d2a92e2e859d22e9c0ca571fd4667797fd6f5b150e66f4a6989fc84f56","sha256:086698a12a114bfe602302c252ca823cb9c4ff99ab2dcc4322df02912d11b7a3"],"state_sha256":"ca9607042e3659cd5469f5c4c9b6124d9c9578e2d924b59a5ae0d46709ba3b6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XBmjdLOwWLceAr5EW6ZPr9QKBWffwXl/aeznymfTHHni1mY0mQTd9TijdJP0I6QPym7Whu/3RvVJsw2JRvWrDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:09:33.682425Z","bundle_sha256":"2d9ca90529a4c847b239deac2dd1667698b7a9837570d0e925bec67abf25d6fe"}}