{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IH6I4OTZ3IDAVE62HKLTNZVO56","short_pith_number":"pith:IH6I4OTZ","schema_version":"1.0","canonical_sha256":"41fc8e3a79da060a93da3a9736e6aeefac95ac518d56a9f9b34360c971725106","source":{"kind":"arxiv","id":"2402.08816","version":1},"attestation_state":"computed","paper":{"title":"Parameterized dynamic data structure for Split Completion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anna Zych-Pawlewicz, Konrad Majewski, Micha{\\l} Pilipczuk","submitted_at":"2024-02-13T21:46:53Z","abstract_excerpt":"We design a randomized data structure that, for a fully dynamic graph $G$ updated by edge insertions and deletions and integers $k, d$ fixed upon initialization, maintains the answer to the Split Completion problem: whether one can add $k$ edges to $G$ to obtain a split graph. The data structure can be initialized on an edgeless $n$-vertex graph in time $n \\cdot (k d \\cdot \\log n)^{\\mathcal{O}(1)}$, and the amortized time complexity of an update is $5^k \\cdot (k d \\cdot \\log n)^{\\mathcal{O}(1)}$. The answer provided by the data structure is correct with probability $1-\\mathcal{O}(n^{-d})$."},"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":"2402.08816","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-02-13T21:46:53Z","cross_cats_sorted":[],"title_canon_sha256":"a81fe128058c8e74a265b0ad4ef8b9ccf9298075fd20e99eb5fef680b0805063","abstract_canon_sha256":"06429de1d37fdeecd03bd5908ad7fa0b1a851ead22f5e65f16c1770b4bd2662e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:45:03.227954Z","signature_b64":"bQpGt06Gsi3oxKdglxnNlpdhiz4wux9El/n6n/ZJ4cMHlfebZAzhAsyGtFc4sY10FtMNmQoj9r6RnIjuGXhgDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41fc8e3a79da060a93da3a9736e6aeefac95ac518d56a9f9b34360c971725106","last_reissued_at":"2026-07-05T07:45:03.227455Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:45:03.227455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized dynamic data structure for Split Completion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anna Zych-Pawlewicz, Konrad Majewski, Micha{\\l} Pilipczuk","submitted_at":"2024-02-13T21:46:53Z","abstract_excerpt":"We design a randomized data structure that, for a fully dynamic graph $G$ updated by edge insertions and deletions and integers $k, d$ fixed upon initialization, maintains the answer to the Split Completion problem: whether one can add $k$ edges to $G$ to obtain a split graph. The data structure can be initialized on an edgeless $n$-vertex graph in time $n \\cdot (k d \\cdot \\log n)^{\\mathcal{O}(1)}$, and the amortized time complexity of an update is $5^k \\cdot (k d \\cdot \\log n)^{\\mathcal{O}(1)}$. The answer provided by the data structure is correct with probability $1-\\mathcal{O}(n^{-d})$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.08816","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/2402.08816/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":"2402.08816","created_at":"2026-07-05T07:45:03.227508+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.08816v1","created_at":"2026-07-05T07:45:03.227508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.08816","created_at":"2026-07-05T07:45:03.227508+00:00"},{"alias_kind":"pith_short_12","alias_value":"IH6I4OTZ3IDA","created_at":"2026-07-05T07:45:03.227508+00:00"},{"alias_kind":"pith_short_16","alias_value":"IH6I4OTZ3IDAVE62","created_at":"2026-07-05T07:45:03.227508+00:00"},{"alias_kind":"pith_short_8","alias_value":"IH6I4OTZ","created_at":"2026-07-05T07:45:03.227508+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/IH6I4OTZ3IDAVE62HKLTNZVO56","json":"https://pith.science/pith/IH6I4OTZ3IDAVE62HKLTNZVO56.json","graph_json":"https://pith.science/api/pith-number/IH6I4OTZ3IDAVE62HKLTNZVO56/graph.json","events_json":"https://pith.science/api/pith-number/IH6I4OTZ3IDAVE62HKLTNZVO56/events.json","paper":"https://pith.science/paper/IH6I4OTZ"},"agent_actions":{"view_html":"https://pith.science/pith/IH6I4OTZ3IDAVE62HKLTNZVO56","download_json":"https://pith.science/pith/IH6I4OTZ3IDAVE62HKLTNZVO56.json","view_paper":"https://pith.science/paper/IH6I4OTZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.08816&json=true","fetch_graph":"https://pith.science/api/pith-number/IH6I4OTZ3IDAVE62HKLTNZVO56/graph.json","fetch_events":"https://pith.science/api/pith-number/IH6I4OTZ3IDAVE62HKLTNZVO56/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IH6I4OTZ3IDAVE62HKLTNZVO56/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IH6I4OTZ3IDAVE62HKLTNZVO56/action/storage_attestation","attest_author":"https://pith.science/pith/IH6I4OTZ3IDAVE62HKLTNZVO56/action/author_attestation","sign_citation":"https://pith.science/pith/IH6I4OTZ3IDAVE62HKLTNZVO56/action/citation_signature","submit_replication":"https://pith.science/pith/IH6I4OTZ3IDAVE62HKLTNZVO56/action/replication_record"}},"created_at":"2026-07-05T07:45:03.227508+00:00","updated_at":"2026-07-05T07:45:03.227508+00:00"}