{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EBQNCJRM3PMAQ6K3GJ4LXRBEJQ","short_pith_number":"pith:EBQNCJRM","schema_version":"1.0","canonical_sha256":"2060d1262cdbd808795b3278bbc4244c0ed377a17e34cf2ce4c8f6ba9e04398b","source":{"kind":"arxiv","id":"1304.5560","version":1},"attestation_state":"computed","paper":{"title":"Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandru I. Tomescu, Eduardo Sany Laber, Emanuele Giaquinta, Ferdinando Cicalese, Romeo Rizzi, Travis Gagie, Zsuzsanna Lipt\\'ak","submitted_at":"2013-04-19T22:50:32Z","abstract_excerpt":"We consider how to index strings, trees and graphs for jumbled pattern matching when we are asked to return a match if one exists. For example, we show how, given a tree containing two colours, we can build a quadratic-space index with which we can find a match in time proportional to the size of the match. We also show how we need only linear space if we are content with approximate matches."},"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":"1304.5560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-19T22:50:32Z","cross_cats_sorted":[],"title_canon_sha256":"ea1b5d3162a8f9242bdffab4d5dfd91699eca50d69d5ab803d9e200fcdf24502","abstract_canon_sha256":"a08f73ec9cbbc1708dd6402dfa78df4e3c9fedb997014cff2c19694905e712d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:31.671636Z","signature_b64":"AEghpbrq1JcCNZ6csTPUvc90cv8W1P+cQe45zovM3vtIILj5EPhiX625ewJvfZSRdS3H7lIDl6Od48MhpP+VCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2060d1262cdbd808795b3278bbc4244c0ed377a17e34cf2ce4c8f6ba9e04398b","last_reissued_at":"2026-05-18T03:27:31.671003Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:31.671003Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexandru I. Tomescu, Eduardo Sany Laber, Emanuele Giaquinta, Ferdinando Cicalese, Romeo Rizzi, Travis Gagie, Zsuzsanna Lipt\\'ak","submitted_at":"2013-04-19T22:50:32Z","abstract_excerpt":"We consider how to index strings, trees and graphs for jumbled pattern matching when we are asked to return a match if one exists. For example, we show how, given a tree containing two colours, we can build a quadratic-space index with which we can find a match in time proportional to the size of the match. We also show how we need only linear space if we are content with approximate matches."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5560","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":"1304.5560","created_at":"2026-05-18T03:27:31.671092+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.5560v1","created_at":"2026-05-18T03:27:31.671092+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5560","created_at":"2026-05-18T03:27:31.671092+00:00"},{"alias_kind":"pith_short_12","alias_value":"EBQNCJRM3PMA","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EBQNCJRM3PMAQ6K3","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EBQNCJRM","created_at":"2026-05-18T12:27:43.054852+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/EBQNCJRM3PMAQ6K3GJ4LXRBEJQ","json":"https://pith.science/pith/EBQNCJRM3PMAQ6K3GJ4LXRBEJQ.json","graph_json":"https://pith.science/api/pith-number/EBQNCJRM3PMAQ6K3GJ4LXRBEJQ/graph.json","events_json":"https://pith.science/api/pith-number/EBQNCJRM3PMAQ6K3GJ4LXRBEJQ/events.json","paper":"https://pith.science/paper/EBQNCJRM"},"agent_actions":{"view_html":"https://pith.science/pith/EBQNCJRM3PMAQ6K3GJ4LXRBEJQ","download_json":"https://pith.science/pith/EBQNCJRM3PMAQ6K3GJ4LXRBEJQ.json","view_paper":"https://pith.science/paper/EBQNCJRM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.5560&json=true","fetch_graph":"https://pith.science/api/pith-number/EBQNCJRM3PMAQ6K3GJ4LXRBEJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/EBQNCJRM3PMAQ6K3GJ4LXRBEJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EBQNCJRM3PMAQ6K3GJ4LXRBEJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EBQNCJRM3PMAQ6K3GJ4LXRBEJQ/action/storage_attestation","attest_author":"https://pith.science/pith/EBQNCJRM3PMAQ6K3GJ4LXRBEJQ/action/author_attestation","sign_citation":"https://pith.science/pith/EBQNCJRM3PMAQ6K3GJ4LXRBEJQ/action/citation_signature","submit_replication":"https://pith.science/pith/EBQNCJRM3PMAQ6K3GJ4LXRBEJQ/action/replication_record"}},"created_at":"2026-05-18T03:27:31.671092+00:00","updated_at":"2026-05-18T03:27:31.671092+00:00"}