{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WEOCBLNNC6WV66TSXSCEB7XE33","short_pith_number":"pith:WEOCBLNN","canonical_record":{"source":{"id":"1506.01973","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-06-05T17:00:47Z","cross_cats_sorted":[],"title_canon_sha256":"3a8fb929d57b4f542bbc1407a3bddef940341a396e96378776c8e8caa581a301","abstract_canon_sha256":"84e13ef317eb11bffd50e6545b12f41b88663d8b5f14e2631acbeb3d05f3e16b"},"schema_version":"1.0"},"canonical_sha256":"b11c20adad17ad5f7a72bc8440fee4dee27dececdb8f2278d4b823b3f3ea1f3f","source":{"kind":"arxiv","id":"1506.01973","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01973","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01973v2","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01973","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"pith_short_12","alias_value":"WEOCBLNNC6WV","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WEOCBLNNC6WV66TS","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WEOCBLNN","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WEOCBLNNC6WV66TSXSCEB7XE33","target":"record","payload":{"canonical_record":{"source":{"id":"1506.01973","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-06-05T17:00:47Z","cross_cats_sorted":[],"title_canon_sha256":"3a8fb929d57b4f542bbc1407a3bddef940341a396e96378776c8e8caa581a301","abstract_canon_sha256":"84e13ef317eb11bffd50e6545b12f41b88663d8b5f14e2631acbeb3d05f3e16b"},"schema_version":"1.0"},"canonical_sha256":"b11c20adad17ad5f7a72bc8440fee4dee27dececdb8f2278d4b823b3f3ea1f3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:31.636423Z","signature_b64":"O3La1NR/2HQE4SuRgPq01QxIyUBrmLJcqDnMePuYUMQMRkNl0veWjCzprclXuJC6DS+u+HuE0+yeeFFFeQSkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b11c20adad17ad5f7a72bc8440fee4dee27dececdb8f2278d4b823b3f3ea1f3f","last_reissued_at":"2026-05-18T01:55:31.635891Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:31.635891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.01973","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-18T01:55:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bJ5tNvvk2RCzhAIashdw5ptjQPcrhhciGzBZzEFhr4TZDS3ZnvLsMEnXuMWJq2dTQgGOFIwXkT3Z33yR3Z7zDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:13:12.569010Z"},"content_sha256":"cebe23da088a605bb505da6ce4c8927071cee3422ab5a6b48e54b64995cb31a3","schema_version":"1.0","event_id":"sha256:cebe23da088a605bb505da6ce4c8927071cee3422ab5a6b48e54b64995cb31a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WEOCBLNNC6WV66TSXSCEB7XE33","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Taming Subgraph Isomorphism for RDF Query Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"2), (2) Oracle Labs, Hassan Chafi (2) ((1) POSTECH, Hyungyu Shin (1), Jinha Kim (1, South Korea, Sungpack Hong (2), USA), Wook-Shin Han (1)","submitted_at":"2015-06-05T17:00:47Z","abstract_excerpt":"RDF data are used to model knowledge in various areas such as life sciences, Semantic Web, bioinformatics, and social graphs. The size of real RDF data reaches billions of triples. This calls for a framework for efficiently processing RDF data. The core function of processing RDF data is subgraph pattern matching. There have been two completely different directions for supporting efficient subgraph pattern matching. One direction is to develop specialized RDF query processing engines exploiting the properties of RDF data for the last decade, while the other direction is to develop efficient su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01973","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-18T01:55:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q4JA9N2+458nemkETEPDvAT4PREFwBUymQSY0KpobaWcXU5ynR0JOyxmHHPnOunj6KxVDeGU78sqqbm/aPQbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:13:12.569766Z"},"content_sha256":"bbd88562cedb684e5428f0bc54dc2684d5e5a2fd1cc6a0d09632864b3e66ff98","schema_version":"1.0","event_id":"sha256:bbd88562cedb684e5428f0bc54dc2684d5e5a2fd1cc6a0d09632864b3e66ff98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WEOCBLNNC6WV66TSXSCEB7XE33/bundle.json","state_url":"https://pith.science/pith/WEOCBLNNC6WV66TSXSCEB7XE33/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WEOCBLNNC6WV66TSXSCEB7XE33/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-10T05:13:12Z","links":{"resolver":"https://pith.science/pith/WEOCBLNNC6WV66TSXSCEB7XE33","bundle":"https://pith.science/pith/WEOCBLNNC6WV66TSXSCEB7XE33/bundle.json","state":"https://pith.science/pith/WEOCBLNNC6WV66TSXSCEB7XE33/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WEOCBLNNC6WV66TSXSCEB7XE33/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WEOCBLNNC6WV66TSXSCEB7XE33","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":"84e13ef317eb11bffd50e6545b12f41b88663d8b5f14e2631acbeb3d05f3e16b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-06-05T17:00:47Z","title_canon_sha256":"3a8fb929d57b4f542bbc1407a3bddef940341a396e96378776c8e8caa581a301"},"schema_version":"1.0","source":{"id":"1506.01973","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.01973","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"arxiv_version","alias_value":"1506.01973v2","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.01973","created_at":"2026-05-18T01:55:31Z"},{"alias_kind":"pith_short_12","alias_value":"WEOCBLNNC6WV","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WEOCBLNNC6WV66TS","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WEOCBLNN","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:bbd88562cedb684e5428f0bc54dc2684d5e5a2fd1cc6a0d09632864b3e66ff98","target":"graph","created_at":"2026-05-18T01:55:31Z","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":"RDF data are used to model knowledge in various areas such as life sciences, Semantic Web, bioinformatics, and social graphs. The size of real RDF data reaches billions of triples. This calls for a framework for efficiently processing RDF data. The core function of processing RDF data is subgraph pattern matching. There have been two completely different directions for supporting efficient subgraph pattern matching. One direction is to develop specialized RDF query processing engines exploiting the properties of RDF data for the last decade, while the other direction is to develop efficient su","authors_text":"2), (2) Oracle Labs, Hassan Chafi (2) ((1) POSTECH, Hyungyu Shin (1), Jinha Kim (1, South Korea, Sungpack Hong (2), USA), Wook-Shin Han (1)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-06-05T17:00:47Z","title":"Taming Subgraph Isomorphism for RDF Query Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.01973","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:cebe23da088a605bb505da6ce4c8927071cee3422ab5a6b48e54b64995cb31a3","target":"record","created_at":"2026-05-18T01:55:31Z","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":"84e13ef317eb11bffd50e6545b12f41b88663d8b5f14e2631acbeb3d05f3e16b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-06-05T17:00:47Z","title_canon_sha256":"3a8fb929d57b4f542bbc1407a3bddef940341a396e96378776c8e8caa581a301"},"schema_version":"1.0","source":{"id":"1506.01973","kind":"arxiv","version":2}},"canonical_sha256":"b11c20adad17ad5f7a72bc8440fee4dee27dececdb8f2278d4b823b3f3ea1f3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b11c20adad17ad5f7a72bc8440fee4dee27dececdb8f2278d4b823b3f3ea1f3f","first_computed_at":"2026-05-18T01:55:31.635891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:31.635891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O3La1NR/2HQE4SuRgPq01QxIyUBrmLJcqDnMePuYUMQMRkNl0veWjCzprclXuJC6DS+u+HuE0+yeeFFFeQSkBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:31.636423Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.01973","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cebe23da088a605bb505da6ce4c8927071cee3422ab5a6b48e54b64995cb31a3","sha256:bbd88562cedb684e5428f0bc54dc2684d5e5a2fd1cc6a0d09632864b3e66ff98"],"state_sha256":"8db410abe85355362c9af619be2a0d6559543cc3c157c58742d10954efd32f30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0e+EJN596MSxvt9TJn5GXjKj4u+pP3OGxURfn826cqNmJl8RqPCjFJ4/2dFM/4rHuI1Mt29sOAirbFihmOSKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T05:13:12.573797Z","bundle_sha256":"e612254f78f0a52b5eaa5d0f1419fd4dd666dacbd3171bb66ff3bee99475e5b6"}}