{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FG7F23ZFILFYKHFASW6RNBF5QI","short_pith_number":"pith:FG7F23ZF","canonical_record":{"source":{"id":"1902.08742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-23T06:04:30Z","cross_cats_sorted":[],"title_canon_sha256":"2454da52f6d35a8a36595b15d95b3628a1ce83f129c51673ff1b5fba3c2fbe6d","abstract_canon_sha256":"24e943aa4608468e0d662745fbe7a83f744a4c44398f684ebfad94d7c73faf51"},"schema_version":"1.0"},"canonical_sha256":"29be5d6f2542cb851ca095bd1684bd823426e118acc474f064f60329dedb51b9","source":{"kind":"arxiv","id":"1902.08742","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08742","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08742v1","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08742","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"pith_short_12","alias_value":"FG7F23ZFILFY","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FG7F23ZFILFYKHFA","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FG7F23ZF","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FG7F23ZFILFYKHFASW6RNBF5QI","target":"record","payload":{"canonical_record":{"source":{"id":"1902.08742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-23T06:04:30Z","cross_cats_sorted":[],"title_canon_sha256":"2454da52f6d35a8a36595b15d95b3628a1ce83f129c51673ff1b5fba3c2fbe6d","abstract_canon_sha256":"24e943aa4608468e0d662745fbe7a83f744a4c44398f684ebfad94d7c73faf51"},"schema_version":"1.0"},"canonical_sha256":"29be5d6f2542cb851ca095bd1684bd823426e118acc474f064f60329dedb51b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:50.106837Z","signature_b64":"yqTkDMcg1Mr+DgRytaKvyi77SLox0hfpALPzdHcmNnnMXWDIBeLR4pbTMfqCesfGUStOTP8fGpsEBi4TZjjuCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29be5d6f2542cb851ca095bd1684bd823426e118acc474f064f60329dedb51b9","last_reissued_at":"2026-05-17T23:52:50.106051Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:50.106051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.08742","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-17T23:52:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7QBtxPgymxeApEc5AZ0dlRqP/V2lRgD8oewa75Ji22K3ghR9+fgGVgM9LZqIL+x0ML2CLovUZ4q7KhebhgAHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:00:14.895832Z"},"content_sha256":"1765f31eaaf45c625cc8ef4df53f302a9ad0c41d1f725e7ac513f80eac976f8c","schema_version":"1.0","event_id":"sha256:1765f31eaaf45c625cc8ef4df53f302a9ad0c41d1f725e7ac513f80eac976f8c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FG7F23ZFILFYKHFASW6RNBF5QI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Algorithm to Reconstruct a Tree from a Subtree Distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kazutoshi Ando, Takanori Maehara","submitted_at":"2019-02-23T06:04:30Z","abstract_excerpt":"This paper addresses the problem of finding a representation of a subtree distance, which is an extension of the tree metric. We show that a minimal representation is uniquely determined by a given subtree distance, and give a linear time algorithm that finds such a representation. This algorithm achieves the optimal time complexity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08742","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-17T23:52:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IurTndekV2ux1Lln8s6FwM1vJITr+ZK286smE/270ohqto2N+EJHV3Qsi9ZQL1EKJf/sngCnE7o3dd0xfUWlCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:00:14.896190Z"},"content_sha256":"bc11011bae43407d597218db352f39ba3686fbabb78c4e275c6201925c655d72","schema_version":"1.0","event_id":"sha256:bc11011bae43407d597218db352f39ba3686fbabb78c4e275c6201925c655d72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FG7F23ZFILFYKHFASW6RNBF5QI/bundle.json","state_url":"https://pith.science/pith/FG7F23ZFILFYKHFASW6RNBF5QI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FG7F23ZFILFYKHFASW6RNBF5QI/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-28T23:00:14Z","links":{"resolver":"https://pith.science/pith/FG7F23ZFILFYKHFASW6RNBF5QI","bundle":"https://pith.science/pith/FG7F23ZFILFYKHFASW6RNBF5QI/bundle.json","state":"https://pith.science/pith/FG7F23ZFILFYKHFASW6RNBF5QI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FG7F23ZFILFYKHFASW6RNBF5QI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FG7F23ZFILFYKHFASW6RNBF5QI","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":"24e943aa4608468e0d662745fbe7a83f744a4c44398f684ebfad94d7c73faf51","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-23T06:04:30Z","title_canon_sha256":"2454da52f6d35a8a36595b15d95b3628a1ce83f129c51673ff1b5fba3c2fbe6d"},"schema_version":"1.0","source":{"id":"1902.08742","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.08742","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"arxiv_version","alias_value":"1902.08742v1","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.08742","created_at":"2026-05-17T23:52:50Z"},{"alias_kind":"pith_short_12","alias_value":"FG7F23ZFILFY","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FG7F23ZFILFYKHFA","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FG7F23ZF","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:bc11011bae43407d597218db352f39ba3686fbabb78c4e275c6201925c655d72","target":"graph","created_at":"2026-05-17T23:52:50Z","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":"This paper addresses the problem of finding a representation of a subtree distance, which is an extension of the tree metric. We show that a minimal representation is uniquely determined by a given subtree distance, and give a linear time algorithm that finds such a representation. This algorithm achieves the optimal time complexity.","authors_text":"Kazutoshi Ando, Takanori Maehara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-23T06:04:30Z","title":"Optimal Algorithm to Reconstruct a Tree from a Subtree Distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.08742","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:1765f31eaaf45c625cc8ef4df53f302a9ad0c41d1f725e7ac513f80eac976f8c","target":"record","created_at":"2026-05-17T23:52:50Z","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":"24e943aa4608468e0d662745fbe7a83f744a4c44398f684ebfad94d7c73faf51","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-23T06:04:30Z","title_canon_sha256":"2454da52f6d35a8a36595b15d95b3628a1ce83f129c51673ff1b5fba3c2fbe6d"},"schema_version":"1.0","source":{"id":"1902.08742","kind":"arxiv","version":1}},"canonical_sha256":"29be5d6f2542cb851ca095bd1684bd823426e118acc474f064f60329dedb51b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29be5d6f2542cb851ca095bd1684bd823426e118acc474f064f60329dedb51b9","first_computed_at":"2026-05-17T23:52:50.106051Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:50.106051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yqTkDMcg1Mr+DgRytaKvyi77SLox0hfpALPzdHcmNnnMXWDIBeLR4pbTMfqCesfGUStOTP8fGpsEBi4TZjjuCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:50.106837Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.08742","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1765f31eaaf45c625cc8ef4df53f302a9ad0c41d1f725e7ac513f80eac976f8c","sha256:bc11011bae43407d597218db352f39ba3686fbabb78c4e275c6201925c655d72"],"state_sha256":"7344ca258c7ec2b47217149b56a6c6e0d98309e9ffa224d7611b8bdf4db67a8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W6RiHtEphox8Ss8IKpgrHsTa+KUVyXtbG9HQcJt2ORDMqYXGz+7X7x4yo0KhVoEunppe/Mdg/hZKEbFSZjCKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:00:14.899290Z","bundle_sha256":"fa5fbb729050c585f6c85cc0ebd60b59e9ca4a0c15b39b45606678712f4cc72e"}}