{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:7LR5JB6PIBLAVGCUG3YV27HHDO","short_pith_number":"pith:7LR5JB6P","canonical_record":{"source":{"id":"2307.16771","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-31T15:38:22Z","cross_cats_sorted":[],"title_canon_sha256":"a749bf4358dfb32114e4f51c543c8df22c0e190a4982d5de7f8664ce74201239","abstract_canon_sha256":"e7987cfe4e1dc9422dda8a84da823294f04c0d5e02cd253e6bc70af1fb9c73de"},"schema_version":"1.0"},"canonical_sha256":"fae3d487cf40560a985436f15d7ce71b9b5268a324071f2037afcc3b8df8dbe8","source":{"kind":"arxiv","id":"2307.16771","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.16771","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"arxiv_version","alias_value":"2307.16771v2","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.16771","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"pith_short_12","alias_value":"7LR5JB6PIBLA","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"pith_short_16","alias_value":"7LR5JB6PIBLAVGCU","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"pith_short_8","alias_value":"7LR5JB6P","created_at":"2026-07-05T06:49:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:7LR5JB6PIBLAVGCUG3YV27HHDO","target":"record","payload":{"canonical_record":{"source":{"id":"2307.16771","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-31T15:38:22Z","cross_cats_sorted":[],"title_canon_sha256":"a749bf4358dfb32114e4f51c543c8df22c0e190a4982d5de7f8664ce74201239","abstract_canon_sha256":"e7987cfe4e1dc9422dda8a84da823294f04c0d5e02cd253e6bc70af1fb9c73de"},"schema_version":"1.0"},"canonical_sha256":"fae3d487cf40560a985436f15d7ce71b9b5268a324071f2037afcc3b8df8dbe8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:49:24.505162Z","signature_b64":"99La0byU2O8ttNsnwnxv0UPkzH8LKW8mPTXLtoK7f0O2DY4qKHewzMWUSHzf9IhN85lXAa3j8hqWlZWraxPVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fae3d487cf40560a985436f15d7ce71b9b5268a324071f2037afcc3b8df8dbe8","last_reissued_at":"2026-07-05T06:49:24.504763Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:49:24.504763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.16771","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-05T06:49:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WaxImjnOn+zI+D+wRtnIcX3kaEJsIcvXvfT/RPKepfTQhlo6ByigMD+5AU7Tc0BFVqfYL2SWplh5w4K3K32GAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T17:28:54.589551Z"},"content_sha256":"7b50e6e66fd04c9a39fc8244eff3255440b82f729af688057123b126115afa52","schema_version":"1.0","event_id":"sha256:7b50e6e66fd04c9a39fc8244eff3255440b82f729af688057123b126115afa52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:7LR5JB6PIBLAVGCUG3YV27HHDO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Algorithms with Predictions for Dynamic Graph Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Barna Saha, Christopher Ye, Martin P. Seybold, Monika Henzinger","submitted_at":"2023-07-31T15:38:22Z","abstract_excerpt":"{\\em Algorithms with predictions} incorporate machine learning predictions into algorithm design. A plethora of recent works incorporated predictions to improve on worst-case optimal bounds for online problems. In this paper, we initiate the study of complexity of dynamic data structures with predictions, including dynamic graph algorithms. Unlike in online algorithms, the main goal in dynamic data structures is to maintain the solution {\\em efficiently} with every update.\n  Motivated by work in online algorithms, we investigate three natural models of predictions: (1) $\\varepsilon$-accurate p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.16771","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/2307.16771/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-05T06:49:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1L2pwCdEH3SfNY76ZhXEEqDuyqqkzG4iu9srbo4oK1tHW97CrNLsvT8NvCRXjDgEm9yHDlri1lGNsNkA0+i/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T17:28:54.590243Z"},"content_sha256":"3896c30ce8d8f5c1e705697bf3b2f3e189cd0719931d014608745f565aa38f73","schema_version":"1.0","event_id":"sha256:3896c30ce8d8f5c1e705697bf3b2f3e189cd0719931d014608745f565aa38f73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7LR5JB6PIBLAVGCUG3YV27HHDO/bundle.json","state_url":"https://pith.science/pith/7LR5JB6PIBLAVGCUG3YV27HHDO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7LR5JB6PIBLAVGCUG3YV27HHDO/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-10T17:28:54Z","links":{"resolver":"https://pith.science/pith/7LR5JB6PIBLAVGCUG3YV27HHDO","bundle":"https://pith.science/pith/7LR5JB6PIBLAVGCUG3YV27HHDO/bundle.json","state":"https://pith.science/pith/7LR5JB6PIBLAVGCUG3YV27HHDO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7LR5JB6PIBLAVGCUG3YV27HHDO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:7LR5JB6PIBLAVGCUG3YV27HHDO","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":"e7987cfe4e1dc9422dda8a84da823294f04c0d5e02cd253e6bc70af1fb9c73de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-31T15:38:22Z","title_canon_sha256":"a749bf4358dfb32114e4f51c543c8df22c0e190a4982d5de7f8664ce74201239"},"schema_version":"1.0","source":{"id":"2307.16771","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.16771","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"arxiv_version","alias_value":"2307.16771v2","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.16771","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"pith_short_12","alias_value":"7LR5JB6PIBLA","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"pith_short_16","alias_value":"7LR5JB6PIBLAVGCU","created_at":"2026-07-05T06:49:24Z"},{"alias_kind":"pith_short_8","alias_value":"7LR5JB6P","created_at":"2026-07-05T06:49:24Z"}],"graph_snapshots":[{"event_id":"sha256:3896c30ce8d8f5c1e705697bf3b2f3e189cd0719931d014608745f565aa38f73","target":"graph","created_at":"2026-07-05T06:49:24Z","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.16771/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"{\\em Algorithms with predictions} incorporate machine learning predictions into algorithm design. A plethora of recent works incorporated predictions to improve on worst-case optimal bounds for online problems. In this paper, we initiate the study of complexity of dynamic data structures with predictions, including dynamic graph algorithms. Unlike in online algorithms, the main goal in dynamic data structures is to maintain the solution {\\em efficiently} with every update.\n  Motivated by work in online algorithms, we investigate three natural models of predictions: (1) $\\varepsilon$-accurate p","authors_text":"Barna Saha, Christopher Ye, Martin P. Seybold, Monika Henzinger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-31T15:38:22Z","title":"On the Complexity of Algorithms with Predictions for Dynamic Graph Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.16771","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:7b50e6e66fd04c9a39fc8244eff3255440b82f729af688057123b126115afa52","target":"record","created_at":"2026-07-05T06:49:24Z","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":"e7987cfe4e1dc9422dda8a84da823294f04c0d5e02cd253e6bc70af1fb9c73de","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-07-31T15:38:22Z","title_canon_sha256":"a749bf4358dfb32114e4f51c543c8df22c0e190a4982d5de7f8664ce74201239"},"schema_version":"1.0","source":{"id":"2307.16771","kind":"arxiv","version":2}},"canonical_sha256":"fae3d487cf40560a985436f15d7ce71b9b5268a324071f2037afcc3b8df8dbe8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fae3d487cf40560a985436f15d7ce71b9b5268a324071f2037afcc3b8df8dbe8","first_computed_at":"2026-07-05T06:49:24.504763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:49:24.504763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"99La0byU2O8ttNsnwnxv0UPkzH8LKW8mPTXLtoK7f0O2DY4qKHewzMWUSHzf9IhN85lXAa3j8hqWlZWraxPVAw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:49:24.505162Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.16771","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b50e6e66fd04c9a39fc8244eff3255440b82f729af688057123b126115afa52","sha256:3896c30ce8d8f5c1e705697bf3b2f3e189cd0719931d014608745f565aa38f73"],"state_sha256":"2c0a01690b5a504c11272bd38dbd75fbf8b5c335dc35eb1c987729421fe21c8d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IhQSixH7v9+jlUir0vhwQtVDbqcQTVukba3GBBPdNDPin9gjcLxJ6Uj7hDCYlFTlyO7G1Mze3PRH77TbZg/jDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T17:28:54.595874Z","bundle_sha256":"1b3836a51ffdd927fcbedac619f80a4025d4ea73fd29fdfd86447f2b14b640bf"}}