{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:A3KMUWPW3PSF766SLWEB3Q2VBV","short_pith_number":"pith:A3KMUWPW","canonical_record":{"source":{"id":"1711.08731","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-23T15:07:08Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"476ee5b9839fba3c2f5bfdebc63b2ba8ce611deb6035877fc1eb602c6a89bfc0","abstract_canon_sha256":"90a1b259762d23990ceda3d07abd949e417c7d0e25779d7a17f62e729aff99b2"},"schema_version":"1.0"},"canonical_sha256":"06d4ca59f6dbe45ffbd25d881dc3550d5949ef70d33f1a796f8f1b7b1db35912","source":{"kind":"arxiv","id":"1711.08731","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08731","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08731v4","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08731","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"A3KMUWPW3PSF","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A3KMUWPW3PSF766S","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A3KMUWPW","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:A3KMUWPW3PSF766SLWEB3Q2VBV","target":"record","payload":{"canonical_record":{"source":{"id":"1711.08731","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-23T15:07:08Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"476ee5b9839fba3c2f5bfdebc63b2ba8ce611deb6035877fc1eb602c6a89bfc0","abstract_canon_sha256":"90a1b259762d23990ceda3d07abd949e417c7d0e25779d7a17f62e729aff99b2"},"schema_version":"1.0"},"canonical_sha256":"06d4ca59f6dbe45ffbd25d881dc3550d5949ef70d33f1a796f8f1b7b1db35912","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:53.473419Z","signature_b64":"W1tpGqIN53ggmFr7rqn5Y9VDbc+d6rlg+aqLKANYAyBZKxKLOux2kaEqz3f7ntB+0JscT+8VycRiAsCbu4RSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06d4ca59f6dbe45ffbd25d881dc3550d5949ef70d33f1a796f8f1b7b1db35912","last_reissued_at":"2026-05-17T23:59:53.472909Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:53.472909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.08731","source_version":4,"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-17T23:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Tn0MubF6XfRolx4zUZtWePUyqqVphu4UjDKqJfx774jxdP0cohwJxlvB5AaTE9qPr0TxShOsLvNurvhFkWwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:44:34.534334Z"},"content_sha256":"09bfc8e43bdab0846445a3af002236789f49bbd92f2a28280ce3dd05014e3063","schema_version":"1.0","event_id":"sha256:09bfc8e43bdab0846445a3af002236789f49bbd92f2a28280ce3dd05014e3063"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:A3KMUWPW3PSF766SLWEB3Q2VBV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Optimal Trees for Irregular Gather and Scatter Collectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CC","authors_text":"Jesper Larsson Tr\\\"aff","submitted_at":"2017-11-23T15:07:08Z","abstract_excerpt":"We study the complexity of finding communication trees with the lowest possible completion time for rooted, irregular gather and scatter collective communication operations in fully connected, $k$-ported communication networks under a linear-time transmission cost model. Consecutively numbered processors specify data blocks of possibly different sizes to be collected at or distributed from some (given) root processor where they are stored in processor order. Data blocks can be combined into larger segments consisting of blocks from or to different processors, but individual blocks cannot be sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08731","kind":"arxiv","version":4},"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-17T23:59:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hpnJH6Bf+pWGLt0GiWOCgZff4oGeLEmBz3UQHZ38B1zE3m8hcbEfdHV/lKjtZLLuNJQ7yRiUu+8en8Fz0ZdCDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T07:44:34.534676Z"},"content_sha256":"b657bc0c31f1e020d3ba3556fc5764d65d1231fa2c6c5a3f2fdd7d05059bd74a","schema_version":"1.0","event_id":"sha256:b657bc0c31f1e020d3ba3556fc5764d65d1231fa2c6c5a3f2fdd7d05059bd74a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A3KMUWPW3PSF766SLWEB3Q2VBV/bundle.json","state_url":"https://pith.science/pith/A3KMUWPW3PSF766SLWEB3Q2VBV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A3KMUWPW3PSF766SLWEB3Q2VBV/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-24T07:44:34Z","links":{"resolver":"https://pith.science/pith/A3KMUWPW3PSF766SLWEB3Q2VBV","bundle":"https://pith.science/pith/A3KMUWPW3PSF766SLWEB3Q2VBV/bundle.json","state":"https://pith.science/pith/A3KMUWPW3PSF766SLWEB3Q2VBV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A3KMUWPW3PSF766SLWEB3Q2VBV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:A3KMUWPW3PSF766SLWEB3Q2VBV","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":"90a1b259762d23990ceda3d07abd949e417c7d0e25779d7a17f62e729aff99b2","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-23T15:07:08Z","title_canon_sha256":"476ee5b9839fba3c2f5bfdebc63b2ba8ce611deb6035877fc1eb602c6a89bfc0"},"schema_version":"1.0","source":{"id":"1711.08731","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.08731","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"arxiv_version","alias_value":"1711.08731v4","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.08731","created_at":"2026-05-17T23:59:53Z"},{"alias_kind":"pith_short_12","alias_value":"A3KMUWPW3PSF","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A3KMUWPW3PSF766S","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A3KMUWPW","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:b657bc0c31f1e020d3ba3556fc5764d65d1231fa2c6c5a3f2fdd7d05059bd74a","target":"graph","created_at":"2026-05-17T23:59:53Z","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 study the complexity of finding communication trees with the lowest possible completion time for rooted, irregular gather and scatter collective communication operations in fully connected, $k$-ported communication networks under a linear-time transmission cost model. Consecutively numbered processors specify data blocks of possibly different sizes to be collected at or distributed from some (given) root processor where they are stored in processor order. Data blocks can be combined into larger segments consisting of blocks from or to different processors, but individual blocks cannot be sp","authors_text":"Jesper Larsson Tr\\\"aff","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-23T15:07:08Z","title":"On Optimal Trees for Irregular Gather and Scatter Collectives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.08731","kind":"arxiv","version":4},"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:09bfc8e43bdab0846445a3af002236789f49bbd92f2a28280ce3dd05014e3063","target":"record","created_at":"2026-05-17T23:59:53Z","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":"90a1b259762d23990ceda3d07abd949e417c7d0e25779d7a17f62e729aff99b2","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-11-23T15:07:08Z","title_canon_sha256":"476ee5b9839fba3c2f5bfdebc63b2ba8ce611deb6035877fc1eb602c6a89bfc0"},"schema_version":"1.0","source":{"id":"1711.08731","kind":"arxiv","version":4}},"canonical_sha256":"06d4ca59f6dbe45ffbd25d881dc3550d5949ef70d33f1a796f8f1b7b1db35912","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06d4ca59f6dbe45ffbd25d881dc3550d5949ef70d33f1a796f8f1b7b1db35912","first_computed_at":"2026-05-17T23:59:53.472909Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:53.472909Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W1tpGqIN53ggmFr7rqn5Y9VDbc+d6rlg+aqLKANYAyBZKxKLOux2kaEqz3f7ntB+0JscT+8VycRiAsCbu4RSDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:53.473419Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.08731","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09bfc8e43bdab0846445a3af002236789f49bbd92f2a28280ce3dd05014e3063","sha256:b657bc0c31f1e020d3ba3556fc5764d65d1231fa2c6c5a3f2fdd7d05059bd74a"],"state_sha256":"2000c6b219cdc2c29bbbd9dd12f852bc76a52f11e098ad1e514db57e6d5a976c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jbE8N4WaHc4sBHV60XPgXUhfl9qsvD2ZLqd6mRLhItcOK+FKXNFfbGEq5iQblw8eFUA2XvJ+/qe4quwowQBqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T07:44:34.536490Z","bundle_sha256":"3131c5f7161b74f444df3d743f97ef61595d00c951875a70cd1753f8ed48c0ae"}}