{"as_of":"2026-08-23T11:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:37af7a21107f400a741417f533407ba718e1a39ca1c515934b263d7e47ed4070","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-28T18:29:35.578100Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.00490/citation-record","integrity":"/paper/2606.00490/integrity","json":"/paper/2606.00490/citation-record.json","paper":"/paper/2606.00490"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2105.12880","last_updated":"2021-09-09T00:52:31Z","snapshot_observed_at":"2026-08-18T22:14:55.987201Z","submitted_at":"2021-05-26T23:55:23Z","title":"The Petascale DTN Project: High Performance Data Transfer for HPC Facilities","version":2},"cited_work":{"arxiv_id":"2105.12880","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2105.12880","snapshot_observed_at":"2026-06-28T20:42:37.537199Z","title":"The Petascale DTN Project: High Performance Data Transfer for HPC Facilities,","venue":null,"work_id":"68d933c6-24e8-4e9b-846b-e8cb0060881a","year":2021},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"cited_paper":"/paper/2105.12880","citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:58823795c0d089f9b81b561fb5f24e5f05128ec7f6ff817c7c241dc16fe995c4","observation_id":"97e764de-3ea0-4430-b88c-c4edac50b680","resolution":{"observed_at":"2026-06-28T20:42:37.539011Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Globus: Recent Enhancements and Future Plans,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:8374568bf1247cfe4baccf14132b78228ce1555da59ba254887d5582b9afab95","observation_id":"12555944-46aa-4b86-ba52-a525478e7cce","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"CATCH: A Cloud-based Adaptive Data Transfer Service for HPC,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:825b7e22ee2901b378650fa6090c0b43bc92f74a9c6644a66a326a3a19db553d","observation_id":"4e5a2380-c283-4dec-ace0-72691000ff2e","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Frontiers in Scientific Workflows: Pervasive Integration with High-Performance Computing,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:11a3794ef33d9ba88a0415dd609241d145eda7dc84a241fa1dbd60b3fe95b86a","observation_id":"8386ecc0-5578-4d5f-aa4e-d2e6aee9c528","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Understanding Data Movement Patterns at HPC: A NERSC Case Study,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:4c5fb552cf75ac4dc4406cdee170dea7c190f9b7256f288a331d9e582a142072","observation_id":"ceb15288-ade1-44de-be1d-656c1e5b6b4f","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Revisiting I/O Bandwidth-Sharing Strategies for HPC Applications,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:b033564dcc3021214d5c97242e5af6979a7ca94933f0d50be8f5371add2a5afc","observation_id":"b4203b02-1414-4992-8f43-00c441781e9f","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"A Workflow Roofline Model for End- to-End Workflow Performance Analysis,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:8a4fbe15d82f2bb4e7071d8daeb04ab99f9be227ad4653394559d56ffebcb2b2","observation_id":"2ee709c2-35d9-48e2-bedd-869fef8aebf9","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Streaming Large-Scale Microscopy Data to a Supercom- puting Facility,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:67c595a4354cf0ab2ad461896aa18f0e649e061dcd12b2aaa7d53cc13ed1954d","observation_id":"b509aae7-be45-4516-bd05-841ee33011af","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Automatically encapsulating hpc best practices into data transfers,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:4ae35be2072c5eadaf8ec6a90c0b52780abfda49a121828f4b38c3eb6182993f","observation_id":"0ea3558d-abd0-453c-9281-71842ef2c07a","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Rsync for data transfers","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:e05f95667f12e7aad50f5d3a988e22395acc3fe24073dc0f114cbcc2b18bd463","observation_id":"cd9a9e84-6866-4dbc-8ed6-dea844ae5c2d","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Gridftp: High-performance data transfer pro- tocol","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:82e89e3b4d80fe9706d7fe13ba5833e95a1b7f8e2c561b995f5ba8744ae06e64","observation_id":"c552f281-6450-4ed1-8139-435ae0d0ce8d","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Ibm aspera: High-speed data transfer software","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:056c6eb92ce404972ef9aa78f0ae0a577ba6424985d00f5d5b90e22fc4d296a6","observation_id":"d02d1849-baae-4e63-a87a-85a4a2e017a0","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Gridftp usage and performance at alcf","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:c4d866dbb40e44786c4d96c106db724bef0b577183d4e3e53223cedb8441e4f2","observation_id":"3087b2db-d502-431f-8484-0429b5957558","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Big Data Transfer Optimiza- tion Through Adaptive Parameter Tuning,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:08548ba2783996a2e83400413b7645b1c390abe92e504a6339092c73872da1d7","observation_id":"6da28156-79a0-45f2-ba7a-7d2a53870ff7","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Coordinating an operational data distribution network for cmip6 data,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:4e00a6daced87667e1a27ea2508c670cd2e653a6ceb0d79705d238f9f7f6a859","observation_id":"9ff02cf5-31d4-4104-88d7-efc8a98ac986","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Krishna,Auction theory","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:e3cb583c2b02d11c90b276fca7026938ee8ca28950e1e7d49ddbd4821abcd0c0","observation_id":"4e84eab0-90e3-4636-a2b3-a00344daf7d3","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Vickrey-clarke- groves (vcg) auctions,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:9d3a16d339a9f34460d18a1ef1ab26cb0b421c26ad243be1a44c631bd78dd4c8","observation_id":"856d6e07-775b-4c62-9db4-d773c5a7de64","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Cs6840: Algo- rithmic game theory – december 4 lecture","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:a789219448294385207ef674bf9ed9620e36a4e4c94a48a274cc10fe81585e07","observation_id":"2f0a95d2-73ac-46fc-bff9-0b24eb6ac8b3","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Computing Just What You Need: Online Data Analysis and Reduction at Extreme Scales,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:24e239f03af4efc6ffb6612e59012d6d1952903b27196589dbc699961a3c665c","observation_id":"c2536a44-c920-4d56-972b-04ec811d8f95","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Resilient Error- Bounded Lossy Compressor for Data Transfer,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:572409f7215ce2898722fadb5a72658b3b5e333e44ea554324137c49119bd966","observation_id":"f840b158-43c8-4fa1-bbc5-2301f25bc434","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Gladier: Automation toolkit for scientific workflows","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:5d091cb9b4e624f0c84fc48a02500e6a36f5207dac074a410dab6aa2c8e1b82a","observation_id":"e8f75df5-3343-4771-bcb1-2dcbe7114e91","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Cross-facility science with the superfacility project at lbnl,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:5ff9df098312b6e351b35a3f19f136c837c83d2915ec0fad0a5e7f4f39e2f621","observation_id":"cce9fb94-0d62-4c3a-bb61-31bc10d5a78d","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-28T18:29:35.578100Z","title":"Value- Based Scheduling for Oversubscribed Power-Constrained Homoge- neous HPC Systems,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-28T18:29:35.578100Z"},"links":{"citing_paper":"/paper/2606.00490"},"observation_digest":"sha256:7712b77c500d5ead285c63e6aa96c6f4766e8e90850a96f2d623a31ee063cc5a","observation_id":"c26b5710-d96e-41e1-9dba-372dbc73cf5e","resolution":{"observed_at":"2026-06-28T18:29:35.578100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.00490","last_updated":"2026-05-30T02:40:50Z","latest_version":1,"primary_category":"cs.NI","snapshot_observed_at":"2026-08-03T06:03:25.417710Z","submitted_at":"2026-05-30T02:40:50Z","title":"XOR Bidding and Knapsack Formulations for HPC Network Resource Allocation"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":23},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2606.00490."}