{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:4RHTDCPSRR5PQOVGIOE5AQO36L","short_pith_number":"pith:4RHTDCPS","canonical_record":{"source":{"id":"cs/0604108","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2006-04-27T10:32:43Z","cross_cats_sorted":["cs.DM","math.CT"],"title_canon_sha256":"a17558fad291f40be89b90ffd5538589348b9bdca7f1252195b50e99068c5cfa","abstract_canon_sha256":"0a006a0b00fa66fc28eb4193d0287c571e37df393b54aae48991418528f56583"},"schema_version":"1.0"},"canonical_sha256":"e44f3189f28c7af83aa64389d041dbf2cd42027d59b217ddf9a7ccf914da8d4f","source":{"kind":"arxiv","id":"cs/0604108","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0604108","created_at":"2026-07-04T14:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0604108v1","created_at":"2026-07-04T14:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0604108","created_at":"2026-07-04T14:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"4RHTDCPSRR5P","created_at":"2026-07-04T14:54:27Z"},{"alias_kind":"pith_short_16","alias_value":"4RHTDCPSRR5PQOVG","created_at":"2026-07-04T14:54:27Z"},{"alias_kind":"pith_short_8","alias_value":"4RHTDCPS","created_at":"2026-07-04T14:54:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:4RHTDCPSRR5PQOVGIOE5AQO36L","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0604108","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2006-04-27T10:32:43Z","cross_cats_sorted":["cs.DM","math.CT"],"title_canon_sha256":"a17558fad291f40be89b90ffd5538589348b9bdca7f1252195b50e99068c5cfa","abstract_canon_sha256":"0a006a0b00fa66fc28eb4193d0287c571e37df393b54aae48991418528f56583"},"schema_version":"1.0"},"canonical_sha256":"e44f3189f28c7af83aa64389d041dbf2cd42027d59b217ddf9a7ccf914da8d4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:54:27.338584Z","signature_b64":"GUo+ylIUcfvwVALZTrK8VWHmJtBgmOd47t7OBniLe0GF0Ph3jDfGigKK2SQ0ZqUv21tmoMj2QfnwWFhQzescBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e44f3189f28c7af83aa64389d041dbf2cd42027d59b217ddf9a7ccf914da8d4f","last_reissued_at":"2026-07-04T14:54:27.338001Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:54:27.338001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0604108","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-07-04T14:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"buZLp45riRwBm82HpN//H6rTh0yATjtj90HAxNhQzq+rtR+0RabdiQcdc3uIwmTKY/FpGgXhPHFFiMKSNglUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T00:25:23.214402Z"},"content_sha256":"51d95f5a7fc8de99172688e52a7c0c27cc95f545be90f32919ceaed73be8d845","schema_version":"1.0","event_id":"sha256:51d95f5a7fc8de99172688e52a7c0c27cc95f545be90f32919ceaed73be8d845"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:4RHTDCPSRR5PQOVGIOE5AQO36L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algebraic View of the Relation between Largest Common Subtrees and Smallest Common Supertrees","license":"","headline":"","cross_cats":["cs.DM","math.CT"],"primary_cat":"cs.DS","authors_text":"Francesc Rossello, Gabriel Valiente","submitted_at":"2006-04-27T10:32:43Z","abstract_excerpt":"The relationship between two important problems in tree pattern matching, the largest common subtree and the smallest common supertree problems, is established by means of simple constructions, which allow one to obtain a largest common subtree of two trees from a smallest common supertree of them, and vice versa. These constructions are the same for isomorphic, homeomorphic, topological, and minor embeddings, they take only time linear in the size of the trees, and they turn out to have a clear algebraic meaning."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0604108","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0604108/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sPRfSCVx+YYSPnKeCxheQg3y4ci5mhffAIKxxd+nAyVGLGswVXZVUemnPqoeyoJiZ1FO2V15lh1B8M5UskZtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T00:25:23.214779Z"},"content_sha256":"aef1bfd7d0281b9903b9557e70dd2699315296ef20ba3c28fdb0293d4711d2f5","schema_version":"1.0","event_id":"sha256:aef1bfd7d0281b9903b9557e70dd2699315296ef20ba3c28fdb0293d4711d2f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4RHTDCPSRR5PQOVGIOE5AQO36L/bundle.json","state_url":"https://pith.science/pith/4RHTDCPSRR5PQOVGIOE5AQO36L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4RHTDCPSRR5PQOVGIOE5AQO36L/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-07-17T00:25:23Z","links":{"resolver":"https://pith.science/pith/4RHTDCPSRR5PQOVGIOE5AQO36L","bundle":"https://pith.science/pith/4RHTDCPSRR5PQOVGIOE5AQO36L/bundle.json","state":"https://pith.science/pith/4RHTDCPSRR5PQOVGIOE5AQO36L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4RHTDCPSRR5PQOVGIOE5AQO36L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:4RHTDCPSRR5PQOVGIOE5AQO36L","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":"0a006a0b00fa66fc28eb4193d0287c571e37df393b54aae48991418528f56583","cross_cats_sorted":["cs.DM","math.CT"],"license":"","primary_cat":"cs.DS","submitted_at":"2006-04-27T10:32:43Z","title_canon_sha256":"a17558fad291f40be89b90ffd5538589348b9bdca7f1252195b50e99068c5cfa"},"schema_version":"1.0","source":{"id":"cs/0604108","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0604108","created_at":"2026-07-04T14:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0604108v1","created_at":"2026-07-04T14:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0604108","created_at":"2026-07-04T14:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"4RHTDCPSRR5P","created_at":"2026-07-04T14:54:27Z"},{"alias_kind":"pith_short_16","alias_value":"4RHTDCPSRR5PQOVG","created_at":"2026-07-04T14:54:27Z"},{"alias_kind":"pith_short_8","alias_value":"4RHTDCPS","created_at":"2026-07-04T14:54:27Z"}],"graph_snapshots":[{"event_id":"sha256:aef1bfd7d0281b9903b9557e70dd2699315296ef20ba3c28fdb0293d4711d2f5","target":"graph","created_at":"2026-07-04T14:54:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0604108/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The relationship between two important problems in tree pattern matching, the largest common subtree and the smallest common supertree problems, is established by means of simple constructions, which allow one to obtain a largest common subtree of two trees from a smallest common supertree of them, and vice versa. These constructions are the same for isomorphic, homeomorphic, topological, and minor embeddings, they take only time linear in the size of the trees, and they turn out to have a clear algebraic meaning.","authors_text":"Francesc Rossello, Gabriel Valiente","cross_cats":["cs.DM","math.CT"],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2006-04-27T10:32:43Z","title":"An Algebraic View of the Relation between Largest Common Subtrees and Smallest Common Supertrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0604108","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:51d95f5a7fc8de99172688e52a7c0c27cc95f545be90f32919ceaed73be8d845","target":"record","created_at":"2026-07-04T14:54:27Z","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":"0a006a0b00fa66fc28eb4193d0287c571e37df393b54aae48991418528f56583","cross_cats_sorted":["cs.DM","math.CT"],"license":"","primary_cat":"cs.DS","submitted_at":"2006-04-27T10:32:43Z","title_canon_sha256":"a17558fad291f40be89b90ffd5538589348b9bdca7f1252195b50e99068c5cfa"},"schema_version":"1.0","source":{"id":"cs/0604108","kind":"arxiv","version":1}},"canonical_sha256":"e44f3189f28c7af83aa64389d041dbf2cd42027d59b217ddf9a7ccf914da8d4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e44f3189f28c7af83aa64389d041dbf2cd42027d59b217ddf9a7ccf914da8d4f","first_computed_at":"2026-07-04T14:54:27.338001Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:54:27.338001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GUo+ylIUcfvwVALZTrK8VWHmJtBgmOd47t7OBniLe0GF0Ph3jDfGigKK2SQ0ZqUv21tmoMj2QfnwWFhQzescBg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:54:27.338584Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0604108","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51d95f5a7fc8de99172688e52a7c0c27cc95f545be90f32919ceaed73be8d845","sha256:aef1bfd7d0281b9903b9557e70dd2699315296ef20ba3c28fdb0293d4711d2f5"],"state_sha256":"70f925f0427d1aaae23151784410a5ccd0e7573197572aee50ee75f50331df50"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3cDmqrmeLrr4SSIk1nUejDm7+oUWRjUoV3Jn9w5a0ZtOtTTkEpyBkeuCdoPxLD9eYxBAfCb/HgyIknfY4ruIDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-17T00:25:23.217214Z","bundle_sha256":"fb365b0f905e3d533eb55128599680ea890af7035ee18fa48153461f3b1f3234"}}