{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:BV4QHA3TRZWNI56Z5PTXW24LX7","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":"cac90392a765d52a661e9fbe598967c4d200c245161ea46ba3299f5e10208de5","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-21T18:37:27Z","title_canon_sha256":"da506d6e956abd01c574a4bef6a865a3a7c3a43a8465dcbf301465b1aa13cb88"},"schema_version":"1.0","source":{"id":"1711.07960","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07960","created_at":"2026-05-18T00:28:51Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07960v3","created_at":"2026-05-18T00:28:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07960","created_at":"2026-05-18T00:28:51Z"},{"alias_kind":"pith_short_12","alias_value":"BV4QHA3TRZWN","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"BV4QHA3TRZWNI56Z","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"BV4QHA3T","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:ad4dfc7020cad3b6b0bda0436ae64cb7bd219b73890390d130a584cb885b8256","target":"graph","created_at":"2026-05-18T00:28:51Z","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":"This paper initiates the study of I/O algorithms (minimizing cache misses) from the perspective of fine-grained complexity (conditional polynomial lower bounds). Specifically, we aim to answer why sparse graph problems are so hard, and why the Longest Common Subsequence problem gets a savings of a factor of the size of cache times the length of a cache line, but no more. We take the reductions and techniques from complexity and fine-grained complexity and apply them to the I/O model to generate new (conditional) lower bounds as well as faster algorithms. We also prove the existence of a time h","authors_text":"Andrea Lincoln, Erik D. Demaine, Jayson Lynch, Quanquan C. Liu, Virginia Vassilevska Williams","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-21T18:37:27Z","title":"Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07960","kind":"arxiv","version":3},"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:ff4747c0c3232c98adda480d6455bfd382c06840f9e30c7e6c18da5b80a2f3b2","target":"record","created_at":"2026-05-18T00:28:51Z","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":"cac90392a765d52a661e9fbe598967c4d200c245161ea46ba3299f5e10208de5","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-21T18:37:27Z","title_canon_sha256":"da506d6e956abd01c574a4bef6a865a3a7c3a43a8465dcbf301465b1aa13cb88"},"schema_version":"1.0","source":{"id":"1711.07960","kind":"arxiv","version":3}},"canonical_sha256":"0d790383738e6cd477d9ebe77b6b8bbfe9fa03926923afdd4aae1ac6191b372f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d790383738e6cd477d9ebe77b6b8bbfe9fa03926923afdd4aae1ac6191b372f","first_computed_at":"2026-05-18T00:28:51.544601Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:51.544601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fyN2nZfUsge4gR2yD7gMsn3keE+/BHhuMetMmqdWUhoLLJ5Om0sOWpHlbYYlN5AWjYlceeC5UD6HuwVQ+7r3BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:51.545208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07960","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff4747c0c3232c98adda480d6455bfd382c06840f9e30c7e6c18da5b80a2f3b2","sha256:ad4dfc7020cad3b6b0bda0436ae64cb7bd219b73890390d130a584cb885b8256"],"state_sha256":"2f469117877786e1c40eb2d75e13d7a423eb363c4247553320389078453bf0d8"}