{"as_of":"2026-08-23T03:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e3474cb77da7f005b8a83b29e58edce1b680a948568c077f31aecfa7d1bcc4f4","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T18:29:53.564488Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T04:12:32.095929Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2603.11797","snapshot_observed_at":"2026-08-01T08:52:38.891519Z","title":"The Carnot bound: Limits and possibilities for bandwidth-efficient consensus.arXiv preprint arXiv:2603.11797, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.21021","last_updated":"2026-08-20T13:40:25Z","snapshot_observed_at":"2026-08-23T02:10:52.784353Z","submitted_at":"2026-07-23T08:05:29Z","title":"Multimmit: Extending Blocks for Faster Finality","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T08:52:38.891519Z"},"links":{"cited_paper":"/paper/2603.11797","citing_paper":"/paper/2607.21021"},"observation_digest":"sha256:2a5ee367667d390e1637840266dad65ee6c78d46b736f61c04d894c262b45b8e","observation_id":"c97400af-ceb0-440c-8b23-96def6221abf","resolution":{"observed_at":"2026-08-01T08:52:38.891519Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2603.11797","snapshot_observed_at":"2026-08-04T04:12:32.095929Z","title":"The Carnot bound: Limits and possibilities for bandwidth-efficient consensus.arXiv preprint arXiv:2603.11797, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.21021","last_updated":"2026-08-20T13:40:25Z","snapshot_observed_at":"2026-08-23T02:10:52.784353Z","submitted_at":"2026-07-23T08:05:29Z","title":"Multimmit: Extending Blocks for Faster Finality","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T04:12:32.095929Z"},"links":{"cited_paper":"/paper/2603.11797","citing_paper":"/paper/2607.21021"},"observation_digest":"sha256:61faa8898fe306ec97dea693ec28a18e156bc69f4575a318f89bf07fb58aced9","observation_id":"d75865a6-f202-43d9-a26d-d03c8f956c28","resolution":{"observed_at":"2026-08-04T04:12:32.095929Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2603.11797/citation-record","integrity":"/paper/2603.11797/integrity","json":"/paper/2603.11797/citation-record.json","paper":"/paper/2603.11797"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T18:29:50.122599Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:50.122599Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:d3c893789cfe90f9067d4b2cfdadf7ebad7bd88b45cec8df93a4bd9dc5aa3d8a","observation_id":"f4453d77-d376-4f79-b683-283c43f3fb1c","resolution":{"observed_at":"2026-08-02T18:29:50.122599Z","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-02T18:29:50.276479Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:50.276479Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:1d3802ffa8a5255f7e835300844fa70af560ca940fc8d79d6bba15245d6f64f9","observation_id":"03e953e3-a5f4-4655-976c-e5d112b1e814","resolution":{"observed_at":"2026-08-02T18:29:50.276479Z","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-02T18:29:50.389429Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:50.389429Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:7a9b4dfc71f88f22c759f1caa175b21610c9f4660a3ff93ecc1e8c16905c15be","observation_id":"2fb1140e-6d66-4e1e-b87b-351f48af2547","resolution":{"observed_at":"2026-08-02T18:29:50.389429Z","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-02T18:29:50.496459Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:50.496459Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:c27ad4d3b0198e3d327e3890b4aa64f9e0a1f32bf42d6ef7ccdb108721ccc906","observation_id":"6d00c55f-0a9b-4e22-83ed-17c4b5b6acd5","resolution":{"observed_at":"2026-08-02T18:29:50.496459Z","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-02T18:29:50.579681Z","title":"2016.Tendermint: Byzantine fault tolerance in the age of blockchains","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:50.579681Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:1afa398b3dbdd66634e9e8d2bff50bcdaf4b75b8465da2399c326dd7b9b98be6","observation_id":"7ba19534-bb74-42c4-a86f-c6655c535080","resolution":{"observed_at":"2026-08-02T18:29:50.579681Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.04938","last_updated":"2019-11-22T10:21:27Z","snapshot_observed_at":"2026-08-20T12:45:38.568604Z","submitted_at":"2018-07-13T06:53:53Z","title":"The latest gossip on BFT consensus","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.04938","snapshot_observed_at":"2026-08-02T18:29:50.701833Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:50.701833Z"},"links":{"cited_paper":"/paper/1807.04938","citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:03b1738311d566db6d5f34d308d50a07ea2838cb46113dad8eaaba29edb46405","observation_id":"908d0b73-29ad-4a52-97fe-eb9f09bdfa43","resolution":{"observed_at":"2026-08-02T18:29:50.701833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.09437","last_updated":"2019-01-22T09:31:32Z","snapshot_observed_at":"2026-08-15T18:40:30.305251Z","submitted_at":"2017-10-25T19:54:52Z","title":"Casper the Friendly Finality Gadget","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.09437","snapshot_observed_at":"2026-08-02T18:29:50.788162Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:50.788162Z"},"links":{"cited_paper":"/paper/1710.09437","citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:8919434987a9d401b45e882674ed1bf285a16204bc6755aa1a042c95796c71dc","observation_id":"f33c0805-de75-457c-89a6-e120a1a25675","resolution":{"observed_at":"2026-08-02T18:29:50.788162Z","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-02T18:29:50.888191Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:50.888191Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:4a6687eeff2237697c3ebae3a2944b6742d63863f3c111eb3ec947f05416b388","observation_id":"c41e5281-2a71-4d8d-a00d-1a00ce1cd2ea","resolution":{"observed_at":"2026-08-02T18:29:50.888191Z","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-02T18:29:50.960754Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:50.960754Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:781f2c927166b841160af7637815b8e6067002e5797f3512de17b455865bf3b2","observation_id":"afad50ad-8899-43f6-b604-204437fcd8bd","resolution":{"observed_at":"2026-08-02T18:29:50.960754Z","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-02T18:29:51.041976Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:51.041976Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:b2a3f500cb748beb75d59dd4dca3544fc5bf1ca3513741e3e03c13641d82c51c","observation_id":"f2e26056-9039-4121-967f-195aaff3dbf5","resolution":{"observed_at":"2026-08-02T18:29:51.041976Z","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-02T18:29:51.104193Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:51.104193Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:86c6212ebbdef9f7bb13d6e34e507e6180ab345b7cd1116d3c6a43f5bf6869d8","observation_id":"9172a4d8-45c3-4536-87f0-faecd31a8116","resolution":{"observed_at":"2026-08-02T18:29:51.104193Z","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-02T18:29:51.205738Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:51.205738Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:cb357f08e84ec4148c9557f9d274069b906c70500fb67f2e8a1dd6502aa7e699","observation_id":"1b479d51-7bdd-49ca-adc0-3639bb1483c3","resolution":{"observed_at":"2026-08-02T18:29:51.205738Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.01791","last_updated":"2024-04-19T11:54:40Z","snapshot_observed_at":"2026-08-16T14:30:04.262331Z","submitted_at":"2024-01-03T15:45:23Z","title":"Moonshot: Optimizing Chain-Based Rotating Leader BFT via Optimistic Proposals","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.01791","snapshot_observed_at":"2026-08-02T18:29:51.313917Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:51.313917Z"},"links":{"cited_paper":"/paper/2401.01791","citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:0f8036ad25658b51fe6055869b76c667aff4932c0c21caa1153b015cb1d13319","observation_id":"1426af7f-e9ce-4ebc-8bfc-c8f23a4eb853","resolution":{"observed_at":"2026-08-02T18:29:51.313917Z","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-02T18:29:51.410793Z","title":"Lynch, and Larry Stockmeyer","venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:51.410793Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:96477bc39add40a4eae3dcba51fc0e8d0d4c18b86aa146c1c9919179d4b58980","observation_id":"cc53a31a-8366-44ea-b669-3a0ebbfd2243","resolution":{"observed_at":"2026-08-02T18:29:51.410793Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.15380","last_updated":"2025-03-19T16:17:54Z","snapshot_observed_at":"2026-08-16T12:48:32.472614Z","submitted_at":"2025-03-19T16:17:54Z","title":"ChonkyBFT: Consensus Protocol of ZKsync","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.15380","snapshot_observed_at":"2026-08-02T18:29:51.501815Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:51.501815Z"},"links":{"cited_paper":"/paper/2503.15380","citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:117ccac577bfd47f1be4ee88f4273efed072a6ff469a71c25eee556b9c1403c5","observation_id":"e916c4ca-b952-4f17-bbe6-20b1d02d2abc","resolution":{"observed_at":"2026-08-02T18:29:51.501815Z","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-02T18:29:51.594000Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:51.594000Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:1d41b5c5214a3fd6a0e3350059e69ecc73a762fffc833fcd2fc2b647f3fae00f","observation_id":"005e974b-d0de-49a6-8730-85e6f7e237ba","resolution":{"observed_at":"2026-08-02T18:29:51.594000Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1810.05256","last_updated":"2019-08-29T16:51:01Z","snapshot_observed_at":"2026-08-15T06:23:38.550573Z","submitted_at":"2018-10-11T21:27:45Z","title":"Aleph: A Leaderless, Asynchronous, Byzantine Fault Tolerant Consensus Protocol","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1810.05256","snapshot_observed_at":"2026-08-02T18:29:51.692970Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:51.692970Z"},"links":{"cited_paper":"/paper/1810.05256","citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:e61b7d135dc067fdb5d8fd3f131b13a7dcfe8f9fd0c95a1649f0c12f6c4b27e1","observation_id":"d91fc22f-62b3-40b7-a3a9-9079f813ef60","resolution":{"observed_at":"2026-08-02T18:29:51.692970Z","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-02T18:29:51.819161Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:51.819161Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:3c7ce7d4d2c39505bb2ef72c6b68206ce7f717e4b4bc2d90d6cb92b193f3f41f","observation_id":"bf3e9d4e-cb6d-4521-887b-7172ce758d6b","resolution":{"observed_at":"2026-08-02T18:29:51.819161Z","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-02T18:29:51.920013Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:51.920013Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:e61b78d0e7427d569ed3f26caa84c2b3d5d1c7666699fcf0d950d0f0a5253dd5","observation_id":"a6d9e994-8f35-4c5d-bda2-25a82885afc5","resolution":{"observed_at":"2026-08-02T18:29:51.920013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2205.09174","last_updated":"2023-09-22T20:40:09Z","snapshot_observed_at":"2026-08-20T01:23:03.091976Z","submitted_at":"2022-05-18T18:45:20Z","title":"Cordial Miners: Fast and Efficient Consensus for Every Eventuality","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.09174","snapshot_observed_at":"2026-08-02T18:29:52.024040Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:52.024040Z"},"links":{"cited_paper":"/paper/2205.09174","citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:854066c156ddbc8c844a311fc01d854d50dc23b56759f5886863c0c18bd87e26","observation_id":"8726f5f4-f69e-44c9-8ece-30a709db1e02","resolution":{"observed_at":"2026-08-02T18:29:52.024040Z","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-02T18:29:52.127434Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:52.127434Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:59aa24b2dc35abb6262d7e9cc34c1c3acc4658dd952db7efa27ed2c893525b53","observation_id":"54e79d7d-8496-46a3-8c73-a14084729e7a","resolution":{"observed_at":"2026-08-02T18:29:52.127434Z","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-02T18:29:52.220567Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:52.220567Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:0e5e21d875a34f2e24bd4ed1e208eb9367059010a9cbd6d1353575290d3cc575","observation_id":"a378c91f-a029-4e42-a0fc-7f13ebb83f41","resolution":{"observed_at":"2026-08-02T18:29:52.220567Z","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-02T18:29:52.345140Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:52.345140Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:276b923b79e042e359fe9b93dbeedf54170872b54d872ae7314debddcbca0d9c","observation_id":"f1394207-cbf3-4d5b-9532-bf013464eca8","resolution":{"observed_at":"2026-08-02T18:29:52.345140Z","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-02T18:29:52.444185Z","title":null,"venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:52.444185Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:75c801ef5bd9f98d3b534f985b25cd15c291a95c7123a3065d78fae946259555","observation_id":"64f15ed9-0b06-4253-a2b2-4f213e88fa79","resolution":{"observed_at":"2026-08-02T18:29:52.444185Z","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-02T18:29:52.513463Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:52.513463Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:c52edde7eacebde412f48a978f90c62188355733c8b43dc7caa3d21ce2fa3a1e","observation_id":"121b4d60-d735-4276-9653-fcf16f999809","resolution":{"observed_at":"2026-08-02T18:29:52.513463Z","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-02T18:29:52.579935Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:52.579935Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:b9c9c62a79235ab007694c51ca08e34d9efdbce3d17d3e2c524103795587d234","observation_id":"96b4874b-18e3-465e-947c-12f56f81ebc4","resolution":{"observed_at":"2026-08-02T18:29:52.579935Z","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-02T18:29:52.663004Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:52.663004Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:e101815efc2a37b5d0881ef66aedabc9f0432d13dfa443d7ff2d1ceb6e69e9b4","observation_id":"6b82d438-30c8-4186-9501-5325edc85aa7","resolution":{"observed_at":"2026-08-02T18:29:52.663004Z","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-02T18:29:52.706872Z","title":null,"venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:52.706872Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:10da535ab0e0dabe4396f25e9559f8984126a81c8f95d4101d6ecb23187b5c73","observation_id":"de89a7a2-fe90-4ba1-b74a-83ee8dd697b7","resolution":{"observed_at":"2026-08-02T18:29:52.706872Z","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-02T18:29:52.845067Z","title":null,"venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:52.845067Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:b8ff120b6745533f785b61e1a43de532d56bcf4ff11e3eb30f4efe573433de8e","observation_id":"c1ef60ac-3d7d-4495-be0b-0e7d76dac805","resolution":{"observed_at":"2026-08-02T18:29:52.845067Z","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-02T18:29:52.936112Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:52.936112Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:d06883b6ab46aae17e56adc523762e9d841fe26a31a9c9368a78e7a223857cd2","observation_id":"a920bb96-2ce9-4413-b6ea-8c6d7f8c3d1d","resolution":{"observed_at":"2026-08-02T18:29:52.936112Z","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-02T18:29:53.008252Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:53.008252Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:e1cda6a2defb51c3fd41b314537cffcf549017fa077352f9bc94bdc6f27abf03","observation_id":"cd36a079-f3d1-4649-8d14-aedce1827b9e","resolution":{"observed_at":"2026-08-02T18:29:53.008252Z","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-02T18:29:53.079927Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:53.079927Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:cc827eb6ce4194de4daaeb4e452334070bd3f7ffbe62563d0fac6e72105822c9","observation_id":"8c8a35a3-fd6b-4d05-9fe4-dbb380cc3edd","resolution":{"observed_at":"2026-08-02T18:29:53.079927Z","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-02T18:29:53.133541Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:53.133541Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:a40f2118f3905b0c53b0fceb708add5fb6467eb54148936ad99a70e53c27c749","observation_id":"513cdda6-97a4-482f-9134-40afb9fc67c5","resolution":{"observed_at":"2026-08-02T18:29:53.133541Z","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-02T18:29:53.215768Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:53.215768Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:aceb2770b16be451449e50ec3857899baab7cee29797dda58ca4e11a9322f931","observation_id":"b4e2280a-b33d-47ac-9f4c-64282538b946","resolution":{"observed_at":"2026-08-02T18:29:53.215768Z","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-02T18:29:53.294183Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:53.294183Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:521783692e09f00bb4c226c9cd356d432ddd377751af7154b9880df88a798758","observation_id":"fc0378f0-7498-489a-b687-d77202180c53","resolution":{"observed_at":"2026-08-02T18:29:53.294183Z","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-02T18:29:53.345526Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:53.345526Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:42ef53c6648de52f867a59f50a5eb0f447a97da2c6d4185c963ea3cf3ee92f3e","observation_id":"bee12d0d-e8e9-4897-9011-493fd91092be","resolution":{"observed_at":"2026-08-02T18:29:53.345526Z","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-02T18:29:53.425671Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:53.425671Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:f28c2d1a7a8108033fcc3d87977596d2d422750bd70efc7c1c528a179786db82","observation_id":"1772cf15-9070-45b0-954e-2fc882887d2d","resolution":{"observed_at":"2026-08-02T18:29:53.425671Z","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-02T18:29:53.479160Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:53.479160Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:56b569221696a846a89ad62aa440b1c9edbffea66d516fcb130608ee3afc5510","observation_id":"cd25de19-5469-400e-b823-6ce61f055f86","resolution":{"observed_at":"2026-08-02T18:29:53.479160Z","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-02T18:29:53.564488Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-02T18:29:53.564488Z"},"links":{"citing_paper":"/paper/2603.11797"},"observation_digest":"sha256:cb96a52575e534704d8dca8662ad3a6c999c9964dd186760762e3cb18868a652","observation_id":"2d466bed-f2a0-4177-951e-f6bf9b9e7e1e","resolution":{"observed_at":"2026-08-02T18:29:53.564488Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2603.11797","last_updated":"2026-07-28T07:56:19Z","latest_version":3,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-16T13:40:09.615288Z","submitted_at":"2026-03-12T10:59:35Z","title":"The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":39,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":39},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 2 inbound Pith citation observations for arXiv:2603.11797."}