{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GMPLWH3YRFMHQTDYAG7DXPRQRN","short_pith_number":"pith:GMPLWH3Y","schema_version":"1.0","canonical_sha256":"331ebb1f788958784c7801be3bbe308b48de6f73c8fe9e26ece4714b14329cbf","source":{"kind":"arxiv","id":"1907.09271","version":1},"attestation_state":"computed","paper":{"title":"Succinct Representation for (Non)Deterministic Finite Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.FL"],"primary_cat":"cs.DS","authors_text":"Kunihiko Sadakane, Roberto Grossi, Sankardeep Chakraborty, Srinivasa Rao Satti","submitted_at":"2019-07-22T12:29:03Z","abstract_excerpt":"Deterministic finite automata are one of the simplest and most practical models of computation studied in automata theory. Their conceptual extension is the non-deterministic finite automata which also have plenty of applications. In this article, we study these models through the lens of succinct data structures where our ultimate goal is to encode these mathematical objects using information-theoretically optimal number of bits along with supporting queries on them efficiently. Towards this goal, we first design a succinct data structure for representing any deterministic finite automaton $\\"},"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":"1907.09271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-22T12:29:03Z","cross_cats_sorted":["cs.DM","cs.FL"],"title_canon_sha256":"65150cd05a0cf74732f6cfd4e81f10a58084150953c6dbfb0dbe2c2e895a7138","abstract_canon_sha256":"ae82330b6722adf56d435363bf6dff6e99aaf225c2fa0995f67f4bcde54acded"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:59.667436Z","signature_b64":"yO3JobVvGrjlP0dv3EUFisHbdU2SF5sGZbgOiZ6eAj4Froz2tkXHRzvRhOOur00Y2S4yvKxiigbtj+kNWuukDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"331ebb1f788958784c7801be3bbe308b48de6f73c8fe9e26ece4714b14329cbf","last_reissued_at":"2026-05-17T23:39:59.666856Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:59.666856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Succinct Representation for (Non)Deterministic Finite Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.FL"],"primary_cat":"cs.DS","authors_text":"Kunihiko Sadakane, Roberto Grossi, Sankardeep Chakraborty, Srinivasa Rao Satti","submitted_at":"2019-07-22T12:29:03Z","abstract_excerpt":"Deterministic finite automata are one of the simplest and most practical models of computation studied in automata theory. Their conceptual extension is the non-deterministic finite automata which also have plenty of applications. In this article, we study these models through the lens of succinct data structures where our ultimate goal is to encode these mathematical objects using information-theoretically optimal number of bits along with supporting queries on them efficiently. Towards this goal, we first design a succinct data structure for representing any deterministic finite automaton $\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09271","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":"1907.09271","created_at":"2026-05-17T23:39:59.666934+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.09271v1","created_at":"2026-05-17T23:39:59.666934+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09271","created_at":"2026-05-17T23:39:59.666934+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMPLWH3YRFMH","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMPLWH3YRFMHQTDY","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMPLWH3Y","created_at":"2026-05-18T12:33:18.533446+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/GMPLWH3YRFMHQTDYAG7DXPRQRN","json":"https://pith.science/pith/GMPLWH3YRFMHQTDYAG7DXPRQRN.json","graph_json":"https://pith.science/api/pith-number/GMPLWH3YRFMHQTDYAG7DXPRQRN/graph.json","events_json":"https://pith.science/api/pith-number/GMPLWH3YRFMHQTDYAG7DXPRQRN/events.json","paper":"https://pith.science/paper/GMPLWH3Y"},"agent_actions":{"view_html":"https://pith.science/pith/GMPLWH3YRFMHQTDYAG7DXPRQRN","download_json":"https://pith.science/pith/GMPLWH3YRFMHQTDYAG7DXPRQRN.json","view_paper":"https://pith.science/paper/GMPLWH3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.09271&json=true","fetch_graph":"https://pith.science/api/pith-number/GMPLWH3YRFMHQTDYAG7DXPRQRN/graph.json","fetch_events":"https://pith.science/api/pith-number/GMPLWH3YRFMHQTDYAG7DXPRQRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMPLWH3YRFMHQTDYAG7DXPRQRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMPLWH3YRFMHQTDYAG7DXPRQRN/action/storage_attestation","attest_author":"https://pith.science/pith/GMPLWH3YRFMHQTDYAG7DXPRQRN/action/author_attestation","sign_citation":"https://pith.science/pith/GMPLWH3YRFMHQTDYAG7DXPRQRN/action/citation_signature","submit_replication":"https://pith.science/pith/GMPLWH3YRFMHQTDYAG7DXPRQRN/action/replication_record"}},"created_at":"2026-05-17T23:39:59.666934+00:00","updated_at":"2026-05-17T23:39:59.666934+00:00"}