{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KBWOTALAKTTKLT5D62KMM3UDPZ","short_pith_number":"pith:KBWOTALA","canonical_record":{"source":{"id":"2607.28290","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-30T14:35:36Z","cross_cats_sorted":[],"title_canon_sha256":"f87116dc08f07f90871723814f16b0587747f80312448b301f6be7cbbc7dce92","abstract_canon_sha256":"7816ef7669ad78f85a9ef195bbe8aac388d4276ca820b17c486f643bb895e89c"},"schema_version":"1.0"},"canonical_sha256":"506ce9816054e6a5cfa3f694c66e837e56e3630a7735079659fe92f5adebe220","source":{"kind":"arxiv","id":"2607.28290","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28290","created_at":"2026-07-31T01:37:09Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28290v1","created_at":"2026-07-31T01:37:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28290","created_at":"2026-07-31T01:37:09Z"},{"alias_kind":"pith_short_12","alias_value":"KBWOTALAKTTK","created_at":"2026-07-31T01:37:09Z"},{"alias_kind":"pith_short_16","alias_value":"KBWOTALAKTTKLT5D","created_at":"2026-07-31T01:37:09Z"},{"alias_kind":"pith_short_8","alias_value":"KBWOTALA","created_at":"2026-07-31T01:37:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KBWOTALAKTTKLT5D62KMM3UDPZ","target":"record","payload":{"canonical_record":{"source":{"id":"2607.28290","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-30T14:35:36Z","cross_cats_sorted":[],"title_canon_sha256":"f87116dc08f07f90871723814f16b0587747f80312448b301f6be7cbbc7dce92","abstract_canon_sha256":"7816ef7669ad78f85a9ef195bbe8aac388d4276ca820b17c486f643bb895e89c"},"schema_version":"1.0"},"canonical_sha256":"506ce9816054e6a5cfa3f694c66e837e56e3630a7735079659fe92f5adebe220","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"506ce9816054e6a5cfa3f694c66e837e56e3630a7735079659fe92f5adebe220","last_reissued_at":"2026-07-31T01:37:09.403013Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:37:09.403013Z"},"source_kind":"arxiv","source_id":"2607.28290","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-07-31T01:37:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IiWGC6V1Q9ZFy4OVzaJqJZAfplSDLIgiIPJfXImXbcVY2Cl8rlImp//6rpI+xoqRxDPpa0FpDoHmmYhY9Sm2Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T15:09:32.967362Z"},"content_sha256":"03486aa3591c9e53c6a5424bd0f6a5e504a05c4618d315bc6dbaffdf0aa82fb7","schema_version":"1.0","event_id":"sha256:03486aa3591c9e53c6a5424bd0f6a5e504a05c4618d315bc6dbaffdf0aa82fb7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KBWOTALAKTTKLT5D62KMM3UDPZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FAIR-Compute: A Roadmap for Fair and Efficient Allocation of Federated Digital Research Infrastructure","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ahmed Sayed, Angeliki Mathioudaki, Dimitris Fotakis, Konstantinos (Kostas) E. Zachariadis, Wan Shuen Siaw","submitted_at":"2026-07-30T14:35:36Z","abstract_excerpt":"As demand for high-performance computing (HPC), high-throughput computing and data storage grows, the way scarce compute is allocated -- not just how much exists -- has become a decisive factor in the productivity of UK research. FAIR-Compute studies allocation in a federated Digital Research Infrastructure (DRI) as a problem at the intersection of algorithmic game theory, transport economics and HPC scheduling. Our central observation is simple: once a shared system must decide who runs, when and under what evidence, its scheduler settings cease to be a purely technical matter and become poli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28290","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/2607.28290/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-07-31T01:37:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1DdoyZny3gQkbpX2IxPilLjJsvTl6O/Mfq33pnlRDsBqMpladLIyeEJ1Q/i0LyKeY2mwu4OBz8C8ZORtzqNbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-02T15:09:32.967908Z"},"content_sha256":"8d33189b97ec6586cd764a5aa10dd7653ae301c32d657024b975f701b71f1b8e","schema_version":"1.0","event_id":"sha256:8d33189b97ec6586cd764a5aa10dd7653ae301c32d657024b975f701b71f1b8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KBWOTALAKTTKLT5D62KMM3UDPZ/bundle.json","state_url":"https://pith.science/pith/KBWOTALAKTTKLT5D62KMM3UDPZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KBWOTALAKTTKLT5D62KMM3UDPZ/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-08-02T15:09:32Z","links":{"resolver":"https://pith.science/pith/KBWOTALAKTTKLT5D62KMM3UDPZ","bundle":"https://pith.science/pith/KBWOTALAKTTKLT5D62KMM3UDPZ/bundle.json","state":"https://pith.science/pith/KBWOTALAKTTKLT5D62KMM3UDPZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KBWOTALAKTTKLT5D62KMM3UDPZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KBWOTALAKTTKLT5D62KMM3UDPZ","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":"7816ef7669ad78f85a9ef195bbe8aac388d4276ca820b17c486f643bb895e89c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-30T14:35:36Z","title_canon_sha256":"f87116dc08f07f90871723814f16b0587747f80312448b301f6be7cbbc7dce92"},"schema_version":"1.0","source":{"id":"2607.28290","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.28290","created_at":"2026-07-31T01:37:09Z"},{"alias_kind":"arxiv_version","alias_value":"2607.28290v1","created_at":"2026-07-31T01:37:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28290","created_at":"2026-07-31T01:37:09Z"},{"alias_kind":"pith_short_12","alias_value":"KBWOTALAKTTK","created_at":"2026-07-31T01:37:09Z"},{"alias_kind":"pith_short_16","alias_value":"KBWOTALAKTTKLT5D","created_at":"2026-07-31T01:37:09Z"},{"alias_kind":"pith_short_8","alias_value":"KBWOTALA","created_at":"2026-07-31T01:37:09Z"}],"graph_snapshots":[{"event_id":"sha256:8d33189b97ec6586cd764a5aa10dd7653ae301c32d657024b975f701b71f1b8e","target":"graph","created_at":"2026-07-31T01:37:09Z","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/2607.28290/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"As demand for high-performance computing (HPC), high-throughput computing and data storage grows, the way scarce compute is allocated -- not just how much exists -- has become a decisive factor in the productivity of UK research. FAIR-Compute studies allocation in a federated Digital Research Infrastructure (DRI) as a problem at the intersection of algorithmic game theory, transport economics and HPC scheduling. Our central observation is simple: once a shared system must decide who runs, when and under what evidence, its scheduler settings cease to be a purely technical matter and become poli","authors_text":"Ahmed Sayed, Angeliki Mathioudaki, Dimitris Fotakis, Konstantinos (Kostas) E. Zachariadis, Wan Shuen Siaw","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-30T14:35:36Z","title":"FAIR-Compute: A Roadmap for Fair and Efficient Allocation of Federated Digital Research Infrastructure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28290","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:03486aa3591c9e53c6a5424bd0f6a5e504a05c4618d315bc6dbaffdf0aa82fb7","target":"record","created_at":"2026-07-31T01:37:09Z","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":"7816ef7669ad78f85a9ef195bbe8aac388d4276ca820b17c486f643bb895e89c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-30T14:35:36Z","title_canon_sha256":"f87116dc08f07f90871723814f16b0587747f80312448b301f6be7cbbc7dce92"},"schema_version":"1.0","source":{"id":"2607.28290","kind":"arxiv","version":1}},"canonical_sha256":"506ce9816054e6a5cfa3f694c66e837e56e3630a7735079659fe92f5adebe220","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"506ce9816054e6a5cfa3f694c66e837e56e3630a7735079659fe92f5adebe220","first_computed_at":"2026-07-31T01:37:09.403013Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:37:09.403013Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.28290","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03486aa3591c9e53c6a5424bd0f6a5e504a05c4618d315bc6dbaffdf0aa82fb7","sha256:8d33189b97ec6586cd764a5aa10dd7653ae301c32d657024b975f701b71f1b8e"],"state_sha256":"36507e75151e9cca1f1f1be0ba2cee3ba7d3e63f515040d46288799a54e2d964"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ftkt7NepU28qaCKdY1H2htCKaSrCa/JwvnlYHEG/b66LhtevNB9NEy3Lz9r8G/VIBzRVc6a5JPSB1oSn9PYmDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-02T15:09:32.975065Z","bundle_sha256":"5c9c0a316aa2abcaded250dc537741a1faad522d52d1f2294ea6a4915f22df79"}}