{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GXAVIBQRPTWVPVWWCPRIQCLEWS","short_pith_number":"pith:GXAVIBQR","schema_version":"1.0","canonical_sha256":"35c15406117ced57d6d613e2880964b48e8bfc211f4e5027b80a257f1bcac559","source":{"kind":"arxiv","id":"1510.04622","version":1},"attestation_state":"computed","paper":{"title":"Subtree Isomorphism Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Amir Abboud, Arturs Backurs, Or Zamir, Thomas Dueholm Hansen, Virginia Vassilevska Williams","submitted_at":"2015-10-15T16:50:31Z","abstract_excerpt":"The Subtree Isomorphism problem asks whether a given tree is contained in another given tree. The problem is of fundamental importance and has been studied since the 1960s. For some variants, e.g., ordered trees, near-linear time algorithms are known, but for the general case truly subquadratic algorithms remain elusive.\n  Our first result is a reduction from the Orthogonal Vectors problem to Subtree Isomorphism, showing that a truly subquadratic algorithm for the latter refutes the Strong Exponential Time Hypothesis (SETH).\n  In light of this conditional lower bound, we focus on natural speci"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1510.04622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-10-15T16:50:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4e805a5f3dce5e8899b138ccab0c90a1a6ee5bec118e2a04818d2d768f27ca0a","abstract_canon_sha256":"cb6a8d635fea0ea4ee0272c2ad3534cd5dce21b38bdd6009307c1eafd1ba0fb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:02.097146Z","signature_b64":"DEAfe/ITli2CkCCSkiZddDyh3ePzECumsjJeC08YJQDUxMS1uIPmo81uM9TWsLQMfnArU5xYhJlNb78qt0aQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35c15406117ced57d6d613e2880964b48e8bfc211f4e5027b80a257f1bcac559","last_reissued_at":"2026-05-18T01:30:02.096519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:02.096519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subtree Isomorphism Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Amir Abboud, Arturs Backurs, Or Zamir, Thomas Dueholm Hansen, Virginia Vassilevska Williams","submitted_at":"2015-10-15T16:50:31Z","abstract_excerpt":"The Subtree Isomorphism problem asks whether a given tree is contained in another given tree. The problem is of fundamental importance and has been studied since the 1960s. For some variants, e.g., ordered trees, near-linear time algorithms are known, but for the general case truly subquadratic algorithms remain elusive.\n  Our first result is a reduction from the Orthogonal Vectors problem to Subtree Isomorphism, showing that a truly subquadratic algorithm for the latter refutes the Strong Exponential Time Hypothesis (SETH).\n  In light of this conditional lower bound, we focus on natural speci"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04622","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1510.04622","created_at":"2026-05-18T01:30:02.096623+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.04622v1","created_at":"2026-05-18T01:30:02.096623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04622","created_at":"2026-05-18T01:30:02.096623+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXAVIBQRPTWV","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXAVIBQRPTWVPVWW","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXAVIBQR","created_at":"2026-05-18T12:29:22.688609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GXAVIBQRPTWVPVWWCPRIQCLEWS","json":"https://pith.science/pith/GXAVIBQRPTWVPVWWCPRIQCLEWS.json","graph_json":"https://pith.science/api/pith-number/GXAVIBQRPTWVPVWWCPRIQCLEWS/graph.json","events_json":"https://pith.science/api/pith-number/GXAVIBQRPTWVPVWWCPRIQCLEWS/events.json","paper":"https://pith.science/paper/GXAVIBQR"},"agent_actions":{"view_html":"https://pith.science/pith/GXAVIBQRPTWVPVWWCPRIQCLEWS","download_json":"https://pith.science/pith/GXAVIBQRPTWVPVWWCPRIQCLEWS.json","view_paper":"https://pith.science/paper/GXAVIBQR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.04622&json=true","fetch_graph":"https://pith.science/api/pith-number/GXAVIBQRPTWVPVWWCPRIQCLEWS/graph.json","fetch_events":"https://pith.science/api/pith-number/GXAVIBQRPTWVPVWWCPRIQCLEWS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXAVIBQRPTWVPVWWCPRIQCLEWS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXAVIBQRPTWVPVWWCPRIQCLEWS/action/storage_attestation","attest_author":"https://pith.science/pith/GXAVIBQRPTWVPVWWCPRIQCLEWS/action/author_attestation","sign_citation":"https://pith.science/pith/GXAVIBQRPTWVPVWWCPRIQCLEWS/action/citation_signature","submit_replication":"https://pith.science/pith/GXAVIBQRPTWVPVWWCPRIQCLEWS/action/replication_record"}},"created_at":"2026-05-18T01:30:02.096623+00:00","updated_at":"2026-05-18T01:30:02.096623+00:00"}