{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:CVT3JTR763TIQB7I6NKBSSXT3M","short_pith_number":"pith:CVT3JTR7","canonical_record":{"source":{"id":"2305.02526","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-04T03:30:08Z","cross_cats_sorted":[],"title_canon_sha256":"ff6868944095721bad6e7cc21d5fdd2f9564023731aa278fd0cd152778925e98","abstract_canon_sha256":"c270cc5a3f62f36aee5eabb077b9b31792b38b81912983c86ef3abee7f7af3ee"},"schema_version":"1.0"},"canonical_sha256":"1567b4ce3ff6e68807e8f354194af3db005dce090bfe143db2a44f19db70ab81","source":{"kind":"arxiv","id":"2305.02526","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.02526","created_at":"2026-07-05T06:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"2305.02526v2","created_at":"2026-07-05T06:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.02526","created_at":"2026-07-05T06:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"CVT3JTR763TI","created_at":"2026-07-05T06:58:09Z"},{"alias_kind":"pith_short_16","alias_value":"CVT3JTR763TIQB7I","created_at":"2026-07-05T06:58:09Z"},{"alias_kind":"pith_short_8","alias_value":"CVT3JTR7","created_at":"2026-07-05T06:58:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:CVT3JTR763TIQB7I6NKBSSXT3M","target":"record","payload":{"canonical_record":{"source":{"id":"2305.02526","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-04T03:30:08Z","cross_cats_sorted":[],"title_canon_sha256":"ff6868944095721bad6e7cc21d5fdd2f9564023731aa278fd0cd152778925e98","abstract_canon_sha256":"c270cc5a3f62f36aee5eabb077b9b31792b38b81912983c86ef3abee7f7af3ee"},"schema_version":"1.0"},"canonical_sha256":"1567b4ce3ff6e68807e8f354194af3db005dce090bfe143db2a44f19db70ab81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:58:09.510200Z","signature_b64":"z2MiOZe+KYuzExOnbBrchYinsPjbDpfHLzz4DO8fIkvZ6ngeSx8p6XCxm4zi8ratWt/yz275IWZAVsW1QD69DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1567b4ce3ff6e68807e8f354194af3db005dce090bfe143db2a44f19db70ab81","last_reissued_at":"2026-07-05T06:58:09.509697Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:58:09.509697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.02526","source_version":2,"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-07-05T06:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zBYMSfGwmz1Q1HxZsaPmRp74NOnFPdeLh+AI+CSnkVCR94IqD5fCueLv1EzqOAw3XpcGlYkjJ1DjO4bcTcTbBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:30:55.875571Z"},"content_sha256":"58f474ea68866f9bde385316f7802616aa746ace0662234b78c7c81053e3780b","schema_version":"1.0","event_id":"sha256:58f474ea68866f9bde385316f7802616aa746ace0662234b78c7c81053e3780b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:CVT3JTR763TIQB7I6NKBSSXT3M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Prefix Sorting DFAs: a Recursive Algorithm","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nicola Cotumaccio","submitted_at":"2023-05-04T03:30:08Z","abstract_excerpt":"In the past thirty years, numerous algorithms for building the suffix array of a string have been proposed. In 2021, the notion of suffix array was extended from strings to DFAs, and it was shown that the resulting data structure can be built in $ O(m^2 + n^{5/2}) $ time, where $ n $ is the number of states and $ m $ is the number of edges [SODA 2021]. Recently, algorithms running in $ O(mn) $ and $ O(n^2\\log n) $ time have been described [CPM 2023].\n  In this paper, we improve the previous bounds by proposing an $ O(n^2) $ recursive algorithm inspired by Farach's algorithm for building a suff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.02526","kind":"arxiv","version":2},"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/2305.02526/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"},"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-07-05T06:58:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fvz6fRyxlmTxb/23yLggQ4pGo9jkjoQZGLAKIdvev0xogUYvpNUiRL+VK2mxN53wZ3CekZRbI4s4GHAY+RreBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T10:30:55.875937Z"},"content_sha256":"d0f6265888063446797df21f9179a078ad88dab747162de93494073e18a74601","schema_version":"1.0","event_id":"sha256:d0f6265888063446797df21f9179a078ad88dab747162de93494073e18a74601"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CVT3JTR763TIQB7I6NKBSSXT3M/bundle.json","state_url":"https://pith.science/pith/CVT3JTR763TIQB7I6NKBSSXT3M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CVT3JTR763TIQB7I6NKBSSXT3M/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-07-07T10:30:55Z","links":{"resolver":"https://pith.science/pith/CVT3JTR763TIQB7I6NKBSSXT3M","bundle":"https://pith.science/pith/CVT3JTR763TIQB7I6NKBSSXT3M/bundle.json","state":"https://pith.science/pith/CVT3JTR763TIQB7I6NKBSSXT3M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CVT3JTR763TIQB7I6NKBSSXT3M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:CVT3JTR763TIQB7I6NKBSSXT3M","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":"c270cc5a3f62f36aee5eabb077b9b31792b38b81912983c86ef3abee7f7af3ee","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-04T03:30:08Z","title_canon_sha256":"ff6868944095721bad6e7cc21d5fdd2f9564023731aa278fd0cd152778925e98"},"schema_version":"1.0","source":{"id":"2305.02526","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.02526","created_at":"2026-07-05T06:58:09Z"},{"alias_kind":"arxiv_version","alias_value":"2305.02526v2","created_at":"2026-07-05T06:58:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.02526","created_at":"2026-07-05T06:58:09Z"},{"alias_kind":"pith_short_12","alias_value":"CVT3JTR763TI","created_at":"2026-07-05T06:58:09Z"},{"alias_kind":"pith_short_16","alias_value":"CVT3JTR763TIQB7I","created_at":"2026-07-05T06:58:09Z"},{"alias_kind":"pith_short_8","alias_value":"CVT3JTR7","created_at":"2026-07-05T06:58:09Z"}],"graph_snapshots":[{"event_id":"sha256:d0f6265888063446797df21f9179a078ad88dab747162de93494073e18a74601","target":"graph","created_at":"2026-07-05T06:58:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2305.02526/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the past thirty years, numerous algorithms for building the suffix array of a string have been proposed. In 2021, the notion of suffix array was extended from strings to DFAs, and it was shown that the resulting data structure can be built in $ O(m^2 + n^{5/2}) $ time, where $ n $ is the number of states and $ m $ is the number of edges [SODA 2021]. Recently, algorithms running in $ O(mn) $ and $ O(n^2\\log n) $ time have been described [CPM 2023].\n  In this paper, we improve the previous bounds by proposing an $ O(n^2) $ recursive algorithm inspired by Farach's algorithm for building a suff","authors_text":"Nicola Cotumaccio","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-04T03:30:08Z","title":"Prefix Sorting DFAs: a Recursive Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.02526","kind":"arxiv","version":2},"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:58f474ea68866f9bde385316f7802616aa746ace0662234b78c7c81053e3780b","target":"record","created_at":"2026-07-05T06:58:09Z","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":"c270cc5a3f62f36aee5eabb077b9b31792b38b81912983c86ef3abee7f7af3ee","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2023-05-04T03:30:08Z","title_canon_sha256":"ff6868944095721bad6e7cc21d5fdd2f9564023731aa278fd0cd152778925e98"},"schema_version":"1.0","source":{"id":"2305.02526","kind":"arxiv","version":2}},"canonical_sha256":"1567b4ce3ff6e68807e8f354194af3db005dce090bfe143db2a44f19db70ab81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1567b4ce3ff6e68807e8f354194af3db005dce090bfe143db2a44f19db70ab81","first_computed_at":"2026-07-05T06:58:09.509697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:58:09.509697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z2MiOZe+KYuzExOnbBrchYinsPjbDpfHLzz4DO8fIkvZ6ngeSx8p6XCxm4zi8ratWt/yz275IWZAVsW1QD69DA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:58:09.510200Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.02526","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58f474ea68866f9bde385316f7802616aa746ace0662234b78c7c81053e3780b","sha256:d0f6265888063446797df21f9179a078ad88dab747162de93494073e18a74601"],"state_sha256":"1afe9857b3a8e05727f4472b46905a7aa8aaedd91f5cda6aaafcf80122949bb4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v02tVLtkskkLfzStI9yS/4+1yGoU/AOph9c4eHordj+0aKYFplVr1CekUFTxtdUQs3fZCOWkgGQUBpdSacFoDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T10:30:55.878063Z","bundle_sha256":"bdd6d38f545d1d1102ad72d4c4b5287e90e7f5829412618395954c242626ba48"}}