{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:N23BN6JKWVJWC52PM6VG6ONSLM","short_pith_number":"pith:N23BN6JK","schema_version":"1.0","canonical_sha256":"6eb616f92ab55361774f67aa6f39b25b2ee6b5260e31d7f800c30aabcf9c14e2","source":{"kind":"arxiv","id":"2605.23104","version":1},"attestation_state":"computed","paper":{"title":"Query Lower Bounds for Correlation Clustering under Memory Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Periklis A. Papakonstantinou, Songhua He, Sumegha Garg","submitted_at":"2026-05-21T23:50:12Z","abstract_excerpt":"This work initiates the study of memory-query tradeoffs for graph problems, with a focus on correlation clustering. Correlation clustering asks for a partition of the vertices that minimizes disagreements: non-edges inside clusters plus edges across clusters. Our first result is a tight query lower bound: to output a partition whose cost approximates the optimum up to an additive error of $\\varepsilon n^2$, any algorithm requires $\\Omega(n/\\varepsilon^2)$ adjacency-matrix queries. Under memory constraints, we show that even for the seemingly easier task of approximating the optimal clustering "},"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":"2605.23104","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-21T23:50:12Z","cross_cats_sorted":[],"title_canon_sha256":"dac412950d492c076450c02ee9e0877d304a8a08a896aa4afaf8b9d104c11992","abstract_canon_sha256":"a178b8b9ff9970d29233e43c9251480ef42d1689c6b96bab6f8a722151ff3b20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:38.306155Z","signature_b64":"gf/7HE9M22eI3HvHETCg9x2+BLuR1lpaL8vZpoGsVn8+qNA1mW0GZKCS6xoaeRFWcI71mC1/OxORgGmxHodKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6eb616f92ab55361774f67aa6f39b25b2ee6b5260e31d7f800c30aabcf9c14e2","last_reissued_at":"2026-05-25T02:01:38.305521Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:38.305521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Query Lower Bounds for Correlation Clustering under Memory Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Periklis A. Papakonstantinou, Songhua He, Sumegha Garg","submitted_at":"2026-05-21T23:50:12Z","abstract_excerpt":"This work initiates the study of memory-query tradeoffs for graph problems, with a focus on correlation clustering. Correlation clustering asks for a partition of the vertices that minimizes disagreements: non-edges inside clusters plus edges across clusters. Our first result is a tight query lower bound: to output a partition whose cost approximates the optimum up to an additive error of $\\varepsilon n^2$, any algorithm requires $\\Omega(n/\\varepsilon^2)$ adjacency-matrix queries. Under memory constraints, we show that even for the seemingly easier task of approximating the optimal clustering "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23104","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/2605.23104/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":"2605.23104","created_at":"2026-05-25T02:01:38.305640+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.23104v1","created_at":"2026-05-25T02:01:38.305640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23104","created_at":"2026-05-25T02:01:38.305640+00:00"},{"alias_kind":"pith_short_12","alias_value":"N23BN6JKWVJW","created_at":"2026-05-25T02:01:38.305640+00:00"},{"alias_kind":"pith_short_16","alias_value":"N23BN6JKWVJWC52P","created_at":"2026-05-25T02:01:38.305640+00:00"},{"alias_kind":"pith_short_8","alias_value":"N23BN6JK","created_at":"2026-05-25T02:01:38.305640+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/N23BN6JKWVJWC52PM6VG6ONSLM","json":"https://pith.science/pith/N23BN6JKWVJWC52PM6VG6ONSLM.json","graph_json":"https://pith.science/api/pith-number/N23BN6JKWVJWC52PM6VG6ONSLM/graph.json","events_json":"https://pith.science/api/pith-number/N23BN6JKWVJWC52PM6VG6ONSLM/events.json","paper":"https://pith.science/paper/N23BN6JK"},"agent_actions":{"view_html":"https://pith.science/pith/N23BN6JKWVJWC52PM6VG6ONSLM","download_json":"https://pith.science/pith/N23BN6JKWVJWC52PM6VG6ONSLM.json","view_paper":"https://pith.science/paper/N23BN6JK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.23104&json=true","fetch_graph":"https://pith.science/api/pith-number/N23BN6JKWVJWC52PM6VG6ONSLM/graph.json","fetch_events":"https://pith.science/api/pith-number/N23BN6JKWVJWC52PM6VG6ONSLM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N23BN6JKWVJWC52PM6VG6ONSLM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N23BN6JKWVJWC52PM6VG6ONSLM/action/storage_attestation","attest_author":"https://pith.science/pith/N23BN6JKWVJWC52PM6VG6ONSLM/action/author_attestation","sign_citation":"https://pith.science/pith/N23BN6JKWVJWC52PM6VG6ONSLM/action/citation_signature","submit_replication":"https://pith.science/pith/N23BN6JKWVJWC52PM6VG6ONSLM/action/replication_record"}},"created_at":"2026-05-25T02:01:38.305640+00:00","updated_at":"2026-05-25T02:01:38.305640+00:00"}