{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:UIYDUODWOGPAWGCQVTHWZ4KRRV","short_pith_number":"pith:UIYDUODW","canonical_record":{"source":{"id":"2605.28205","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-27T09:27:13Z","cross_cats_sorted":[],"title_canon_sha256":"d899a14630eac04edefba78c0bcbc3fb985b4da3c24bac25cef79cf79f66d934","abstract_canon_sha256":"078b0d7e4d1d5ef417229940941164898d7b4dce512bcb9b5bf951a64cdfb55d"},"schema_version":"1.0"},"canonical_sha256":"a2303a3876719e0b1850accf6cf1518d511f59e07bb716b6aaa1721c69a27c16","source":{"kind":"arxiv","id":"2605.28205","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.28205","created_at":"2026-05-28T01:05:02Z"},{"alias_kind":"arxiv_version","alias_value":"2605.28205v1","created_at":"2026-05-28T01:05:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28205","created_at":"2026-05-28T01:05:02Z"},{"alias_kind":"pith_short_12","alias_value":"UIYDUODWOGPA","created_at":"2026-05-28T01:05:02Z"},{"alias_kind":"pith_short_16","alias_value":"UIYDUODWOGPAWGCQ","created_at":"2026-05-28T01:05:02Z"},{"alias_kind":"pith_short_8","alias_value":"UIYDUODW","created_at":"2026-05-28T01:05:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:UIYDUODWOGPAWGCQVTHWZ4KRRV","target":"record","payload":{"canonical_record":{"source":{"id":"2605.28205","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-27T09:27:13Z","cross_cats_sorted":[],"title_canon_sha256":"d899a14630eac04edefba78c0bcbc3fb985b4da3c24bac25cef79cf79f66d934","abstract_canon_sha256":"078b0d7e4d1d5ef417229940941164898d7b4dce512bcb9b5bf951a64cdfb55d"},"schema_version":"1.0"},"canonical_sha256":"a2303a3876719e0b1850accf6cf1518d511f59e07bb716b6aaa1721c69a27c16","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:05:02.552050Z","signature_b64":"8rVYkzMhjijJAhOabkZV57gRI5smXfAuZ5eVvyyROmhqFjMYSJBEXu3emYXlwzPf+yEtrDiDNmsydNzJajohDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2303a3876719e0b1850accf6cf1518d511f59e07bb716b6aaa1721c69a27c16","last_reissued_at":"2026-05-28T01:05:02.551640Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:05:02.551640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.28205","source_version":1,"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-28T01:05:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dJ96DElLGe1A38XQtoDDh+MCRb0PtXaN54uFIQAOUJCQbfWsC3GzrM5E62HiGlkl5+n3oZyGOp2Be2A3A8mhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:22:49.495679Z"},"content_sha256":"2671c317e0ffc0fcd1671e34430da1dfd28dc4654a33957027d0e4c71c5743c8","schema_version":"1.0","event_id":"sha256:2671c317e0ffc0fcd1671e34430da1dfd28dc4654a33957027d0e4c71c5743c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:UIYDUODWOGPAWGCQVTHWZ4KRRV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Resource Allocation in HyperX Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Alejandro Cano, Carmen Mart\\'inez, Crist\\'obal Camarero, Ram\\'on Beivide","submitted_at":"2026-05-27T09:27:13Z","abstract_excerpt":"As high-performance computing systems scale in size and complexity, efficient resource management is essential to minimize communication overhead. The HyperX is a richly connected, low-diameter network that offers a scalable and cost-effective alternative to traditional topologies. However, resource allocation in HyperX remains underexplored, and strategies designed for networks like Torus, Fat-tree, or Dragonfly do not directly transfer. In this work, we propose and formalize several resource allocation strategies for HyperX networks, categorized into linear, geometric, and stochastic functio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28205","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.28205/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-28T01:05:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zXhvLPGu1ePpuE0HK1bcl/PzhE58R4djWlLiGgaX5kvgnhnhWOEBoDakyVZ//axYXiFJW/mr/lviPO/jmCW2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T17:22:49.496057Z"},"content_sha256":"15bdcc4ec3c2d1fae38ac094cb87dd59534bfeec3c03e900d95cc3ce3526ba3a","schema_version":"1.0","event_id":"sha256:15bdcc4ec3c2d1fae38ac094cb87dd59534bfeec3c03e900d95cc3ce3526ba3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UIYDUODWOGPAWGCQVTHWZ4KRRV/bundle.json","state_url":"https://pith.science/pith/UIYDUODWOGPAWGCQVTHWZ4KRRV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UIYDUODWOGPAWGCQVTHWZ4KRRV/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-30T17:22:49Z","links":{"resolver":"https://pith.science/pith/UIYDUODWOGPAWGCQVTHWZ4KRRV","bundle":"https://pith.science/pith/UIYDUODWOGPAWGCQVTHWZ4KRRV/bundle.json","state":"https://pith.science/pith/UIYDUODWOGPAWGCQVTHWZ4KRRV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UIYDUODWOGPAWGCQVTHWZ4KRRV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:UIYDUODWOGPAWGCQVTHWZ4KRRV","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":"078b0d7e4d1d5ef417229940941164898d7b4dce512bcb9b5bf951a64cdfb55d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-27T09:27:13Z","title_canon_sha256":"d899a14630eac04edefba78c0bcbc3fb985b4da3c24bac25cef79cf79f66d934"},"schema_version":"1.0","source":{"id":"2605.28205","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.28205","created_at":"2026-05-28T01:05:02Z"},{"alias_kind":"arxiv_version","alias_value":"2605.28205v1","created_at":"2026-05-28T01:05:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.28205","created_at":"2026-05-28T01:05:02Z"},{"alias_kind":"pith_short_12","alias_value":"UIYDUODWOGPA","created_at":"2026-05-28T01:05:02Z"},{"alias_kind":"pith_short_16","alias_value":"UIYDUODWOGPAWGCQ","created_at":"2026-05-28T01:05:02Z"},{"alias_kind":"pith_short_8","alias_value":"UIYDUODW","created_at":"2026-05-28T01:05:02Z"}],"graph_snapshots":[{"event_id":"sha256:15bdcc4ec3c2d1fae38ac094cb87dd59534bfeec3c03e900d95cc3ce3526ba3a","target":"graph","created_at":"2026-05-28T01:05:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.28205/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"As high-performance computing systems scale in size and complexity, efficient resource management is essential to minimize communication overhead. The HyperX is a richly connected, low-diameter network that offers a scalable and cost-effective alternative to traditional topologies. However, resource allocation in HyperX remains underexplored, and strategies designed for networks like Torus, Fat-tree, or Dragonfly do not directly transfer. In this work, we propose and formalize several resource allocation strategies for HyperX networks, categorized into linear, geometric, and stochastic functio","authors_text":"Alejandro Cano, Carmen Mart\\'inez, Crist\\'obal Camarero, Ram\\'on Beivide","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-27T09:27:13Z","title":"Resource Allocation in HyperX Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.28205","kind":"arxiv","version":1},"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:2671c317e0ffc0fcd1671e34430da1dfd28dc4654a33957027d0e4c71c5743c8","target":"record","created_at":"2026-05-28T01:05:02Z","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":"078b0d7e4d1d5ef417229940941164898d7b4dce512bcb9b5bf951a64cdfb55d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-05-27T09:27:13Z","title_canon_sha256":"d899a14630eac04edefba78c0bcbc3fb985b4da3c24bac25cef79cf79f66d934"},"schema_version":"1.0","source":{"id":"2605.28205","kind":"arxiv","version":1}},"canonical_sha256":"a2303a3876719e0b1850accf6cf1518d511f59e07bb716b6aaa1721c69a27c16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2303a3876719e0b1850accf6cf1518d511f59e07bb716b6aaa1721c69a27c16","first_computed_at":"2026-05-28T01:05:02.551640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:05:02.551640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8rVYkzMhjijJAhOabkZV57gRI5smXfAuZ5eVvyyROmhqFjMYSJBEXu3emYXlwzPf+yEtrDiDNmsydNzJajohDg==","signature_status":"signed_v1","signed_at":"2026-05-28T01:05:02.552050Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.28205","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2671c317e0ffc0fcd1671e34430da1dfd28dc4654a33957027d0e4c71c5743c8","sha256:15bdcc4ec3c2d1fae38ac094cb87dd59534bfeec3c03e900d95cc3ce3526ba3a"],"state_sha256":"51fbb15025913f209a3166f063de401721cb43b9fd56d7f4f4a8cb150f2f1295"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/yHqnqFN87N0YEKJTRKR0HS9uh0hVMe+fmhId/XIceOILdtNkTUFkbXKtTI8Egf9ZOQ9Jk+ATYryYdcfko1xCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T17:22:49.498070Z","bundle_sha256":"c00f7b2eaa136255e4a2a10ce7dadd76c20ff1bbbd02c279f936bede19458560"}}