{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DBOHL2HQGLCIX3PMXATFTASJ6O","short_pith_number":"pith:DBOHL2HQ","schema_version":"1.0","canonical_sha256":"185c75e8f032c48bedecb826598249f3852d9e57ca2e9f32ce01ac9fd81f0be4","source":{"kind":"arxiv","id":"2405.14835","version":1},"attestation_state":"computed","paper":{"title":"Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bruno Loff, Parth Mittal, Prantar Ghosh, Sagnik Mukhopadhyay, Sepehr Assadi","submitted_at":"2024-05-23T17:50:34Z","abstract_excerpt":"The following question arises naturally in the study of graph streaming algorithms:\n  \"Is there any graph problem which is \"not too hard\", in that it can be solved efficiently with total communication (nearly) linear in the number $n$ of vertices, and for which, nonetheless, any streaming algorithm with $\\tilde{O}(n)$ space (i.e., a semi-streaming algorithm) needs a polynomial $n^{\\Omega(1)}$ number of passes?\"\n  Assadi, Chen, and Khanna [STOC 2019] were the first to prove that this is indeed the case. However, the lower bounds that they obtained are for rather non-standard graph problems.\n  O"},"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":"2405.14835","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-05-23T17:50:34Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1b783cfd3bd21aa695c9640d5ac62beea371eb27ee5d6e0c733b69ce65d56731","abstract_canon_sha256":"e289934e54dea93bb92a650d3d365b88fb1bffc8cc2e5f9d9e37176d68ff22ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:22:28.594093Z","signature_b64":"kJNRws48Y/Wc2G7l3fTYkCnrlfX3CWnPr9EIWqEohkZVh4iVjwwAU0b0dutRQpTSnrJaH6Xj7dfp9FcxuBrKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"185c75e8f032c48bedecb826598249f3852d9e57ca2e9f32ce01ac9fd81f0be4","last_reissued_at":"2026-07-05T08:22:28.593630Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:22:28.593630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bruno Loff, Parth Mittal, Prantar Ghosh, Sagnik Mukhopadhyay, Sepehr Assadi","submitted_at":"2024-05-23T17:50:34Z","abstract_excerpt":"The following question arises naturally in the study of graph streaming algorithms:\n  \"Is there any graph problem which is \"not too hard\", in that it can be solved efficiently with total communication (nearly) linear in the number $n$ of vertices, and for which, nonetheless, any streaming algorithm with $\\tilde{O}(n)$ space (i.e., a semi-streaming algorithm) needs a polynomial $n^{\\Omega(1)}$ number of passes?\"\n  Assadi, Chen, and Khanna [STOC 2019] were the first to prove that this is indeed the case. However, the lower bounds that they obtained are for rather non-standard graph problems.\n  O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.14835","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/2405.14835/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":"2405.14835","created_at":"2026-07-05T08:22:28.593675+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.14835v1","created_at":"2026-07-05T08:22:28.593675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.14835","created_at":"2026-07-05T08:22:28.593675+00:00"},{"alias_kind":"pith_short_12","alias_value":"DBOHL2HQGLCI","created_at":"2026-07-05T08:22:28.593675+00:00"},{"alias_kind":"pith_short_16","alias_value":"DBOHL2HQGLCIX3PM","created_at":"2026-07-05T08:22:28.593675+00:00"},{"alias_kind":"pith_short_8","alias_value":"DBOHL2HQ","created_at":"2026-07-05T08:22:28.593675+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/DBOHL2HQGLCIX3PMXATFTASJ6O","json":"https://pith.science/pith/DBOHL2HQGLCIX3PMXATFTASJ6O.json","graph_json":"https://pith.science/api/pith-number/DBOHL2HQGLCIX3PMXATFTASJ6O/graph.json","events_json":"https://pith.science/api/pith-number/DBOHL2HQGLCIX3PMXATFTASJ6O/events.json","paper":"https://pith.science/paper/DBOHL2HQ"},"agent_actions":{"view_html":"https://pith.science/pith/DBOHL2HQGLCIX3PMXATFTASJ6O","download_json":"https://pith.science/pith/DBOHL2HQGLCIX3PMXATFTASJ6O.json","view_paper":"https://pith.science/paper/DBOHL2HQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.14835&json=true","fetch_graph":"https://pith.science/api/pith-number/DBOHL2HQGLCIX3PMXATFTASJ6O/graph.json","fetch_events":"https://pith.science/api/pith-number/DBOHL2HQGLCIX3PMXATFTASJ6O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DBOHL2HQGLCIX3PMXATFTASJ6O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DBOHL2HQGLCIX3PMXATFTASJ6O/action/storage_attestation","attest_author":"https://pith.science/pith/DBOHL2HQGLCIX3PMXATFTASJ6O/action/author_attestation","sign_citation":"https://pith.science/pith/DBOHL2HQGLCIX3PMXATFTASJ6O/action/citation_signature","submit_replication":"https://pith.science/pith/DBOHL2HQGLCIX3PMXATFTASJ6O/action/replication_record"}},"created_at":"2026-07-05T08:22:28.593675+00:00","updated_at":"2026-07-05T08:22:28.593675+00:00"}