{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:B3XOREIPNMMDEDNJQVNW76LIZC","short_pith_number":"pith:B3XOREIP","schema_version":"1.0","canonical_sha256":"0eeee8910f6b18320da9855b6ff968c8848575fc0cd0b14b046bb407addf81d0","source":{"kind":"arxiv","id":"1906.09226","version":4},"attestation_state":"computed","paper":{"title":"$\\text{#NFA}$ admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Cristian Riveros, Luis Alberto Croquevielle, Marcelo Arenas, Rajesh Jayaram","submitted_at":"2019-06-21T16:22:53Z","abstract_excerpt":"In this work, we study two simple yet general complexity classes, based on logspace Turing machines, which provide a unifying framework for efficient query evaluation in areas like information extraction and graph databases, among others. We investigate the complexity of three fundamental algorithmic problems for these classes: enumeration, counting and uniform generation of solutions, and show that they have several desirable properties in this respect.\n  Both complexity classes are defined in terms of non-deterministic logspace transducers (NL transducers). For the first class, we consider t"},"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":"1906.09226","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-21T16:22:53Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"d8067fdce5789678e71bbaa79d4d804662212a64f079009de370124d8561945c","abstract_canon_sha256":"daa83be50a783a9a1d88e9c1bf6ceb99f9b5fdae99221b728bea1559f3413e7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:51:53.260655Z","signature_b64":"caSEpGMoqzGxvwPnUvdc6aqEDt7Y+ofaeHu32NYXacMjysO9bCKL3dgIC6bTG1IEfmgh2zpkeErFHJVKX2m0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0eeee8910f6b18320da9855b6ff968c8848575fc0cd0b14b046bb407addf81d0","last_reissued_at":"2026-07-05T02:51:53.259996Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:51:53.259996Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$\\text{#NFA}$ admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace Classes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Cristian Riveros, Luis Alberto Croquevielle, Marcelo Arenas, Rajesh Jayaram","submitted_at":"2019-06-21T16:22:53Z","abstract_excerpt":"In this work, we study two simple yet general complexity classes, based on logspace Turing machines, which provide a unifying framework for efficient query evaluation in areas like information extraction and graph databases, among others. We investigate the complexity of three fundamental algorithmic problems for these classes: enumeration, counting and uniform generation of solutions, and show that they have several desirable properties in this respect.\n  Both complexity classes are defined in terms of non-deterministic logspace transducers (NL transducers). For the first class, we consider t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.09226","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1906.09226/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1906.09226","created_at":"2026-07-05T02:51:53.260081+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.09226v4","created_at":"2026-07-05T02:51:53.260081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.09226","created_at":"2026-07-05T02:51:53.260081+00:00"},{"alias_kind":"pith_short_12","alias_value":"B3XOREIPNMMD","created_at":"2026-07-05T02:51:53.260081+00:00"},{"alias_kind":"pith_short_16","alias_value":"B3XOREIPNMMDEDNJ","created_at":"2026-07-05T02:51:53.260081+00:00"},{"alias_kind":"pith_short_8","alias_value":"B3XOREIP","created_at":"2026-07-05T02:51:53.260081+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/B3XOREIPNMMDEDNJQVNW76LIZC","json":"https://pith.science/pith/B3XOREIPNMMDEDNJQVNW76LIZC.json","graph_json":"https://pith.science/api/pith-number/B3XOREIPNMMDEDNJQVNW76LIZC/graph.json","events_json":"https://pith.science/api/pith-number/B3XOREIPNMMDEDNJQVNW76LIZC/events.json","paper":"https://pith.science/paper/B3XOREIP"},"agent_actions":{"view_html":"https://pith.science/pith/B3XOREIPNMMDEDNJQVNW76LIZC","download_json":"https://pith.science/pith/B3XOREIPNMMDEDNJQVNW76LIZC.json","view_paper":"https://pith.science/paper/B3XOREIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.09226&json=true","fetch_graph":"https://pith.science/api/pith-number/B3XOREIPNMMDEDNJQVNW76LIZC/graph.json","fetch_events":"https://pith.science/api/pith-number/B3XOREIPNMMDEDNJQVNW76LIZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B3XOREIPNMMDEDNJQVNW76LIZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B3XOREIPNMMDEDNJQVNW76LIZC/action/storage_attestation","attest_author":"https://pith.science/pith/B3XOREIPNMMDEDNJQVNW76LIZC/action/author_attestation","sign_citation":"https://pith.science/pith/B3XOREIPNMMDEDNJQVNW76LIZC/action/citation_signature","submit_replication":"https://pith.science/pith/B3XOREIPNMMDEDNJQVNW76LIZC/action/replication_record"}},"created_at":"2026-07-05T02:51:53.260081+00:00","updated_at":"2026-07-05T02:51:53.260081+00:00"}