{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QN6T7C35O5IVYWVHPXKLO7P2NS","short_pith_number":"pith:QN6T7C35","canonical_record":{"source":{"id":"1710.04376","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-12T05:46:58Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"bbd776f9b1c730500c996bbf7d15fa77965f8073cdf123c54b7ddf16e4227853","abstract_canon_sha256":"751ab131fe24fdf0e298194a6f7a87f3f8baa63bcc555b03a9358f6c1004b2b7"},"schema_version":"1.0"},"canonical_sha256":"837d3f8b7d77515c5aa77dd4b77dfa6cb519fa97cb6be80cd915b4897ae9433c","source":{"kind":"arxiv","id":"1710.04376","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04376","created_at":"2026-05-18T00:32:20Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04376v2","created_at":"2026-05-18T00:32:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04376","created_at":"2026-05-18T00:32:20Z"},{"alias_kind":"pith_short_12","alias_value":"QN6T7C35O5IV","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QN6T7C35O5IVYWVH","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QN6T7C35","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QN6T7C35O5IVYWVHPXKLO7P2NS","target":"record","payload":{"canonical_record":{"source":{"id":"1710.04376","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-12T05:46:58Z","cross_cats_sorted":["cs.CC","cs.DM"],"title_canon_sha256":"bbd776f9b1c730500c996bbf7d15fa77965f8073cdf123c54b7ddf16e4227853","abstract_canon_sha256":"751ab131fe24fdf0e298194a6f7a87f3f8baa63bcc555b03a9358f6c1004b2b7"},"schema_version":"1.0"},"canonical_sha256":"837d3f8b7d77515c5aa77dd4b77dfa6cb519fa97cb6be80cd915b4897ae9433c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:20.054874Z","signature_b64":"71sFZMHjHOHjFeU7vfe9FCTPbzAdslshZoECcm6SyWng4Fwi015I1U8po3mTbEpbtBZF5vrto+QkQBb0+tUeCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"837d3f8b7d77515c5aa77dd4b77dfa6cb519fa97cb6be80cd915b4897ae9433c","last_reissued_at":"2026-05-18T00:32:20.054449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:20.054449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.04376","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-18T00:32:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QI9jXDS+wt5tN6ZXBjaP2RkUlSZqZxHuMCR5g7NzL45i3Ju0t+axN0tOs7Z2Tcyp+E1Wv4LzKx4jhXIcfVHZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:02:02.485856Z"},"content_sha256":"e8a1fda0cf2daed6e869ec2f4414d3ad4c59458851dc7e9b470872a3e54ff589","schema_version":"1.0","event_id":"sha256:e8a1fda0cf2daed6e869ec2f4414d3ad4c59458851dc7e9b470872a3e54ff589"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QN6T7C35O5IVYWVHPXKLO7P2NS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Power of Tree-Depth for Fully Polynomial FPT Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM"],"primary_cat":"cs.DS","authors_text":"Naoto Ohsaka, Tomoaki Ogasawara, Yoichi Iwata","submitted_at":"2017-10-12T05:46:58Z","abstract_excerpt":"There are many classical problems in P whose time complexities have not been improved over the past decades. Recent studies of \"Hardness in P\" have revealed that, for several of such problems, the current fastest algorithm is the best possible under some complexity assumptions. To bypass this difficulty, Fomin et al. (SODA 2017) introduced the concept of fully polynomial FPT algorithms. For a problem with the current best time complexity $O(n^c)$, the goal is to design an algorithm running in $k^{O(1)}n^{c'}$ time for a parameter $k$ and a constant $c'<c$. In this paper, we investigate the com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04376","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-18T00:32:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aA64AzPVH62skRJy6tRAN3gC3vpPcWJdjU+NV0A40bEUVBlyfSy2a6QAZqWzouwc+mszPuoQQzQZBNTVsZNpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:02:02.486196Z"},"content_sha256":"2b0a3b5f69192e078d48cf9d8a873d21665f9b7a8a93a7fae67eb0777aec041a","schema_version":"1.0","event_id":"sha256:2b0a3b5f69192e078d48cf9d8a873d21665f9b7a8a93a7fae67eb0777aec041a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QN6T7C35O5IVYWVHPXKLO7P2NS/bundle.json","state_url":"https://pith.science/pith/QN6T7C35O5IVYWVHPXKLO7P2NS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QN6T7C35O5IVYWVHPXKLO7P2NS/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-06-27T12:02:02Z","links":{"resolver":"https://pith.science/pith/QN6T7C35O5IVYWVHPXKLO7P2NS","bundle":"https://pith.science/pith/QN6T7C35O5IVYWVHPXKLO7P2NS/bundle.json","state":"https://pith.science/pith/QN6T7C35O5IVYWVHPXKLO7P2NS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QN6T7C35O5IVYWVHPXKLO7P2NS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QN6T7C35O5IVYWVHPXKLO7P2NS","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":"751ab131fe24fdf0e298194a6f7a87f3f8baa63bcc555b03a9358f6c1004b2b7","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-12T05:46:58Z","title_canon_sha256":"bbd776f9b1c730500c996bbf7d15fa77965f8073cdf123c54b7ddf16e4227853"},"schema_version":"1.0","source":{"id":"1710.04376","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.04376","created_at":"2026-05-18T00:32:20Z"},{"alias_kind":"arxiv_version","alias_value":"1710.04376v2","created_at":"2026-05-18T00:32:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04376","created_at":"2026-05-18T00:32:20Z"},{"alias_kind":"pith_short_12","alias_value":"QN6T7C35O5IV","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QN6T7C35O5IVYWVH","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QN6T7C35","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:2b0a3b5f69192e078d48cf9d8a873d21665f9b7a8a93a7fae67eb0777aec041a","target":"graph","created_at":"2026-05-18T00:32:20Z","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":"There are many classical problems in P whose time complexities have not been improved over the past decades. Recent studies of \"Hardness in P\" have revealed that, for several of such problems, the current fastest algorithm is the best possible under some complexity assumptions. To bypass this difficulty, Fomin et al. (SODA 2017) introduced the concept of fully polynomial FPT algorithms. For a problem with the current best time complexity $O(n^c)$, the goal is to design an algorithm running in $k^{O(1)}n^{c'}$ time for a parameter $k$ and a constant $c'<c$. In this paper, we investigate the com","authors_text":"Naoto Ohsaka, Tomoaki Ogasawara, Yoichi Iwata","cross_cats":["cs.CC","cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-12T05:46:58Z","title":"On the Power of Tree-Depth for Fully Polynomial FPT Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04376","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:e8a1fda0cf2daed6e869ec2f4414d3ad4c59458851dc7e9b470872a3e54ff589","target":"record","created_at":"2026-05-18T00:32:20Z","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":"751ab131fe24fdf0e298194a6f7a87f3f8baa63bcc555b03a9358f6c1004b2b7","cross_cats_sorted":["cs.CC","cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-12T05:46:58Z","title_canon_sha256":"bbd776f9b1c730500c996bbf7d15fa77965f8073cdf123c54b7ddf16e4227853"},"schema_version":"1.0","source":{"id":"1710.04376","kind":"arxiv","version":2}},"canonical_sha256":"837d3f8b7d77515c5aa77dd4b77dfa6cb519fa97cb6be80cd915b4897ae9433c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"837d3f8b7d77515c5aa77dd4b77dfa6cb519fa97cb6be80cd915b4897ae9433c","first_computed_at":"2026-05-18T00:32:20.054449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:20.054449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"71sFZMHjHOHjFeU7vfe9FCTPbzAdslshZoECcm6SyWng4Fwi015I1U8po3mTbEpbtBZF5vrto+QkQBb0+tUeCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:20.054874Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.04376","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8a1fda0cf2daed6e869ec2f4414d3ad4c59458851dc7e9b470872a3e54ff589","sha256:2b0a3b5f69192e078d48cf9d8a873d21665f9b7a8a93a7fae67eb0777aec041a"],"state_sha256":"152cfffae35bd91e79178c0047e0ed51a2282362018c15732bcf40e9423f747d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YcLoXvhkyt1Rw2XnKYNE4Lc8tKkG1e6fcupqyVd7lKo18oe7BYLoHxBi7fEchks+P0hLnbH8X3iwZcpF0gRCCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T12:02:02.488062Z","bundle_sha256":"4c15c4ae9214212d359845d354ad0e68c884807a9ed49f23c6810311c4c3ac60"}}