{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OIHURMRYLS3UYQ6EMBS4I7X2I6","short_pith_number":"pith:OIHURMRY","schema_version":"1.0","canonical_sha256":"720f48b2385cb74c43c46065c47efa47898bd215bc306537b6de425c1c004226","source":{"kind":"arxiv","id":"1301.3488","version":1},"attestation_state":"computed","paper":{"title":"Various improvements to text fingerprinting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IR"],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Mathieu Raffinot, Roman Kolpakov","submitted_at":"2013-01-15T20:59:43Z","abstract_excerpt":"Let s = s_1 .. s_n be a text (or sequence) on a finite alphabet \\Sigma of size \\sigma. A fingerprint in s is the set of distinct characters appearing in one of its substrings. The problem considered here is to compute the set {\\cal F} of all fingerprints of all substrings of s in order to answer efficiently certain questions on this set. A substring s_i .. s_j is a maximal location for a fingerprint f in F (denoted by <i,j>) if the alphabet of s_i .. s_j is f and s_{i-1}, s_{j+1}, if defined, are not in f. The set of maximal locations ins is {\\cal L} (it is easy to see that |{\\cal L}| \\leq n \\"},"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":"1301.3488","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-15T20:59:43Z","cross_cats_sorted":["cs.DM","cs.IR"],"title_canon_sha256":"56e9be5dd257e284283b845c7649892895bf2e1a5d57bebdc28807102f30df81","abstract_canon_sha256":"3fb288e6c1c8de48c4c983f17e34b968d7224166a88c504a8a6d039a0fab57fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:25.529199Z","signature_b64":"cnl6EZ4ekPetVlg8w/tEZB2oUxHetEr8DZFKIl6+pTIIs4Q5WWy3bNLjkBy93ALI7jDrdq8g5VYgQ8a5qwohCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"720f48b2385cb74c43c46065c47efa47898bd215bc306537b6de425c1c004226","last_reissued_at":"2026-05-18T03:36:25.528764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:25.528764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Various improvements to text fingerprinting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.IR"],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Mathieu Raffinot, Roman Kolpakov","submitted_at":"2013-01-15T20:59:43Z","abstract_excerpt":"Let s = s_1 .. s_n be a text (or sequence) on a finite alphabet \\Sigma of size \\sigma. A fingerprint in s is the set of distinct characters appearing in one of its substrings. The problem considered here is to compute the set {\\cal F} of all fingerprints of all substrings of s in order to answer efficiently certain questions on this set. A substring s_i .. s_j is a maximal location for a fingerprint f in F (denoted by <i,j>) if the alphabet of s_i .. s_j is f and s_{i-1}, s_{j+1}, if defined, are not in f. The set of maximal locations ins is {\\cal L} (it is easy to see that |{\\cal L}| \\leq n \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3488","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":"1301.3488","created_at":"2026-05-18T03:36:25.528841+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.3488v1","created_at":"2026-05-18T03:36:25.528841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3488","created_at":"2026-05-18T03:36:25.528841+00:00"},{"alias_kind":"pith_short_12","alias_value":"OIHURMRYLS3U","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OIHURMRYLS3UYQ6E","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OIHURMRY","created_at":"2026-05-18T12:27:54.935989+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/OIHURMRYLS3UYQ6EMBS4I7X2I6","json":"https://pith.science/pith/OIHURMRYLS3UYQ6EMBS4I7X2I6.json","graph_json":"https://pith.science/api/pith-number/OIHURMRYLS3UYQ6EMBS4I7X2I6/graph.json","events_json":"https://pith.science/api/pith-number/OIHURMRYLS3UYQ6EMBS4I7X2I6/events.json","paper":"https://pith.science/paper/OIHURMRY"},"agent_actions":{"view_html":"https://pith.science/pith/OIHURMRYLS3UYQ6EMBS4I7X2I6","download_json":"https://pith.science/pith/OIHURMRYLS3UYQ6EMBS4I7X2I6.json","view_paper":"https://pith.science/paper/OIHURMRY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.3488&json=true","fetch_graph":"https://pith.science/api/pith-number/OIHURMRYLS3UYQ6EMBS4I7X2I6/graph.json","fetch_events":"https://pith.science/api/pith-number/OIHURMRYLS3UYQ6EMBS4I7X2I6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OIHURMRYLS3UYQ6EMBS4I7X2I6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OIHURMRYLS3UYQ6EMBS4I7X2I6/action/storage_attestation","attest_author":"https://pith.science/pith/OIHURMRYLS3UYQ6EMBS4I7X2I6/action/author_attestation","sign_citation":"https://pith.science/pith/OIHURMRYLS3UYQ6EMBS4I7X2I6/action/citation_signature","submit_replication":"https://pith.science/pith/OIHURMRYLS3UYQ6EMBS4I7X2I6/action/replication_record"}},"created_at":"2026-05-18T03:36:25.528841+00:00","updated_at":"2026-05-18T03:36:25.528841+00:00"}