{"as_of":"2026-08-08T03:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2e9a17e813d456a3222361fe0211709327b6631778ad90403c638a5edf1d4dbe","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T06:18:29.113918Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2506.06102/citation-record","integrity":"/paper/2506.06102/integrity","json":"/paper/2506.06102/citation-record.json","paper":"/paper/2506.06102"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:18:31.547870Z","title":"Parallel randomized load balancing","venue":null,"work_id":"c91c9fae-955a-492c-a9bb-caecbbb2c264","year":1998},"citing_paper":{"arxiv_id":"2506.06102","last_updated":"2025-06-06T14:02:04Z","snapshot_observed_at":"2026-08-07T05:58:04.009528Z","submitted_at":"2025-06-06T14:02:04Z","title":"Perfect Matching with Few Link Activations","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T06:18:27.813621Z"},"links":{"citing_paper":"/paper/2506.06102"},"observation_digest":"sha256:8064ee4f66b43acf2ab61e73e5d9630018667331417744992b6ce5e4c7ce0977","observation_id":"b818651c-a64a-48c4-b3b2-258f8bff722c","resolution":{"observed_at":"2026-08-07T06:18:31.675391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:18:31.337021Z","title":"Noisy beeping networks","venue":null,"work_id":"d2d0211d-3a82-4b93-b37d-42c9a9b271a1","year":2022},"citing_paper":{"arxiv_id":"2506.06102","last_updated":"2025-06-06T14:02:04Z","snapshot_observed_at":"2026-08-07T05:58:04.009528Z","submitted_at":"2025-06-06T14:02:04Z","title":"Perfect Matching with Few Link Activations","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T06:18:27.863287Z"},"links":{"citing_paper":"/paper/2506.06102"},"observation_digest":"sha256:03f4141b470b5045b30eb5a9f8058b123efaa694b1bd72718334ec9f2e6aec83","observation_id":"f43ea61b-31b3-4832-9794-99e9ba265f6c","resolution":{"observed_at":"2026-08-07T06:18:31.451979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:18:31.165547Z","title":"A trade-off between information and communication in broadcast protocols","venue":null,"work_id":"f1278007-c927-43fa-a2bc-3eb8d5ead377","year":1990},"citing_paper":{"arxiv_id":"2506.06102","last_updated":"2025-06-06T14:02:04Z","snapshot_observed_at":"2026-08-07T05:58:04.009528Z","submitted_at":"2025-06-06T14:02:04Z","title":"Perfect Matching with Few Link Activations","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T06:18:27.999956Z"},"links":{"citing_paper":"/paper/2506.06102"},"observation_digest":"sha256:8d4652b0a3f8e04eda10965c803dc3fa32d07b4ab01b407ac694158adf1848c7","observation_id":"bfc9d30a-90d3-448d-b0aa-2923fed21f1b","resolution":{"observed_at":"2026-08-07T06:18:31.244381Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:18:31.007997Z","title":"Distributed computations in fully-defective networks","venue":null,"work_id":"4a59f37a-bd86-486b-ad45-a19994c1e7d4","year":2023},"citing_paper":{"arxiv_id":"2506.06102","last_updated":"2025-06-06T14:02:04Z","snapshot_observed_at":"2026-08-07T05:58:04.009528Z","submitted_at":"2025-06-06T14:02:04Z","title":"Perfect Matching with Few Link Activations","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T06:18:28.085239Z"},"links":{"citing_paper":"/paper/2506.06102"},"observation_digest":"sha256:f934125f67357c2dc419cf509a607f5288f5ddf0011066878acca56305846f05","observation_id":"70529ee8-5c74-4fde-bb6a-f3a85f1826d4","resolution":{"observed_at":"2026-08-07T06:18:31.054823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:18:30.897334Z","title":"Deploying wireless networks with beeps","venue":null,"work_id":"8dd63d09-d006-4430-a538-64c25b340e4d","year":2010},"citing_paper":{"arxiv_id":"2506.06102","last_updated":"2025-06-06T14:02:04Z","snapshot_observed_at":"2026-08-07T05:58:04.009528Z","submitted_at":"2025-06-06T14:02:04Z","title":"Perfect Matching with Few Link Activations","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T06:18:28.158051Z"},"links":{"citing_paper":"/paper/2506.06102"},"observation_digest":"sha256:ba68fabee9f8c8ee59f516c43a836b479cc968af5c8b278c14523aed8a971aba","observation_id":"87b620e6-6eb9-4075-8551-4743cdf1681a","resolution":{"observed_at":"2026-08-07T06:18:30.931073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:18:30.762296Z","title":"The complexity of leader election in diameter-two networks","venue":null,"work_id":"9cdda42a-f73a-47a9-a678-d2b513c9d434","year":2020},"citing_paper":{"arxiv_id":"2506.06102","last_updated":"2025-06-06T14:02:04Z","snapshot_observed_at":"2026-08-07T05:58:04.009528Z","submitted_at":"2025-06-06T14:02:04Z","title":"Perfect Matching with Few Link Activations","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T06:18:28.291499Z"},"links":{"citing_paper":"/paper/2506.06102"},"observation_digest":"sha256:8f773d1d97fbe2728f199a02ce0d2bf96a81655632eb48da3a5f8bb786652dc9","observation_id":"66482afd-89bd-4ba4-94af-f0c2164d3e18","resolution":{"observed_at":"2026-08-07T06:18:30.822196Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:18:30.612726Z","title":"Information transduction capacity of noisy biochemical signaling networks","venue":null,"work_id":"68598509-cedc-4464-9e68-9e38f40de853","year":2011},"citing_paper":{"arxiv_id":"2506.06102","last_updated":"2025-06-06T14:02:04Z","snapshot_observed_at":"2026-08-07T05:58:04.009528Z","submitted_at":"2025-06-06T14:02:04Z","title":"Perfect Matching with Few Link Activations","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T06:18:28.354574Z"},"links":{"citing_paper":"/paper/2506.06102"},"observation_digest":"sha256:9f8658b375a42f3d74bbd1d9cd44008486e08af02d0b09a3b3a0d64309c9a299","observation_id":"bb76e8cf-a1b3-4817-964e-9d43db99240d","resolution":{"observed_at":"2026-08-07T06:18:30.684363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:18:30.487778Z","title":"Optimal message-passing with noisy beeps","venue":null,"work_id":"a28180d9-976e-4b97-a3fa-7d5b14a4d7fc","year":2023},"citing_paper":{"arxiv_id":"2506.06102","last_updated":"2025-06-06T14:02:04Z","snapshot_observed_at":"2026-08-07T05:58:04.009528Z","submitted_at":"2025-06-06T14:02:04Z","title":"Perfect Matching with Few Link Activations","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T06:18:28.496508Z"},"links":{"citing_paper":"/paper/2506.06102"},"observation_digest":"sha256:2d3d953a2c5c7e6da3fb28baef9c95b28bd165d4dc6a40b3fbc49c52d895fde5","observation_id":"a6a8194e-a1cc-4bb8-8ed6-5ecc37dacac1","resolution":{"observed_at":"2026-08-07T06:18:30.540521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:18:30.354004Z","title":"Distributed MST and broadcast with fewer messages, and faster gossiping","venue":null,"work_id":"9f43d38a-19f6-4f4a-8d56-bf15679fbd20","year":2018},"citing_paper":{"arxiv_id":"2506.06102","last_updated":"2025-06-06T14:02:04Z","snapshot_observed_at":"2026-08-07T05:58:04.009528Z","submitted_at":"2025-06-06T14:02:04Z","title":"Perfect Matching with Few Link Activations","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T06:18:28.623005Z"},"links":{"citing_paper":"/paper/2506.06102"},"observation_digest":"sha256:9d6f75c1a7950b34812cb55cbe80d6411fa1b5b1c9ee5ab542d7a80324c65eff","observation_id":"45901bd6-8693-461c-953c-08f41b5d0552","resolution":{"observed_at":"2026-08-07T06:18:30.425204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:18:30.158953Z","title":"On representatives of subsets","venue":null,"work_id":"ccbad0ac-8906-4c0d-b8af-fe10d302bb11","year":1935},"citing_paper":{"arxiv_id":"2506.06102","last_updated":"2025-06-06T14:02:04Z","snapshot_observed_at":"2026-08-07T05:58:04.009528Z","submitted_at":"2025-06-06T14:02:04Z","title":"Perfect Matching with Few Link Activations","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T06:18:28.665852Z"},"links":{"citing_paper":"/paper/2506.06102"},"observation_digest":"sha256:1bb51699845cbd6dc9c2204af074368ef03171dc75d201289516843ce5fb326b","observation_id":"57fdb3e0-5d56-4556-9e99-08d009b3bd96","resolution":{"observed_at":"2026-08-07T06:18:30.231197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:18:29.998763Z","title":"Constructive proofs of concentration bounds","venue":null,"work_id":"d0a72ce7-4ffc-4e2b-ab48-d64a9c258300","year":2010},"citing_paper":{"arxiv_id":"2506.06102","last_updated":"2025-06-06T14:02:04Z","snapshot_observed_at":"2026-08-07T05:58:04.009528Z","submitted_at":"2025-06-06T14:02:04Z","title":"Perfect Matching with Few Link Activations","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T06:18:28.735988Z"},"links":{"citing_paper":"/paper/2506.06102"},"observation_digest":"sha256:a4c2f1ce7a6cd995a72be3fa66f11549f794bf82b00810ffdd45ef3d317b1ece","observation_id":"921f18eb-b690-46ae-93a4-f5a1547d1beb","resolution":{"observed_at":"2026-08-07T06:18:30.067114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:18:29.792463Z","title":"Tight bounds for parallel randomized load balancing","venue":null,"work_id":"636e5c51-0b0a-4942-a8ab-f1b877a2c19c","year":2016},"citing_paper":{"arxiv_id":"2506.06102","last_updated":"2025-06-06T14:02:04Z","snapshot_observed_at":"2026-08-07T05:58:04.009528Z","submitted_at":"2025-06-06T14:02:04Z","title":"Perfect Matching with Few Link Activations","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T06:18:28.827077Z"},"links":{"citing_paper":"/paper/2506.06102"},"observation_digest":"sha256:2bf466279e79d5cf32e303465f45cb9508503b037767e2f86d854ea7849750ef","observation_id":"24b22c2f-0d21-4a1b-aff8-b0f293b81df2","resolution":{"observed_at":"2026-08-07T06:18:29.919855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:18:29.657171Z","title":"Distributed information processing in biological and computational systems","venue":null,"work_id":"871ae323-dd05-47f4-bf62-3c4724b595af","year":2014},"citing_paper":{"arxiv_id":"2506.06102","last_updated":"2025-06-06T14:02:04Z","snapshot_observed_at":"2026-08-07T05:58:04.009528Z","submitted_at":"2025-06-06T14:02:04Z","title":"Perfect Matching with Few Link Activations","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T06:18:28.881707Z"},"links":{"citing_paper":"/paper/2506.06102"},"observation_digest":"sha256:b15f24bfa6c4280cf43f89ce90a1dfc81de60306163f1bf2e09e58475004d028","observation_id":"a49a2e22-e2b9-4680-b5d2-fe996d64c34f","resolution":{"observed_at":"2026-08-07T06:18:29.726875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:18:29.506199Z","title":"Distributed Computing: A Locality-Sensitive Approach","venue":null,"work_id":"6904246a-c18f-4012-9458-fff7dbe0cca4","year":2000},"citing_paper":{"arxiv_id":"2506.06102","last_updated":"2025-06-06T14:02:04Z","snapshot_observed_at":"2026-08-07T05:58:04.009528Z","submitted_at":"2025-06-06T14:02:04Z","title":"Perfect Matching with Few Link Activations","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T06:18:28.946318Z"},"links":{"citing_paper":"/paper/2506.06102"},"observation_digest":"sha256:9dfc016b9157988c376a3b65b12ccd0f64489e20ccc9d0e19eb278ec1e1e059e","observation_id":"4656dac3-62d1-4319-9f79-06f98392ddc2","resolution":{"observed_at":"2026-08-07T06:18:29.579094Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:18:29.337712Z","title":"Survey of local algorithms","venue":null,"work_id":"b5eedab4-b98a-4726-8643-10f549b556af","year":2013},"citing_paper":{"arxiv_id":"2506.06102","last_updated":"2025-06-06T14:02:04Z","snapshot_observed_at":"2026-08-07T05:58:04.009528Z","submitted_at":"2025-06-06T14:02:04Z","title":"Perfect Matching with Few Link Activations","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T06:18:29.046271Z"},"links":{"citing_paper":"/paper/2506.06102"},"observation_digest":"sha256:8b4849f13dd0ff2bf2842de797a3af25e2462d06770e29d8419336e23a60bcce","observation_id":"a3119465-09ca-4418-ac88-b1c8ff83b996","resolution":{"observed_at":"2026-08-07T06:18:29.407838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T06:18:29.217602Z","title":"Load balancing in parallel computers: theory and practice , volume 381","venue":null,"work_id":"e7d3896f-3561-4716-acd2-426d643f19f6","year":2007},"citing_paper":{"arxiv_id":"2506.06102","last_updated":"2025-06-06T14:02:04Z","snapshot_observed_at":"2026-08-07T05:58:04.009528Z","submitted_at":"2025-06-06T14:02:04Z","title":"Perfect Matching with Few Link Activations","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T06:18:29.113918Z"},"links":{"citing_paper":"/paper/2506.06102"},"observation_digest":"sha256:212aa463015e8d0a258d3bac253ad7a0db9d84bd697967365ee64909dc419c26","observation_id":"450b7e73-706d-4f49-a8ef-bf7ef632678f","resolution":{"observed_at":"2026-08-07T06:18:29.264853Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.06102","last_updated":"2025-06-06T14:02:04Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-07T05:58:04.009528Z","submitted_at":"2025-06-06T14:02:04Z","title":"Perfect Matching with Few Link Activations"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":16},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2506.06102."}