{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BV4QHA3TRZWNI56Z5PTXW24LX7","short_pith_number":"pith:BV4QHA3T","schema_version":"1.0","canonical_sha256":"0d790383738e6cd477d9ebe77b6b8bbfe9fa03926923afdd4aae1ac6191b372f","source":{"kind":"arxiv","id":"1711.07960","version":3},"attestation_state":"computed","paper":{"title":"Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Andrea Lincoln, Erik D. Demaine, Jayson Lynch, Quanquan C. Liu, Virginia Vassilevska Williams","submitted_at":"2017-11-21T18:37:27Z","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"},"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":"1711.07960","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-21T18:37:27Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"da506d6e956abd01c574a4bef6a865a3a7c3a43a8465dcbf301465b1aa13cb88","abstract_canon_sha256":"cac90392a765d52a661e9fbe598967c4d200c245161ea46ba3299f5e10208de5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:51.545208Z","signature_b64":"fyN2nZfUsge4gR2yD7gMsn3keE+/BHhuMetMmqdWUhoLLJ5Om0sOWpHlbYYlN5AWjYlceeC5UD6HuwVQ+7r3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d790383738e6cd477d9ebe77b6b8bbfe9fa03926923afdd4aae1ac6191b372f","last_reissued_at":"2026-05-18T00:28:51.544601Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:51.544601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Andrea Lincoln, Erik D. Demaine, Jayson Lynch, Quanquan C. Liu, Virginia Vassilevska Williams","submitted_at":"2017-11-21T18:37:27Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07960","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1711.07960","created_at":"2026-05-18T00:28:51.544718+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.07960v3","created_at":"2026-05-18T00:28:51.544718+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07960","created_at":"2026-05-18T00:28:51.544718+00:00"},{"alias_kind":"pith_short_12","alias_value":"BV4QHA3TRZWN","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BV4QHA3TRZWNI56Z","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BV4QHA3T","created_at":"2026-05-18T12:31:08.081275+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/BV4QHA3TRZWNI56Z5PTXW24LX7","json":"https://pith.science/pith/BV4QHA3TRZWNI56Z5PTXW24LX7.json","graph_json":"https://pith.science/api/pith-number/BV4QHA3TRZWNI56Z5PTXW24LX7/graph.json","events_json":"https://pith.science/api/pith-number/BV4QHA3TRZWNI56Z5PTXW24LX7/events.json","paper":"https://pith.science/paper/BV4QHA3T"},"agent_actions":{"view_html":"https://pith.science/pith/BV4QHA3TRZWNI56Z5PTXW24LX7","download_json":"https://pith.science/pith/BV4QHA3TRZWNI56Z5PTXW24LX7.json","view_paper":"https://pith.science/paper/BV4QHA3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.07960&json=true","fetch_graph":"https://pith.science/api/pith-number/BV4QHA3TRZWNI56Z5PTXW24LX7/graph.json","fetch_events":"https://pith.science/api/pith-number/BV4QHA3TRZWNI56Z5PTXW24LX7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BV4QHA3TRZWNI56Z5PTXW24LX7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BV4QHA3TRZWNI56Z5PTXW24LX7/action/storage_attestation","attest_author":"https://pith.science/pith/BV4QHA3TRZWNI56Z5PTXW24LX7/action/author_attestation","sign_citation":"https://pith.science/pith/BV4QHA3TRZWNI56Z5PTXW24LX7/action/citation_signature","submit_replication":"https://pith.science/pith/BV4QHA3TRZWNI56Z5PTXW24LX7/action/replication_record"}},"created_at":"2026-05-18T00:28:51.544718+00:00","updated_at":"2026-05-18T00:28:51.544718+00:00"}