{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GXAVIBQRPTWVPVWWCPRIQCLEWS","short_pith_number":"pith:GXAVIBQR","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"},"canonical_sha256":"35c15406117ced57d6d613e2880964b48e8bfc211f4e5027b80a257f1bcac559","source":{"kind":"arxiv","id":"1510.04622","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04622","created_at":"2026-05-18T01:30:02Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04622v1","created_at":"2026-05-18T01:30:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04622","created_at":"2026-05-18T01:30:02Z"},{"alias_kind":"pith_short_12","alias_value":"GXAVIBQRPTWV","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GXAVIBQRPTWVPVWW","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GXAVIBQR","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GXAVIBQRPTWVPVWWCPRIQCLEWS","target":"record","payload":{"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"},"canonical_sha256":"35c15406117ced57d6d613e2880964b48e8bfc211f4e5027b80a257f1bcac559","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"},"source_kind":"arxiv","source_id":"1510.04622","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-18T01:30:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w+/r3igWwEWU9mUGGspn1H8PMUEqJkTK+h6724LncKXaRaPH5IFg2d6+xZrkcqWXEX2VI1AwnkmYYLGAnH+nCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:39:06.385675Z"},"content_sha256":"4570b9d9e11f2683ec29eebc99aab415d5ae507517a0ab437a3fef26e476c81d","schema_version":"1.0","event_id":"sha256:4570b9d9e11f2683ec29eebc99aab415d5ae507517a0ab437a3fef26e476c81d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GXAVIBQRPTWVPVWWCPRIQCLEWS","target":"graph","payload":{"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"},"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-18T01:30:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l/cUsfAOLC2WkbY2+mbImMO7plEjqZhvRHsrTqgAJQSXuslyNy/6mtjN6avwPo54UeHQNjfSJVkaR1Jp5yjiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T23:39:06.386296Z"},"content_sha256":"d0fcefeebc383977235dc5164cb41fad1e2a8039c29007b7150ee0fa0554c0ce","schema_version":"1.0","event_id":"sha256:d0fcefeebc383977235dc5164cb41fad1e2a8039c29007b7150ee0fa0554c0ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GXAVIBQRPTWVPVWWCPRIQCLEWS/bundle.json","state_url":"https://pith.science/pith/GXAVIBQRPTWVPVWWCPRIQCLEWS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GXAVIBQRPTWVPVWWCPRIQCLEWS/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-29T23:39:06Z","links":{"resolver":"https://pith.science/pith/GXAVIBQRPTWVPVWWCPRIQCLEWS","bundle":"https://pith.science/pith/GXAVIBQRPTWVPVWWCPRIQCLEWS/bundle.json","state":"https://pith.science/pith/GXAVIBQRPTWVPVWWCPRIQCLEWS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GXAVIBQRPTWVPVWWCPRIQCLEWS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GXAVIBQRPTWVPVWWCPRIQCLEWS","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":"cb6a8d635fea0ea4ee0272c2ad3534cd5dce21b38bdd6009307c1eafd1ba0fb3","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-10-15T16:50:31Z","title_canon_sha256":"4e805a5f3dce5e8899b138ccab0c90a1a6ee5bec118e2a04818d2d768f27ca0a"},"schema_version":"1.0","source":{"id":"1510.04622","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.04622","created_at":"2026-05-18T01:30:02Z"},{"alias_kind":"arxiv_version","alias_value":"1510.04622v1","created_at":"2026-05-18T01:30:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04622","created_at":"2026-05-18T01:30:02Z"},{"alias_kind":"pith_short_12","alias_value":"GXAVIBQRPTWV","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GXAVIBQRPTWVPVWW","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GXAVIBQR","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:d0fcefeebc383977235dc5164cb41fad1e2a8039c29007b7150ee0fa0554c0ce","target":"graph","created_at":"2026-05-18T01:30:02Z","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":"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","authors_text":"Amir Abboud, Arturs Backurs, Or Zamir, Thomas Dueholm Hansen, Virginia Vassilevska Williams","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-10-15T16:50:31Z","title":"Subtree Isomorphism Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04622","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:4570b9d9e11f2683ec29eebc99aab415d5ae507517a0ab437a3fef26e476c81d","target":"record","created_at":"2026-05-18T01:30:02Z","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":"cb6a8d635fea0ea4ee0272c2ad3534cd5dce21b38bdd6009307c1eafd1ba0fb3","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-10-15T16:50:31Z","title_canon_sha256":"4e805a5f3dce5e8899b138ccab0c90a1a6ee5bec118e2a04818d2d768f27ca0a"},"schema_version":"1.0","source":{"id":"1510.04622","kind":"arxiv","version":1}},"canonical_sha256":"35c15406117ced57d6d613e2880964b48e8bfc211f4e5027b80a257f1bcac559","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35c15406117ced57d6d613e2880964b48e8bfc211f4e5027b80a257f1bcac559","first_computed_at":"2026-05-18T01:30:02.096519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:02.096519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DEAfe/ITli2CkCCSkiZddDyh3ePzECumsjJeC08YJQDUxMS1uIPmo81uM9TWsLQMfnArU5xYhJlNb78qt0aQDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:02.097146Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.04622","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4570b9d9e11f2683ec29eebc99aab415d5ae507517a0ab437a3fef26e476c81d","sha256:d0fcefeebc383977235dc5164cb41fad1e2a8039c29007b7150ee0fa0554c0ce"],"state_sha256":"9c4edc06f0f53d17d4c0ed64c51aab80c43858de3f0906455db112ccf59f066a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mcS6IXY8mYhwq7nH3Ti0gi1Ah03RCmiLNFq5DxtbmnaNPNo7NcifuWVcd022+OEaNRf0o1xbYnIekf0GML2jCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T23:39:06.388751Z","bundle_sha256":"25cac69aa8dc0cafee8b11e9795d47ff67fd012e72d3ba0d6ed5d208f6e7ef2c"}}