{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:3CUXWHRBXSCUA6BRYZ2HFATUDZ","short_pith_number":"pith:3CUXWHRB","canonical_record":{"source":{"id":"2506.01571","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-02T11:55:41Z","cross_cats_sorted":[],"title_canon_sha256":"3decc7480738cd6bc3dcb388d0792619e378222c9d982146569a5ecd72b7c142","abstract_canon_sha256":"088b2c4cbcf315095a5c998db915b87186c8c499f83d7160215849ff70824a5c"},"schema_version":"1.0"},"canonical_sha256":"d8a97b1e21bc85407831c6747282741e504cb02de1fa03e2c1bc26d282ce65c0","source":{"kind":"arxiv","id":"2506.01571","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01571","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01571v1","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01571","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"3CUXWHRBXSCU","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"pith_short_16","alias_value":"3CUXWHRBXSCUA6BR","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"pith_short_8","alias_value":"3CUXWHRB","created_at":"2026-07-05T11:14:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:3CUXWHRBXSCUA6BRYZ2HFATUDZ","target":"record","payload":{"canonical_record":{"source":{"id":"2506.01571","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-02T11:55:41Z","cross_cats_sorted":[],"title_canon_sha256":"3decc7480738cd6bc3dcb388d0792619e378222c9d982146569a5ecd72b7c142","abstract_canon_sha256":"088b2c4cbcf315095a5c998db915b87186c8c499f83d7160215849ff70824a5c"},"schema_version":"1.0"},"canonical_sha256":"d8a97b1e21bc85407831c6747282741e504cb02de1fa03e2c1bc26d282ce65c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:14:16.055419Z","signature_b64":"HfCkguPweolUGvRB8SHaWooonar2Uc1MP3M8ciDtHY5xLGocmV+TLrKi8fgkfk6TkTeSLVtZ398hpSLCVWxpDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8a97b1e21bc85407831c6747282741e504cb02de1fa03e2c1bc26d282ce65c0","last_reissued_at":"2026-07-05T11:14:16.054979Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:14:16.054979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.01571","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-05T11:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iOOs0LOWUTFmSMWvpJimJuFxPgBdnK6BWGtEG1Yowe7KTp8wnRY8ZMzvEHpThtT5pSEoCGnh5sAC0siyRhs3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T03:05:49.663188Z"},"content_sha256":"ba42dc224e1c8aa623a3a5bc0fc2851f41c2bdc85362fa44b8e377d4de372fab","schema_version":"1.0","event_id":"sha256:ba42dc224e1c8aa623a3a5bc0fc2851f41c2bdc85362fa44b8e377d4de372fab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:3CUXWHRBXSCUA6BRYZ2HFATUDZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aditya Gudal, Manzoor A. Khan, Novak Bo\\v{s}kov, Rajpreet Singh","submitted_at":"2025-06-02T11:55:41Z","abstract_excerpt":"Resource allocation and scheduling are a common problem in various distributed systems. Although widely studied, the state-of-the-art solutions either do not scale or lack the expressive power to capture the most complex instances of the problem. To that end, we present a mathematical framework for hypergraph ranking and analysis, unifying graph theory, lattice theory, and semantic analysis. In our fundamental theorem, we prove the existence of partial order on entities of hypergraphs, extending traditional hypergraph analysis by introducing semantic operators that capture relationships betwee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01571","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/2506.01571/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-05T11:14:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6vLgPnfHrT6V4ushC/qyytmZlcMBTATW9SsBt2RkZbemC13KzWSroxrGd5jBVEmZj10anc5EKIq9kH/0ENunAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T03:05:49.663748Z"},"content_sha256":"68614ee0c218c3a6e712f7f14165aa7f87233ec7176da79bd1fcbc1045a87416","schema_version":"1.0","event_id":"sha256:68614ee0c218c3a6e712f7f14165aa7f87233ec7176da79bd1fcbc1045a87416"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3CUXWHRBXSCUA6BRYZ2HFATUDZ/bundle.json","state_url":"https://pith.science/pith/3CUXWHRBXSCUA6BRYZ2HFATUDZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3CUXWHRBXSCUA6BRYZ2HFATUDZ/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-08T03:05:49Z","links":{"resolver":"https://pith.science/pith/3CUXWHRBXSCUA6BRYZ2HFATUDZ","bundle":"https://pith.science/pith/3CUXWHRBXSCUA6BRYZ2HFATUDZ/bundle.json","state":"https://pith.science/pith/3CUXWHRBXSCUA6BRYZ2HFATUDZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3CUXWHRBXSCUA6BRYZ2HFATUDZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:3CUXWHRBXSCUA6BRYZ2HFATUDZ","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":"088b2c4cbcf315095a5c998db915b87186c8c499f83d7160215849ff70824a5c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-02T11:55:41Z","title_canon_sha256":"3decc7480738cd6bc3dcb388d0792619e378222c9d982146569a5ecd72b7c142"},"schema_version":"1.0","source":{"id":"2506.01571","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.01571","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"arxiv_version","alias_value":"2506.01571v1","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01571","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"pith_short_12","alias_value":"3CUXWHRBXSCU","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"pith_short_16","alias_value":"3CUXWHRBXSCUA6BR","created_at":"2026-07-05T11:14:16Z"},{"alias_kind":"pith_short_8","alias_value":"3CUXWHRB","created_at":"2026-07-05T11:14:16Z"}],"graph_snapshots":[{"event_id":"sha256:68614ee0c218c3a6e712f7f14165aa7f87233ec7176da79bd1fcbc1045a87416","target":"graph","created_at":"2026-07-05T11:14:16Z","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/2506.01571/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Resource allocation and scheduling are a common problem in various distributed systems. Although widely studied, the state-of-the-art solutions either do not scale or lack the expressive power to capture the most complex instances of the problem. To that end, we present a mathematical framework for hypergraph ranking and analysis, unifying graph theory, lattice theory, and semantic analysis. In our fundamental theorem, we prove the existence of partial order on entities of hypergraphs, extending traditional hypergraph analysis by introducing semantic operators that capture relationships betwee","authors_text":"Aditya Gudal, Manzoor A. Khan, Novak Bo\\v{s}kov, Rajpreet Singh","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-02T11:55:41Z","title":"A Ranking Framework for Network Resource Allocation and Scheduling via Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01571","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:ba42dc224e1c8aa623a3a5bc0fc2851f41c2bdc85362fa44b8e377d4de372fab","target":"record","created_at":"2026-07-05T11:14:16Z","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":"088b2c4cbcf315095a5c998db915b87186c8c499f83d7160215849ff70824a5c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-02T11:55:41Z","title_canon_sha256":"3decc7480738cd6bc3dcb388d0792619e378222c9d982146569a5ecd72b7c142"},"schema_version":"1.0","source":{"id":"2506.01571","kind":"arxiv","version":1}},"canonical_sha256":"d8a97b1e21bc85407831c6747282741e504cb02de1fa03e2c1bc26d282ce65c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8a97b1e21bc85407831c6747282741e504cb02de1fa03e2c1bc26d282ce65c0","first_computed_at":"2026-07-05T11:14:16.054979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:14:16.054979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HfCkguPweolUGvRB8SHaWooonar2Uc1MP3M8ciDtHY5xLGocmV+TLrKi8fgkfk6TkTeSLVtZ398hpSLCVWxpDw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:14:16.055419Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.01571","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba42dc224e1c8aa623a3a5bc0fc2851f41c2bdc85362fa44b8e377d4de372fab","sha256:68614ee0c218c3a6e712f7f14165aa7f87233ec7176da79bd1fcbc1045a87416"],"state_sha256":"a33d92dfe62fd515762ab8fab3a2569693759e189ee0cf3b6379c636cadb4946"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9MWShRF6lKOFaiY3LjSQBevR1tpMoZuFAglrNwJLn9eeXd4jiQzDW8qFlpDzDmGy1M0fjrS17ygH4oZZR7lnCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T03:05:49.669109Z","bundle_sha256":"c0191fe94e70fa53a66a14f19641e7787acd2b6ab970d3d6f528f7d20bbf3ad7"}}