{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:6TAI4N3HIQLZEHKITMR77FITYK","short_pith_number":"pith:6TAI4N3H","canonical_record":{"source":{"id":"1602.04095","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-12T16:04:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"24ad724d158fc21d450e572c174607278ea32a5ca17340f447cd4b534e3e76f3","abstract_canon_sha256":"a74e2ab6d0dd2792542ded0c7f9b0cb8230e7efac98fe3254e826ca613fb1761"},"schema_version":"1.0"},"canonical_sha256":"f4c08e37674417921d489b23ff9513c29437f14c2f6929919f12f85d3ed22e51","source":{"kind":"arxiv","id":"1602.04095","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04095","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04095v3","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04095","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"pith_short_12","alias_value":"6TAI4N3HIQLZ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6TAI4N3HIQLZEHKI","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6TAI4N3H","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:6TAI4N3HIQLZEHKITMR77FITYK","target":"record","payload":{"canonical_record":{"source":{"id":"1602.04095","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-12T16:04:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"24ad724d158fc21d450e572c174607278ea32a5ca17340f447cd4b534e3e76f3","abstract_canon_sha256":"a74e2ab6d0dd2792542ded0c7f9b0cb8230e7efac98fe3254e826ca613fb1761"},"schema_version":"1.0"},"canonical_sha256":"f4c08e37674417921d489b23ff9513c29437f14c2f6929919f12f85d3ed22e51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:39.578796Z","signature_b64":"rbet4ceeLTg0I5XCrGSWZnAPA7A8hStEKFAk2Ce1+vds5lU0OzBkKPJJLXOum6qqt8EarwMUzTOVPH5MxjkqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4c08e37674417921d489b23ff9513c29437f14c2f6929919f12f85d3ed22e51","last_reissued_at":"2026-05-18T00:42:39.578114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:39.578114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.04095","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:42:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wbtt37kb5MC/HU1CNfyleAUDcv62VhuQNErB+2AHwpBQNpRVMy4coy9C15xX1N9Cly7HNIQG+MiJZezxhz32BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:15:52.299161Z"},"content_sha256":"2791f614dcfbd912745ab36fa4fd10edc235c62eecb28dcf22ba8bc2e9fdf72e","schema_version":"1.0","event_id":"sha256:2791f614dcfbd912745ab36fa4fd10edc235c62eecb28dcf22ba8bc2e9fdf72e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:6TAI4N3HIQLZEHKITMR77FITYK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic graph connectivity in the broadcast congested clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Ioan Todinca, Pedro Montealegre","submitted_at":"2016-02-12T16:04:14Z","abstract_excerpt":"We present deterministic constant-round protocols for the graph connectivity problem in the model where each of the $n$ nodes of a graph receives a row of the adjacency matrix, and broadcasts a single sublinear size message to all other nodes. Communication rounds are synchronous. This model is sometimes called the broadcast congested clique. Specifically, we exhibit a deterministic protocol that computes the connected components of the input graph in $\\lceil 1/\\epsilon \\rceil$ rounds, each player communicating $\\mathcal{O}(n^{\\epsilon} \\cdot \\log n)$ bits per round, with $0 < \\epsilon \\leq 1$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04095","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:42:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z+nWun1IO4PiOFvXJVMmsCo6uPZMvW2keGFrqDvK3EcZdLDXkP4oW9a0SkOpnZcbLvrY7cfhcYQihITMMg3GCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:15:52.299530Z"},"content_sha256":"badf7fcded47514829a4c74c8cbee038fd2a06d0c885def2c3798dbde61abfe2","schema_version":"1.0","event_id":"sha256:badf7fcded47514829a4c74c8cbee038fd2a06d0c885def2c3798dbde61abfe2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6TAI4N3HIQLZEHKITMR77FITYK/bundle.json","state_url":"https://pith.science/pith/6TAI4N3HIQLZEHKITMR77FITYK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6TAI4N3HIQLZEHKITMR77FITYK/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-30T04:15:52Z","links":{"resolver":"https://pith.science/pith/6TAI4N3HIQLZEHKITMR77FITYK","bundle":"https://pith.science/pith/6TAI4N3HIQLZEHKITMR77FITYK/bundle.json","state":"https://pith.science/pith/6TAI4N3HIQLZEHKITMR77FITYK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6TAI4N3HIQLZEHKITMR77FITYK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:6TAI4N3HIQLZEHKITMR77FITYK","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":"a74e2ab6d0dd2792542ded0c7f9b0cb8230e7efac98fe3254e826ca613fb1761","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-12T16:04:14Z","title_canon_sha256":"24ad724d158fc21d450e572c174607278ea32a5ca17340f447cd4b534e3e76f3"},"schema_version":"1.0","source":{"id":"1602.04095","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04095","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04095v3","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04095","created_at":"2026-05-18T00:42:39Z"},{"alias_kind":"pith_short_12","alias_value":"6TAI4N3HIQLZ","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"6TAI4N3HIQLZEHKI","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"6TAI4N3H","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:badf7fcded47514829a4c74c8cbee038fd2a06d0c885def2c3798dbde61abfe2","target":"graph","created_at":"2026-05-18T00:42:39Z","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":"We present deterministic constant-round protocols for the graph connectivity problem in the model where each of the $n$ nodes of a graph receives a row of the adjacency matrix, and broadcasts a single sublinear size message to all other nodes. Communication rounds are synchronous. This model is sometimes called the broadcast congested clique. Specifically, we exhibit a deterministic protocol that computes the connected components of the input graph in $\\lceil 1/\\epsilon \\rceil$ rounds, each player communicating $\\mathcal{O}(n^{\\epsilon} \\cdot \\log n)$ bits per round, with $0 < \\epsilon \\leq 1$","authors_text":"Ioan Todinca, Pedro Montealegre","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-12T16:04:14Z","title":"Deterministic graph connectivity in the broadcast congested clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04095","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:2791f614dcfbd912745ab36fa4fd10edc235c62eecb28dcf22ba8bc2e9fdf72e","target":"record","created_at":"2026-05-18T00:42:39Z","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":"a74e2ab6d0dd2792542ded0c7f9b0cb8230e7efac98fe3254e826ca613fb1761","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-12T16:04:14Z","title_canon_sha256":"24ad724d158fc21d450e572c174607278ea32a5ca17340f447cd4b534e3e76f3"},"schema_version":"1.0","source":{"id":"1602.04095","kind":"arxiv","version":3}},"canonical_sha256":"f4c08e37674417921d489b23ff9513c29437f14c2f6929919f12f85d3ed22e51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4c08e37674417921d489b23ff9513c29437f14c2f6929919f12f85d3ed22e51","first_computed_at":"2026-05-18T00:42:39.578114Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:39.578114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rbet4ceeLTg0I5XCrGSWZnAPA7A8hStEKFAk2Ce1+vds5lU0OzBkKPJJLXOum6qqt8EarwMUzTOVPH5MxjkqAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:39.578796Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04095","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2791f614dcfbd912745ab36fa4fd10edc235c62eecb28dcf22ba8bc2e9fdf72e","sha256:badf7fcded47514829a4c74c8cbee038fd2a06d0c885def2c3798dbde61abfe2"],"state_sha256":"fa483be5b732918ff37a74754b9869dcf302c26beb681a63a2f269f3915c6cab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J8kqDAWBwWZKPgbBY8mIo9C8N4s3ZD0areX1nh6tsUnkpxf7g0c6oupgHdMKzj9Vzuw1guiUeClkl1kDy0TtAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:15:52.301867Z","bundle_sha256":"8a0270439a9d865a575cee4e97d19b8a2e8d6e0a60b61fe834a8f9fd947653ba"}}