{"as_of":"2026-08-08T21:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:93682cdafb06b99bcc2ac07fa2f429a0e2441e8206e9fe426c57ad997baf1dc2","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-08T06:32:00.761636+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-03T16:33:29.927781Z","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:e6335cd6a80ef4c030b078ddb44179ab73c157748a98dc1d6c924803a6626f1c","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-03T16:33:29.927781Z","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:b48c1afafe2e59cd6d8bf6ab029a0f70f9a4b33304fd29620d63c5f635e56fcb","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-03T16:33:29.927781Z","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:2eb385401d8c9b08b77c174673cb9afeb33ba44f820b7eb4f432ef3803167536","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-03T16:33:29.927781Z","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:7dc2f7e40564ba91e02619babc22843e9bf6b83d9e669ce56f3381bc532b0196","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-03T16:33:29.927781Z","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:c4c239700e9fdd5ac0fda695162a38536ce511e4b8c90f58253993479c685895","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-03T16:33:29.927781Z","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:170bb84e52d861cb9355e9b590cb79492b76957b0a3f8db33b277211ac12591b","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-03T16:33:29.927781Z","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:ae66695d77c2aaa1886f4be87f748bc91240b79056f38982c01d36a2cdf8d6c3","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-03T16:33:29.927781Z","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:74007cbdb51f7162088f2f4030a3a3fc581a3a101f07e5efa41042e0de04b568","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-03T16:33:29.927781Z","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:63fbffd6df137cd0aee7b4dc03c524ab261d1cec267cf12f88bdbad6035e77ea","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-03T16:33:29.927781Z","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:cd7636eb281b0734b662bccd0409b6d8c57dbb4c590f77e87778067f86efc953","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-03T16:33:29.927781Z","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:ff9a2f912576ce197beb2e7484a2f786fc7ef6c8a4dd9a19d9c1e7acbe54ca0a","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07-06T06:49:58.018213Z","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-03T16:33:29.927781Z","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:bb3868898fa329c94960fc7b8321503b871c2992f6bc6711bba7ea19eca98882","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-03T16:33:29.927781Z","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:184783797ec019ca5af1cdd503ab12143109d679ff266a705a360d55db713188","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-03T16:33:29.927781Z","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:797f97f32ac142017bb14e38d007dda528fd750015d55b6df372fd1c024a7fad","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-03T16:33:29.927781Z","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:b473008768b8290e8740de0ec06d7666b8ded86f78c4139ef99ccf5e6762081d","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-08T09:18:50.141320Z","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-03T16:33:29.927781Z","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:6ebe065af212c2cdb9c27eb3a67b32f9130dcda1b36507452f382783fa4b0a10","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-03T16:33:29.927781Z","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:2c974cba4397d151ebeb671c820a7816fb3ef36e82558726bbe443eb326272c3","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-03T16:33:29.927781Z","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:f4532557603721f4b84fd39485681e06b44071cc72f0af07aeaa461b4df6236c","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-03T16:33:29.927781Z","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:751daca49c9109d422717463cc50b70634cb24a6d71a604bd879509d7d927bad","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-03T16:33:29.927781Z","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:255dd028ff8155f6ccf698b52e64671d95b65233c102a1917f0ee8819f9a3f54","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-03T16:33:29.927781Z","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:6cb2b9c22424417b11454996a06a6e5c049a40dfa0cf5f74dbc49a7b674a0415","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-03T16:33:29.927781Z","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:616a5fbeeb474cf56b1c3cde35f2b2890ce0b50998fffd7bf9cf885509829763","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-03T16:33:29.927781Z","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:27f1b4b4377fafeea5d3c77325cd40be84f833a76e6a3ab409a48ecfa6606029","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-03T16:33:29.927781Z","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:60968d603b1ea3edf01e8c4907d5689fef5554cb57450beb1f5d6e18ab85fa75","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-03T16:33:29.927781Z","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:0630a4358369860424724e7fa23323d7d7675692aa316f169b8d27211f2e9441","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-03T16:33:29.927781Z","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:43451ca919a9cccaa8c2969591cc37ce0faaf95ca8dfdc891d0b0d26138c4c49","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-03T16:33:29.927781Z","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:cd89f8e6c9bc599301226e29a05641973ac918f2ace515590e658b433e1706ea","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-03T16:33:29.927781Z","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:3ff66d10b007fbcd87fdf41bc989ae48e5fefc6eea71a6f6e2f8543f4812ed5f","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-03T16:33:29.927781Z","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:2a17cef66821a45a7defc1c0b352fc0bf4f978d801b77aec8345c5b9e6b5c8e5","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-03T16:33:29.927781Z","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:a23d3212995989dd45e41c9c9863641a515fb187b0e510724d2b4570a750473a","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-03T16:33:29.927781Z","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:cd49aaeb031670e84718440e4071e302f008461045d6dd877c406a61aa9d9d92","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-03T16:33:29.927781Z","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:cb7d8c31acdeed322f442777f797c86de1cb9b8c591a7e518f298f802da5881b","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-03T16:33:29.927781Z","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:d2096104a00c9c727662febaa12bbfdb6dbc646e81bc6eafeb59dc6de234e73e","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-03T16:33:29.927781Z","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:5f621980f72d79925652df9ec55738ef9280dd7f2a7228ee52862c0fe4524cff","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-03T16:33:29.927781Z","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:1a60846aeac48acbc0c87e95b7962ef5bc98e9bdcb5eb6e92d59b23a91899878","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-03T16:33:29.927781Z","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:db20a4fa5429cb17e59ec44c2207d4cff2a8389740d7f8dabfdb030ac240a15e","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-03T16:33:29.927781Z","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:951c9d27197a1f0c1d6915687421005f1bd1beaf0de0e690dc2940855f2103dd","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-03T16:33:29.927781Z","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:b84111f443635a75a049e77ce272c060fac11e2bc80c6691d94220de222438a7","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-03T16:33:29.927781Z","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:047fabe3d3bc6a91a41de03a291f2fa1c3056cf2778dc5e4f7efbc6f87a974a5","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-03T16:33:29.927781Z","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:a804d54be045ee7a15b1e6168ae40d3c66d41831b62622911a866137c76719b1","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-03T16:33:29.927781Z","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:32d3210faaf6122ca46d12f4f7bf98f7b5af21d4570457548d0b607a0b2670af","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-03T16:33:29.927781Z","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:8d167f943be1527e748c5037eec53eb8d7e7c6d632d9cf2c8a1004ba9257b808","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-03T16:33:29.927781Z","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:6aa4452da3a723cd6f34eacb19aec5c897c98919f50871aee443696c5f6a5241","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-03T16:33:29.927781Z","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:2a0ea6a5ea8065c9073532ed50bb167879e045cee134f9b51c77c2625c8d1c4b","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-03T16:33:29.927781Z","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:fb871cd0beda67fcff43c7bbfbadd0f3b6a63760ac856145b09e57a2046e57a5","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-03T12:23:23.857496Z","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-03T16:33:29.927781Z","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:538983d1fffff5c7d270e73f5497d1375a01f3841da46355509f041237f14b1d","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-03T16:33:29.927781Z","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:7ebaf2974d9b8f98d4387521309bc0a43f89bdd4c6439f7f0872080849acf3f2","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-03T16:33:29.927781Z","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:61a224988588311b59d440afbddb024f24034f7770f0afa7c3996727dea77951","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-03T16:33:29.927781Z","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:fa3ce5f92972d09da005d0a25179ea39c067eb42a403ea77869990b08ceabc44","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-04T15:33:01.386998Z","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-03T16:33:29.927781Z","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:e9f6e556837b7a76061c5babde5068d7ec9fab2daab7b9d9864f6c9ab7fa8f48","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-03T16:33:29.927781Z","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:b5999ce32fb7f3f9a8b8d83542ed175ef4d9820f4dc425d1ce5e23e38770f3a4","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-03T16:33:29.927781Z","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:3293ff6974824ca3d85f17c2872f0e8a1e9ad686390897b86306277608bf5b96","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-03T16:33:29.927781Z","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:6d8afd6ff4856c69224046be4d6a6ff0c14f1cea4e32c61cb6a5791454bf9de9","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-03T16:33:29.927781Z","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:d11046342c216c87583f4d61e704fc3187a346151ca01af2ac4c158ea4376832","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-03T16:33:29.927781Z","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:748549e4f148f744a10d6f4803e044ac29598a5b6b815141c025f31a36db4d81","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-03T16:33:29.927781Z","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:21bd813052a91d50a45161aceddf7009da14dba5cbc36eb4e7b691ac7b8f0f2a","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-03T16:33:29.927781Z","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:5144434a2cee464fd228bd3c8017c3ed75aa775a83cb01c4a00d6d0d1c5b62e2","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-03T16:33:29.927781Z","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:6b99c5106b96e4917ed48f3d92b63ca2668be324c2a41b0e1eae97f42791c797","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-03T16:33:29.927781Z","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:df3578de9704194fb437b7ace5362f2b836ef6a617c27b43be691e6b9036fa06","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-03T16:33:29.927781Z","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:d123345719688b0416864c29be2e9302f00e1eaaa0720f45e2b7807e85de562d","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-03T16:33:29.927781Z","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:b719c5b92153143fc173205b148e9527911defc9e61afd40e1a0a2ada63dbfed","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-03T16:33:29.927781Z","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:873c1ceda24f388c7b18b09caf90648fec3a2e94c53f0604cd27cd429a11fb66","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-03T16:33:29.927781Z","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:ce929688a8a7dffacc659d030912db089f48368333c198385f4f0f7c102f07fb","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-03T16:33:29.927781Z","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:4ea65d25c674b122273e54df166f10b3934c3962fb1c988b63b6188ca8cab34d","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-08T08:04:45.346264Z","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-03T16:33:29.927781Z","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:625d3c8717da6c75bbcae20a13ccbc50e9ece31d82d6a19d1a5869f4186287ef","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-03T16:33:29.927781Z","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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 65 of 65 outbound references and 0 inbound Pith citation observations for arXiv:2607.22209."}