{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OYXJPZRYC3BG2J5UQYYQ4IRFDV","short_pith_number":"pith:OYXJPZRY","canonical_record":{"source":{"id":"1211.5817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-21T10:55:36Z","cross_cats_sorted":[],"title_canon_sha256":"476a1b31f27d4a6dbe973393ba62f7fea57d7b5589e501694206c9d4ea2a7746","abstract_canon_sha256":"7aebed95de052046fd1b49e56ef1aae3c7d4b2fcbc4d89d5d53984af836412bf"},"schema_version":"1.0"},"canonical_sha256":"762e97e63816c26d27b486310e22251d5478e135de36459584fa557ef456f9f5","source":{"kind":"arxiv","id":"1211.5817","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5817","created_at":"2026-05-18T03:40:01Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5817v1","created_at":"2026-05-18T03:40:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5817","created_at":"2026-05-18T03:40:01Z"},{"alias_kind":"pith_short_12","alias_value":"OYXJPZRYC3BG","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"OYXJPZRYC3BG2J5U","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"OYXJPZRY","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OYXJPZRYC3BG2J5UQYYQ4IRFDV","target":"record","payload":{"canonical_record":{"source":{"id":"1211.5817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-21T10:55:36Z","cross_cats_sorted":[],"title_canon_sha256":"476a1b31f27d4a6dbe973393ba62f7fea57d7b5589e501694206c9d4ea2a7746","abstract_canon_sha256":"7aebed95de052046fd1b49e56ef1aae3c7d4b2fcbc4d89d5d53984af836412bf"},"schema_version":"1.0"},"canonical_sha256":"762e97e63816c26d27b486310e22251d5478e135de36459584fa557ef456f9f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:40:01.890658Z","signature_b64":"BSXr32xXXtTdaoXMcyllhYCrDcTnAYGIBEIM6lk841B8QNX+dkOKc5quo5nyG04gf7gBJkGj2cw9hg10STrBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"762e97e63816c26d27b486310e22251d5478e135de36459584fa557ef456f9f5","last_reissued_at":"2026-05-18T03:40:01.890136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:40:01.890136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.5817","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-18T03:40:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jrQO/Beqebx4of/P6n37Q+4bRahJCLvZuK7kz7ocZwvk4S2Q3Lw1/L6Jgzw6I787laUaouSxxnvJ50cAYAkYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T13:06:44.562791Z"},"content_sha256":"c8994b8e53693c1a9b143b1b3d71f2639249923c372e4882179027dede9ff470","schema_version":"1.0","event_id":"sha256:c8994b8e53693c1a9b143b1b3d71f2639249923c372e4882179027dede9ff470"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OYXJPZRYC3BG2J5UQYYQ4IRFDV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extending SPARQL to Support Entity Grouping and Path Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Boualem Benatallah, Hamid Reza Motahari-Nezhad, Seyed-Mehdi-Reza Beheshti, Sherif Sakr","submitted_at":"2012-11-21T10:55:36Z","abstract_excerpt":"The ability to efficiently find relevant subgraphs and paths in a large graph to a given query is important in many applications including scientific data analysis, social networks, and business intelligence. Currently, there is little support and no efficient approaches for expressing and executing such queries. This paper proposes a data model and a query language to address this problem. The contributions include supporting the construction and selection of: (i) folder nodes, representing a set of related entities, and (ii) path nodes, representing a set of paths in which a path is the tran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5817","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-18T03:40:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vPbGaIKEQm47MXXWhznxCsV3iV4tu8W3UNiSG3n5JRv4FpXvO/72ZgxwbTV5JgBv+GHrgNhU+fNmORMKHrKVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T13:06:44.563133Z"},"content_sha256":"ff307598ed8eb91e26a06d7eb85609777781fe869f1edc4a05d4b91ff002d60d","schema_version":"1.0","event_id":"sha256:ff307598ed8eb91e26a06d7eb85609777781fe869f1edc4a05d4b91ff002d60d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OYXJPZRYC3BG2J5UQYYQ4IRFDV/bundle.json","state_url":"https://pith.science/pith/OYXJPZRYC3BG2J5UQYYQ4IRFDV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OYXJPZRYC3BG2J5UQYYQ4IRFDV/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-19T13:06:44Z","links":{"resolver":"https://pith.science/pith/OYXJPZRYC3BG2J5UQYYQ4IRFDV","bundle":"https://pith.science/pith/OYXJPZRYC3BG2J5UQYYQ4IRFDV/bundle.json","state":"https://pith.science/pith/OYXJPZRYC3BG2J5UQYYQ4IRFDV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OYXJPZRYC3BG2J5UQYYQ4IRFDV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OYXJPZRYC3BG2J5UQYYQ4IRFDV","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":"7aebed95de052046fd1b49e56ef1aae3c7d4b2fcbc4d89d5d53984af836412bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-21T10:55:36Z","title_canon_sha256":"476a1b31f27d4a6dbe973393ba62f7fea57d7b5589e501694206c9d4ea2a7746"},"schema_version":"1.0","source":{"id":"1211.5817","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5817","created_at":"2026-05-18T03:40:01Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5817v1","created_at":"2026-05-18T03:40:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5817","created_at":"2026-05-18T03:40:01Z"},{"alias_kind":"pith_short_12","alias_value":"OYXJPZRYC3BG","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"OYXJPZRYC3BG2J5U","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"OYXJPZRY","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:ff307598ed8eb91e26a06d7eb85609777781fe869f1edc4a05d4b91ff002d60d","target":"graph","created_at":"2026-05-18T03:40:01Z","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 ability to efficiently find relevant subgraphs and paths in a large graph to a given query is important in many applications including scientific data analysis, social networks, and business intelligence. Currently, there is little support and no efficient approaches for expressing and executing such queries. This paper proposes a data model and a query language to address this problem. The contributions include supporting the construction and selection of: (i) folder nodes, representing a set of related entities, and (ii) path nodes, representing a set of paths in which a path is the tran","authors_text":"Boualem Benatallah, Hamid Reza Motahari-Nezhad, Seyed-Mehdi-Reza Beheshti, Sherif Sakr","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-21T10:55:36Z","title":"Extending SPARQL to Support Entity Grouping and Path Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5817","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:c8994b8e53693c1a9b143b1b3d71f2639249923c372e4882179027dede9ff470","target":"record","created_at":"2026-05-18T03:40:01Z","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":"7aebed95de052046fd1b49e56ef1aae3c7d4b2fcbc4d89d5d53984af836412bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-11-21T10:55:36Z","title_canon_sha256":"476a1b31f27d4a6dbe973393ba62f7fea57d7b5589e501694206c9d4ea2a7746"},"schema_version":"1.0","source":{"id":"1211.5817","kind":"arxiv","version":1}},"canonical_sha256":"762e97e63816c26d27b486310e22251d5478e135de36459584fa557ef456f9f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"762e97e63816c26d27b486310e22251d5478e135de36459584fa557ef456f9f5","first_computed_at":"2026-05-18T03:40:01.890136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:01.890136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BSXr32xXXtTdaoXMcyllhYCrDcTnAYGIBEIM6lk841B8QNX+dkOKc5quo5nyG04gf7gBJkGj2cw9hg10STrBBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:01.890658Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.5817","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8994b8e53693c1a9b143b1b3d71f2639249923c372e4882179027dede9ff470","sha256:ff307598ed8eb91e26a06d7eb85609777781fe869f1edc4a05d4b91ff002d60d"],"state_sha256":"d95aaa56bff1125571ed1a655b8b61f39b4c40aea5ed6b7c3abf9a7f627a641b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z8gkl6iOJtl7dc6BnGk96VDsHBFLXQKI6jxu7B07mH5kHb3HT3qq8dIBniLvz99vh26uzZTYC33O7bcfueUVAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T13:06:44.564944Z","bundle_sha256":"8e8404a1989106ac81117a80a5674c18e64b2fba9e7e5af1d4b9e44033f7034c"}}