{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3DA5SPVMLBGNUG3SHJ2D54PVH2","short_pith_number":"pith:3DA5SPVM","canonical_record":{"source":{"id":"1305.3164","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-14T14:24:42Z","cross_cats_sorted":[],"title_canon_sha256":"a162626571fa5ea9a2b44438a26ca5220c75090c5c47d0bfe4b30cff1c26f896","abstract_canon_sha256":"b2363c834e8c0a76c0bd6946825c39c926424fb1aa25757274de766c988193c1"},"schema_version":"1.0"},"canonical_sha256":"d8c1d93eac584cda1b723a743ef1f53e88c22a8c5326952e7029f4001e011952","source":{"kind":"arxiv","id":"1305.3164","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3164","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3164v2","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3164","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"3DA5SPVMLBGN","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3DA5SPVMLBGNUG3S","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3DA5SPVM","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3DA5SPVMLBGNUG3SHJ2D54PVH2","target":"record","payload":{"canonical_record":{"source":{"id":"1305.3164","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-14T14:24:42Z","cross_cats_sorted":[],"title_canon_sha256":"a162626571fa5ea9a2b44438a26ca5220c75090c5c47d0bfe4b30cff1c26f896","abstract_canon_sha256":"b2363c834e8c0a76c0bd6946825c39c926424fb1aa25757274de766c988193c1"},"schema_version":"1.0"},"canonical_sha256":"d8c1d93eac584cda1b723a743ef1f53e88c22a8c5326952e7029f4001e011952","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:28.861548Z","signature_b64":"8YhUmzdBRH1uE+c558/5e0sXTIDgedeOohmCvSh9/u8TQ2iFXx5eRYQ3CvGlosgb0oz+hln6XQNrzoFA1qQMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8c1d93eac584cda1b723a743ef1f53e88c22a8c5326952e7029f4001e011952","last_reissued_at":"2026-05-18T03:18:28.860916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:28.860916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.3164","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:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"znJoy5RSeno1WcMiiN2fDMniciUqMkpgJsw1ZFXu+oCc0jXsvYMRHH8ILOx2G3LNalBtfB2j7Jk8GeMCtpjdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:30:37.424083Z"},"content_sha256":"beb4d93855b70e7d596939a491ccf52ce1c2f316d0e308889a0161adf0b91c88","schema_version":"1.0","event_id":"sha256:beb4d93855b70e7d596939a491ccf52ce1c2f316d0e308889a0161adf0b91c88"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3DA5SPVMLBGNUG3SHJ2D54PVH2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Heaviest Induced Ancestors and Longest Common Substrings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pawe{\\l} Gawrychowski, Travis Gagie, Yakov Nekrich","submitted_at":"2013-05-14T14:24:42Z","abstract_excerpt":"Suppose we have two trees on the same set of leaves, in which nodes are weighted such that children are heavier than their parents. We say a node from the first tree and a node from the second tree are induced together if they have a common leaf descendant. In this paper we describe data structures that efficiently support the following heaviest-induced-ancestor query: given a node from the first tree and a node from the second tree, find an induced pair of their ancestors with maximum combined weight. Our solutions are based on a geometric interpretation that enables us to find heaviest induc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3164","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:18:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5kQZjeUq7RvL2Vy6bBaMlumnxAdPFk+jEVnwGlI1bAnkbGeD5V2lGP6Q0YBFTmFMla2A18tXuzJUUdhA3YiOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:30:37.424787Z"},"content_sha256":"9b2699487359d7453cbf17a54b7dec0e87772c9b0ce81cc03417968a99c01747","schema_version":"1.0","event_id":"sha256:9b2699487359d7453cbf17a54b7dec0e87772c9b0ce81cc03417968a99c01747"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3DA5SPVMLBGNUG3SHJ2D54PVH2/bundle.json","state_url":"https://pith.science/pith/3DA5SPVMLBGNUG3SHJ2D54PVH2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3DA5SPVMLBGNUG3SHJ2D54PVH2/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-26T22:30:37Z","links":{"resolver":"https://pith.science/pith/3DA5SPVMLBGNUG3SHJ2D54PVH2","bundle":"https://pith.science/pith/3DA5SPVMLBGNUG3SHJ2D54PVH2/bundle.json","state":"https://pith.science/pith/3DA5SPVMLBGNUG3SHJ2D54PVH2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3DA5SPVMLBGNUG3SHJ2D54PVH2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3DA5SPVMLBGNUG3SHJ2D54PVH2","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":"b2363c834e8c0a76c0bd6946825c39c926424fb1aa25757274de766c988193c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-14T14:24:42Z","title_canon_sha256":"a162626571fa5ea9a2b44438a26ca5220c75090c5c47d0bfe4b30cff1c26f896"},"schema_version":"1.0","source":{"id":"1305.3164","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.3164","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"arxiv_version","alias_value":"1305.3164v2","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.3164","created_at":"2026-05-18T03:18:28Z"},{"alias_kind":"pith_short_12","alias_value":"3DA5SPVMLBGN","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3DA5SPVMLBGNUG3S","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3DA5SPVM","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:9b2699487359d7453cbf17a54b7dec0e87772c9b0ce81cc03417968a99c01747","target":"graph","created_at":"2026-05-18T03:18:28Z","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":"Suppose we have two trees on the same set of leaves, in which nodes are weighted such that children are heavier than their parents. We say a node from the first tree and a node from the second tree are induced together if they have a common leaf descendant. In this paper we describe data structures that efficiently support the following heaviest-induced-ancestor query: given a node from the first tree and a node from the second tree, find an induced pair of their ancestors with maximum combined weight. Our solutions are based on a geometric interpretation that enables us to find heaviest induc","authors_text":"Pawe{\\l} Gawrychowski, Travis Gagie, Yakov Nekrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-14T14:24:42Z","title":"Heaviest Induced Ancestors and Longest Common Substrings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.3164","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:beb4d93855b70e7d596939a491ccf52ce1c2f316d0e308889a0161adf0b91c88","target":"record","created_at":"2026-05-18T03:18:28Z","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":"b2363c834e8c0a76c0bd6946825c39c926424fb1aa25757274de766c988193c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-14T14:24:42Z","title_canon_sha256":"a162626571fa5ea9a2b44438a26ca5220c75090c5c47d0bfe4b30cff1c26f896"},"schema_version":"1.0","source":{"id":"1305.3164","kind":"arxiv","version":2}},"canonical_sha256":"d8c1d93eac584cda1b723a743ef1f53e88c22a8c5326952e7029f4001e011952","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8c1d93eac584cda1b723a743ef1f53e88c22a8c5326952e7029f4001e011952","first_computed_at":"2026-05-18T03:18:28.860916Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:28.860916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8YhUmzdBRH1uE+c558/5e0sXTIDgedeOohmCvSh9/u8TQ2iFXx5eRYQ3CvGlosgb0oz+hln6XQNrzoFA1qQMDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:28.861548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.3164","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:beb4d93855b70e7d596939a491ccf52ce1c2f316d0e308889a0161adf0b91c88","sha256:9b2699487359d7453cbf17a54b7dec0e87772c9b0ce81cc03417968a99c01747"],"state_sha256":"1518adc364399f7a26eb026edd1630f4bb0adb335b23065e338f2506bb161cf8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cr0i9t37/eJclVFlhaxvdkNR6OV2v8fmrDG4fqohJqYruWtiOe4sjJsYEPvFfNBycbvPWGauxojGk3mrzdAmAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:30:37.428418Z","bundle_sha256":"f70b3f93941e45b83f092a73b20fb14379551a7206a490a2b42b6365a54ff925"}}