{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:55K5VWLES32MOD6BTSSWLJDG76","short_pith_number":"pith:55K5VWLE","schema_version":"1.0","canonical_sha256":"ef55dad96496f4c70fc19ca565a466ffac0a48dcb9d878ed279946b0e683b48b","source":{"kind":"arxiv","id":"1606.07676","version":1},"attestation_state":"computed","paper":{"title":"Message-Combining Algorithms for Isomorphic, Sparse Collective Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexandra Carpen-Amarie, Antoine Rougier, Jesper Larsson Tr\\\"aff, Sascha Hunold","submitted_at":"2016-06-24T13:13:03Z","abstract_excerpt":"Isomorphic (sparse) collective communication is a form of collective communication in which all involved processes communicate in small, identically structured neighborhoods of other processes. Isomorphic neighborhoods are defined via an embedding of the processes in a regularly structured topology, e.g., $d$-dimensional torus, which may correspond to the physical communication network of the underlying system. Isomorphic collective communication is useful for implementing stencil and other regular, sparse distributed computations, where the assumption that all processes behave (almost) symmet"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1606.07676","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-24T13:13:03Z","cross_cats_sorted":[],"title_canon_sha256":"eee411cd4922e8c00e7f7d15971081a7e0283ed1b0eb198cf888eff63d405beb","abstract_canon_sha256":"19f25d837667b414dbbcc3748f4d0367d474204ac7e577b0d128759d24278e10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:55.908105Z","signature_b64":"sOqm6aV08KwSqY2RgSjLwvespYTuxDGHL//njBp0zjTSwTJCYLqHNAxFl4ZbN3urqlfC9GbO4q6WYCp0T+/fBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef55dad96496f4c70fc19ca565a466ffac0a48dcb9d878ed279946b0e683b48b","last_reissued_at":"2026-05-18T01:11:55.907668Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:55.907668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Message-Combining Algorithms for Isomorphic, Sparse Collective Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alexandra Carpen-Amarie, Antoine Rougier, Jesper Larsson Tr\\\"aff, Sascha Hunold","submitted_at":"2016-06-24T13:13:03Z","abstract_excerpt":"Isomorphic (sparse) collective communication is a form of collective communication in which all involved processes communicate in small, identically structured neighborhoods of other processes. Isomorphic neighborhoods are defined via an embedding of the processes in a regularly structured topology, e.g., $d$-dimensional torus, which may correspond to the physical communication network of the underlying system. Isomorphic collective communication is useful for implementing stencil and other regular, sparse distributed computations, where the assumption that all processes behave (almost) symmet"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07676","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":""},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.07676","created_at":"2026-05-18T01:11:55.907734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.07676v1","created_at":"2026-05-18T01:11:55.907734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07676","created_at":"2026-05-18T01:11:55.907734+00:00"},{"alias_kind":"pith_short_12","alias_value":"55K5VWLES32M","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"55K5VWLES32MOD6B","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"55K5VWLE","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/55K5VWLES32MOD6BTSSWLJDG76","json":"https://pith.science/pith/55K5VWLES32MOD6BTSSWLJDG76.json","graph_json":"https://pith.science/api/pith-number/55K5VWLES32MOD6BTSSWLJDG76/graph.json","events_json":"https://pith.science/api/pith-number/55K5VWLES32MOD6BTSSWLJDG76/events.json","paper":"https://pith.science/paper/55K5VWLE"},"agent_actions":{"view_html":"https://pith.science/pith/55K5VWLES32MOD6BTSSWLJDG76","download_json":"https://pith.science/pith/55K5VWLES32MOD6BTSSWLJDG76.json","view_paper":"https://pith.science/paper/55K5VWLE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.07676&json=true","fetch_graph":"https://pith.science/api/pith-number/55K5VWLES32MOD6BTSSWLJDG76/graph.json","fetch_events":"https://pith.science/api/pith-number/55K5VWLES32MOD6BTSSWLJDG76/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/55K5VWLES32MOD6BTSSWLJDG76/action/timestamp_anchor","attest_storage":"https://pith.science/pith/55K5VWLES32MOD6BTSSWLJDG76/action/storage_attestation","attest_author":"https://pith.science/pith/55K5VWLES32MOD6BTSSWLJDG76/action/author_attestation","sign_citation":"https://pith.science/pith/55K5VWLES32MOD6BTSSWLJDG76/action/citation_signature","submit_replication":"https://pith.science/pith/55K5VWLES32MOD6BTSSWLJDG76/action/replication_record"}},"created_at":"2026-05-18T01:11:55.907734+00:00","updated_at":"2026-05-18T01:11:55.907734+00:00"}