{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:NASZJCPWGIANGMM7BEZ4GLPIWA","short_pith_number":"pith:NASZJCPW","schema_version":"1.0","canonical_sha256":"68259489f63200d3319f0933c32de8b017b4ef4c39e6b4a92e09520a0959e89e","source":{"kind":"arxiv","id":"cs/0512061","version":3},"attestation_state":"computed","paper":{"title":"Matching Subsequences in Trees","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Inge Li Goertz, Philip Bille","submitted_at":"2005-12-15T10:28:04Z","abstract_excerpt":"Given two rooted, labeled trees $P$ and $T$ the tree path subsequence problem is to determine which paths in $P$ are subsequences of which paths in $T$. Here a path begins at the root and ends at a leaf. In this paper we propose this problem as a useful query primitive for XML data, and provide new algorithms improving the previously best known time and space bounds."},"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":"cs/0512061","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2005-12-15T10:28:04Z","cross_cats_sorted":[],"title_canon_sha256":"b9182ed9accce9631ce1eb0b09d0e6665c4c02e903dcd514b1fb92d0b4aaa1e8","abstract_canon_sha256":"d7af21d1dfe88732a77bfde324405a2945eea71d4dee01743f2a74cc9024b565"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:54.132965Z","signature_b64":"6nttEeSlUlkqIDUD5O19wNmpbNbexqlt5KQf5NHVCuAj7hlNjDYneWbvs3MPriM+Xuw8ihzxpChmvFiUsKmjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68259489f63200d3319f0933c32de8b017b4ef4c39e6b4a92e09520a0959e89e","last_reissued_at":"2026-05-18T04:08:54.132517Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:54.132517Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matching Subsequences in Trees","license":"","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Inge Li Goertz, Philip Bille","submitted_at":"2005-12-15T10:28:04Z","abstract_excerpt":"Given two rooted, labeled trees $P$ and $T$ the tree path subsequence problem is to determine which paths in $P$ are subsequences of which paths in $T$. Here a path begins at the root and ends at a leaf. In this paper we propose this problem as a useful query primitive for XML data, and provide new algorithms improving the previously best known time and space bounds."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0512061","kind":"arxiv","version":3},"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":"cs/0512061","created_at":"2026-05-18T04:08:54.132578+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0512061v3","created_at":"2026-05-18T04:08:54.132578+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0512061","created_at":"2026-05-18T04:08:54.132578+00:00"},{"alias_kind":"pith_short_12","alias_value":"NASZJCPWGIAN","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"NASZJCPWGIANGMM7","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"NASZJCPW","created_at":"2026-05-18T12:25:53.335082+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/NASZJCPWGIANGMM7BEZ4GLPIWA","json":"https://pith.science/pith/NASZJCPWGIANGMM7BEZ4GLPIWA.json","graph_json":"https://pith.science/api/pith-number/NASZJCPWGIANGMM7BEZ4GLPIWA/graph.json","events_json":"https://pith.science/api/pith-number/NASZJCPWGIANGMM7BEZ4GLPIWA/events.json","paper":"https://pith.science/paper/NASZJCPW"},"agent_actions":{"view_html":"https://pith.science/pith/NASZJCPWGIANGMM7BEZ4GLPIWA","download_json":"https://pith.science/pith/NASZJCPWGIANGMM7BEZ4GLPIWA.json","view_paper":"https://pith.science/paper/NASZJCPW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0512061&json=true","fetch_graph":"https://pith.science/api/pith-number/NASZJCPWGIANGMM7BEZ4GLPIWA/graph.json","fetch_events":"https://pith.science/api/pith-number/NASZJCPWGIANGMM7BEZ4GLPIWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NASZJCPWGIANGMM7BEZ4GLPIWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NASZJCPWGIANGMM7BEZ4GLPIWA/action/storage_attestation","attest_author":"https://pith.science/pith/NASZJCPWGIANGMM7BEZ4GLPIWA/action/author_attestation","sign_citation":"https://pith.science/pith/NASZJCPWGIANGMM7BEZ4GLPIWA/action/citation_signature","submit_replication":"https://pith.science/pith/NASZJCPWGIANGMM7BEZ4GLPIWA/action/replication_record"}},"created_at":"2026-05-18T04:08:54.132578+00:00","updated_at":"2026-05-18T04:08:54.132578+00:00"}