{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:RWB45G3XJFQENUMWWOBPXQN3GG","short_pith_number":"pith:RWB45G3X","schema_version":"1.0","canonical_sha256":"8d83ce9b77496046d196b382fbc1bb31a8ab8dcadb2e2bb5f509262f5f561d32","source":{"kind":"arxiv","id":"2006.00571","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2006.00571","created_at":"2026-07-05T01:20:18.730464+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.00571v2","created_at":"2026-07-05T01:20:18.730464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.00571","created_at":"2026-07-05T01:20:18.730464+00:00"},{"alias_kind":"pith_short_12","alias_value":"RWB45G3XJFQE","created_at":"2026-07-05T01:20:18.730464+00:00"},{"alias_kind":"pith_short_16","alias_value":"RWB45G3XJFQENUMW","created_at":"2026-07-05T01:20:18.730464+00:00"},{"alias_kind":"pith_short_8","alias_value":"RWB45G3X","created_at":"2026-07-05T01:20:18.730464+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RWB45G3XJFQENUMWWOBPXQN3GG","json":"https://pith.science/pith/RWB45G3XJFQENUMWWOBPXQN3GG.json","graph_json":"https://pith.science/api/pith-number/RWB45G3XJFQENUMWWOBPXQN3GG/graph.json","events_json":"https://pith.science/api/pith-number/RWB45G3XJFQENUMWWOBPXQN3GG/events.json","paper":"https://pith.science/paper/RWB45G3X"},"agent_actions":{"view_html":"https://pith.science/pith/RWB45G3XJFQENUMWWOBPXQN3GG","download_json":"https://pith.science/pith/RWB45G3XJFQENUMWWOBPXQN3GG.json","view_paper":"https://pith.science/paper/RWB45G3X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.00571&json=true","fetch_graph":"https://pith.science/api/pith-number/RWB45G3XJFQENUMWWOBPXQN3GG/graph.json","fetch_events":"https://pith.science/api/pith-number/RWB45G3XJFQENUMWWOBPXQN3GG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RWB45G3XJFQENUMWWOBPXQN3GG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RWB45G3XJFQENUMWWOBPXQN3GG/action/storage_attestation","attest_author":"https://pith.science/pith/RWB45G3XJFQENUMWWOBPXQN3GG/action/author_attestation","sign_citation":"https://pith.science/pith/RWB45G3XJFQENUMWWOBPXQN3GG/action/citation_signature","submit_replication":"https://pith.science/pith/RWB45G3XJFQENUMWWOBPXQN3GG/action/replication_record"}},"created_at":"2026-07-05T01:20:18.730464+00:00","updated_at":"2026-07-05T01:20:18.730464+00:00"}