{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:POLTTARCNRMWODXV5CMF3UYFSU","short_pith_number":"pith:POLTTARC","canonical_record":{"source":{"id":"1212.4613","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-19T10:03:47Z","cross_cats_sorted":[],"title_canon_sha256":"11cb1ffbb0259d0e34e978a50e4770e8506f117aab2aa91f0f6c040b6137b9b7","abstract_canon_sha256":"95112a3e6a0e589d13a84da607d2830fcfd3c4b0270ee54121014c23860c10f8"},"schema_version":"1.0"},"canonical_sha256":"7b973982226c59670ef5e8985dd30595123f85d88228c64d465930613df69a56","source":{"kind":"arxiv","id":"1212.4613","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4613","created_at":"2026-05-18T03:36:36Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4613v2","created_at":"2026-05-18T03:36:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4613","created_at":"2026-05-18T03:36:36Z"},{"alias_kind":"pith_short_12","alias_value":"POLTTARCNRMW","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"POLTTARCNRMWODXV","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"POLTTARC","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:POLTTARCNRMWODXV5CMF3UYFSU","target":"record","payload":{"canonical_record":{"source":{"id":"1212.4613","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-19T10:03:47Z","cross_cats_sorted":[],"title_canon_sha256":"11cb1ffbb0259d0e34e978a50e4770e8506f117aab2aa91f0f6c040b6137b9b7","abstract_canon_sha256":"95112a3e6a0e589d13a84da607d2830fcfd3c4b0270ee54121014c23860c10f8"},"schema_version":"1.0"},"canonical_sha256":"7b973982226c59670ef5e8985dd30595123f85d88228c64d465930613df69a56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:36.081870Z","signature_b64":"xOAJ6IXPYG7Qu4VUdJre9aLFZy/USzb56mxwz5b/aG3eUDFRz8RYGwZN/07bWREJhQMQFn1J1WGjqSxGAFLBDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b973982226c59670ef5e8985dd30595123f85d88228c64d465930613df69a56","last_reissued_at":"2026-05-18T03:36:36.081268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:36.081268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.4613","source_version":2,"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:36:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qlGnVkC6lq5mkXrvVr11TwpsbUtsp/yJ/jtmRC7Ijr63nFu96mq+f92aw/+VD3vzHMibjoyOy/esSM71ZD7jBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:15:00.566391Z"},"content_sha256":"cffe2de6fc1b63b60f7996d1cf30de7e267488c2a70d8ceb2479d82a05ecded7","schema_version":"1.0","event_id":"sha256:cffe2de6fc1b63b60f7996d1cf30de7e267488c2a70d8ceb2479d82a05ecded7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:POLTTARCNRMWODXV5CMF3UYFSU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Algorithms for Position Heaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Travis Gagie, Tsung-Han Ku, Wing-Kai Hon","submitted_at":"2012-12-19T10:03:47Z","abstract_excerpt":"We present several results about position heaps, a relatively new alternative to suffix trees and suffix arrays. First, we show that, if we limit the maximum length of patterns to be sought, then we can also limit the height of the heap and reduce the worst-case cost of insertions and deletions. Second, we show how to build a position heap in linear time independent of the size of the alphabet. Third, we show how to augment a position heap such that it supports access to the corresponding suffix array, and vice versa. Fourth, we introduce a variant of a position heap that can be simulated effi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4613","kind":"arxiv","version":2},"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:36:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZqSSZduFC/ENznP5ysY981BxkviZlcqsLj/syCKDUUvlTylpbhXsaUqiZdQwtXeseMkBwu4TTBkKPgMZ0nVdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:15:00.567054Z"},"content_sha256":"82e65936005f42ad2faaf6cb8ba2a2292590ff4ff9d517ed1fb30715c6f844d6","schema_version":"1.0","event_id":"sha256:82e65936005f42ad2faaf6cb8ba2a2292590ff4ff9d517ed1fb30715c6f844d6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/POLTTARCNRMWODXV5CMF3UYFSU/bundle.json","state_url":"https://pith.science/pith/POLTTARCNRMWODXV5CMF3UYFSU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/POLTTARCNRMWODXV5CMF3UYFSU/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-26T21:15:00Z","links":{"resolver":"https://pith.science/pith/POLTTARCNRMWODXV5CMF3UYFSU","bundle":"https://pith.science/pith/POLTTARCNRMWODXV5CMF3UYFSU/bundle.json","state":"https://pith.science/pith/POLTTARCNRMWODXV5CMF3UYFSU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/POLTTARCNRMWODXV5CMF3UYFSU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:POLTTARCNRMWODXV5CMF3UYFSU","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":"95112a3e6a0e589d13a84da607d2830fcfd3c4b0270ee54121014c23860c10f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-19T10:03:47Z","title_canon_sha256":"11cb1ffbb0259d0e34e978a50e4770e8506f117aab2aa91f0f6c040b6137b9b7"},"schema_version":"1.0","source":{"id":"1212.4613","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.4613","created_at":"2026-05-18T03:36:36Z"},{"alias_kind":"arxiv_version","alias_value":"1212.4613v2","created_at":"2026-05-18T03:36:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4613","created_at":"2026-05-18T03:36:36Z"},{"alias_kind":"pith_short_12","alias_value":"POLTTARCNRMW","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"POLTTARCNRMWODXV","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"POLTTARC","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:82e65936005f42ad2faaf6cb8ba2a2292590ff4ff9d517ed1fb30715c6f844d6","target":"graph","created_at":"2026-05-18T03:36:36Z","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 present several results about position heaps, a relatively new alternative to suffix trees and suffix arrays. First, we show that, if we limit the maximum length of patterns to be sought, then we can also limit the height of the heap and reduce the worst-case cost of insertions and deletions. Second, we show how to build a position heap in linear time independent of the size of the alphabet. Third, we show how to augment a position heap such that it supports access to the corresponding suffix array, and vice versa. Fourth, we introduce a variant of a position heap that can be simulated effi","authors_text":"Travis Gagie, Tsung-Han Ku, Wing-Kai Hon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-19T10:03:47Z","title":"New Algorithms for Position Heaps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4613","kind":"arxiv","version":2},"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:cffe2de6fc1b63b60f7996d1cf30de7e267488c2a70d8ceb2479d82a05ecded7","target":"record","created_at":"2026-05-18T03:36:36Z","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":"95112a3e6a0e589d13a84da607d2830fcfd3c4b0270ee54121014c23860c10f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-19T10:03:47Z","title_canon_sha256":"11cb1ffbb0259d0e34e978a50e4770e8506f117aab2aa91f0f6c040b6137b9b7"},"schema_version":"1.0","source":{"id":"1212.4613","kind":"arxiv","version":2}},"canonical_sha256":"7b973982226c59670ef5e8985dd30595123f85d88228c64d465930613df69a56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b973982226c59670ef5e8985dd30595123f85d88228c64d465930613df69a56","first_computed_at":"2026-05-18T03:36:36.081268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:36.081268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xOAJ6IXPYG7Qu4VUdJre9aLFZy/USzb56mxwz5b/aG3eUDFRz8RYGwZN/07bWREJhQMQFn1J1WGjqSxGAFLBDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:36.081870Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.4613","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cffe2de6fc1b63b60f7996d1cf30de7e267488c2a70d8ceb2479d82a05ecded7","sha256:82e65936005f42ad2faaf6cb8ba2a2292590ff4ff9d517ed1fb30715c6f844d6"],"state_sha256":"026fde5dd237395b5e9f876f99d194d3f882b5992ebf0e1ffa1b1691c556d650"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AQ+ABGNaztbopKPB0f4FbSdi5I5gKl20vIyFIewEM2aDwYnXkAuht3PhdujIoLze55hrz+WzdiBR/H6XDYZOAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:15:00.570398Z","bundle_sha256":"0382f027aadb1846eea6a93886989d2c21a9ebb6a0089d328b3f3d70e13bc18a"}}