{"as_of":"2026-08-19T07:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:98b4bb0665bfc377717b5d174e16a10e3d3a0a66cf901fa5b30bd6c7f8b65c7b","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T09:16:48.563259Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2607.22743/citation-record","integrity":"/paper/2607.22743/integrity","json":"/paper/2607.22743/citation-record.json","paper":"/paper/2607.22743"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T09:16:45.157122Z","title":"URLhttps://seer.cancer.gov/statfacts/html/ colorect.html","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:45.157122Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:94bc46ce13ba77343dc1bff065db88013ba58fb00039bc6f4088e2194ea3ec07","observation_id":"6c268eff-c1d4-47e0-9794-c1147ca332bb","resolution":{"observed_at":"2026-08-01T09:16:45.157122Z","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-08-01T09:16:45.299736Z","title":"Ronneberger, P","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:45.299736Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:16ce478b1c36d1f390dc7a4dd8c086fae99dedbda125e4c5575ca00f1b9e60a2","observation_id":"6c20e415-6233-4e3a-b90a-d161d152b628","resolution":{"observed_at":"2026-08-01T09:16:45.299736Z","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-08-01T09:16:45.407643Z","title":"Fan, G.-P","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:45.407643Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:138d7f6af4f3b32f83e848d1e4d9e3e26f105492f1722f7b16152e1b2f22d156","observation_id":"584da4a1-ac6f-4ec2-8601-3c2b7f5d502d","resolution":{"observed_at":"2026-08-01T09:16:45.407643Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.07172","last_updated":"2021-01-20T15:58:47Z","snapshot_observed_at":"2026-08-16T18:51:36.474062Z","submitted_at":"2021-01-18T17:20:11Z","title":"HarDNet-MSEG: A Simple Encoder-Decoder Polyp Segmentation Neural Network that Achieves over 0.9 Mean Dice and 86 FPS","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.07172","snapshot_observed_at":"2026-08-01T09:16:45.522051Z","title":"Huang, H.-Y","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:45.522051Z"},"links":{"cited_paper":"/paper/2101.07172","citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:ee028002aa313a347f01726912f121f118dfbdeb1602feee8265a7a989def770","observation_id":"3718c670-52d4-4cad-8185-b0727d6d6ad2","resolution":{"observed_at":"2026-08-01T09:16:45.522051Z","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-08-01T09:16:45.613001Z","title":"McMahan, E","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:45.613001Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:fbe04ba5dc79c9e10e2679541e52927395358edebbe8baf9fbbc27c5f16b89f1","observation_id":"3b951d60-a37f-4395-a092-ae54ae7f8405","resolution":{"observed_at":"2026-08-01T09:16:45.613001Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1610.05492","last_updated":"2017-10-30T20:52:14Z","snapshot_observed_at":"2026-08-13T17:19:46.488095Z","submitted_at":"2016-10-18T09:11:51Z","title":"Federated Learning: Strategies for Improving Communication Efficiency","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1610.05492","snapshot_observed_at":"2026-08-01T09:16:45.710835Z","title":"Kone ˇcný, et al., Federated learning: Strategies for improving communication efficiency, arXiv preprint arXiv:1610.05492 (2016)","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:45.710835Z"},"links":{"cited_paper":"/paper/1610.05492","citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:77e76bc79238ae10e6ad27392312b26eed2051d71e0675920fde021015122e95","observation_id":"4278bcf8-8cbb-4669-a979-48ca88074d9e","resolution":{"observed_at":"2026-08-01T09:16:45.710835Z","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":"10.1073/pnas.2024789118","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Proceedings of the National Academy of Sciences","work_id":"638d04dd-a4f5-4242-9e7a-9efa68fe73a6","year":2021},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:45.810619Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:027ae4df0c57ab48cd2577f7a478e5e8f38020467470e417eab9b2329ed5f501","observation_id":"f4156deb-8215-4aaa-aab2-e73ada429f29","resolution":{"observed_at":"2026-08-01T09:18:28.662500Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-08-01T09:16:45.975461Z","title":"Reisizadeh, A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:45.975461Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:1ca65779cf4b25f762db476efc4e370038bc4cae9a7a8302feed6519cd260563","observation_id":"f6760697-642c-4719-b47e-5af9c5e4774f","resolution":{"observed_at":"2026-08-01T09:16:45.975461Z","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-08-01T09:16:46.040245Z","title":"Jacob, S","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:46.040245Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:06bf1cb4d14e31b48f0bcf25781fc17d006b79db9ff6702138236bdc97bd1162","observation_id":"6e112bce-20c6-4553-9001-50cc3e5ffc20","resolution":{"observed_at":"2026-08-01T09:16:46.040245Z","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-08-01T09:16:46.108477Z","title":"Ronneberger, P","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:46.108477Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:4e2870e52324379a41bee240712e0427496bd5e660c45b7f1a730e5c31482468","observation_id":"67b83715-4bcc-4cb6-a0d6-8d5fa3d7d211","resolution":{"observed_at":"2026-08-01T09:16:46.108477Z","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-08-01T09:16:46.163994Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:46.163994Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:a709f6678d6d41212ea19ebf01d4cda16e1862fc13724e5cfbc7343b3cf14afd","observation_id":"fa6c559b-a9f1-4465-8fc1-aaacae15cad7","resolution":{"observed_at":"2026-08-01T09:16:46.163994Z","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-08-01T09:16:46.221997Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:46.221997Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:4208a0c9abd95775a4b27b5319cc76a41baa11909badb4957abcfbbc8d97d782","observation_id":"59eb002f-bf25-47d5-9c81-41ff3fbe552b","resolution":{"observed_at":"2026-08-01T09:16:46.221997Z","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-08-01T09:16:46.293894Z","title":"Fang, C.-W","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:46.293894Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:8fd146f93a0752a8846d6e61eaea4a8e8f080997d2b4f94b5cb7724e0d5e810a","observation_id":"26069f1b-1458-4fd0-9b59-03704b7e5ae9","resolution":{"observed_at":"2026-08-01T09:16:46.293894Z","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-08-01T09:16:46.347247Z","title":"Fan, G.-P","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:46.347247Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:dff034802b93b1d80066a5bb4d532e142d273e833e297ad3df16a09fb4a192c9","observation_id":"9f93c7d7-d2fa-42c3-a73e-8b12e0c3f6e4","resolution":{"observed_at":"2026-08-01T09:16:46.347247Z","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-08-01T09:16:46.392461Z","title":"Zhang, G","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:46.392461Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:06993f98499cf4e9462562e47a8292926ed6ce6179fdaee22117bcea24cb5f18","observation_id":"45cfbc7c-465c-46d2-a5dd-6a02da00ee76","resolution":{"observed_at":"2026-08-01T09:16:46.392461Z","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-08-01T09:16:46.419125Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:46.419125Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:d685ee710f408730666329a7d72c23a62e7e5370003cd2d2415a5b62fcb909f6","observation_id":"91d169c2-b2c8-4a6f-8f5e-cacf61191d0f","resolution":{"observed_at":"2026-08-01T09:16:46.419125Z","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-08-01T09:16:46.532551Z","title":"Rieke, J","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:46.532551Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:7722ba40217e8f3bea47af1db52c0f97c70a616b8afa8b111cd57bdf2f329a83","observation_id":"7258e3d2-c666-4005-a682-84e22c519bf4","resolution":{"observed_at":"2026-08-01T09:16:46.532551Z","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-08-01T09:16:46.700483Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:46.700483Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:efb4bff618d357bef6493e4f655f2afa0a3553e997953b236fc869dfe6a40280","observation_id":"3d1da3b0-69a6-42f5-83bd-0e872eec1acd","resolution":{"observed_at":"2026-08-01T09:16:46.700483Z","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-08-01T09:16:46.860944Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:46.860944Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:8d22846d4676265c5c37f5380b6f11ab909f0a6cfda0d318546f308f26cb523a","observation_id":"2ee9548f-1ffd-4304-8c3e-ac35e8828c4a","resolution":{"observed_at":"2026-08-01T09:16:46.860944Z","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-08-01T09:16:46.974860Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:46.974860Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:6d2710ae2d08ab876449aaebcc7baa48e26a034e70f0f68b6a8439130907025e","observation_id":"e1cdc6a1-1ce8-4243-83c2-be18e9ed87d4","resolution":{"observed_at":"2026-08-01T09:16:46.974860Z","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-08-01T09:16:47.131643Z","title":"Alistarh, D","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:47.131643Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:d0d6aed6f6e7a1b09a486990c670650c4527f70f75d958655311f2a0635ac2a9","observation_id":"fcec0238-f2f8-4908-89b4-fca4bcb4ef40","resolution":{"observed_at":"2026-08-01T09:16:47.131643Z","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-08-01T09:16:47.215023Z","title":"Bernstein, J","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:47.215023Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:792156cecbbac84bb82e6b8236ef3589e974eeb49d2b92553093155552ddccbe","observation_id":"e155d5fd-96a1-4738-9a94-e1b295a36a10","resolution":{"observed_at":"2026-08-01T09:16:47.215023Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1712.01887","last_updated":"2020-06-23T03:28:30Z","snapshot_observed_at":"2026-08-18T15:24:54.289687Z","submitted_at":"2017-12-05T19:48:11Z","title":"Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.01887","snapshot_observed_at":"2026-08-01T09:16:47.330488Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:47.330488Z"},"links":{"cited_paper":"/paper/1712.01887","citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:28b5eae312f7b5558a67a26a6d8637af4e95b99da60e13678b66f36befbf8c48","observation_id":"7f6dd9ff-fd3c-4ea7-96ba-db17f07b05f4","resolution":{"observed_at":"2026-08-01T09:16:47.330488Z","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-08-01T09:16:47.450475Z","title":"Jacob, S","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:47.450475Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:eca7f96ddb4aa9b412d1799b34cc279a32f2c077ca0d4e863649feca9707946d","observation_id":"196bad3b-ed78-4c7f-af17-07da6d2ad896","resolution":{"observed_at":"2026-08-01T09:16:47.450475Z","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-08-01T09:16:47.564405Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:47.564405Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:ee04a885723cc69e0050483c74abf267b7d49d128d91b54b3eb7fad5ca499a5d","observation_id":"f64f0d76-a34f-4919-993d-f2fa142ddd1e","resolution":{"observed_at":"2026-08-01T09:16:47.564405Z","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-08-01T09:16:47.645661Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:47.645661Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:8eb54d8ea0f90ffcacd9b5a9c541c45328046721197a8ff138491dbd7148f33c","observation_id":"5af62afa-40a8-4174-9a8c-d05b162e8f35","resolution":{"observed_at":"2026-08-01T09:16:47.645661Z","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-08-01T09:16:47.774999Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:47.774999Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:f4bbece17ed3b3f6bc3b6ee3e35d0fb166176e78ff92586ac1a6cff67e7bc861","observation_id":"2f927ea0-862e-4a6b-993b-339289b80ec7","resolution":{"observed_at":"2026-08-01T09:16:47.774999Z","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-08-01T09:16:47.899784Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:47.899784Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:413fee0015a687a093ba6ea5870b9f76901e47f8ad489e84bdb1153347b12e6c","observation_id":"bd313674-d95d-4e4b-9665-9c6b792b019d","resolution":{"observed_at":"2026-08-01T09:16:47.899784Z","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-08-01T09:16:48.024840Z","title":"McMahan, E","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:48.024840Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:58b23232bc0cc04c9cf146308e5fb738c4517cb457484a1717b714f6ab49bc26","observation_id":"548cf924-0234-4047-aefc-12f1a9ae86d8","resolution":{"observed_at":"2026-08-01T09:16:48.024840Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2011.07631","last_updated":"2021-03-31T20:21:06Z","snapshot_observed_at":"2026-08-16T19:05:43.844175Z","submitted_at":"2020-11-15T21:14:50Z","title":"Real-Time Polyp Detection, Localization and Segmentation in Colonoscopy Using Deep Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.07631","snapshot_observed_at":"2026-08-01T09:16:48.147738Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:48.147738Z"},"links":{"cited_paper":"/paper/2011.07631","citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:9b281f804b8deb5cd395111cf8f30a33ceea9de9995a7c94e97b8c23da2407ab","observation_id":"488d7748-5339-451c-8f30-de37e8496749","resolution":{"observed_at":"2026-08-01T09:16:48.147738Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.04280","last_updated":"2022-05-09T13:53:26Z","snapshot_observed_at":"2026-08-16T17:01:37.822351Z","submitted_at":"2022-05-09T13:53:26Z","title":"TGANet: Text-guided attention for improved polyp segmentation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.04280","snapshot_observed_at":"2026-08-01T09:16:48.201105Z","title":"Tomar, D","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:48.201105Z"},"links":{"cited_paper":"/paper/2205.04280","citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:c16af5e00346d71129765184db80bceb11c737ff21092da4a3178abe4ff5627a","observation_id":"e15aa9e7-7769-43d5-a7c4-49d16b550b57","resolution":{"observed_at":"2026-08-01T09:16:48.201105Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.06932","last_updated":"2024-02-19T13:02:26Z","snapshot_observed_at":"2026-08-18T04:59:52.688617Z","submitted_at":"2021-08-16T07:09:06Z","title":"Polyp-PVT: Polyp Segmentation with Pyramid Vision Transformers","version":8},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.06932","snapshot_observed_at":"2026-08-01T09:16:48.235738Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:48.235738Z"},"links":{"cited_paper":"/paper/2108.06932","citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:2cd72a1a7accfdcc53deab7727b477927ca24be982643694ad8548828924302b","observation_id":"27a9f52c-cc27-4e81-91d6-837061021ee2","resolution":{"observed_at":"2026-08-01T09:16:48.235738Z","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-08-01T09:16:48.440945Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:48.440945Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:0795bdea1d53f06d58c5ef0f33da440ca2dea41832496aa964ca1cfcceeac28f","observation_id":"b6e65702-0f3c-4720-ad64-c8f6ae01ee6a","resolution":{"observed_at":"2026-08-01T09:16:48.440945Z","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-08-01T09:16:48.563259Z","title":"Stelter, V","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T09:16:48.563259Z"},"links":{"citing_paper":"/paper/2607.22743"},"observation_digest":"sha256:200c57e15a09c513ffbf548245ee28a26dd977dcf6df7aa2880bbb2b5ced0105","observation_id":"f6a36ebe-4988-4c63-86e3-040ad5d17dfb","resolution":{"observed_at":"2026-08-01T09:16:48.563259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.22743","last_updated":"2026-07-23T01:50:54Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T18:27:13.884020Z","submitted_at":"2026-07-23T01:50:54Z","title":"QFedPolyp: A Communication- and Inference-Efficient Federated Learning Framework for Polyp Segmentation"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":34},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2607.22743."}