{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:N23BN6JKWVJWC52PM6VG6ONSLM","short_pith_number":"pith:N23BN6JK","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"},"canonical_sha256":"6eb616f92ab55361774f67aa6f39b25b2ee6b5260e31d7f800c30aabcf9c14e2","source":{"kind":"arxiv","id":"2605.23104","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23104","created_at":"2026-05-25T02:01:38Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23104v1","created_at":"2026-05-25T02:01:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23104","created_at":"2026-05-25T02:01:38Z"},{"alias_kind":"pith_short_12","alias_value":"N23BN6JKWVJW","created_at":"2026-05-25T02:01:38Z"},{"alias_kind":"pith_short_16","alias_value":"N23BN6JKWVJWC52P","created_at":"2026-05-25T02:01:38Z"},{"alias_kind":"pith_short_8","alias_value":"N23BN6JK","created_at":"2026-05-25T02:01:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:N23BN6JKWVJWC52PM6VG6ONSLM","target":"record","payload":{"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"},"canonical_sha256":"6eb616f92ab55361774f67aa6f39b25b2ee6b5260e31d7f800c30aabcf9c14e2","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"},"source_kind":"arxiv","source_id":"2605.23104","source_version":1,"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-05-25T02:01:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PsvkiK88TSGOvq76T3P7Aet/aKLxqRKcffq38EAeA9USnt/3jL4wXVmqSwqN/VTVDZmWrT6SvFL1fj6lJancDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:07:18.715653Z"},"content_sha256":"df56168b278fac250f3f74d544e28a184d8c80633f3d02a47a60635aa2a2c752","schema_version":"1.0","event_id":"sha256:df56168b278fac250f3f74d544e28a184d8c80633f3d02a47a60635aa2a2c752"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:N23BN6JKWVJWC52PM6VG6ONSLM","target":"graph","payload":{"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"},"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-05-25T02:01:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIpOoGIZsURU99sbZpZMeYjh2IeUkZZFr6v39Uve53dOJmrd9AaXtTZLa+VbOnwZjQgOaah7+I+n1lFfMM5xDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:07:18.716183Z"},"content_sha256":"629c5804818e8f82a276f57cfa1375dc7aac2df79f44b6d70442a9eea1abde95","schema_version":"1.0","event_id":"sha256:629c5804818e8f82a276f57cfa1375dc7aac2df79f44b6d70442a9eea1abde95"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:N23BN6JKWVJWC52PM6VG6ONSLM","target":"integrity","payload":{"note":"Identifier '10.1002/(sici)1098-2418(199809)13:2' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Devdatt P. Dubhashi and Desh Ranjan , journal =. Balls and bins:. 1998 , timestamp =. doi:10.1002/(SICI)1098-2418(199809)13:2\\ pages =","arxiv_id":"2605.23104","detector":"doi_compliance","evidence":{"doi":"10.1002/(sici)1098-2418(199809)13:2","arxiv_id":null,"ref_index":28,"raw_excerpt":"Devdatt P. Dubhashi and Desh Ranjan , journal =. Balls and bins:. 1998 , timestamp =. doi:10.1002/(SICI)1098-2418(199809)13:2\\ pages =","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":28,"audited_at":"2026-05-25T04:59:01.605549Z","event_type":"pith.integrity.v1","detected_doi":"10.1002/(sici)1098-2418(199809)13:2","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"634eddbe75308583ebca491fb4a7ee8f920d446c235a7f06eddc42ce48e65942","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":7370,"payload_sha256":"1a09a2da547082e43dc7e8443ea49c13fecdabb9892e6338774c203e762556fc","signature_b64":"a7/tRDCMOvZWfGZVLh11uyvB2VB6O4bqya7aYOx/b/JZgg3bbChG7V8XbngHwJ9Cn7X2sJKQwTv9S2oXZPZbBw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T04:59:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F85TcTziWGKXr+8tgJGYHH0SyuxZKnIRrxIJsrk36uHilKrNRrOSNQ4Jz6DdB4Cxn7ioMxMEtyTn/yAgZGfyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:07:18.717426Z"},"content_sha256":"18ee2a4c775b5179f4e4c9797a709e100ca215e37ebda766d7ec6ad76704a0f3","schema_version":"1.0","event_id":"sha256:18ee2a4c775b5179f4e4c9797a709e100ca215e37ebda766d7ec6ad76704a0f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N23BN6JKWVJWC52PM6VG6ONSLM/bundle.json","state_url":"https://pith.science/pith/N23BN6JKWVJWC52PM6VG6ONSLM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N23BN6JKWVJWC52PM6VG6ONSLM/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-05-26T07:07:18Z","links":{"resolver":"https://pith.science/pith/N23BN6JKWVJWC52PM6VG6ONSLM","bundle":"https://pith.science/pith/N23BN6JKWVJWC52PM6VG6ONSLM/bundle.json","state":"https://pith.science/pith/N23BN6JKWVJWC52PM6VG6ONSLM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N23BN6JKWVJWC52PM6VG6ONSLM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:N23BN6JKWVJWC52PM6VG6ONSLM","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a178b8b9ff9970d29233e43c9251480ef42d1689c6b96bab6f8a722151ff3b20","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-21T23:50:12Z","title_canon_sha256":"dac412950d492c076450c02ee9e0877d304a8a08a896aa4afaf8b9d104c11992"},"schema_version":"1.0","source":{"id":"2605.23104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23104","created_at":"2026-05-25T02:01:38Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23104v1","created_at":"2026-05-25T02:01:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23104","created_at":"2026-05-25T02:01:38Z"},{"alias_kind":"pith_short_12","alias_value":"N23BN6JKWVJW","created_at":"2026-05-25T02:01:38Z"},{"alias_kind":"pith_short_16","alias_value":"N23BN6JKWVJWC52P","created_at":"2026-05-25T02:01:38Z"},{"alias_kind":"pith_short_8","alias_value":"N23BN6JK","created_at":"2026-05-25T02:01:38Z"}],"graph_snapshots":[{"event_id":"sha256:629c5804818e8f82a276f57cfa1375dc7aac2df79f44b6d70442a9eea1abde95","target":"graph","created_at":"2026-05-25T02:01:38Z","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/2605.23104/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Periklis A. Papakonstantinou, Songhua He, Sumegha Garg","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-21T23:50:12Z","title":"Query Lower Bounds for Correlation Clustering under Memory Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23104","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:df56168b278fac250f3f74d544e28a184d8c80633f3d02a47a60635aa2a2c752","target":"record","created_at":"2026-05-25T02:01:38Z","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":"a178b8b9ff9970d29233e43c9251480ef42d1689c6b96bab6f8a722151ff3b20","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-05-21T23:50:12Z","title_canon_sha256":"dac412950d492c076450c02ee9e0877d304a8a08a896aa4afaf8b9d104c11992"},"schema_version":"1.0","source":{"id":"2605.23104","kind":"arxiv","version":1}},"canonical_sha256":"6eb616f92ab55361774f67aa6f39b25b2ee6b5260e31d7f800c30aabcf9c14e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6eb616f92ab55361774f67aa6f39b25b2ee6b5260e31d7f800c30aabcf9c14e2","first_computed_at":"2026-05-25T02:01:38.305521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:38.305521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gf/7HE9M22eI3HvHETCg9x2+BLuR1lpaL8vZpoGsVn8+qNA1mW0GZKCS6xoaeRFWcI71mC1/OxORgGmxHodKCw==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:38.306155Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.23104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df56168b278fac250f3f74d544e28a184d8c80633f3d02a47a60635aa2a2c752","sha256:629c5804818e8f82a276f57cfa1375dc7aac2df79f44b6d70442a9eea1abde95","sha256:18ee2a4c775b5179f4e4c9797a709e100ca215e37ebda766d7ec6ad76704a0f3"],"state_sha256":"eb87fae52fe2fdea585e9b413ca3315f7fd90e68f411eb9ab7d3971f0ac46bab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hVxUpc98zkyDQAv94gZ+Bm000UyztIEbtgvaaUAb2TSVfJiioA/K2Hn7YkJOnlEYARkWq3yEghFrpBjKtz95BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:07:18.720893Z","bundle_sha256":"51e4834c0b81706337267ed293c9f871745c2ee321df031390f028d6d7148231"}}