{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:FG3JLFEXY3HE4BEW2RDNUBIOCM","short_pith_number":"pith:FG3JLFEX","canonical_record":{"source":{"id":"1501.00563","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-03T13:19:12Z","cross_cats_sorted":[],"title_canon_sha256":"f1730b6a7c83c056f4351a0b9bc5ddf1063a6da7b62ffc8c03af24ba87c26321","abstract_canon_sha256":"9bc8a12e4f5148fbb1bc7e9eae6138582d641b69a7a23f1a71381d392cd8a664"},"schema_version":"1.0"},"canonical_sha256":"29b6959497c6ce4e0496d446da050e133369f4e76aae667109cd1a1d07bb4cb8","source":{"kind":"arxiv","id":"1501.00563","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00563","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00563v2","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00563","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"pith_short_12","alias_value":"FG3JLFEXY3HE","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FG3JLFEXY3HE4BEW","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FG3JLFEX","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:FG3JLFEXY3HE4BEW2RDNUBIOCM","target":"record","payload":{"canonical_record":{"source":{"id":"1501.00563","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-03T13:19:12Z","cross_cats_sorted":[],"title_canon_sha256":"f1730b6a7c83c056f4351a0b9bc5ddf1063a6da7b62ffc8c03af24ba87c26321","abstract_canon_sha256":"9bc8a12e4f5148fbb1bc7e9eae6138582d641b69a7a23f1a71381d392cd8a664"},"schema_version":"1.0"},"canonical_sha256":"29b6959497c6ce4e0496d446da050e133369f4e76aae667109cd1a1d07bb4cb8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:38.417429Z","signature_b64":"tLpaAgLGzQtjVqE1ckTRABrEFsWNHzNSxbK4NVX7mrcA8GaJsHrufUfad+EjoYSBb7upTEf9D5zViLn0EopCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29b6959497c6ce4e0496d446da050e133369f4e76aae667109cd1a1d07bb4cb8","last_reissued_at":"2026-05-18T02:26:38.416905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:38.416905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.00563","source_version":2,"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-18T02:26:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7FbHYqE00+gDv+zEKQvlou93dNtooVcsm2E8sEEkwVMq0EUk8C3rEkgB9+YSyH8m3v3GelXu6gmr7OuxjwX2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:22:30.715575Z"},"content_sha256":"d31544a0ad8dd2898796753b172dc6a7318e7b4dc9a7196d1853ff30dd1e1ab8","schema_version":"1.0","event_id":"sha256:d31544a0ad8dd2898796753b172dc6a7318e7b4dc9a7196d1853ff30dd1e1ab8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:FG3JLFEXY3HE4BEW2RDNUBIOCM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spotting Trees with Few Leaves","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Bj\\\"orklund, {\\L}ukasz Kowalik, Meirav Zehavi, Vikram Kamat","submitted_at":"2015-01-03T13:19:12Z","abstract_excerpt":"We show two results related to the Hamiltonicity and $k$-Path algorithms in undirected graphs by Bj\\\"orklund [FOCS'10], and Bj\\\"orklund et al., [arXiv'10]. First, we demonstrate that the technique used can be generalized to finding some $k$-vertex tree with $l$ leaves in an $n$-vertex undirected graph in $O^*(1.657^k2^{l/2})$ time. It can be applied as a subroutine to solve the $k$-Internal Spanning Tree ($k$-IST) problem in $O^*(\\min(3.455^k, 1.946^n))$ time using polynomial space, improving upon previous algorithms for this problem. In particular, for the first time we break the natural barr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00563","kind":"arxiv","version":2},"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-18T02:26:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OjNRlWETZErpmzUYSttOBdYIvV5oCPCZfhNoCP7tOTT/sLZlPobpLVW0++eZG9Kt7bJ5tYRwfUgtAbjFedMAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:22:30.716118Z"},"content_sha256":"69c7fe483f4df7e03eb325b9faf9107981c3eea1e453d903d22e495794db782f","schema_version":"1.0","event_id":"sha256:69c7fe483f4df7e03eb325b9faf9107981c3eea1e453d903d22e495794db782f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FG3JLFEXY3HE4BEW2RDNUBIOCM/bundle.json","state_url":"https://pith.science/pith/FG3JLFEXY3HE4BEW2RDNUBIOCM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FG3JLFEXY3HE4BEW2RDNUBIOCM/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-25T19:22:30Z","links":{"resolver":"https://pith.science/pith/FG3JLFEXY3HE4BEW2RDNUBIOCM","bundle":"https://pith.science/pith/FG3JLFEXY3HE4BEW2RDNUBIOCM/bundle.json","state":"https://pith.science/pith/FG3JLFEXY3HE4BEW2RDNUBIOCM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FG3JLFEXY3HE4BEW2RDNUBIOCM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:FG3JLFEXY3HE4BEW2RDNUBIOCM","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":"9bc8a12e4f5148fbb1bc7e9eae6138582d641b69a7a23f1a71381d392cd8a664","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-03T13:19:12Z","title_canon_sha256":"f1730b6a7c83c056f4351a0b9bc5ddf1063a6da7b62ffc8c03af24ba87c26321"},"schema_version":"1.0","source":{"id":"1501.00563","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.00563","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"arxiv_version","alias_value":"1501.00563v2","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.00563","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"pith_short_12","alias_value":"FG3JLFEXY3HE","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"FG3JLFEXY3HE4BEW","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"FG3JLFEX","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:69c7fe483f4df7e03eb325b9faf9107981c3eea1e453d903d22e495794db782f","target":"graph","created_at":"2026-05-18T02:26:38Z","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":"We show two results related to the Hamiltonicity and $k$-Path algorithms in undirected graphs by Bj\\\"orklund [FOCS'10], and Bj\\\"orklund et al., [arXiv'10]. First, we demonstrate that the technique used can be generalized to finding some $k$-vertex tree with $l$ leaves in an $n$-vertex undirected graph in $O^*(1.657^k2^{l/2})$ time. It can be applied as a subroutine to solve the $k$-Internal Spanning Tree ($k$-IST) problem in $O^*(\\min(3.455^k, 1.946^n))$ time using polynomial space, improving upon previous algorithms for this problem. In particular, for the first time we break the natural barr","authors_text":"Andreas Bj\\\"orklund, {\\L}ukasz Kowalik, Meirav Zehavi, Vikram Kamat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-03T13:19:12Z","title":"Spotting Trees with Few Leaves"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.00563","kind":"arxiv","version":2},"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:d31544a0ad8dd2898796753b172dc6a7318e7b4dc9a7196d1853ff30dd1e1ab8","target":"record","created_at":"2026-05-18T02:26:38Z","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":"9bc8a12e4f5148fbb1bc7e9eae6138582d641b69a7a23f1a71381d392cd8a664","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-03T13:19:12Z","title_canon_sha256":"f1730b6a7c83c056f4351a0b9bc5ddf1063a6da7b62ffc8c03af24ba87c26321"},"schema_version":"1.0","source":{"id":"1501.00563","kind":"arxiv","version":2}},"canonical_sha256":"29b6959497c6ce4e0496d446da050e133369f4e76aae667109cd1a1d07bb4cb8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29b6959497c6ce4e0496d446da050e133369f4e76aae667109cd1a1d07bb4cb8","first_computed_at":"2026-05-18T02:26:38.416905Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:38.416905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tLpaAgLGzQtjVqE1ckTRABrEFsWNHzNSxbK4NVX7mrcA8GaJsHrufUfad+EjoYSBb7upTEf9D5zViLn0EopCAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:38.417429Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.00563","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d31544a0ad8dd2898796753b172dc6a7318e7b4dc9a7196d1853ff30dd1e1ab8","sha256:69c7fe483f4df7e03eb325b9faf9107981c3eea1e453d903d22e495794db782f"],"state_sha256":"c5987ff05bb676b7f574bcf978c196a956c13ad6a7dcdc1997be05ee1c7d8122"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AC9dZvCD2hHKC1SKDCFJ/ioyCek5o2T5Cm4vEZePypIPgXVSkXcuYR0JiycAX2RGEZvE4AeK4N8fFIye/hnqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:22:30.718760Z","bundle_sha256":"2192a06f34fdef29352d6256bdb03756530eb088ccd56495da6ca2bbb97e87a7"}}