{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:M66GTEV3NQRIHV5LGUEBE6MP4G","short_pith_number":"pith:M66GTEV3","canonical_record":{"source":{"id":"1203.2886","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-03-13T18:11:55Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"14ee4a4e51919c6a5a37acef2319d45d7cc045cd2c7c33ef1e1dd062763eef10","abstract_canon_sha256":"23207f0adc0a17283e5f9efc2c3c97bf27edef9e6eaa68d5989b5a31e134a1e2"},"schema_version":"1.0"},"canonical_sha256":"67bc6992bb6c2283d7ab350812798fe1891d9f39493324d83624de5f34e42a86","source":{"kind":"arxiv","id":"1203.2886","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2886","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2886v1","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2886","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"M66GTEV3NQRI","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"M66GTEV3NQRIHV5L","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"M66GTEV3","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:M66GTEV3NQRIHV5LGUEBE6MP4G","target":"record","payload":{"canonical_record":{"source":{"id":"1203.2886","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-03-13T18:11:55Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"14ee4a4e51919c6a5a37acef2319d45d7cc045cd2c7c33ef1e1dd062763eef10","abstract_canon_sha256":"23207f0adc0a17283e5f9efc2c3c97bf27edef9e6eaa68d5989b5a31e134a1e2"},"schema_version":"1.0"},"canonical_sha256":"67bc6992bb6c2283d7ab350812798fe1891d9f39493324d83624de5f34e42a86","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:14.304371Z","signature_b64":"o1VrB6yWzhkcUSugiTZMWgJHfB9SKH4chyUtLKpedJ7etGXMndTZozmA+s/X3RElcQrwXqXyr97XW3nXcCd4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67bc6992bb6c2283d7ab350812798fe1891d9f39493324d83624de5f34e42a86","last_reissued_at":"2026-05-18T04:00:14.303636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:14.303636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.2886","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-18T04:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5spC5Qd+miXYmteH2Y8fILKJvSmlCUvkAbHNxWI2Dx9ZRr2I2ycP1p7tbQpysIlrP6AMceRZVo9O6mdJ5eYyBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:56:36.292286Z"},"content_sha256":"762f6f60032a569b58d4d17561f3af04fa0c76536bcedea25cd1451b5191caf4","schema_version":"1.0","event_id":"sha256:762f6f60032a569b58d4d17561f3af04fa0c76536bcedea25cd1451b5191caf4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:M66GTEV3NQRIHV5LGUEBE6MP4G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"BitPath -- Label Order Constrained Reachability Queries over Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DB","authors_text":"Medha Atre, Mohammed J. Zaki, Vineet Chaoji","submitted_at":"2012-03-13T18:11:55Z","abstract_excerpt":"In this paper we focus on the following constrained reachability problem over edge-labeled graphs like RDF -- \"given source node x, destination node y, and a sequence of edge labels (a, b, c, d), is there a path between the two nodes such that the edge labels on the path satisfy a regular expression \"*a.*b.*c.*d.*\". A \"*\" before \"a\" allows any other edge label to appear on the path before edge \"a\". \"a.*\" forces at least one edge with label \"a\". \".*\" after \"a\" allows zero or more edge labels after \"a\" and before \"b\". Our query processing algorithm uses simple divide-and-conquer and greedy pruni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2886","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-18T04:00:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FoLb/TwxNxTo9Nw0U+TO/tnJtFwjAUG8icahPTg9cV9FsoksnHBZLriIR/Vv95E9rwAGocgfklvJRtjQlRG6AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:56:36.293095Z"},"content_sha256":"9a423f58f4ae840f72dc9b677fe6b5768b32d6f48581eff837f3276086f8398a","schema_version":"1.0","event_id":"sha256:9a423f58f4ae840f72dc9b677fe6b5768b32d6f48581eff837f3276086f8398a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M66GTEV3NQRIHV5LGUEBE6MP4G/bundle.json","state_url":"https://pith.science/pith/M66GTEV3NQRIHV5LGUEBE6MP4G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M66GTEV3NQRIHV5LGUEBE6MP4G/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-30T20:56:36Z","links":{"resolver":"https://pith.science/pith/M66GTEV3NQRIHV5LGUEBE6MP4G","bundle":"https://pith.science/pith/M66GTEV3NQRIHV5LGUEBE6MP4G/bundle.json","state":"https://pith.science/pith/M66GTEV3NQRIHV5LGUEBE6MP4G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M66GTEV3NQRIHV5LGUEBE6MP4G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:M66GTEV3NQRIHV5LGUEBE6MP4G","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":"23207f0adc0a17283e5f9efc2c3c97bf27edef9e6eaa68d5989b5a31e134a1e2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-03-13T18:11:55Z","title_canon_sha256":"14ee4a4e51919c6a5a37acef2319d45d7cc045cd2c7c33ef1e1dd062763eef10"},"schema_version":"1.0","source":{"id":"1203.2886","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2886","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2886v1","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2886","created_at":"2026-05-18T04:00:14Z"},{"alias_kind":"pith_short_12","alias_value":"M66GTEV3NQRI","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"M66GTEV3NQRIHV5L","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"M66GTEV3","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:9a423f58f4ae840f72dc9b677fe6b5768b32d6f48581eff837f3276086f8398a","target":"graph","created_at":"2026-05-18T04:00:14Z","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":"In this paper we focus on the following constrained reachability problem over edge-labeled graphs like RDF -- \"given source node x, destination node y, and a sequence of edge labels (a, b, c, d), is there a path between the two nodes such that the edge labels on the path satisfy a regular expression \"*a.*b.*c.*d.*\". A \"*\" before \"a\" allows any other edge label to appear on the path before edge \"a\". \"a.*\" forces at least one edge with label \"a\". \".*\" after \"a\" allows zero or more edge labels after \"a\" and before \"b\". Our query processing algorithm uses simple divide-and-conquer and greedy pruni","authors_text":"Medha Atre, Mohammed J. Zaki, Vineet Chaoji","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-03-13T18:11:55Z","title":"BitPath -- Label Order Constrained Reachability Queries over Large Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2886","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:762f6f60032a569b58d4d17561f3af04fa0c76536bcedea25cd1451b5191caf4","target":"record","created_at":"2026-05-18T04:00:14Z","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":"23207f0adc0a17283e5f9efc2c3c97bf27edef9e6eaa68d5989b5a31e134a1e2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-03-13T18:11:55Z","title_canon_sha256":"14ee4a4e51919c6a5a37acef2319d45d7cc045cd2c7c33ef1e1dd062763eef10"},"schema_version":"1.0","source":{"id":"1203.2886","kind":"arxiv","version":1}},"canonical_sha256":"67bc6992bb6c2283d7ab350812798fe1891d9f39493324d83624de5f34e42a86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67bc6992bb6c2283d7ab350812798fe1891d9f39493324d83624de5f34e42a86","first_computed_at":"2026-05-18T04:00:14.303636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:14.303636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o1VrB6yWzhkcUSugiTZMWgJHfB9SKH4chyUtLKpedJ7etGXMndTZozmA+s/X3RElcQrwXqXyr97XW3nXcCd4Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:14.304371Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.2886","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:762f6f60032a569b58d4d17561f3af04fa0c76536bcedea25cd1451b5191caf4","sha256:9a423f58f4ae840f72dc9b677fe6b5768b32d6f48581eff837f3276086f8398a"],"state_sha256":"ad2d839234f3f535ada18bcc5d1a9d30da803691751cbbc6ecaef0e4e6de1e5a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h0C8tUOH8027sltNMgi3Y4NwEkLq4Ll+BB0q/JmXsObf3F1aDl46OmECmwgsi7Ml3xASNH2f1xYblFfPxSprBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:56:36.297098Z","bundle_sha256":"115b92233530b09b48e5a332664bbc53c64a9b0ba3b283ebea924af8dece0ec3"}}