{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:KHG4P4ECMPD5WN5XFOGM7REK4P","short_pith_number":"pith:KHG4P4EC","canonical_record":{"source":{"id":"1705.01887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-04T15:59:56Z","cross_cats_sorted":[],"title_canon_sha256":"498fb3ad4acdfd469e832ace8a46e063c2729dd9101ebed8c21554e2dc796d08","abstract_canon_sha256":"8361fa0770e64253792fa8c877c272ea41fb1b49ea2a35b9fea1f3f68eb0c9a8"},"schema_version":"1.0"},"canonical_sha256":"51cdc7f08263c7db37b72b8ccfc48ae3ed4777915d22ce2bbf1add2650fbde3c","source":{"kind":"arxiv","id":"1705.01887","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01887","created_at":"2026-05-18T00:45:02Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01887v1","created_at":"2026-05-18T00:45:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01887","created_at":"2026-05-18T00:45:02Z"},{"alias_kind":"pith_short_12","alias_value":"KHG4P4ECMPD5","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KHG4P4ECMPD5WN5X","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KHG4P4EC","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:KHG4P4ECMPD5WN5XFOGM7REK4P","target":"record","payload":{"canonical_record":{"source":{"id":"1705.01887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-04T15:59:56Z","cross_cats_sorted":[],"title_canon_sha256":"498fb3ad4acdfd469e832ace8a46e063c2729dd9101ebed8c21554e2dc796d08","abstract_canon_sha256":"8361fa0770e64253792fa8c877c272ea41fb1b49ea2a35b9fea1f3f68eb0c9a8"},"schema_version":"1.0"},"canonical_sha256":"51cdc7f08263c7db37b72b8ccfc48ae3ed4777915d22ce2bbf1add2650fbde3c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:02.093565Z","signature_b64":"U3ejAahLkJ733z5hkjf6CHf2N7PtFhQr2tHP8Q/88NPm7ro9jdSiAZLp4E/a7g4KxvjQWuJH5b9q6th7bUINBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51cdc7f08263c7db37b72b8ccfc48ae3ed4777915d22ce2bbf1add2650fbde3c","last_reissued_at":"2026-05-18T00:45:02.093176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:02.093176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.01887","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-18T00:45:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7MN6fYL+NGLNg8jHyX/U7EK5aKR8EDZF8qzSnbp/tuBETpS0ZyH5uGffRaQCTaUBm/gDifWbI2/mP0SNGKC+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:56:03.790455Z"},"content_sha256":"d722df4f0eb8752969fd4097452c29d33da860cc70032cc548ba3cb27620258d","schema_version":"1.0","event_id":"sha256:d722df4f0eb8752969fd4097452c29d33da860cc70032cc548ba3cb27620258d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:KHG4P4ECMPD5WN5XFOGM7REK4P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Streaming for Aibohphobes: Longest Palindrome with Mismatches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou","submitted_at":"2017-05-04T15:59:56Z","abstract_excerpt":"A palindrome is a string that reads the same as its reverse, such as \"aibohphobia\" (fear of palindromes). Given an integer $d>0$, a $d$-near-palindrome is a string of Hamming distance at most $d$ from its reverse. We study the natural problem of identifying a longest $d$-near-palindrome in data streams. The problem is relevant to the analysis of DNA databases, and to the task of repairing recursive structures in documents such as XML and JSON. We present an algorithm that returns a $d$-near-palindrome whose length is within a multiplicative $(1+\\epsilon)$-factor of the longest $d$-near-palindr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01887","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-18T00:45:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"37Oi/xMOOCxOXUpE1zNuAuh24t1DZLbpIXAeVHIfoqd9G9QiwZJVFmh6u6p0OQ7N6Fz1hkJD4N28UyYTsftOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:56:03.791075Z"},"content_sha256":"bf4b7c97351c202bbd93b7b3c81fc066c71cbf2756966ec2f8e22a57af641218","schema_version":"1.0","event_id":"sha256:bf4b7c97351c202bbd93b7b3c81fc066c71cbf2756966ec2f8e22a57af641218"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHG4P4ECMPD5WN5XFOGM7REK4P/bundle.json","state_url":"https://pith.science/pith/KHG4P4ECMPD5WN5XFOGM7REK4P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHG4P4ECMPD5WN5XFOGM7REK4P/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-05-26T16:56:03Z","links":{"resolver":"https://pith.science/pith/KHG4P4ECMPD5WN5XFOGM7REK4P","bundle":"https://pith.science/pith/KHG4P4ECMPD5WN5XFOGM7REK4P/bundle.json","state":"https://pith.science/pith/KHG4P4ECMPD5WN5XFOGM7REK4P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHG4P4ECMPD5WN5XFOGM7REK4P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:KHG4P4ECMPD5WN5XFOGM7REK4P","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":"8361fa0770e64253792fa8c877c272ea41fb1b49ea2a35b9fea1f3f68eb0c9a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-04T15:59:56Z","title_canon_sha256":"498fb3ad4acdfd469e832ace8a46e063c2729dd9101ebed8c21554e2dc796d08"},"schema_version":"1.0","source":{"id":"1705.01887","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01887","created_at":"2026-05-18T00:45:02Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01887v1","created_at":"2026-05-18T00:45:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01887","created_at":"2026-05-18T00:45:02Z"},{"alias_kind":"pith_short_12","alias_value":"KHG4P4ECMPD5","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"KHG4P4ECMPD5WN5X","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"KHG4P4EC","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:bf4b7c97351c202bbd93b7b3c81fc066c71cbf2756966ec2f8e22a57af641218","target":"graph","created_at":"2026-05-18T00:45:02Z","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":"A palindrome is a string that reads the same as its reverse, such as \"aibohphobia\" (fear of palindromes). Given an integer $d>0$, a $d$-near-palindrome is a string of Hamming distance at most $d$ from its reverse. We study the natural problem of identifying a longest $d$-near-palindrome in data streams. The problem is relevant to the analysis of DNA databases, and to the task of repairing recursive structures in documents such as XML and JSON. We present an algorithm that returns a $d$-near-palindrome whose length is within a multiplicative $(1+\\epsilon)$-factor of the longest $d$-near-palindr","authors_text":"Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-04T15:59:56Z","title":"Streaming for Aibohphobes: Longest Palindrome with Mismatches"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01887","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:d722df4f0eb8752969fd4097452c29d33da860cc70032cc548ba3cb27620258d","target":"record","created_at":"2026-05-18T00:45:02Z","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":"8361fa0770e64253792fa8c877c272ea41fb1b49ea2a35b9fea1f3f68eb0c9a8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-04T15:59:56Z","title_canon_sha256":"498fb3ad4acdfd469e832ace8a46e063c2729dd9101ebed8c21554e2dc796d08"},"schema_version":"1.0","source":{"id":"1705.01887","kind":"arxiv","version":1}},"canonical_sha256":"51cdc7f08263c7db37b72b8ccfc48ae3ed4777915d22ce2bbf1add2650fbde3c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51cdc7f08263c7db37b72b8ccfc48ae3ed4777915d22ce2bbf1add2650fbde3c","first_computed_at":"2026-05-18T00:45:02.093176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:02.093176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U3ejAahLkJ733z5hkjf6CHf2N7PtFhQr2tHP8Q/88NPm7ro9jdSiAZLp4E/a7g4KxvjQWuJH5b9q6th7bUINBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:02.093565Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.01887","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d722df4f0eb8752969fd4097452c29d33da860cc70032cc548ba3cb27620258d","sha256:bf4b7c97351c202bbd93b7b3c81fc066c71cbf2756966ec2f8e22a57af641218"],"state_sha256":"3497b23983be40694bb69bddce794a719b0a3351ba9b4ebf68245ccf4fbdb37a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9utvsBt0M+cWPj1UMsRnljvY/irLQvxcEI17BI3U03/ZMPdTyCpvGJjGvx55yfofgGDvddvDUW5F/WKOT4taCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:56:03.794160Z","bundle_sha256":"cb76236a9cc46a06b15ca6bb7536cf49adfb048d2991603ff521ed009d12d530"}}