{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:SICWA3F622WDAJKVE22U2YRL3S","short_pith_number":"pith:SICWA3F6","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"},"canonical_sha256":"9205606cbed6ac30255526b54d622bdcb0abb6aca933927b268163835441cd67","source":{"kind":"arxiv","id":"2504.03394","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.03394","created_at":"2026-07-05T10:44:31Z"},{"alias_kind":"arxiv_version","alias_value":"2504.03394v1","created_at":"2026-07-05T10:44:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.03394","created_at":"2026-07-05T10:44:31Z"},{"alias_kind":"pith_short_12","alias_value":"SICWA3F622WD","created_at":"2026-07-05T10:44:31Z"},{"alias_kind":"pith_short_16","alias_value":"SICWA3F622WDAJKV","created_at":"2026-07-05T10:44:31Z"},{"alias_kind":"pith_short_8","alias_value":"SICWA3F6","created_at":"2026-07-05T10:44:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:SICWA3F622WDAJKVE22U2YRL3S","target":"record","payload":{"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"},"canonical_sha256":"9205606cbed6ac30255526b54d622bdcb0abb6aca933927b268163835441cd67","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"},"source_kind":"arxiv","source_id":"2504.03394","source_version":1,"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-05T10:44:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GPyaX+rLs/Nc1MDkYNvEaF1YfsKOBkkbQstSDN0G+3K/SlnkrZY7z1h2deNXJ1Z+KPluknB1bMQYRqBSH0QzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T02:37:41.304412Z"},"content_sha256":"6e209646b5624f16ddcbe78f60001f281b481199ef62317d128729ed3f84ae05","schema_version":"1.0","event_id":"sha256:6e209646b5624f16ddcbe78f60001f281b481199ef62317d128729ed3f84ae05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:SICWA3F622WDAJKVE22U2YRL3S","target":"graph","payload":{"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"},"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-05T10:44:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O8SjiT1lSA5vPZhFbOflwYdFZ2jIqtoPqJSZmXc7wEA5ablg3FX4NtKzj/GpA6xyV8d/uvJBLOvwH58ZtJAJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T02:37:41.304799Z"},"content_sha256":"3f68610b45716ba32f359ed9d573309c650a3944e0dd2f1a7995a8d255fdf39a","schema_version":"1.0","event_id":"sha256:3f68610b45716ba32f359ed9d573309c650a3944e0dd2f1a7995a8d255fdf39a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SICWA3F622WDAJKVE22U2YRL3S/bundle.json","state_url":"https://pith.science/pith/SICWA3F622WDAJKVE22U2YRL3S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SICWA3F622WDAJKVE22U2YRL3S/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-07T02:37:41Z","links":{"resolver":"https://pith.science/pith/SICWA3F622WDAJKVE22U2YRL3S","bundle":"https://pith.science/pith/SICWA3F622WDAJKVE22U2YRL3S/bundle.json","state":"https://pith.science/pith/SICWA3F622WDAJKVE22U2YRL3S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SICWA3F622WDAJKVE22U2YRL3S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:SICWA3F622WDAJKVE22U2YRL3S","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":"85a135bba69af396986ac5cacc389c51ceb948c21fd824ab187fc432c36df53d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-04T12:09:10Z","title_canon_sha256":"a4b8a9ca2012379ea2da1953452f879dd89e411508ac65de24922ac92f7a3f99"},"schema_version":"1.0","source":{"id":"2504.03394","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.03394","created_at":"2026-07-05T10:44:31Z"},{"alias_kind":"arxiv_version","alias_value":"2504.03394v1","created_at":"2026-07-05T10:44:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.03394","created_at":"2026-07-05T10:44:31Z"},{"alias_kind":"pith_short_12","alias_value":"SICWA3F622WD","created_at":"2026-07-05T10:44:31Z"},{"alias_kind":"pith_short_16","alias_value":"SICWA3F622WDAJKV","created_at":"2026-07-05T10:44:31Z"},{"alias_kind":"pith_short_8","alias_value":"SICWA3F6","created_at":"2026-07-05T10:44:31Z"}],"graph_snapshots":[{"event_id":"sha256:3f68610b45716ba32f359ed9d573309c650a3944e0dd2f1a7995a8d255fdf39a","target":"graph","created_at":"2026-07-05T10:44:31Z","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/2504.03394/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Nicola Cotumaccio","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-04T12:09:10Z","title":"Improved Circular Dictionary Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.03394","kind":"arxiv","version":1},"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:6e209646b5624f16ddcbe78f60001f281b481199ef62317d128729ed3f84ae05","target":"record","created_at":"2026-07-05T10:44:31Z","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":"85a135bba69af396986ac5cacc389c51ceb948c21fd824ab187fc432c36df53d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2025-04-04T12:09:10Z","title_canon_sha256":"a4b8a9ca2012379ea2da1953452f879dd89e411508ac65de24922ac92f7a3f99"},"schema_version":"1.0","source":{"id":"2504.03394","kind":"arxiv","version":1}},"canonical_sha256":"9205606cbed6ac30255526b54d622bdcb0abb6aca933927b268163835441cd67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9205606cbed6ac30255526b54d622bdcb0abb6aca933927b268163835441cd67","first_computed_at":"2026-07-05T10:44:31.371583Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:44:31.371583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w2zMyHZk7LRydX7vrmcL26T0F34dlq+XCGB3rsfKt3w0E8bZ1uWIeMSAbIyvdmyO//5OPjGEDsKpIcWJieN3Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:44:31.372062Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.03394","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e209646b5624f16ddcbe78f60001f281b481199ef62317d128729ed3f84ae05","sha256:3f68610b45716ba32f359ed9d573309c650a3944e0dd2f1a7995a8d255fdf39a"],"state_sha256":"d0ead10f38f62c0dbd5b9ad77c77a4e313373bc373968c6aa7fa9572e1c09768"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nL3BohKYqg4tD2edm4jQWs49o30mMRONGk5L3HnbhP5gTJC0R79GEd1MqxT8TXFPEyZsTYULFA9DjutiCeYiCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T02:37:41.307467Z","bundle_sha256":"4f5e9bb06884c48bbc23448978f6336beb84706633a3e49b02a1e25b3d42d59a"}}