{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:26CFIMWR2NN72EE4E4GVYZLEKK","short_pith_number":"pith:26CFIMWR","canonical_record":{"source":{"id":"1412.4463","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-12-15T05:02:37Z","cross_cats_sorted":[],"title_canon_sha256":"b5c8c23b68c259ad5783f190174237b2f5be2ff6794d0dc9948c49330dc0b121","abstract_canon_sha256":"2494fd72a5b739b5794a649936b5e0c45ad91c3dc200aad6ecc907384f5f8650"},"schema_version":"1.0"},"canonical_sha256":"d7845432d1d35bfd109c270d5c656452938f7a9645b06d1b5a99976cb9ee4e46","source":{"kind":"arxiv","id":"1412.4463","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4463","created_at":"2026-05-18T02:17:51Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4463v2","created_at":"2026-05-18T02:17:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4463","created_at":"2026-05-18T02:17:51Z"},{"alias_kind":"pith_short_12","alias_value":"26CFIMWR2NN7","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"26CFIMWR2NN72EE4","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"26CFIMWR","created_at":"2026-05-18T12:28:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:26CFIMWR2NN72EE4E4GVYZLEKK","target":"record","payload":{"canonical_record":{"source":{"id":"1412.4463","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-12-15T05:02:37Z","cross_cats_sorted":[],"title_canon_sha256":"b5c8c23b68c259ad5783f190174237b2f5be2ff6794d0dc9948c49330dc0b121","abstract_canon_sha256":"2494fd72a5b739b5794a649936b5e0c45ad91c3dc200aad6ecc907384f5f8650"},"schema_version":"1.0"},"canonical_sha256":"d7845432d1d35bfd109c270d5c656452938f7a9645b06d1b5a99976cb9ee4e46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:51.553139Z","signature_b64":"vAimuaTTuxrxFQlKkpYp30u5WuEp0VpU64SPfHTrAoFoGI8AGEISOgJ1gVr31uN2gnvTNBoW46SzDXt+/MePBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7845432d1d35bfd109c270d5c656452938f7a9645b06d1b5a99976cb9ee4e46","last_reissued_at":"2026-05-18T02:17:51.552492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:51.552492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.4463","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-18T02:17:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U2ja9mPSMfRDKcagbcYDm5LeInXBhw3WM4YtnfXEMksA6NRD89XgKPqxzmovqvp+RXaNt3XN2DJdtMQmK60DDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:11:31.652068Z"},"content_sha256":"b79d9b87f70371bc8e8374c295c807e9385f4196ad943fd2792f1e8c927d5065","schema_version":"1.0","event_id":"sha256:b79d9b87f70371bc8e8374c295c807e9385f4196ad943fd2792f1e8c927d5065"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:26CFIMWR2NN72EE4E4GVYZLEKK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Defining relations on graphs: how hard is it in the presence of node partitions?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"B. Srivathsan, M. Praveen","submitted_at":"2014-12-15T05:02:37Z","abstract_excerpt":"Designing query languages for graph structured data is an active field of research. Evaluating a query on a graph results in a relation on the set of its nodes. In other words, a query is a mechanism for defining relations on a graph. Some relations may not be definable by any query in a given language. This leads to the following question: given a graph, a query language and a relation on the graph, does there exist a query in the language that defines the relation? This is called the definability problem. When the given query language is standard regular expressions, the definability problem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4463","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-18T02:17:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yBwYRqmPPOPURL4NTq7gCt87oJbM9Cwgg8JtGpt++1P1FRrJS4wrtHp69A6gy0HT/EmEIDyDMjPDzGlB9sYsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:11:31.652763Z"},"content_sha256":"1e52fa6698b657bec6ff3cd74d0b23c66868289aea2a5d82fc0eb2a67b56f1a3","schema_version":"1.0","event_id":"sha256:1e52fa6698b657bec6ff3cd74d0b23c66868289aea2a5d82fc0eb2a67b56f1a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/26CFIMWR2NN72EE4E4GVYZLEKK/bundle.json","state_url":"https://pith.science/pith/26CFIMWR2NN72EE4E4GVYZLEKK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/26CFIMWR2NN72EE4E4GVYZLEKK/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-07T14:11:31Z","links":{"resolver":"https://pith.science/pith/26CFIMWR2NN72EE4E4GVYZLEKK","bundle":"https://pith.science/pith/26CFIMWR2NN72EE4E4GVYZLEKK/bundle.json","state":"https://pith.science/pith/26CFIMWR2NN72EE4E4GVYZLEKK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/26CFIMWR2NN72EE4E4GVYZLEKK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:26CFIMWR2NN72EE4E4GVYZLEKK","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":"2494fd72a5b739b5794a649936b5e0c45ad91c3dc200aad6ecc907384f5f8650","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-12-15T05:02:37Z","title_canon_sha256":"b5c8c23b68c259ad5783f190174237b2f5be2ff6794d0dc9948c49330dc0b121"},"schema_version":"1.0","source":{"id":"1412.4463","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4463","created_at":"2026-05-18T02:17:51Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4463v2","created_at":"2026-05-18T02:17:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4463","created_at":"2026-05-18T02:17:51Z"},{"alias_kind":"pith_short_12","alias_value":"26CFIMWR2NN7","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"26CFIMWR2NN72EE4","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"26CFIMWR","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:1e52fa6698b657bec6ff3cd74d0b23c66868289aea2a5d82fc0eb2a67b56f1a3","target":"graph","created_at":"2026-05-18T02:17:51Z","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":"Designing query languages for graph structured data is an active field of research. Evaluating a query on a graph results in a relation on the set of its nodes. In other words, a query is a mechanism for defining relations on a graph. Some relations may not be definable by any query in a given language. This leads to the following question: given a graph, a query language and a relation on the graph, does there exist a query in the language that defines the relation? This is called the definability problem. When the given query language is standard regular expressions, the definability problem","authors_text":"B. Srivathsan, M. Praveen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-12-15T05:02:37Z","title":"Defining relations on graphs: how hard is it in the presence of node partitions?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4463","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:b79d9b87f70371bc8e8374c295c807e9385f4196ad943fd2792f1e8c927d5065","target":"record","created_at":"2026-05-18T02:17:51Z","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":"2494fd72a5b739b5794a649936b5e0c45ad91c3dc200aad6ecc907384f5f8650","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-12-15T05:02:37Z","title_canon_sha256":"b5c8c23b68c259ad5783f190174237b2f5be2ff6794d0dc9948c49330dc0b121"},"schema_version":"1.0","source":{"id":"1412.4463","kind":"arxiv","version":2}},"canonical_sha256":"d7845432d1d35bfd109c270d5c656452938f7a9645b06d1b5a99976cb9ee4e46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7845432d1d35bfd109c270d5c656452938f7a9645b06d1b5a99976cb9ee4e46","first_computed_at":"2026-05-18T02:17:51.552492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:51.552492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vAimuaTTuxrxFQlKkpYp30u5WuEp0VpU64SPfHTrAoFoGI8AGEISOgJ1gVr31uN2gnvTNBoW46SzDXt+/MePBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:51.553139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.4463","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b79d9b87f70371bc8e8374c295c807e9385f4196ad943fd2792f1e8c927d5065","sha256:1e52fa6698b657bec6ff3cd74d0b23c66868289aea2a5d82fc0eb2a67b56f1a3"],"state_sha256":"c5be7c0f4955d3a84c93b620fb8fca63e504738929b2e5c3818c1ae0c63e800b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W9j5i2wOnNSKd6JWY9irg3oDScZ1NfDpIXBT2R7Ge5VW5vCQbJfzkChGJGmMucWJWWExj0BoicJMzcbRjX5CDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:11:31.656513Z","bundle_sha256":"9ae57bf888778cc87a34480bb02fec5403bc0d964d3a23b6c1bd100b33aee418"}}