{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4QJD7NJ7Q3KXIGGUSXZROZ46E3","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":"01be4b45cdcf0afc1bba8395f137ad348a58b1a7824023da221f1239794e26cb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-03-05T18:12:06Z","title_canon_sha256":"8ec8a03c2a2ac4e1d260bb0ba68996aac83d9bd5239d0ff67fe7ae969a4682f3"},"schema_version":"1.0","source":{"id":"1703.01638","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.01638","created_at":"2026-05-18T00:49:30Z"},{"alias_kind":"arxiv_version","alias_value":"1703.01638v1","created_at":"2026-05-18T00:49:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01638","created_at":"2026-05-18T00:49:30Z"},{"alias_kind":"pith_short_12","alias_value":"4QJD7NJ7Q3KX","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4QJD7NJ7Q3KXIGGU","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4QJD7NJ7","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:d5a5f7de71ab78f835d1ae48e27a0e26aaa4cb1256a49d91eb5756920f682e60","target":"graph","created_at":"2026-05-18T00:49:30Z","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"},"paper":{"abstract_excerpt":"In recent years it has become popular to study dynamic problems in a sensitivity setting: Instead of allowing for an arbitrary sequence of updates, the sensitivity model only allows to apply batch updates of small size to the original input data. The sensitivity model is particularly appealing since recent strong conditional lower bounds ruled out fast algorithms for many dynamic problems, such as shortest paths, reachability, or subgraph connectivity.\n  In this paper we prove conditional lower bounds for sensitivity problems. For example, we show that under the Boolean Matrix Multiplication (","authors_text":"Andrea Lincoln, Monika Henzinger, Stefan Neumann, Virginia Vassilevska Williams","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-03-05T18:12:06Z","title":"Conditional Hardness for Sensitivity Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01638","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:50115056b141581e7861f33df49c9c1a2d1138480f3f18caca3dc9a51faecd68","target":"record","created_at":"2026-05-18T00:49:30Z","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":"01be4b45cdcf0afc1bba8395f137ad348a58b1a7824023da221f1239794e26cb","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2017-03-05T18:12:06Z","title_canon_sha256":"8ec8a03c2a2ac4e1d260bb0ba68996aac83d9bd5239d0ff67fe7ae969a4682f3"},"schema_version":"1.0","source":{"id":"1703.01638","kind":"arxiv","version":1}},"canonical_sha256":"e4123fb53f86d57418d495f317679e26e193177082b761dc45f6feb57d8dd389","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4123fb53f86d57418d495f317679e26e193177082b761dc45f6feb57d8dd389","first_computed_at":"2026-05-18T00:49:30.044698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:30.044698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gWofmMMi/o+RSzRzHas74oQPj7DbDZtBd5cmEq3VNWhAlvai4l2rdIophYRCxYc0wbHZYW09W7Yg/TE6uRNQAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:30.045361Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.01638","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50115056b141581e7861f33df49c9c1a2d1138480f3f18caca3dc9a51faecd68","sha256:d5a5f7de71ab78f835d1ae48e27a0e26aaa4cb1256a49d91eb5756920f682e60"],"state_sha256":"7a7c5b74d23d8fadf3482405a4a0f778cebba64a62497ad8c622e1faa98fc574"}