{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XHK4C2CAGZM22NUJVWFFDGRTHY","short_pith_number":"pith:XHK4C2CA","canonical_record":{"source":{"id":"1304.0528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-02T04:41:33Z","cross_cats_sorted":[],"title_canon_sha256":"e3c45f07a1b28342eb06d2a5480e1492436becc79a80edf90152d9e4c480b56a","abstract_canon_sha256":"b1ca510c9aecb8a4ce2f39a3a68060d167895cd57e8273da575fa4b9002b5afd"},"schema_version":"1.0"},"canonical_sha256":"b9d5c168403659ad3689ad8a519a333e03fa6be7fbabdec9b1e3a50ddaa2f1dd","source":{"kind":"arxiv","id":"1304.0528","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0528","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0528v1","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0528","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"pith_short_12","alias_value":"XHK4C2CAGZM2","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XHK4C2CAGZM22NUJ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XHK4C2CA","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XHK4C2CAGZM22NUJVWFFDGRTHY","target":"record","payload":{"canonical_record":{"source":{"id":"1304.0528","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-02T04:41:33Z","cross_cats_sorted":[],"title_canon_sha256":"e3c45f07a1b28342eb06d2a5480e1492436becc79a80edf90152d9e4c480b56a","abstract_canon_sha256":"b1ca510c9aecb8a4ce2f39a3a68060d167895cd57e8273da575fa4b9002b5afd"},"schema_version":"1.0"},"canonical_sha256":"b9d5c168403659ad3689ad8a519a333e03fa6be7fbabdec9b1e3a50ddaa2f1dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:15.160262Z","signature_b64":"iyEerWKZkwIqhj/lFHthS61PXXWIX01VVdkd1Vhg98w/NF6RYfb3K4zSgoM6oon2i16iDY1rgDosvfAEeOuXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9d5c168403659ad3689ad8a519a333e03fa6be7fbabdec9b1e3a50ddaa2f1dd","last_reissued_at":"2026-05-18T03:29:15.159532Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:15.159532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.0528","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-05-18T03:29:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cp+ejaqGRJ7rraRWfxegH7vtyaLc0o1u3XalXfuV/3PTwPbtFUZiMH3CTB2Fph10uMmG2m3WrOTN6o15IfLECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:19:00.342999Z"},"content_sha256":"21d1bc9bf8bc9dd43e956f468d3f69607da8ee425bcd18d07c5a7e188fa88ae8","schema_version":"1.0","event_id":"sha256:21d1bc9bf8bc9dd43e956f468d3f69607da8ee425bcd18d07c5a7e188fa88ae8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XHK4C2CAGZM22NUJVWFFDGRTHY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient repeat finding via suffix arrays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alejandro Deymonnaz, Pablo Ariel Heiber, Veronica Becher","submitted_at":"2013-04-02T04:41:33Z","abstract_excerpt":"We solve the problem of finding interspersed maximal repeats using a suffix array construction. As it is well known, all the functionality of suffix trees can be handled by suffix arrays, gaining practicality. Our solution improves the suffix tree based approaches for the repeat finding problem, being particularly well suited for very large inputs. We prove the corrrectness and complexity of the algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0528","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"},"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-05-18T03:29:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NNpriEH4McUvNk0tISoEg1hH7CyCbaEDWwmLzTRs6xHGRRBh+5WGe+WJ7DEilBI5Zgisct9P5xxD7lJc67qzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T08:19:00.343353Z"},"content_sha256":"b6ff98f67f2faf201e5a3cd8b53a7a9d7a4aaa7adcb4539d05dca36e76402fe8","schema_version":"1.0","event_id":"sha256:b6ff98f67f2faf201e5a3cd8b53a7a9d7a4aaa7adcb4539d05dca36e76402fe8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XHK4C2CAGZM22NUJVWFFDGRTHY/bundle.json","state_url":"https://pith.science/pith/XHK4C2CAGZM22NUJVWFFDGRTHY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XHK4C2CAGZM22NUJVWFFDGRTHY/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-06-25T08:19:00Z","links":{"resolver":"https://pith.science/pith/XHK4C2CAGZM22NUJVWFFDGRTHY","bundle":"https://pith.science/pith/XHK4C2CAGZM22NUJVWFFDGRTHY/bundle.json","state":"https://pith.science/pith/XHK4C2CAGZM22NUJVWFFDGRTHY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XHK4C2CAGZM22NUJVWFFDGRTHY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XHK4C2CAGZM22NUJVWFFDGRTHY","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":"b1ca510c9aecb8a4ce2f39a3a68060d167895cd57e8273da575fa4b9002b5afd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-02T04:41:33Z","title_canon_sha256":"e3c45f07a1b28342eb06d2a5480e1492436becc79a80edf90152d9e4c480b56a"},"schema_version":"1.0","source":{"id":"1304.0528","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.0528","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"arxiv_version","alias_value":"1304.0528v1","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.0528","created_at":"2026-05-18T03:29:15Z"},{"alias_kind":"pith_short_12","alias_value":"XHK4C2CAGZM2","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XHK4C2CAGZM22NUJ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XHK4C2CA","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:b6ff98f67f2faf201e5a3cd8b53a7a9d7a4aaa7adcb4539d05dca36e76402fe8","target":"graph","created_at":"2026-05-18T03:29:15Z","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"},"paper":{"abstract_excerpt":"We solve the problem of finding interspersed maximal repeats using a suffix array construction. As it is well known, all the functionality of suffix trees can be handled by suffix arrays, gaining practicality. Our solution improves the suffix tree based approaches for the repeat finding problem, being particularly well suited for very large inputs. We prove the corrrectness and complexity of the algorithms.","authors_text":"Alejandro Deymonnaz, Pablo Ariel Heiber, Veronica Becher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-02T04:41:33Z","title":"Efficient repeat finding via suffix arrays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.0528","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:21d1bc9bf8bc9dd43e956f468d3f69607da8ee425bcd18d07c5a7e188fa88ae8","target":"record","created_at":"2026-05-18T03:29:15Z","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":"b1ca510c9aecb8a4ce2f39a3a68060d167895cd57e8273da575fa4b9002b5afd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-02T04:41:33Z","title_canon_sha256":"e3c45f07a1b28342eb06d2a5480e1492436becc79a80edf90152d9e4c480b56a"},"schema_version":"1.0","source":{"id":"1304.0528","kind":"arxiv","version":1}},"canonical_sha256":"b9d5c168403659ad3689ad8a519a333e03fa6be7fbabdec9b1e3a50ddaa2f1dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b9d5c168403659ad3689ad8a519a333e03fa6be7fbabdec9b1e3a50ddaa2f1dd","first_computed_at":"2026-05-18T03:29:15.159532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:15.159532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iyEerWKZkwIqhj/lFHthS61PXXWIX01VVdkd1Vhg98w/NF6RYfb3K4zSgoM6oon2i16iDY1rgDosvfAEeOuXBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:15.160262Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.0528","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21d1bc9bf8bc9dd43e956f468d3f69607da8ee425bcd18d07c5a7e188fa88ae8","sha256:b6ff98f67f2faf201e5a3cd8b53a7a9d7a4aaa7adcb4539d05dca36e76402fe8"],"state_sha256":"88594d0fd28cd07c6bd49c27159df1e035bd2b088ce447f63c505b71c26103b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cn3hJ11RdkU9MxglNmZ9nhIN6RtiYigcyuwunFt1DzhyDIFr43ASqfc2nfl0F04omvg1plhqoJApygl2md1NCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T08:19:00.345263Z","bundle_sha256":"f868265f651a24a040e128143cc055e47b11ee0750ddc1680c0aa539e88de011"}}