{"as_of":"2026-08-15T04:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cf066867a7228af6146ec517c31a398b4751c535ae9f8e3566aab294e260919e","coverage":[{"denominator":65,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":65,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T05:36:52.422200Z","state":"measured"},{"denominator":65,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":65,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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.22209/citation-record","integrity":"/paper/2607.22209/integrity","json":"/paper/2607.22209/citation-record.json","paper":"/paper/2607.22209"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T05:36:45.624894Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:45.624894Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:5215c2a4658530f64f6cd127753dbb488f8742f1348f10ad21307dc3cd2e18c2","observation_id":"bc4bb0f2-fb20-40e5-967c-1c9caaede881","resolution":{"observed_at":"2026-08-01T05:36:45.624894Z","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-01T05:36:45.734751Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:45.734751Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:e16aa4645df4b502b7afc507508832c056c813a3bb1d9e1b870ccc23f534fcc8","observation_id":"dbe11534-1636-4166-bf96-8fca7225b7b3","resolution":{"observed_at":"2026-08-01T05:36:45.734751Z","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-01T05:36:45.850009Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:45.850009Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:6c7d675ad9b1004920f8fda1cc5661cdbb3115c8216a7906c38c54f1324286a7","observation_id":"cb1bb67c-8bc6-436b-98af-48139a0ad605","resolution":{"observed_at":"2026-08-01T05:36:45.850009Z","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-01T05:36:45.945226Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:45.945226Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:fa861c2cb3f0a67745186681e673baa1d945f4ff990a102952b361b1936a6d95","observation_id":"aaa7c0a7-748d-40ab-8e98-00bb314299e1","resolution":{"observed_at":"2026-08-01T05:36:45.945226Z","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-01T05:36:46.046726Z","title":"Filecoin: A Decentralized Storage Network.https://filecoin.io/ filecoin.pdf","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:46.046726Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:4420800d6614d5a1e5ac9d299856f355bf8e9bb2af511d0d0076f72bb22bb647","observation_id":"5cf446e9-9ef8-44f4-a3cf-128460bd298f","resolution":{"observed_at":"2026-08-01T05:36:46.046726Z","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.4230/lipics.opodis.2021.27","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"f3790e6b-9061-4063-a7c7-566e3a252bd2","year":2021},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:46.154756Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:b60babb4818c30cb6a3243ee22534345fbece20df6fdce62365a72abba516c4a","observation_id":"2d2158c0-4729-463d-8547-1ce02e4770c9","resolution":{"observed_at":"2026-08-01T05:38:34.240505Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-01T05:36:46.214742Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:46.214742Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:49d23e8229061462a9d5bd0fc31edd55174a1cdb97ab1e932275a9939a8bdacb","observation_id":"7d8b198b-dcf0-45f4-bcd1-f1c7b9a1cf19","resolution":{"observed_at":"2026-08-01T05:36:46.214742Z","resolver_source":null,"status":"malformed_identifier"},"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-01T05:36:46.294904Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:46.294904Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:ec78a67cc2db831778a84b12c6752171f25a390c03ee13f5b5e046b20ff83692","observation_id":"aaeaa703-1dd8-4809-bb4f-2f88d8ccf193","resolution":{"observed_at":"2026-08-01T05:36:46.294904Z","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-01T05:36:46.394755Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:46.394755Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:2c1789655df844b109571b3f7db2a276bc90456767452271a75dcdd16229d971","observation_id":"dc47a82c-21cf-420d-ada8-dc1e890cbdce","resolution":{"observed_at":"2026-08-01T05:36:46.394755Z","resolver_source":null,"status":"malformed_identifier"},"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-01T05:36:46.497173Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:46.497173Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:ee8e4de76051c9108356a07132d81318e089199f808e87d78d8974a93a3ef516","observation_id":"0ed2ad1d-7363-4889-b71b-f5ef2eb2dde4","resolution":{"observed_at":"2026-08-01T05:36:46.497173Z","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.1145/1317379","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"ACM SIGOPS Operating Systems Review","work_id":"24980b40-8a2b-4c5d-85f5-43037212cba6","year":2007},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:46.537676Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:42d23dca769d945bcd94b10b5f7e18b1ea7ff3f53813e83add8f56727ca3467d","observation_id":"84a4b10b-2ccb-4795-935c-f0fef620126c","resolution":{"observed_at":"2026-08-01T05:38:33.980412Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1807.04938","last_updated":"2019-11-22T10:21:27Z","snapshot_observed_at":"2026-08-14T18:52:26.552038Z","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-01T05:36:46.655497Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:46.655497Z"},"links":{"cited_paper":"/paper/1807.04938","citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:337e1a976cd552364550873543a479a9a42810158e85acc18326ba45425bfff3","observation_id":"40ec2c3f-d8d9-4d91-aa8f-e8eb6d3d774f","resolution":{"observed_at":"2026-08-01T05:36:46.655497Z","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-01T05:36:46.793824Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:46.793824Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:062f35bf4ae3c2a9caf09e881cf66aca41d7c5d24ae8cb148478e1667bdbbc48","observation_id":"a01602e2-1f1d-4eb9-b394-272fdde477dc","resolution":{"observed_at":"2026-08-01T05:36:46.793824Z","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-01T05:36:46.945342Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:46.945342Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:d0beb1caa0283bca0da0be5eece6930e88f86f45c0a9f8b632d0d878cd0f800f","observation_id":"4df8ad44-7e17-49da-be58-0b4dfe8c8e29","resolution":{"observed_at":"2026-08-01T05:36:46.945342Z","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-01T05:36:47.056483Z","title":"2011.In- troduction to reliable and secure distributed programming","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:47.056483Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:e86fe330e8b9a01f2c0a1fbd22d19a12276bc85ce7d975b4d3d29a0665d787fb","observation_id":"d6814378-6bce-4a1f-9b94-5c8290a68ab7","resolution":{"observed_at":"2026-08-01T05:36:47.056483Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1603.07351","last_updated":"2016-12-19T17:08:40Z","snapshot_observed_at":"2026-08-14T22:04:43.989095Z","submitted_at":"2016-03-23T20:42:55Z","title":"Non-determinism in Byzantine Fault-Tolerant Replication","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1603.07351","snapshot_observed_at":"2026-08-01T05:36:47.111914Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:47.111914Z"},"links":{"cited_paper":"/paper/1603.07351","citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:64c69e2e0c59905fb7f32fea78847ada47a613762ca8a2d9c31afa504185d84f","observation_id":"744be669-ea97-4a62-8098-ff071a0a2347","resolution":{"observed_at":"2026-08-01T05:36:47.111914Z","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-01T05:36:47.197920Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:47.197920Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:72a4ed419f490f5f57ecc77ec8f48d65965eed52ee6eeef8679f909bee09e8d8","observation_id":"1ce78140-67ed-4a94-8471-0b5098fff1bf","resolution":{"observed_at":"2026-08-01T05:36:47.197920Z","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-01T05:36:47.292457Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:47.292457Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:2e7b68171c38f4bcdfaf15b1e1dd17d04040a87eed9d47b1eb0b68d8c66638af","observation_id":"033845c5-9666-47d1-8443-4d8b671521ab","resolution":{"observed_at":"2026-08-01T05:36:47.292457Z","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-01T05:36:47.416340Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:47.416340Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:708daba12f30a17e255fc331a9bfba8a0e4d0c95210c8ad92075902966821dce","observation_id":"820681b8-39e4-4295-845f-95085a5caf43","resolution":{"observed_at":"2026-08-01T05:36:47.416340Z","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-01T05:36:47.531533Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:47.531533Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:032e082b69ef02e0305345a15cbeb67d46858e4c2df09cb8dfe3ce56caf74e04","observation_id":"9d56ed21-f6e4-49d8-a617-504ff14fe7bd","resolution":{"observed_at":"2026-08-01T05:36:47.531533Z","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-01T05:36:47.647712Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:47.647712Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:6ccd631cd1d434249e9721429e94ce42b150e8ab98d9d44b647fc8ea8aa5483b","observation_id":"0c4a3a3b-cbea-4be8-b4eb-17c24ae10d8b","resolution":{"observed_at":"2026-08-01T05:36:47.647712Z","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-01T05:36:47.759743Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:47.759743Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:b5e699523fbd7153bcf2f0f8339f00951903d3e6b1ff39ffcd83c6219c49a13f","observation_id":"a67dbb4e-4011-44ac-9baf-aa2676d5580c","resolution":{"observed_at":"2026-08-01T05:36:47.759743Z","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-01T05:36:47.875108Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:47.875108Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:6368e37430bce57225e12c453d46b18c2154fd93025a041e3d174e58b73141ec","observation_id":"53c933fa-d0f2-44ce-b068-dad6f9b9f553","resolution":{"observed_at":"2026-08-01T05:36:47.875108Z","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.1145/3397190","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"ACM Computing Surveys","work_id":"f8195991-8bc8-4d16-9d1e-5bad0683b6bc","year":2020},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:47.942284Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:c3a4718a66904de5798f75d8434d71aa83d92d4577ed00bc7f834a5ad324a77f","observation_id":"f53a83e2-f04c-4072-b983-4becb0479219","resolution":{"observed_at":"2026-08-01T05:38:32.496982Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-01T05:36:48.013877Z","title":"Fischer, Nancy A","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:48.013877Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:9581af6b5286571a633ed20660754d358f011a0d8e494563ff90c3ebd75b75ae","observation_id":"01c2d051-0d1a-4b44-9fc4-0438a9c59e18","resolution":{"observed_at":"2026-08-01T05:36:48.013877Z","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-01T05:36:48.100030Z","title":"Golan Gueta, I","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:48.100030Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:22955c0d29f359c064d7bea300076f267ed5684ea89806355c6ea1c26d739da0","observation_id":"dab62853-ab6b-4ede-b621-e6faaf5e9e9d","resolution":{"observed_at":"2026-08-01T05:36:48.100030Z","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-01T05:36:48.201892Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:48.201892Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:454567abe9a842b0d5f3a2ddcd99e3c20e4f3a50b787bdcf7f508fe68a47e098","observation_id":"afc810a9-ea5d-42d6-89b7-30c5a9a4d700","resolution":{"observed_at":"2026-08-01T05:36:48.201892Z","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-01T05:36:48.339367Z","title":null,"venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:48.339367Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:86fb50fe3d2c2a6e2bc81afc6f94f2783d432f17c33a3a1bc8c0f5d757072a34","observation_id":"99f1e6bc-65e4-43ef-977f-240cec8810fe","resolution":{"observed_at":"2026-08-01T05:36:48.339367Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.07157","last_updated":"2025-09-08T19:12:50Z","snapshot_observed_at":"2026-08-07T10:18:52.292413Z","submitted_at":"2025-09-08T19:12:50Z","title":"Crossword: Adaptive Consensus for Dynamic Data-Heavy Workloads","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.07157","snapshot_observed_at":"2026-08-01T05:36:48.408036Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:48.408036Z"},"links":{"cited_paper":"/paper/2509.07157","citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:aad1694cb05f7f90650a39ed935563b95a9e25aabf85a23f9edf59f9a97ccecb","observation_id":"c2ccf4c6-7aae-4f47-8531-f4fa38afdb48","resolution":{"observed_at":"2026-08-01T05:36:48.408036Z","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-01T05:36:48.473004Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:48.473004Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:b913cc1f407c97bef304beadee8526abc566a4d1585c409fc53c9696127dda36","observation_id":"cef41e54-fc7c-42ff-b03f-24095f98c87a","resolution":{"observed_at":"2026-08-01T05:36:48.473004Z","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-01T05:36:48.545472Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:48.545472Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:fea5351a31ca484ef19ec4c86d6177605832170501928b4a5da42a5287100aeb","observation_id":"74449343-040a-4f21-b61a-8acdfae2740b","resolution":{"observed_at":"2026-08-01T05:36:48.545472Z","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-01T05:36:48.606805Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:48.606805Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:5b8a110af419664b07501c6670f7b1e401f6c2176e0d305ec851d9e36a1fb543","observation_id":"fe8117cd-761e-4dfc-aefb-e25b813e322c","resolution":{"observed_at":"2026-08-01T05:36:48.606805Z","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-01T05:36:48.643133Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:48.643133Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:3e8e2a6229964eca06beae8afb6493229ad73b7f155d73cf6692da3d14e34105","observation_id":"4a145b60-e2b5-4ec0-9b86-34d79f14a0c0","resolution":{"observed_at":"2026-08-01T05:36:48.643133Z","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-01T05:36:48.716909Z","title":"Sharma, Adriana Szekeres, and Dan R","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:48.716909Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:15d280473f1f38a8ce8ec877217a49ed48bf928f4bb7018525c921941701e4f3","observation_id":"dc89b9c0-758e-4a98-b112-c7545ae793b2","resolution":{"observed_at":"2026-08-01T05:36:48.716909Z","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-01T05:36:48.845814Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:48.845814Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:d396053a19c45d1e7dae87aff6f920759b5aa37bc60df099b393cbf1b0b39004","observation_id":"c7517f53-2a38-4181-9bb6-314708cb4be4","resolution":{"observed_at":"2026-08-01T05:36:48.845814Z","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-01T05:36:48.924915Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:48.924915Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:6ca3cf8fc39677fbee47a0b7562885aa1d75262403f8aeb9e6a660c178eac0f6","observation_id":"831cf121-7ed3-4087-8965-9eddfa47c644","resolution":{"observed_at":"2026-08-01T05:36:48.924915Z","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-01T05:36:49.019605Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:49.019605Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:f7401da38bb4c3d23920175020558364397da1b356e3480e58095746a6e419a0","observation_id":"e8bb4ce7-27f8-41d9-b402-f4c10300ca86","resolution":{"observed_at":"2026-08-01T05:36:49.019605Z","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-01T05:36:49.130414Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:49.130414Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:9928f84e0a26c6a41c44fe25b3a44c539c5d85032c6930249630710d5219d617","observation_id":"6513d721-ac70-4add-beb0-1abf436e4d55","resolution":{"observed_at":"2026-08-01T05:36:49.130414Z","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-01T05:36:49.216653Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:49.216653Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:e23cacb1e7f75bf0c472025066deb6be3a32688efbcd8d5f752fc0808d631c00","observation_id":"6f190a58-019c-48ec-81f4-e7a95ebcbb07","resolution":{"observed_at":"2026-08-01T05:36:49.216653Z","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-01T05:36:49.431121Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:49.431121Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:5bbcd42a518231c7df740498529bbff5f1d98afea902501be8ffdf85d2c21f67","observation_id":"0722b928-600c-4c81-982f-2a93ddc046d2","resolution":{"observed_at":"2026-08-01T05:36:49.431121Z","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-01T05:36:49.543606Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:49.543606Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:79b9e80bda650241b72a3743ecbe1bf59f5b6c3c21f88c9b3cb008e934bc0572","observation_id":"6bdd422c-d2ab-46d0-94e2-db01eef21189","resolution":{"observed_at":"2026-08-01T05:36:49.543606Z","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-01T05:36:49.683523Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:49.683523Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:c561a17f6dd44f2b6770cdd1a07bc000e33e13fcdf53e6b0027dc589a5caf09c","observation_id":"2d397142-f5e9-44bf-b994-fd4e207d3d52","resolution":{"observed_at":"2026-08-01T05:36:49.683523Z","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-01T05:36:49.810183Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:49.810183Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:8628bb081039591195932d849d66e6631bc29c057009bee15ae86c1751b6819a","observation_id":"7fa18fe6-4fba-400f-9c09-b1bf4135bc30","resolution":{"observed_at":"2026-08-01T05:36:49.810183Z","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-01T05:36:49.946311Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:49.946311Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:dc7ae6b808dc2738b71641264f80f91f16568085ef336a60997624be6bcef7bc","observation_id":"23624819-32ab-495f-b655-fb823209129c","resolution":{"observed_at":"2026-08-01T05:36:49.946311Z","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-01T05:36:50.074614Z","title":"Pinar Ozisik, Gavin Andresen, Brian N","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:50.074614Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:be181103331f77c5098c3fea974b5de6afe117b0e3899ec479b3553b6ad76d79","observation_id":"59a4453c-44c2-44c3-a076-bda3e4762232","resolution":{"observed_at":"2026-08-01T05:36:50.074614Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2601.03390","last_updated":"2026-07-02T17:24:25Z","snapshot_observed_at":"2026-08-09T04:53:51.108577Z","submitted_at":"2026-01-06T19:56:15Z","title":"Practical One-Round-Trip BFT Replication","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2601.03390","snapshot_observed_at":"2026-08-01T05:36:50.239737Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:50.239737Z"},"links":{"cited_paper":"/paper/2601.03390","citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:b0591b3fb8647b0777ec0368be179a663f59e0d23dd45a9fba997aeade73783b","observation_id":"6457cb48-5d63-45ad-9d48-333adeb31126","resolution":{"observed_at":"2026-08-01T05:36:50.239737Z","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-01T05:36:50.398956Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:50.398956Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:0fc9a496e9e7bf06c2018cf6901931ef97422a9b8ad870b721dcc38ddfabc560","observation_id":"84578238-7265-40b1-9793-116e72a05074","resolution":{"observed_at":"2026-08-01T05:36:50.398956Z","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-01T05:36:50.561989Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:50.561989Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:fd8ab22b3c22a5929a5b5ee45bd6668c71a56ae81a0ead1c9f7bb6f5aa16f676","observation_id":"47621597-02cb-4638-acc9-04e883c44861","resolution":{"observed_at":"2026-08-01T05:36:50.561989Z","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-01T05:36:50.854090Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:50.854090Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:0a5b9d48d1ec643c9bb68fbc8ccefa5098bfd2e117da7b9c73ab6d2952ef89f2","observation_id":"d275c175-4cf3-421d-9150-3ffba4e63213","resolution":{"observed_at":"2026-08-01T05:36:50.854090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.08936","last_updated":"2020-08-24T14:54:44Z","snapshot_observed_at":"2026-08-14T16:12:43.994747Z","submitted_at":"2019-06-21T03:55:19Z","title":"Scalable and Probabilistic Leaderless BFT Consensus through Metastability","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.08936","snapshot_observed_at":"2026-08-01T05:36:51.023314Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:51.023314Z"},"links":{"cited_paper":"/paper/1906.08936","citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:15d6df5bc48d7ed6091af2fc03fedb57ae5e2ddf4d86b55c58194ff22baab6d9","observation_id":"27d84124-06ed-4d6a-9285-831b02a2fc73","resolution":{"observed_at":"2026-08-01T05:36:51.023314Z","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-01T05:36:51.146230Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:51.146230Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:aafcd42af9138ca42ae63a2e4dad466235b5c7dac661ee260c24f0630adb03aa","observation_id":"734ee5ef-8886-424c-976b-ad7e4e8057c4","resolution":{"observed_at":"2026-08-01T05:36:51.146230Z","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-01T05:36:51.216220Z","title":"Schneider","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:51.216220Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:198f9956fcfb969f021ee277a482ceee9aaebd2e1df9005c46e8d3ec8a4ffa0f","observation_id":"05c03cf1-3df1-42fe-8e92-32f65cdc79e1","resolution":{"observed_at":"2026-08-01T05:36:51.216220Z","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-01T05:36:51.285441Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:51.285441Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:fff960cc4284f92c32d43366cf34711e28ed33c673c241bd8ebaaf62f7eb01f8","observation_id":"853eac4d-6610-4f66-ab1a-09da38b8e7c7","resolution":{"observed_at":"2026-08-01T05:36:51.285441Z","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-01T05:36:51.395524Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:51.395524Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:dbd5f9e25496d2dda435773e60a51374508a714c31af91cc1427ca5f0a1c2c87","observation_id":"db852555-7ae5-475d-b093-0d2cc9e02b03","resolution":{"observed_at":"2026-08-01T05:36:51.395524Z","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-01T05:36:51.496742Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:51.496742Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:1ebee8787abce83d90e634591a3118dfc5862c2ce6444e7cbf09d0dfe5d7213b","observation_id":"001e1ba6-6ace-400e-af36-e20e20db19f0","resolution":{"observed_at":"2026-08-01T05:36:51.496742Z","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-01T05:36:51.545820Z","title":"Frans Kaashoek, and Hari Balakrishnan","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:51.545820Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:827f9ae083f5e458cb784b001b92fc1b695715cb67630563f6ec1a49585ec8ee","observation_id":"860a9b9e-321a-48e1-9d74-244b9a55e08d","resolution":{"observed_at":"2026-08-01T05:36:51.545820Z","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-01T05:36:51.605314Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:51.605314Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:f223b301e81b6399d772d6ae997d74c7204871fc6f56d936c37fd37b84085ac8","observation_id":"bcec419f-0ed4-49e5-9000-ccfe8444d6c5","resolution":{"observed_at":"2026-08-01T05:36:51.605314Z","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-01T05:36:51.815626Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:51.815626Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:2958484e45e855dbf00bae5fc573305437b9b90f1eb9696d7a8cba341f7dd883","observation_id":"bafd7683-2763-4086-a980-c30469ab3900","resolution":{"observed_at":"2026-08-01T05:36:51.815626Z","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-01T05:36:51.954732Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:51.954732Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:78b079620df749e7e694b1919858f6712a8c2746cd75807918437f58d5e2ed97","observation_id":"17fa3b8e-0d7e-452e-8bd1-e686ae7c77be","resolution":{"observed_at":"2026-08-01T05:36:51.954732Z","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-01T05:36:52.108747Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:52.108747Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:69b3c4bb01cd57a5760acfacaa11baa322d085ce63a9a0adc503c33919d394f2","observation_id":"c175df47-389d-4b16-941a-cd4cfb7013cb","resolution":{"observed_at":"2026-08-01T05:36:52.108747Z","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-01T05:36:52.297082Z","title":"Reiter, Guy Golan Gueta, and Ittai Abraham","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:52.297082Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:c88dbe5c61b9067e77b395a6af1d4e888f5e8e27c01eee15076d1d3b3fce4680","observation_id":"a56a89bb-749f-4d92-bfe3-a6bbb16bb03c","resolution":{"observed_at":"2026-08-01T05:36:52.297082Z","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-01T05:36:52.422200Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:52.422200Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:6b2f8dbb30d63c5ed900d2962c761eb87d8fcdf94304e0de84c3d827fc70eb3c","observation_id":"bac7c08c-851a-4ffb-a486-0df2f905c4ab","resolution":{"observed_at":"2026-08-01T05:36:52.422200Z","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-01T05:36:49.312213Z","title":null,"venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:49.312213Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:8fc5abaa26ef62b52ca3752c4b72bfe3b29399f6dac2679fb8e34ea6c61d3d36","observation_id":"e09a728f-40cf-415a-8834-07398899ec97","resolution":{"observed_at":"2026-08-01T05:36:49.312213Z","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-01T05:36:48.287076Z","title":"In24th USENIX Security Symposium (USENIX Security 15)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:48.287076Z"},"links":{"citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:1f2edec5ee07337ba2e9ea2eae36b4da89d1dc75e33a3a9bb564bce70adc1a60","observation_id":"50a55b80-c1f1-4536-92e7-603f386a0907","resolution":{"observed_at":"2026-08-01T05:36:48.287076Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.03052","last_updated":"2020-05-11T18:27:40Z","snapshot_observed_at":"2026-08-13T23:20:06.834758Z","submitted_at":"2020-03-06T06:39:10Z","title":"Combining GHOST and Casper","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.03052","snapshot_observed_at":"2026-08-01T05:36:47.005227Z","title":"arXiv:2003.03052https://arxiv.org/abs/2003.03052","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-01T05:36:47.005227Z"},"links":{"cited_paper":"/paper/2003.03052","citing_paper":"/paper/2607.22209"},"observation_digest":"sha256:acb39699521c681a766d3632ce8a597781061e11affb9ed840ffc687f525768e","observation_id":"365f4bf0-5433-4279-ad51-39e4e61beb00","resolution":{"observed_at":"2026-08-01T05:36:47.005227Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.22209","last_updated":"2026-07-24T11:25:59Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-14T13:19:53.217075Z","submitted_at":"2026-07-24T11:25:59Z","title":"Duet: Co-Optimizing P2P Message Propagation and Rotating-Leader Consensus"},"reference_resolution":{"displayed":65,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":60,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":65},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 0 inbound Pith citation observations for arXiv:2607.22209."}