{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EBJQQ3RX5CUQHWVSKHTHOWZEEC","short_pith_number":"pith:EBJQQ3RX","canonical_record":{"source":{"id":"1509.05896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-19T14:20:05Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b31e02921cffb2d3c8f89be91f746a546b216e9fec1b807d67c1746e9874c4f4","abstract_canon_sha256":"2da3c4c546557f589d3403c240e8827f14c4aee6f8fdf56e7333c95ee5746daf"},"schema_version":"1.0"},"canonical_sha256":"2053086e37e8a903dab251e6775b2420b4858a1c0b69c6e0899dfaaad419e0bb","source":{"kind":"arxiv","id":"1509.05896","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05896","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05896v2","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05896","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"pith_short_12","alias_value":"EBJQQ3RX5CUQ","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EBJQQ3RX5CUQHWVS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EBJQQ3RX","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EBJQQ3RX5CUQHWVSKHTHOWZEEC","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05896","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-19T14:20:05Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b31e02921cffb2d3c8f89be91f746a546b216e9fec1b807d67c1746e9874c4f4","abstract_canon_sha256":"2da3c4c546557f589d3403c240e8827f14c4aee6f8fdf56e7333c95ee5746daf"},"schema_version":"1.0"},"canonical_sha256":"2053086e37e8a903dab251e6775b2420b4858a1c0b69c6e0899dfaaad419e0bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:00.310938Z","signature_b64":"qR+dYXD7ialcWFokHdp+8bCDUAbQ5Xx8riVI/xgjX7iSQV/XdCE8omK31CVPx6OJ5TpAX9CA4kCthdJ71Ey0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2053086e37e8a903dab251e6775b2420b4858a1c0b69c6e0899dfaaad419e0bb","last_reissued_at":"2026-05-18T01:15:00.310478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:00.310478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05896","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-18T01:15:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f9JsG18W1XyISHeSpPxP7CgYM/X3acW2jN4x491FbxxV8DqNTKDdchuXQIerhuECzvQVXxnwOCLa6R+sQIrBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:41:20.921651Z"},"content_sha256":"390a0a84b7dac88684a6fdb08f0afe7b74f205836264c6b2633b7c1ee89a01a1","schema_version":"1.0","event_id":"sha256:390a0a84b7dac88684a6fdb08f0afe7b74f205836264c6b2633b7c1ee89a01a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EBJQQ3RX5CUQHWVSKHTHOWZEEC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On space efficiency of algorithms working on structural decompositions of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Marcin Wrochna, Micha{\\l} Pilipczuk","submitted_at":"2015-09-19T14:20:05Z","abstract_excerpt":"Dynamic programming on path and tree decompositions of graphs is a technique that is ubiquitous in the field of parameterized and exponential-time algorithms. However, one of its drawbacks is that the space usage is exponential in the decomposition's width. Following the work of Allender et al. [Theory of Computing, '14], we investigate whether this space complexity explosion is unavoidable. Using the idea of reparameterization of Cai and Juedes [J. Comput. Syst. Sci., '03], we prove that the question is closely related to a conjecture that the Longest Common Subsequence problem parameterized "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05896","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-18T01:15:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0qPDIhCIGaJQgAEF21s4xpBituy3+1umNSJdm1vo/Sxyt6b87Lh/3CaEEvFwxhbYmfz0I3OUrXZ9qzbZfbaBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:41:20.922022Z"},"content_sha256":"c95d13f8b3cf6081033a6ccca02786bd73317e3a4973c0d71c05f90f467c2ec2","schema_version":"1.0","event_id":"sha256:c95d13f8b3cf6081033a6ccca02786bd73317e3a4973c0d71c05f90f467c2ec2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EBJQQ3RX5CUQHWVSKHTHOWZEEC/bundle.json","state_url":"https://pith.science/pith/EBJQQ3RX5CUQHWVSKHTHOWZEEC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EBJQQ3RX5CUQHWVSKHTHOWZEEC/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-28T17:41:20Z","links":{"resolver":"https://pith.science/pith/EBJQQ3RX5CUQHWVSKHTHOWZEEC","bundle":"https://pith.science/pith/EBJQQ3RX5CUQHWVSKHTHOWZEEC/bundle.json","state":"https://pith.science/pith/EBJQQ3RX5CUQHWVSKHTHOWZEEC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EBJQQ3RX5CUQHWVSKHTHOWZEEC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EBJQQ3RX5CUQHWVSKHTHOWZEEC","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":"2da3c4c546557f589d3403c240e8827f14c4aee6f8fdf56e7333c95ee5746daf","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-19T14:20:05Z","title_canon_sha256":"b31e02921cffb2d3c8f89be91f746a546b216e9fec1b807d67c1746e9874c4f4"},"schema_version":"1.0","source":{"id":"1509.05896","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05896","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05896v2","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05896","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"pith_short_12","alias_value":"EBJQQ3RX5CUQ","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EBJQQ3RX5CUQHWVS","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EBJQQ3RX","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:c95d13f8b3cf6081033a6ccca02786bd73317e3a4973c0d71c05f90f467c2ec2","target":"graph","created_at":"2026-05-18T01:15:00Z","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":"Dynamic programming on path and tree decompositions of graphs is a technique that is ubiquitous in the field of parameterized and exponential-time algorithms. However, one of its drawbacks is that the space usage is exponential in the decomposition's width. Following the work of Allender et al. [Theory of Computing, '14], we investigate whether this space complexity explosion is unavoidable. Using the idea of reparameterization of Cai and Juedes [J. Comput. Syst. Sci., '03], we prove that the question is closely related to a conjecture that the Longest Common Subsequence problem parameterized ","authors_text":"Marcin Wrochna, Micha{\\l} Pilipczuk","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-19T14:20:05Z","title":"On space efficiency of algorithms working on structural decompositions of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05896","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:390a0a84b7dac88684a6fdb08f0afe7b74f205836264c6b2633b7c1ee89a01a1","target":"record","created_at":"2026-05-18T01:15:00Z","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":"2da3c4c546557f589d3403c240e8827f14c4aee6f8fdf56e7333c95ee5746daf","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-09-19T14:20:05Z","title_canon_sha256":"b31e02921cffb2d3c8f89be91f746a546b216e9fec1b807d67c1746e9874c4f4"},"schema_version":"1.0","source":{"id":"1509.05896","kind":"arxiv","version":2}},"canonical_sha256":"2053086e37e8a903dab251e6775b2420b4858a1c0b69c6e0899dfaaad419e0bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2053086e37e8a903dab251e6775b2420b4858a1c0b69c6e0899dfaaad419e0bb","first_computed_at":"2026-05-18T01:15:00.310478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:00.310478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qR+dYXD7ialcWFokHdp+8bCDUAbQ5Xx8riVI/xgjX7iSQV/XdCE8omK31CVPx6OJ5TpAX9CA4kCthdJ71Ey0Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:00.310938Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05896","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:390a0a84b7dac88684a6fdb08f0afe7b74f205836264c6b2633b7c1ee89a01a1","sha256:c95d13f8b3cf6081033a6ccca02786bd73317e3a4973c0d71c05f90f467c2ec2"],"state_sha256":"a96dbe25f50cafa286b2aabd98d883f1087aeb60262f0674f88f9dbe8ed9b565"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HQaYhoOvFZUkp8kdnD4H7BBVTK7KBMe8kgS3Nq89q3HYkzJJZC4sjt0iHhn7nu/N47YwX8vsqobeQCELOUReBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T17:41:20.924811Z","bundle_sha256":"1c2fa2d4c88d41b28a6708cb13d207105d63f0f45dcd1a7ddd3f4d0369c3cb72"}}