{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2NVJDODPWHY2AMAO2EFLXB4RFF","short_pith_number":"pith:2NVJDODP","canonical_record":{"source":{"id":"1412.2109","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-05T19:33:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3c220aaa8acc7c93ae3308fd373ed2ae47f138ccceeca9c668aa556e9532f914","abstract_canon_sha256":"c00d9b623c2ec37effb09ee81f9d98c36806275bc1a8278ac3d0cd7a7519678b"},"schema_version":"1.0"},"canonical_sha256":"d36a91b86fb1f1a0300ed10abb8791296ee3396fdb23ffd4496f73e0d67e8a56","source":{"kind":"arxiv","id":"1412.2109","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2109","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2109v2","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2109","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"pith_short_12","alias_value":"2NVJDODPWHY2","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2NVJDODPWHY2AMAO","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2NVJDODP","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2NVJDODPWHY2AMAO2EFLXB4RFF","target":"record","payload":{"canonical_record":{"source":{"id":"1412.2109","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-05T19:33:46Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3c220aaa8acc7c93ae3308fd373ed2ae47f138ccceeca9c668aa556e9532f914","abstract_canon_sha256":"c00d9b623c2ec37effb09ee81f9d98c36806275bc1a8278ac3d0cd7a7519678b"},"schema_version":"1.0"},"canonical_sha256":"d36a91b86fb1f1a0300ed10abb8791296ee3396fdb23ffd4496f73e0d67e8a56","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:51.480373Z","signature_b64":"Rt9iUteyjPQzF/fNbTAk5PRH5C8+xtGbUFMnuOf7TOb+dBlQcTn9M9zyDIh3K6Op0t0Jzj699ymGDOczs38wCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d36a91b86fb1f1a0300ed10abb8791296ee3396fdb23ffd4496f73e0d67e8a56","last_reissued_at":"2026-05-18T02:21:51.479675Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:51.479675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.2109","source_version":2,"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-18T02:21:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M1OURNhMlQDngXn1H3wYJciXsPIiO6P0vKWEZQoFoe3R2AcrpGBQsiLXiUl1SvTbSFsR6JWzCchMH3zOp8nqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:32:22.573596Z"},"content_sha256":"1df7f3a6abbc00049c2a52d143a577c9dec9ef8e2be6bca9c3a6c7a7f81e686a","schema_version":"1.0","event_id":"sha256:1df7f3a6abbc00049c2a52d143a577c9dec9ef8e2be6bca9c3a6c7a7f81e686a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2NVJDODPWHY2AMAO2EFLXB4RFF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algebrisation in Distributed Graph Algorithms: Fast Matrix Multiplication in the Congested Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Christoph Lenzen, Janne H. Korhonen, Jukka Suomela, Petteri Kaski","submitted_at":"2014-12-05T19:33:46Z","abstract_excerpt":"While algebrisation constitutes a powerful technique in the design and analysis of centralised algorithms, to date there have been hardly any applications of algebraic techniques in the context of distributed graph algorithms. This work is a case study that demonstrates the potential of algebrisation in the distributed context. \nWe will focus on distributed graph algorithms in the congested clique model; the graph problems that we will consider include, e.g., the triangle detection problem and the all-pairs shortest path problem (APSP). There is plenty of prior work on combinatorial algorithms"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2109","kind":"arxiv","version":2},"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-18T02:21:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mh9sMVfur76v8S1EdvrdrLD3WXnRCA0KXXO/lJE4jA7falej+yKL9XKa5VCSg4z8SkPVdrm95mNoqDKyOHZAAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T23:32:22.574336Z"},"content_sha256":"fa5ab38152656dd732d40fd4500a111d8e3d52bcca808cb14b4473575fd192f0","schema_version":"1.0","event_id":"sha256:fa5ab38152656dd732d40fd4500a111d8e3d52bcca808cb14b4473575fd192f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2NVJDODPWHY2AMAO2EFLXB4RFF/bundle.json","state_url":"https://pith.science/pith/2NVJDODPWHY2AMAO2EFLXB4RFF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2NVJDODPWHY2AMAO2EFLXB4RFF/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-28T23:32:22Z","links":{"resolver":"https://pith.science/pith/2NVJDODPWHY2AMAO2EFLXB4RFF","bundle":"https://pith.science/pith/2NVJDODPWHY2AMAO2EFLXB4RFF/bundle.json","state":"https://pith.science/pith/2NVJDODPWHY2AMAO2EFLXB4RFF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2NVJDODPWHY2AMAO2EFLXB4RFF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2NVJDODPWHY2AMAO2EFLXB4RFF","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":"c00d9b623c2ec37effb09ee81f9d98c36806275bc1a8278ac3d0cd7a7519678b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-05T19:33:46Z","title_canon_sha256":"3c220aaa8acc7c93ae3308fd373ed2ae47f138ccceeca9c668aa556e9532f914"},"schema_version":"1.0","source":{"id":"1412.2109","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2109","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2109v2","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2109","created_at":"2026-05-18T02:21:51Z"},{"alias_kind":"pith_short_12","alias_value":"2NVJDODPWHY2","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2NVJDODPWHY2AMAO","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2NVJDODP","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:fa5ab38152656dd732d40fd4500a111d8e3d52bcca808cb14b4473575fd192f0","target":"graph","created_at":"2026-05-18T02:21:51Z","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":"While algebrisation constitutes a powerful technique in the design and analysis of centralised algorithms, to date there have been hardly any applications of algebraic techniques in the context of distributed graph algorithms. This work is a case study that demonstrates the potential of algebrisation in the distributed context. \nWe will focus on distributed graph algorithms in the congested clique model; the graph problems that we will consider include, e.g., the triangle detection problem and the all-pairs shortest path problem (APSP). There is plenty of prior work on combinatorial algorithms","authors_text":"Christoph Lenzen, Janne H. Korhonen, Jukka Suomela, Petteri Kaski","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-05T19:33:46Z","title":"Algebrisation in Distributed Graph Algorithms: Fast Matrix Multiplication in the Congested Clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2109","kind":"arxiv","version":2},"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:1df7f3a6abbc00049c2a52d143a577c9dec9ef8e2be6bca9c3a6c7a7f81e686a","target":"record","created_at":"2026-05-18T02:21:51Z","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":"c00d9b623c2ec37effb09ee81f9d98c36806275bc1a8278ac3d0cd7a7519678b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-12-05T19:33:46Z","title_canon_sha256":"3c220aaa8acc7c93ae3308fd373ed2ae47f138ccceeca9c668aa556e9532f914"},"schema_version":"1.0","source":{"id":"1412.2109","kind":"arxiv","version":2}},"canonical_sha256":"d36a91b86fb1f1a0300ed10abb8791296ee3396fdb23ffd4496f73e0d67e8a56","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d36a91b86fb1f1a0300ed10abb8791296ee3396fdb23ffd4496f73e0d67e8a56","first_computed_at":"2026-05-18T02:21:51.479675Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:51.479675Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rt9iUteyjPQzF/fNbTAk5PRH5C8+xtGbUFMnuOf7TOb+dBlQcTn9M9zyDIh3K6Op0t0Jzj699ymGDOczs38wCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:51.480373Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2109","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1df7f3a6abbc00049c2a52d143a577c9dec9ef8e2be6bca9c3a6c7a7f81e686a","sha256:fa5ab38152656dd732d40fd4500a111d8e3d52bcca808cb14b4473575fd192f0"],"state_sha256":"fd58b72614895d4c402b009fbea926d728f99949b305b664070f8c9a562bb20c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m6MFbzLLONWqx0fj1tI6K1JchLzkA3fmYtVBCnxkRnPYdJ36RU4TH4UnedgDqDIrfiyHY4dtC6EhqeRSAb5rCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T23:32:22.580535Z","bundle_sha256":"310814d2b965c09a8e8fb591c613d461b351ecb1d533d6bdb07e504eabedc7a2"}}