{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3GK6BF7QENDGK7LJQJKSTKMOKH","short_pith_number":"pith:3GK6BF7Q","canonical_record":{"source":{"id":"1707.02229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-07T15:31:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5bb250dce80d08b85fbab460aeb936ba0837a70049c265081e59764ca44019ac","abstract_canon_sha256":"dd8433661ee8ad9e8f3737e2c9a8f4d8431d501138741e84093559a78b21914b"},"schema_version":"1.0"},"canonical_sha256":"d995e097f02346657d69825529a98e51da9604b303ded1b15b833cb33c2e5a40","source":{"kind":"arxiv","id":"1707.02229","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02229","created_at":"2026-05-18T00:29:40Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02229v2","created_at":"2026-05-18T00:29:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02229","created_at":"2026-05-18T00:29:40Z"},{"alias_kind":"pith_short_12","alias_value":"3GK6BF7QENDG","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3GK6BF7QENDGK7LJ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3GK6BF7Q","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3GK6BF7QENDGK7LJQJKSTKMOKH","target":"record","payload":{"canonical_record":{"source":{"id":"1707.02229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-07T15:31:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5bb250dce80d08b85fbab460aeb936ba0837a70049c265081e59764ca44019ac","abstract_canon_sha256":"dd8433661ee8ad9e8f3737e2c9a8f4d8431d501138741e84093559a78b21914b"},"schema_version":"1.0"},"canonical_sha256":"d995e097f02346657d69825529a98e51da9604b303ded1b15b833cb33c2e5a40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:40.819283Z","signature_b64":"BCKUBwRBFPP295P2lilS8tD2OSBOnpgGsfPROhFg3bsA+JhRpeY0NRlaFUJArtfVGewQ1L+pS+zpUnUKDWhIDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d995e097f02346657d69825529a98e51da9604b303ded1b15b833cb33c2e5a40","last_reissued_at":"2026-05-18T00:29:40.818751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:40.818751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.02229","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-18T00:29:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NnfmJBM7kfvfSzTIVoMDRsCaVV2OueneQSabSqFzLaLmKpmgj4Ms5TcsAF8W3u3rMrd62t7vMjBpFEfp2n4FCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:32:46.154843Z"},"content_sha256":"d64275843a576667b81a73835aef2c6da8b6519c45a9f611eca8f5fda651749a","schema_version":"1.0","event_id":"sha256:d64275843a576667b81a73835aef2c6da8b6519c45a9f611eca8f5fda651749a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3GK6BF7QENDGK7LJQJKSTKMOKH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Lower Bound Technique for Communication in BSP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Francesco Silvestri, Gianfranco Bilardi, Michele Scquizzato","submitted_at":"2017-07-07T15:31:16Z","abstract_excerpt":"Communication is a major factor determining the performance of algorithms on current computing systems; it is therefore valuable to provide tight lower bounds on the communication complexity of computations. This paper presents a lower bound technique for the communication complexity in the bulk-synchronous parallel (BSP) model of a given class of DAG computations. The derived bound is expressed in terms of the switching potential of a DAG, that is, the number of permutations that the DAG can realize when viewed as a switching network. The proposed technique yields tight lower bounds for the f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02229","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-18T00:29:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kcKkvO+3RsK3cA2lTLIMAzAKFFttz6/pMQ7jcmC89tahbkE1fw/BFJ2rBiGs6t5Dea3ipBmJwoSWnCYTn89UDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:32:46.155411Z"},"content_sha256":"0d5911336c7e88a36c38c71f599770ab0fd6ff9cdb2a46662bf68de0b24e04c9","schema_version":"1.0","event_id":"sha256:0d5911336c7e88a36c38c71f599770ab0fd6ff9cdb2a46662bf68de0b24e04c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GK6BF7QENDGK7LJQJKSTKMOKH/bundle.json","state_url":"https://pith.science/pith/3GK6BF7QENDGK7LJQJKSTKMOKH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GK6BF7QENDGK7LJQJKSTKMOKH/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-03T17:32:46Z","links":{"resolver":"https://pith.science/pith/3GK6BF7QENDGK7LJQJKSTKMOKH","bundle":"https://pith.science/pith/3GK6BF7QENDGK7LJQJKSTKMOKH/bundle.json","state":"https://pith.science/pith/3GK6BF7QENDGK7LJQJKSTKMOKH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GK6BF7QENDGK7LJQJKSTKMOKH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3GK6BF7QENDGK7LJQJKSTKMOKH","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":"dd8433661ee8ad9e8f3737e2c9a8f4d8431d501138741e84093559a78b21914b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-07T15:31:16Z","title_canon_sha256":"5bb250dce80d08b85fbab460aeb936ba0837a70049c265081e59764ca44019ac"},"schema_version":"1.0","source":{"id":"1707.02229","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.02229","created_at":"2026-05-18T00:29:40Z"},{"alias_kind":"arxiv_version","alias_value":"1707.02229v2","created_at":"2026-05-18T00:29:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.02229","created_at":"2026-05-18T00:29:40Z"},{"alias_kind":"pith_short_12","alias_value":"3GK6BF7QENDG","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3GK6BF7QENDGK7LJ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3GK6BF7Q","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:0d5911336c7e88a36c38c71f599770ab0fd6ff9cdb2a46662bf68de0b24e04c9","target":"graph","created_at":"2026-05-18T00:29:40Z","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":"Communication is a major factor determining the performance of algorithms on current computing systems; it is therefore valuable to provide tight lower bounds on the communication complexity of computations. This paper presents a lower bound technique for the communication complexity in the bulk-synchronous parallel (BSP) model of a given class of DAG computations. The derived bound is expressed in terms of the switching potential of a DAG, that is, the number of permutations that the DAG can realize when viewed as a switching network. The proposed technique yields tight lower bounds for the f","authors_text":"Francesco Silvestri, Gianfranco Bilardi, Michele Scquizzato","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-07T15:31:16Z","title":"A Lower Bound Technique for Communication in BSP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.02229","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:d64275843a576667b81a73835aef2c6da8b6519c45a9f611eca8f5fda651749a","target":"record","created_at":"2026-05-18T00:29:40Z","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":"dd8433661ee8ad9e8f3737e2c9a8f4d8431d501138741e84093559a78b21914b","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-07T15:31:16Z","title_canon_sha256":"5bb250dce80d08b85fbab460aeb936ba0837a70049c265081e59764ca44019ac"},"schema_version":"1.0","source":{"id":"1707.02229","kind":"arxiv","version":2}},"canonical_sha256":"d995e097f02346657d69825529a98e51da9604b303ded1b15b833cb33c2e5a40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d995e097f02346657d69825529a98e51da9604b303ded1b15b833cb33c2e5a40","first_computed_at":"2026-05-18T00:29:40.818751Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:40.818751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BCKUBwRBFPP295P2lilS8tD2OSBOnpgGsfPROhFg3bsA+JhRpeY0NRlaFUJArtfVGewQ1L+pS+zpUnUKDWhIDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:40.819283Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.02229","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d64275843a576667b81a73835aef2c6da8b6519c45a9f611eca8f5fda651749a","sha256:0d5911336c7e88a36c38c71f599770ab0fd6ff9cdb2a46662bf68de0b24e04c9"],"state_sha256":"642fb031fc8d229185002490159957d3aef1c57b568f97aa9d71f106978d20a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ub4iCDILM0FtabLdn2QSpv046Q4ku/5VW7pNYHr/lqH5cr6lOFQEXoe03AXvZsq4ZG9ut1Z9uZ8P6jQM4Th9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:32:46.158065Z","bundle_sha256":"e01079044bdffb320cc0e8001ae434ff513b1c31ac04d27ab870c634854d8570"}}