{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:DBOHL2HQGLCIX3PMXATFTASJ6O","short_pith_number":"pith:DBOHL2HQ","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"},"canonical_sha256":"185c75e8f032c48bedecb826598249f3852d9e57ca2e9f32ce01ac9fd81f0be4","source":{"kind":"arxiv","id":"2405.14835","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.14835","created_at":"2026-07-05T08:22:28Z"},{"alias_kind":"arxiv_version","alias_value":"2405.14835v1","created_at":"2026-07-05T08:22:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.14835","created_at":"2026-07-05T08:22:28Z"},{"alias_kind":"pith_short_12","alias_value":"DBOHL2HQGLCI","created_at":"2026-07-05T08:22:28Z"},{"alias_kind":"pith_short_16","alias_value":"DBOHL2HQGLCIX3PM","created_at":"2026-07-05T08:22:28Z"},{"alias_kind":"pith_short_8","alias_value":"DBOHL2HQ","created_at":"2026-07-05T08:22:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:DBOHL2HQGLCIX3PMXATFTASJ6O","target":"record","payload":{"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"},"canonical_sha256":"185c75e8f032c48bedecb826598249f3852d9e57ca2e9f32ce01ac9fd81f0be4","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"},"source_kind":"arxiv","source_id":"2405.14835","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-07-05T08:22:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aD9IImo+Y3X73dm//ClPHuxuFRRqNTdbUbw2k42Z2Rx1IYj+9t5s+y6V/2Qfm4miCqs9hOP49c9GDYUKC0wzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:41:58.802261Z"},"content_sha256":"5f8e12a9675f85cbd0f9c7bd1a428efc74ef0592b999816666fe343b6cb28de6","schema_version":"1.0","event_id":"sha256:5f8e12a9675f85cbd0f9c7bd1a428efc74ef0592b999816666fe343b6cb28de6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:DBOHL2HQGLCIX3PMXATFTASJ6O","target":"graph","payload":{"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"},"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-07-05T08:22:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZLmpP2uTY/Vhs9tNj9oxhDZg9Avgk4yReSLth4v9VU9YwTRdDvTrp+xGdH/Ly5kUBu2rZol60eB8vzWM47uAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:41:58.802656Z"},"content_sha256":"97824a0fa57f7840661de5bd6ef7681e1836671645dbd186c9be082bee37640a","schema_version":"1.0","event_id":"sha256:97824a0fa57f7840661de5bd6ef7681e1836671645dbd186c9be082bee37640a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DBOHL2HQGLCIX3PMXATFTASJ6O/bundle.json","state_url":"https://pith.science/pith/DBOHL2HQGLCIX3PMXATFTASJ6O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DBOHL2HQGLCIX3PMXATFTASJ6O/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-07-06T20:41:58Z","links":{"resolver":"https://pith.science/pith/DBOHL2HQGLCIX3PMXATFTASJ6O","bundle":"https://pith.science/pith/DBOHL2HQGLCIX3PMXATFTASJ6O/bundle.json","state":"https://pith.science/pith/DBOHL2HQGLCIX3PMXATFTASJ6O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DBOHL2HQGLCIX3PMXATFTASJ6O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:DBOHL2HQGLCIX3PMXATFTASJ6O","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":"e289934e54dea93bb92a650d3d365b88fb1bffc8cc2e5f9d9e37176d68ff22ad","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-05-23T17:50:34Z","title_canon_sha256":"1b783cfd3bd21aa695c9640d5ac62beea371eb27ee5d6e0c733b69ce65d56731"},"schema_version":"1.0","source":{"id":"2405.14835","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.14835","created_at":"2026-07-05T08:22:28Z"},{"alias_kind":"arxiv_version","alias_value":"2405.14835v1","created_at":"2026-07-05T08:22:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.14835","created_at":"2026-07-05T08:22:28Z"},{"alias_kind":"pith_short_12","alias_value":"DBOHL2HQGLCI","created_at":"2026-07-05T08:22:28Z"},{"alias_kind":"pith_short_16","alias_value":"DBOHL2HQGLCIX3PM","created_at":"2026-07-05T08:22:28Z"},{"alias_kind":"pith_short_8","alias_value":"DBOHL2HQ","created_at":"2026-07-05T08:22:28Z"}],"graph_snapshots":[{"event_id":"sha256:97824a0fa57f7840661de5bd6ef7681e1836671645dbd186c9be082bee37640a","target":"graph","created_at":"2026-07-05T08:22:28Z","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/2405.14835/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Bruno Loff, Parth Mittal, Prantar Ghosh, Sagnik Mukhopadhyay, Sepehr Assadi","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-05-23T17:50:34Z","title":"Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.14835","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:5f8e12a9675f85cbd0f9c7bd1a428efc74ef0592b999816666fe343b6cb28de6","target":"record","created_at":"2026-07-05T08:22:28Z","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":"e289934e54dea93bb92a650d3d365b88fb1bffc8cc2e5f9d9e37176d68ff22ad","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-05-23T17:50:34Z","title_canon_sha256":"1b783cfd3bd21aa695c9640d5ac62beea371eb27ee5d6e0c733b69ce65d56731"},"schema_version":"1.0","source":{"id":"2405.14835","kind":"arxiv","version":1}},"canonical_sha256":"185c75e8f032c48bedecb826598249f3852d9e57ca2e9f32ce01ac9fd81f0be4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"185c75e8f032c48bedecb826598249f3852d9e57ca2e9f32ce01ac9fd81f0be4","first_computed_at":"2026-07-05T08:22:28.593630Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:22:28.593630Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kJNRws48Y/Wc2G7l3fTYkCnrlfX3CWnPr9EIWqEohkZVh4iVjwwAU0b0dutRQpTSnrJaH6Xj7dfp9FcxuBrKBg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:22:28.594093Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.14835","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f8e12a9675f85cbd0f9c7bd1a428efc74ef0592b999816666fe343b6cb28de6","sha256:97824a0fa57f7840661de5bd6ef7681e1836671645dbd186c9be082bee37640a"],"state_sha256":"1539bc50553f637f5dac4e80de95a736f05278ca752e3db7751fb3fde26aab6c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W3I5WShGbUOAmIRrFZzHLaCR0jMjS2xnjALB+s6tZSmP2qGZH/ChR6EKTzqcXQEi66twxrWWHkJkyYijUWkHAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:41:58.804652Z","bundle_sha256":"c321b10962d0d10035eb622b650a158016f2423744b984c77672d9291c145ac6"}}