{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ZMSBBGHF5ZJTSDP7L2TDA25SCN","short_pith_number":"pith:ZMSBBGHF","canonical_record":{"source":{"id":"2307.01285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-03T18:20:53Z","cross_cats_sorted":[],"title_canon_sha256":"8aad6622889f7b4b567478c110993004708a1c70b3500fee0ea8cab5c47c9e36","abstract_canon_sha256":"677515116269deac3b719dcba49810861c014a216d02225154d4747949b06400"},"schema_version":"1.0"},"canonical_sha256":"cb241098e5ee53390dff5ea6306bb2134c9098c4c5440debe3914eaa57739d80","source":{"kind":"arxiv","id":"2307.01285","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.01285","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"arxiv_version","alias_value":"2307.01285v1","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.01285","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZMSBBGHF5ZJT","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"pith_short_16","alias_value":"ZMSBBGHF5ZJTSDP7","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"pith_short_8","alias_value":"ZMSBBGHF","created_at":"2026-07-05T11:53:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ZMSBBGHF5ZJTSDP7L2TDA25SCN","target":"record","payload":{"canonical_record":{"source":{"id":"2307.01285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-03T18:20:53Z","cross_cats_sorted":[],"title_canon_sha256":"8aad6622889f7b4b567478c110993004708a1c70b3500fee0ea8cab5c47c9e36","abstract_canon_sha256":"677515116269deac3b719dcba49810861c014a216d02225154d4747949b06400"},"schema_version":"1.0"},"canonical_sha256":"cb241098e5ee53390dff5ea6306bb2134c9098c4c5440debe3914eaa57739d80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:38.800205Z","signature_b64":"yNsCjnwCbIKP1Rejh+0todQyc0o3apvtCHK7U1+1PMVEdgwKiEvgg+H0EHPf7fGWGeLy9yQBQKPpNlfBhVoRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb241098e5ee53390dff5ea6306bb2134c9098c4c5440debe3914eaa57739d80","last_reissued_at":"2026-07-05T11:53:38.799708Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:38.799708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.01285","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-07-05T11:53:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kwvrD+UgkZN6jfHJbE7A4oZYF+GKGjcXksXovYw5putWBMZNMKCOGg3F9K9D95NjcIitmNPi8Ixmp83dc3SXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T07:27:42.311088Z"},"content_sha256":"755ffef732bfb15cf7404d20ff4692b3810f4f556c68497a297e7e013e8932b5","schema_version":"1.0","event_id":"sha256:755ffef732bfb15cf7404d20ff4692b3810f4f556c68497a297e7e013e8932b5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ZMSBBGHF5ZJTSDP7L2TDA25SCN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Benjamin Bergougnoux, Erik Jan van Leeuwen, Mamadou Moustapha Kant\\'e, Matthias Mnich, Micha{\\l} Pilipczuk, Robert Ganian, Sang-il Oum, Vera Chekan","submitted_at":"2023-07-03T18:20:53Z","abstract_excerpt":"Dynamic programming on various graph decompositions is one of the most fundamental techniques used in parameterized complexity. Unfortunately, even if we consider concepts as simple as path or tree decompositions, such dynamic programming uses space that is exponential in the decomposition's width, and there are good reasons to believe that this is necessary. However, it has been shown that in graphs of low treedepth it is possible to design algorithms which achieve polynomial space complexity without requiring worse time complexity than their counterparts working on tree decompositions of bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.01285","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.01285/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:53:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iBZt69uXxGGha4HPc5D29Q5+/ORw5j8yo4yevED2XZKFQ+VUiRLvedvctJdObxOca6SU0v05m6PCL6n1QiUkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T07:27:42.311476Z"},"content_sha256":"6f6831b4f409a9a43d8112ef43b637e6940f89123bb581911b51f02ebfb16cbf","schema_version":"1.0","event_id":"sha256:6f6831b4f409a9a43d8112ef43b637e6940f89123bb581911b51f02ebfb16cbf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZMSBBGHF5ZJTSDP7L2TDA25SCN/bundle.json","state_url":"https://pith.science/pith/ZMSBBGHF5ZJTSDP7L2TDA25SCN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZMSBBGHF5ZJTSDP7L2TDA25SCN/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-07-10T07:27:42Z","links":{"resolver":"https://pith.science/pith/ZMSBBGHF5ZJTSDP7L2TDA25SCN","bundle":"https://pith.science/pith/ZMSBBGHF5ZJTSDP7L2TDA25SCN/bundle.json","state":"https://pith.science/pith/ZMSBBGHF5ZJTSDP7L2TDA25SCN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZMSBBGHF5ZJTSDP7L2TDA25SCN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ZMSBBGHF5ZJTSDP7L2TDA25SCN","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":"677515116269deac3b719dcba49810861c014a216d02225154d4747949b06400","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-03T18:20:53Z","title_canon_sha256":"8aad6622889f7b4b567478c110993004708a1c70b3500fee0ea8cab5c47c9e36"},"schema_version":"1.0","source":{"id":"2307.01285","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.01285","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"arxiv_version","alias_value":"2307.01285v1","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.01285","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"pith_short_12","alias_value":"ZMSBBGHF5ZJT","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"pith_short_16","alias_value":"ZMSBBGHF5ZJTSDP7","created_at":"2026-07-05T11:53:38Z"},{"alias_kind":"pith_short_8","alias_value":"ZMSBBGHF","created_at":"2026-07-05T11:53:38Z"}],"graph_snapshots":[{"event_id":"sha256:6f6831b4f409a9a43d8112ef43b637e6940f89123bb581911b51f02ebfb16cbf","target":"graph","created_at":"2026-07-05T11:53: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2307.01285/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dynamic programming on various graph decompositions is one of the most fundamental techniques used in parameterized complexity. Unfortunately, even if we consider concepts as simple as path or tree decompositions, such dynamic programming uses space that is exponential in the decomposition's width, and there are good reasons to believe that this is necessary. However, it has been shown that in graphs of low treedepth it is possible to design algorithms which achieve polynomial space complexity without requiring worse time complexity than their counterparts working on tree decompositions of bou","authors_text":"Benjamin Bergougnoux, Erik Jan van Leeuwen, Mamadou Moustapha Kant\\'e, Matthias Mnich, Micha{\\l} Pilipczuk, Robert Ganian, Sang-il Oum, Vera Chekan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-03T18:20:53Z","title":"Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.01285","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:755ffef732bfb15cf7404d20ff4692b3810f4f556c68497a297e7e013e8932b5","target":"record","created_at":"2026-07-05T11:53: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":"677515116269deac3b719dcba49810861c014a216d02225154d4747949b06400","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-03T18:20:53Z","title_canon_sha256":"8aad6622889f7b4b567478c110993004708a1c70b3500fee0ea8cab5c47c9e36"},"schema_version":"1.0","source":{"id":"2307.01285","kind":"arxiv","version":1}},"canonical_sha256":"cb241098e5ee53390dff5ea6306bb2134c9098c4c5440debe3914eaa57739d80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb241098e5ee53390dff5ea6306bb2134c9098c4c5440debe3914eaa57739d80","first_computed_at":"2026-07-05T11:53:38.799708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:53:38.799708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yNsCjnwCbIKP1Rejh+0todQyc0o3apvtCHK7U1+1PMVEdgwKiEvgg+H0EHPf7fGWGeLy9yQBQKPpNlfBhVoRBg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:53:38.800205Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.01285","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:755ffef732bfb15cf7404d20ff4692b3810f4f556c68497a297e7e013e8932b5","sha256:6f6831b4f409a9a43d8112ef43b637e6940f89123bb581911b51f02ebfb16cbf"],"state_sha256":"6fa2b5d2952e71b230701d36021c88cd5464c81d38cf372b2b0cb33af68578c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3OQimyxiHevIJb4L01iC5fHatOun/hQKoDvx/UTwyAcmR0WZuVYuxpowOIepYwgJClTCaZd40phloP/XNUVMBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T07:27:42.313430Z","bundle_sha256":"0de71f8fa7d84157f541d730175f3cb004c99aa757c2baaff6f51a8bff834685"}}