{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:RWB45G3XJFQENUMWWOBPXQN3GG","short_pith_number":"pith:RWB45G3X","canonical_record":{"source":{"id":"2006.00571","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-31T17:47:01Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"eecedb191a4ed92e3fdeecc224859f0a70b1afd10f99ccf371d1a932a3803f41","abstract_canon_sha256":"6c258906d9fa0d5f772997fcbdfdbd47426086adebcf3b2a08a5503ba8566677"},"schema_version":"1.0"},"canonical_sha256":"8d83ce9b77496046d196b382fbc1bb31a8ab8dcadb2e2bb5f509262f5f561d32","source":{"kind":"arxiv","id":"2006.00571","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.00571","created_at":"2026-07-05T01:20:18Z"},{"alias_kind":"arxiv_version","alias_value":"2006.00571v2","created_at":"2026-07-05T01:20:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.00571","created_at":"2026-07-05T01:20:18Z"},{"alias_kind":"pith_short_12","alias_value":"RWB45G3XJFQE","created_at":"2026-07-05T01:20:18Z"},{"alias_kind":"pith_short_16","alias_value":"RWB45G3XJFQENUMW","created_at":"2026-07-05T01:20:18Z"},{"alias_kind":"pith_short_8","alias_value":"RWB45G3X","created_at":"2026-07-05T01:20:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:RWB45G3XJFQENUMWWOBPXQN3GG","target":"record","payload":{"canonical_record":{"source":{"id":"2006.00571","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-31T17:47:01Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"eecedb191a4ed92e3fdeecc224859f0a70b1afd10f99ccf371d1a932a3803f41","abstract_canon_sha256":"6c258906d9fa0d5f772997fcbdfdbd47426086adebcf3b2a08a5503ba8566677"},"schema_version":"1.0"},"canonical_sha256":"8d83ce9b77496046d196b382fbc1bb31a8ab8dcadb2e2bb5f509262f5f561d32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:20:18.730830Z","signature_b64":"WCwmY8R3yCqeB8FIzKDABvVsgysw2fzTes3mp8rllvf0wi0ldNFufyOKJrqEO4OpGwHiDkQx/RG5tVsxkA97AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d83ce9b77496046d196b382fbc1bb31a8ab8dcadb2e2bb5f509262f5f561d32","last_reissued_at":"2026-07-05T01:20:18.730398Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:20:18.730398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2006.00571","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-07-05T01:20:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vNjPvF3/SBggwrU7jSsSng7kIZGxtB/ESzcjcEqbaVvAlS7UT9/pxqt64KSfOc14Etd5ycm5ZeIMfO6AU2PGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:06:49.590133Z"},"content_sha256":"57d6d39753a4735ac32cfe48914324533e2e612be8b2ae961f072202f44f94e6","schema_version":"1.0","event_id":"sha256:57d6d39753a4735ac32cfe48914324533e2e612be8b2ae961f072202f44f94e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:RWB45G3XJFQENUMWWOBPXQN3GG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient fully dynamic elimination forests with applications to detecting long paths and cycles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Andreas Emil Feldmann, Anna Zych-Pawlewicz, Bart{\\l}omiej Wr\\'oblewski, Danny Hermelin, Jiehua Chen, Manuel Sorge, Marcin Pilipczuk, Micha{\\l} Pilipczuk, Wojciech Czerwi\\'nski, Wojciech Nadara, Yann Disser","submitted_at":"2020-05-31T17:47:01Z","abstract_excerpt":"We present a data structure that in a dynamic graph of treedepth at most $d$, which is modified over time by edge insertions and deletions, maintains an optimum-height elimination forest. The data structure achieves worst-case update time $2^{{\\cal O}(d^2)}$, which matches the best known parameter dependency in the running time of a static fpt algorithm for computing the treedepth of a graph. This improves a result of Dvo\\v{r}\\'ak et al. [ESA 2014], who for the same problem achieved update time $f(d)$ for some non-elementary (i.e. tower-exponential) function $f$. As a by-product, we improve kn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.00571","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2006.00571/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-05T01:20:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZJhL/euer0pDy9cdtqrfwGLYG58S3O3lgCwGXWXvSaqY9t9/Rb9sidK4JlVLnGjjfTIRZkEIQ/uae2t+83/JCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T21:06:49.590730Z"},"content_sha256":"f134a9c46b8ab10725aa84d02ff9d8ffeabf4e82a5c32a776c39ffda6a3e896f","schema_version":"1.0","event_id":"sha256:f134a9c46b8ab10725aa84d02ff9d8ffeabf4e82a5c32a776c39ffda6a3e896f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RWB45G3XJFQENUMWWOBPXQN3GG/bundle.json","state_url":"https://pith.science/pith/RWB45G3XJFQENUMWWOBPXQN3GG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RWB45G3XJFQENUMWWOBPXQN3GG/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-08-04T21:06:49Z","links":{"resolver":"https://pith.science/pith/RWB45G3XJFQENUMWWOBPXQN3GG","bundle":"https://pith.science/pith/RWB45G3XJFQENUMWWOBPXQN3GG/bundle.json","state":"https://pith.science/pith/RWB45G3XJFQENUMWWOBPXQN3GG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RWB45G3XJFQENUMWWOBPXQN3GG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:RWB45G3XJFQENUMWWOBPXQN3GG","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":"6c258906d9fa0d5f772997fcbdfdbd47426086adebcf3b2a08a5503ba8566677","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-31T17:47:01Z","title_canon_sha256":"eecedb191a4ed92e3fdeecc224859f0a70b1afd10f99ccf371d1a932a3803f41"},"schema_version":"1.0","source":{"id":"2006.00571","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.00571","created_at":"2026-07-05T01:20:18Z"},{"alias_kind":"arxiv_version","alias_value":"2006.00571v2","created_at":"2026-07-05T01:20:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.00571","created_at":"2026-07-05T01:20:18Z"},{"alias_kind":"pith_short_12","alias_value":"RWB45G3XJFQE","created_at":"2026-07-05T01:20:18Z"},{"alias_kind":"pith_short_16","alias_value":"RWB45G3XJFQENUMW","created_at":"2026-07-05T01:20:18Z"},{"alias_kind":"pith_short_8","alias_value":"RWB45G3X","created_at":"2026-07-05T01:20:18Z"}],"graph_snapshots":[{"event_id":"sha256:f134a9c46b8ab10725aa84d02ff9d8ffeabf4e82a5c32a776c39ffda6a3e896f","target":"graph","created_at":"2026-07-05T01:20:18Z","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/2006.00571/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a data structure that in a dynamic graph of treedepth at most $d$, which is modified over time by edge insertions and deletions, maintains an optimum-height elimination forest. The data structure achieves worst-case update time $2^{{\\cal O}(d^2)}$, which matches the best known parameter dependency in the running time of a static fpt algorithm for computing the treedepth of a graph. This improves a result of Dvo\\v{r}\\'ak et al. [ESA 2014], who for the same problem achieved update time $f(d)$ for some non-elementary (i.e. tower-exponential) function $f$. As a by-product, we improve kn","authors_text":"Andreas Emil Feldmann, Anna Zych-Pawlewicz, Bart{\\l}omiej Wr\\'oblewski, Danny Hermelin, Jiehua Chen, Manuel Sorge, Marcin Pilipczuk, Micha{\\l} Pilipczuk, Wojciech Czerwi\\'nski, Wojciech Nadara, Yann Disser","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-31T17:47:01Z","title":"Efficient fully dynamic elimination forests with applications to detecting long paths and cycles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.00571","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:57d6d39753a4735ac32cfe48914324533e2e612be8b2ae961f072202f44f94e6","target":"record","created_at":"2026-07-05T01:20:18Z","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":"6c258906d9fa0d5f772997fcbdfdbd47426086adebcf3b2a08a5503ba8566677","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-05-31T17:47:01Z","title_canon_sha256":"eecedb191a4ed92e3fdeecc224859f0a70b1afd10f99ccf371d1a932a3803f41"},"schema_version":"1.0","source":{"id":"2006.00571","kind":"arxiv","version":2}},"canonical_sha256":"8d83ce9b77496046d196b382fbc1bb31a8ab8dcadb2e2bb5f509262f5f561d32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d83ce9b77496046d196b382fbc1bb31a8ab8dcadb2e2bb5f509262f5f561d32","first_computed_at":"2026-07-05T01:20:18.730398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:20:18.730398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WCwmY8R3yCqeB8FIzKDABvVsgysw2fzTes3mp8rllvf0wi0ldNFufyOKJrqEO4OpGwHiDkQx/RG5tVsxkA97AA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:20:18.730830Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.00571","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57d6d39753a4735ac32cfe48914324533e2e612be8b2ae961f072202f44f94e6","sha256:f134a9c46b8ab10725aa84d02ff9d8ffeabf4e82a5c32a776c39ffda6a3e896f"],"state_sha256":"45245eb4244a6c700a95e4ac6ed9f1fe947da9832da78933c91ca8ed1c3238e0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ZgaZsZXOvKyoevnjoFY2O6/Se/cHnj8dhrShvPoMmfhLKx65dMU3YdlhG6OuuAOVrLRb0noblD6oIeV9TN2Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T21:06:49.595619Z","bundle_sha256":"e9cc022dedcb635cebddbd4bf83196bb68416147dd0c4d178824d49d6ffe484d"}}