{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3HOTV5NCRG3EIVJVP66PC43KAN","short_pith_number":"pith:3HOTV5NC","canonical_record":{"source":{"id":"1705.03284","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-09T11:43:38Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"051534f126c1a2352ab9e432b7bdf05f73673b10241d18acab68627ba2907739","abstract_canon_sha256":"e5b0b47d41d7e3911d95bf5dce98707bf95f74defee959b6b2d2f19fe461c89e"},"schema_version":"1.0"},"canonical_sha256":"d9dd3af5a289b64455357fbcf1736a036ee92095ee52aa06b0442a3832a95653","source":{"kind":"arxiv","id":"1705.03284","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03284","created_at":"2026-05-18T00:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03284v3","created_at":"2026-05-18T00:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03284","created_at":"2026-05-18T00:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"3HOTV5NCRG3E","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3HOTV5NCRG3EIVJV","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3HOTV5NC","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3HOTV5NCRG3EIVJVP66PC43KAN","target":"record","payload":{"canonical_record":{"source":{"id":"1705.03284","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-09T11:43:38Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"051534f126c1a2352ab9e432b7bdf05f73673b10241d18acab68627ba2907739","abstract_canon_sha256":"e5b0b47d41d7e3911d95bf5dce98707bf95f74defee959b6b2d2f19fe461c89e"},"schema_version":"1.0"},"canonical_sha256":"d9dd3af5a289b64455357fbcf1736a036ee92095ee52aa06b0442a3832a95653","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:43.688610Z","signature_b64":"73xUZMpQs0D7P+pGResXeRDtybNGqM5VkTDhePPIcVzG9LHFuiIeyDmChJjaX9JS6z14SHofS5653NFV3KzLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9dd3af5a289b64455357fbcf1736a036ee92095ee52aa06b0442a3832a95653","last_reissued_at":"2026-05-18T00:17:43.687888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:43.687888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.03284","source_version":3,"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-18T00:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L2J80xQSY1J+goHvcRKJInJaFomay6GSsbvmn1caOBxQIBuEZ726hFzGsXStG2kGAAkHi7Dhy+uU7xF137TZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:39:42.800005Z"},"content_sha256":"8de872117580eae817a8f65b2e415370e2b5539692307b2664b6752b14a3b72f","schema_version":"1.0","event_id":"sha256:8de872117580eae817a8f65b2e415370e2b5539692307b2664b6752b14a3b72f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3HOTV5NCRG3EIVJVP66PC43KAN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards a complexity theory for the congested clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DC","authors_text":"Janne H. Korhonen, Jukka Suomela","submitted_at":"2017-05-09T11:43:38Z","abstract_excerpt":"The congested clique model of distributed computing has been receiving attention as a model for densely connected distributed systems. While there has been significant progress on the side of upper bounds, we have very little in terms of lower bounds for the congested clique; indeed, it is now know that proving explicit congested clique lower bounds is as difficult as proving circuit lower bounds.\n  In this work, we use various more traditional complexity-theoretic tools to build a clearer picture of the complexity landscape of the congested clique:\n  -- Nondeterminism and beyond: We introduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03284","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"},"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-18T00:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N3bv2ljxb598uZn0K/CeXLjmtQw7LiRElHmgC9KkWupM3IZhK7O/txWNsT47Pmtv4SeT9Q/9eUFC5EzyRbz1Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T04:39:42.800732Z"},"content_sha256":"20ccf1954ef3b226fe151feca0bc7e48c2ac15861d98e72504a7e81da925182d","schema_version":"1.0","event_id":"sha256:20ccf1954ef3b226fe151feca0bc7e48c2ac15861d98e72504a7e81da925182d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3HOTV5NCRG3EIVJVP66PC43KAN/bundle.json","state_url":"https://pith.science/pith/3HOTV5NCRG3EIVJVP66PC43KAN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3HOTV5NCRG3EIVJVP66PC43KAN/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-06-08T04:39:42Z","links":{"resolver":"https://pith.science/pith/3HOTV5NCRG3EIVJVP66PC43KAN","bundle":"https://pith.science/pith/3HOTV5NCRG3EIVJVP66PC43KAN/bundle.json","state":"https://pith.science/pith/3HOTV5NCRG3EIVJVP66PC43KAN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3HOTV5NCRG3EIVJVP66PC43KAN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3HOTV5NCRG3EIVJVP66PC43KAN","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":"e5b0b47d41d7e3911d95bf5dce98707bf95f74defee959b6b2d2f19fe461c89e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-09T11:43:38Z","title_canon_sha256":"051534f126c1a2352ab9e432b7bdf05f73673b10241d18acab68627ba2907739"},"schema_version":"1.0","source":{"id":"1705.03284","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.03284","created_at":"2026-05-18T00:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"1705.03284v3","created_at":"2026-05-18T00:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.03284","created_at":"2026-05-18T00:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"3HOTV5NCRG3E","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3HOTV5NCRG3EIVJV","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3HOTV5NC","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:20ccf1954ef3b226fe151feca0bc7e48c2ac15861d98e72504a7e81da925182d","target":"graph","created_at":"2026-05-18T00:17:43Z","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"},"paper":{"abstract_excerpt":"The congested clique model of distributed computing has been receiving attention as a model for densely connected distributed systems. While there has been significant progress on the side of upper bounds, we have very little in terms of lower bounds for the congested clique; indeed, it is now know that proving explicit congested clique lower bounds is as difficult as proving circuit lower bounds.\n  In this work, we use various more traditional complexity-theoretic tools to build a clearer picture of the complexity landscape of the congested clique:\n  -- Nondeterminism and beyond: We introduce","authors_text":"Janne H. Korhonen, Jukka Suomela","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-09T11:43:38Z","title":"Towards a complexity theory for the congested clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.03284","kind":"arxiv","version":3},"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:8de872117580eae817a8f65b2e415370e2b5539692307b2664b6752b14a3b72f","target":"record","created_at":"2026-05-18T00:17:43Z","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":"e5b0b47d41d7e3911d95bf5dce98707bf95f74defee959b6b2d2f19fe461c89e","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-09T11:43:38Z","title_canon_sha256":"051534f126c1a2352ab9e432b7bdf05f73673b10241d18acab68627ba2907739"},"schema_version":"1.0","source":{"id":"1705.03284","kind":"arxiv","version":3}},"canonical_sha256":"d9dd3af5a289b64455357fbcf1736a036ee92095ee52aa06b0442a3832a95653","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9dd3af5a289b64455357fbcf1736a036ee92095ee52aa06b0442a3832a95653","first_computed_at":"2026-05-18T00:17:43.687888Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:43.687888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"73xUZMpQs0D7P+pGResXeRDtybNGqM5VkTDhePPIcVzG9LHFuiIeyDmChJjaX9JS6z14SHofS5653NFV3KzLBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:43.688610Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.03284","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8de872117580eae817a8f65b2e415370e2b5539692307b2664b6752b14a3b72f","sha256:20ccf1954ef3b226fe151feca0bc7e48c2ac15861d98e72504a7e81da925182d"],"state_sha256":"0c2c4933577fc324dad3aea3724d8f85036476e8a54436d2351799d40d5d085a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ShqD6r+r+dcenDOc62jYwAkgVcKJw7n0VWHJXWcanLBlWK1F5x8oT41wnHnwW8jycESiKRd5iGUDE/BXVtcNDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T04:39:42.804794Z","bundle_sha256":"ce3ff61bc5dd702a5be3f058daeb9ac13eea328e0f685d3806047bcef3f9672f"}}