{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:M66GTEV3NQRIHV5LGUEBE6MP4G","short_pith_number":"pith:M66GTEV3","schema_version":"1.0","canonical_sha256":"67bc6992bb6c2283d7ab350812798fe1891d9f39493324d83624de5f34e42a86","source":{"kind":"arxiv","id":"1203.2886","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1203.2886","created_at":"2026-05-18T04:00:14.303780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.2886v1","created_at":"2026-05-18T04:00:14.303780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2886","created_at":"2026-05-18T04:00:14.303780+00:00"},{"alias_kind":"pith_short_12","alias_value":"M66GTEV3NQRI","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"M66GTEV3NQRIHV5L","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"M66GTEV3","created_at":"2026-05-18T12:27:14.488303+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M66GTEV3NQRIHV5LGUEBE6MP4G","json":"https://pith.science/pith/M66GTEV3NQRIHV5LGUEBE6MP4G.json","graph_json":"https://pith.science/api/pith-number/M66GTEV3NQRIHV5LGUEBE6MP4G/graph.json","events_json":"https://pith.science/api/pith-number/M66GTEV3NQRIHV5LGUEBE6MP4G/events.json","paper":"https://pith.science/paper/M66GTEV3"},"agent_actions":{"view_html":"https://pith.science/pith/M66GTEV3NQRIHV5LGUEBE6MP4G","download_json":"https://pith.science/pith/M66GTEV3NQRIHV5LGUEBE6MP4G.json","view_paper":"https://pith.science/paper/M66GTEV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.2886&json=true","fetch_graph":"https://pith.science/api/pith-number/M66GTEV3NQRIHV5LGUEBE6MP4G/graph.json","fetch_events":"https://pith.science/api/pith-number/M66GTEV3NQRIHV5LGUEBE6MP4G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M66GTEV3NQRIHV5LGUEBE6MP4G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M66GTEV3NQRIHV5LGUEBE6MP4G/action/storage_attestation","attest_author":"https://pith.science/pith/M66GTEV3NQRIHV5LGUEBE6MP4G/action/author_attestation","sign_citation":"https://pith.science/pith/M66GTEV3NQRIHV5LGUEBE6MP4G/action/citation_signature","submit_replication":"https://pith.science/pith/M66GTEV3NQRIHV5LGUEBE6MP4G/action/replication_record"}},"created_at":"2026-05-18T04:00:14.303780+00:00","updated_at":"2026-05-18T04:00:14.303780+00:00"}