{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:AHZIJYNC24E5ACDHEPYVJL52GT","short_pith_number":"pith:AHZIJYNC","schema_version":"1.0","canonical_sha256":"01f284e1a2d709d0086723f154afba34ce6a2d80968aa471e295acdeda985655","source":{"kind":"arxiv","id":"2606.00490","version":1},"attestation_state":"computed","paper":{"title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Abrar Hossain, Kishwar Ahmed","submitted_at":"2026-05-30T02:40:50Z","abstract_excerpt":"Modern High Performance Computing (HPC) centers face growing challenges in ingesting large and diverse data streams. These issues often create bottlenecks that limit bandwidth utilization and delay scientific progress. Traditional static allocation and simple queuing methods are often insufficient. This paper presents a dynamic, value-based approach to bandwidth allocation. We formalize the problem by incorporating both network and processing constraints. To address it, we introduce two auction-based mechanisms: the Greedy Value Density Auction, which is computationally efficient, and the Vick"},"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":"2606.00490","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NI","submitted_at":"2026-05-30T02:40:50Z","cross_cats_sorted":[],"title_canon_sha256":"a10ed78484492b32262b6a8ffe8c0af27e448c15cd7d9d634adbe9252f73dc17","abstract_canon_sha256":"fdb83da157ede85674803e20e4de1b79e5a438c76c52d09c51550543b00812ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:56.076396Z","signature_b64":"lsOaKpUDEVc+/he+L/R7bimdvZkgJNl4eCgr9yUkNCuC0Fm0Z1tmeff8qpgx/BOF69byYUTzS9OYQcBBkBnSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01f284e1a2d709d0086723f154afba34ce6a2d80968aa471e295acdeda985655","last_reissued_at":"2026-06-02T01:03:56.075986Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:56.075986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Abrar Hossain, Kishwar Ahmed","submitted_at":"2026-05-30T02:40:50Z","abstract_excerpt":"Modern High Performance Computing (HPC) centers face growing challenges in ingesting large and diverse data streams. These issues often create bottlenecks that limit bandwidth utilization and delay scientific progress. Traditional static allocation and simple queuing methods are often insufficient. This paper presents a dynamic, value-based approach to bandwidth allocation. We formalize the problem by incorporating both network and processing constraints. To address it, we introduce two auction-based mechanisms: the Greedy Value Density Auction, which is computationally efficient, and the Vick"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00490","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/2606.00490/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.00490","created_at":"2026-06-02T01:03:56.076048+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.00490v1","created_at":"2026-06-02T01:03:56.076048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00490","created_at":"2026-06-02T01:03:56.076048+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHZIJYNC24E5","created_at":"2026-06-02T01:03:56.076048+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHZIJYNC24E5ACDH","created_at":"2026-06-02T01:03:56.076048+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHZIJYNC","created_at":"2026-06-02T01:03:56.076048+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/AHZIJYNC24E5ACDHEPYVJL52GT","json":"https://pith.science/pith/AHZIJYNC24E5ACDHEPYVJL52GT.json","graph_json":"https://pith.science/api/pith-number/AHZIJYNC24E5ACDHEPYVJL52GT/graph.json","events_json":"https://pith.science/api/pith-number/AHZIJYNC24E5ACDHEPYVJL52GT/events.json","paper":"https://pith.science/paper/AHZIJYNC"},"agent_actions":{"view_html":"https://pith.science/pith/AHZIJYNC24E5ACDHEPYVJL52GT","download_json":"https://pith.science/pith/AHZIJYNC24E5ACDHEPYVJL52GT.json","view_paper":"https://pith.science/paper/AHZIJYNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.00490&json=true","fetch_graph":"https://pith.science/api/pith-number/AHZIJYNC24E5ACDHEPYVJL52GT/graph.json","fetch_events":"https://pith.science/api/pith-number/AHZIJYNC24E5ACDHEPYVJL52GT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHZIJYNC24E5ACDHEPYVJL52GT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHZIJYNC24E5ACDHEPYVJL52GT/action/storage_attestation","attest_author":"https://pith.science/pith/AHZIJYNC24E5ACDHEPYVJL52GT/action/author_attestation","sign_citation":"https://pith.science/pith/AHZIJYNC24E5ACDHEPYVJL52GT/action/citation_signature","submit_replication":"https://pith.science/pith/AHZIJYNC24E5ACDHEPYVJL52GT/action/replication_record"}},"created_at":"2026-06-02T01:03:56.076048+00:00","updated_at":"2026-06-02T01:03:56.076048+00:00"}