{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7GQL64VMUE4UFQHRUGLKALEN5S","short_pith_number":"pith:7GQL64VM","canonical_record":{"source":{"id":"1212.6857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-12-31T11:02:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5433034bb63af6fbecf321be7ef48927c6e4390d096f8b167b95886a9dec4ea1","abstract_canon_sha256":"883621ff93f5c78bae26763245e6888b00d8ec31630b26b5280f9a938a28ed65"},"schema_version":"1.0"},"canonical_sha256":"f9a0bf72aca13942c0f1a196a02c8dec889a9b2a7077a6706a4a0f6124085a24","source":{"kind":"arxiv","id":"1212.6857","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6857","created_at":"2026-05-18T03:37:30Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6857v1","created_at":"2026-05-18T03:37:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6857","created_at":"2026-05-18T03:37:30Z"},{"alias_kind":"pith_short_12","alias_value":"7GQL64VMUE4U","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7GQL64VMUE4UFQHR","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7GQL64VM","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7GQL64VMUE4UFQHRUGLKALEN5S","target":"record","payload":{"canonical_record":{"source":{"id":"1212.6857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-12-31T11:02:16Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5433034bb63af6fbecf321be7ef48927c6e4390d096f8b167b95886a9dec4ea1","abstract_canon_sha256":"883621ff93f5c78bae26763245e6888b00d8ec31630b26b5280f9a938a28ed65"},"schema_version":"1.0"},"canonical_sha256":"f9a0bf72aca13942c0f1a196a02c8dec889a9b2a7077a6706a4a0f6124085a24","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:30.703300Z","signature_b64":"RsRnUuEFG8XzMmzz96ErtF/ViF9bL6bZaMWK6z7TZiRXcceyNpbLXdAPz/m0JKxIlEMhIMvzV2es32N1xJIcBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9a0bf72aca13942c0f1a196a02c8dec889a9b2a7077a6706a4a0f6124085a24","last_reissued_at":"2026-05-18T03:37:30.702584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:30.702584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.6857","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:37:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+reqTGfn0gnppn8n4zlPUhj2cfAhCp/nDJ7FSzpACn08nTAzIO91fS7tX6C+xw/APWhkJt6VM6Q87w0VC7HWAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:03:15.125826Z"},"content_sha256":"35e174463111a73ffd184fe9c3edd8424b242617f65d5e34783c325288a69133","schema_version":"1.0","event_id":"sha256:35e174463111a73ffd184fe9c3edd8424b242617f65d5e34783c325288a69133"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7GQL64VMUE4UFQHRUGLKALEN5S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Trichotomy for Regular Simple Path Queries on Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DB","authors_text":"Angela Bonifati, Benoit Groz, Guillaume Bagan","submitted_at":"2012-12-31T11:02:16Z","abstract_excerpt":"Regular path queries (RPQs) select nodes connected by some path in a graph. The edge labels of such a path have to form a word that matches a given regular expression. We investigate the evaluation of RPQs with an additional constraint that prevents multiple traversals of the same nodes. Those regular simple path queries (RSPQs) find several applications in practice, yet they quickly become intractable, even for basic languages such as (aa)* or a*ba*.\n  In this paper, we establish a comprehensive classification of regular languages with respect to the complexity of the corresponding regular si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6857","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:37:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BI211/wgdFn/gY6QCX0CBZvYfOhspxtd0ZMsFj48Ej46oijYPGAx/4biaOpsmW51ANbqnFcQ5jf/88J2BD21Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T20:03:15.126168Z"},"content_sha256":"4a25f21a324ffa08c67586d6347c25abdf820a0eb65a736b96e4ee3622ea93d9","schema_version":"1.0","event_id":"sha256:4a25f21a324ffa08c67586d6347c25abdf820a0eb65a736b96e4ee3622ea93d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7GQL64VMUE4UFQHRUGLKALEN5S/bundle.json","state_url":"https://pith.science/pith/7GQL64VMUE4UFQHRUGLKALEN5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7GQL64VMUE4UFQHRUGLKALEN5S/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-24T20:03:15Z","links":{"resolver":"https://pith.science/pith/7GQL64VMUE4UFQHRUGLKALEN5S","bundle":"https://pith.science/pith/7GQL64VMUE4UFQHRUGLKALEN5S/bundle.json","state":"https://pith.science/pith/7GQL64VMUE4UFQHRUGLKALEN5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7GQL64VMUE4UFQHRUGLKALEN5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7GQL64VMUE4UFQHRUGLKALEN5S","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":"883621ff93f5c78bae26763245e6888b00d8ec31630b26b5280f9a938a28ed65","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-12-31T11:02:16Z","title_canon_sha256":"5433034bb63af6fbecf321be7ef48927c6e4390d096f8b167b95886a9dec4ea1"},"schema_version":"1.0","source":{"id":"1212.6857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6857","created_at":"2026-05-18T03:37:30Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6857v1","created_at":"2026-05-18T03:37:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6857","created_at":"2026-05-18T03:37:30Z"},{"alias_kind":"pith_short_12","alias_value":"7GQL64VMUE4U","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"7GQL64VMUE4UFQHR","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"7GQL64VM","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:4a25f21a324ffa08c67586d6347c25abdf820a0eb65a736b96e4ee3622ea93d9","target":"graph","created_at":"2026-05-18T03:37:30Z","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":"Regular path queries (RPQs) select nodes connected by some path in a graph. The edge labels of such a path have to form a word that matches a given regular expression. We investigate the evaluation of RPQs with an additional constraint that prevents multiple traversals of the same nodes. Those regular simple path queries (RSPQs) find several applications in practice, yet they quickly become intractable, even for basic languages such as (aa)* or a*ba*.\n  In this paper, we establish a comprehensive classification of regular languages with respect to the complexity of the corresponding regular si","authors_text":"Angela Bonifati, Benoit Groz, Guillaume Bagan","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-12-31T11:02:16Z","title":"A Trichotomy for Regular Simple Path Queries on Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6857","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:35e174463111a73ffd184fe9c3edd8424b242617f65d5e34783c325288a69133","target":"record","created_at":"2026-05-18T03:37:30Z","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":"883621ff93f5c78bae26763245e6888b00d8ec31630b26b5280f9a938a28ed65","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-12-31T11:02:16Z","title_canon_sha256":"5433034bb63af6fbecf321be7ef48927c6e4390d096f8b167b95886a9dec4ea1"},"schema_version":"1.0","source":{"id":"1212.6857","kind":"arxiv","version":1}},"canonical_sha256":"f9a0bf72aca13942c0f1a196a02c8dec889a9b2a7077a6706a4a0f6124085a24","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9a0bf72aca13942c0f1a196a02c8dec889a9b2a7077a6706a4a0f6124085a24","first_computed_at":"2026-05-18T03:37:30.702584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:30.702584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RsRnUuEFG8XzMmzz96ErtF/ViF9bL6bZaMWK6z7TZiRXcceyNpbLXdAPz/m0JKxIlEMhIMvzV2es32N1xJIcBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:30.703300Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35e174463111a73ffd184fe9c3edd8424b242617f65d5e34783c325288a69133","sha256:4a25f21a324ffa08c67586d6347c25abdf820a0eb65a736b96e4ee3622ea93d9"],"state_sha256":"2ea624d740a50699069ade05fae27223f90c370b3da5f2e2749f64aeddf2d380"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N2WxIdxQIdVwSbX6r+8UNmwtIAzY0DRXtkfnHruUdyS1ti6FZvmFmHXLe41LfcmBeV+TG/mQV24SKl2wnqGYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T20:03:15.128255Z","bundle_sha256":"e61d0ac45767f71ee0e5f0c280bb1130a82cc35f9bccfc00eddfcf98adb70253"}}