{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SICWA3F622WDAJKVE22U2YRL3S","short_pith_number":"pith:SICWA3F6","schema_version":"1.0","canonical_sha256":"9205606cbed6ac30255526b54d622bdcb0abb6aca933927b268163835441cd67","source":{"kind":"arxiv","id":"2504.03394","version":1},"attestation_state":"computed","paper":{"title":"Improved Circular Dictionary Matching","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nicola Cotumaccio","submitted_at":"2025-04-04T12:09:10Z","abstract_excerpt":"The circular dictionary matching problem is an extension of the classical dictionary matching problem where every string in the dictionary is interpreted as a circular string: after reading the last character of a string, we can move back to its first character. The circular dictionary matching problem is motivated by applications in bioinformatics and computational geometry.\n  In 2011, Hon et al. [ISAAC 2011] showed how to efficiently solve circular dictionary matching queries within compressed space by building on Mantaci et al.'s eBWT and Sadakane's compressed suffix tree. The proposed solu"},"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":"2504.03394","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-04T12:09:10Z","cross_cats_sorted":[],"title_canon_sha256":"a4b8a9ca2012379ea2da1953452f879dd89e411508ac65de24922ac92f7a3f99","abstract_canon_sha256":"85a135bba69af396986ac5cacc389c51ceb948c21fd824ab187fc432c36df53d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:44:31.372062Z","signature_b64":"w2zMyHZk7LRydX7vrmcL26T0F34dlq+XCGB3rsfKt3w0E8bZ1uWIeMSAbIyvdmyO//5OPjGEDsKpIcWJieN3Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9205606cbed6ac30255526b54d622bdcb0abb6aca933927b268163835441cd67","last_reissued_at":"2026-07-05T10:44:31.371583Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:44:31.371583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Circular Dictionary Matching","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nicola Cotumaccio","submitted_at":"2025-04-04T12:09:10Z","abstract_excerpt":"The circular dictionary matching problem is an extension of the classical dictionary matching problem where every string in the dictionary is interpreted as a circular string: after reading the last character of a string, we can move back to its first character. The circular dictionary matching problem is motivated by applications in bioinformatics and computational geometry.\n  In 2011, Hon et al. [ISAAC 2011] showed how to efficiently solve circular dictionary matching queries within compressed space by building on Mantaci et al.'s eBWT and Sadakane's compressed suffix tree. The proposed solu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.03394","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.03394/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":"2504.03394","created_at":"2026-07-05T10:44:31.371638+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.03394v1","created_at":"2026-07-05T10:44:31.371638+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.03394","created_at":"2026-07-05T10:44:31.371638+00:00"},{"alias_kind":"pith_short_12","alias_value":"SICWA3F622WD","created_at":"2026-07-05T10:44:31.371638+00:00"},{"alias_kind":"pith_short_16","alias_value":"SICWA3F622WDAJKV","created_at":"2026-07-05T10:44:31.371638+00:00"},{"alias_kind":"pith_short_8","alias_value":"SICWA3F6","created_at":"2026-07-05T10:44:31.371638+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/SICWA3F622WDAJKVE22U2YRL3S","json":"https://pith.science/pith/SICWA3F622WDAJKVE22U2YRL3S.json","graph_json":"https://pith.science/api/pith-number/SICWA3F622WDAJKVE22U2YRL3S/graph.json","events_json":"https://pith.science/api/pith-number/SICWA3F622WDAJKVE22U2YRL3S/events.json","paper":"https://pith.science/paper/SICWA3F6"},"agent_actions":{"view_html":"https://pith.science/pith/SICWA3F622WDAJKVE22U2YRL3S","download_json":"https://pith.science/pith/SICWA3F622WDAJKVE22U2YRL3S.json","view_paper":"https://pith.science/paper/SICWA3F6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.03394&json=true","fetch_graph":"https://pith.science/api/pith-number/SICWA3F622WDAJKVE22U2YRL3S/graph.json","fetch_events":"https://pith.science/api/pith-number/SICWA3F622WDAJKVE22U2YRL3S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SICWA3F622WDAJKVE22U2YRL3S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SICWA3F622WDAJKVE22U2YRL3S/action/storage_attestation","attest_author":"https://pith.science/pith/SICWA3F622WDAJKVE22U2YRL3S/action/author_attestation","sign_citation":"https://pith.science/pith/SICWA3F622WDAJKVE22U2YRL3S/action/citation_signature","submit_replication":"https://pith.science/pith/SICWA3F622WDAJKVE22U2YRL3S/action/replication_record"}},"created_at":"2026-07-05T10:44:31.371638+00:00","updated_at":"2026-07-05T10:44:31.371638+00:00"}