{"as_of":"2026-08-08T12:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:92f0ee496396a19f0c739128e29febfe74e700abc6fb296e854010bdfc2228e9","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T05:30:50.383855Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"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/2608.02533/citation-record","integrity":"/paper/2608.02533/integrity","json":"/paper/2608.02533/citation-record.json","paper":"/paper/2608.02533"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T05:30:50.316912Z","title":"SIAM Journal on Computing , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.316912Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:5807accd1e48af17e5fc7d3f73dbffc326fd1bba9691a0321c8c5a5e7e4368dd","observation_id":"4da70b8e-7e40-4239-8320-00c02d886815","resolution":{"observed_at":"2026-08-04T05:30:50.316912Z","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-04T05:30:50.319402Z","title":"Computational complexity , volume=","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.319402Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:dbcab9877f49f9dabb90b2ce120170e6daefeb250ee67853d28dd5ef9755c51c","observation_id":"ed30c879-3952-4d67-a4a8-b4e222fff3a7","resolution":{"observed_at":"2026-08-04T05:30:50.319402Z","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-04T05:30:50.322695Z","title":"8th Innovations in Theoretical Computer Science Conference (ITCS 2017) , pages=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.322695Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:3984cfe1bac52d1b067a4fd9069c09cbb35025cf3fe84896efe48670206e89a0","observation_id":"1b3b9fc4-8fdf-4e4c-8414-ff19f69052af","resolution":{"observed_at":"2026-08-04T05:30:50.322695Z","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-04T05:30:50.325264Z","title":"SIAM Journal on Computing , volume=","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.325264Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:7c24627422546506fb0020e5012419417119d7f2b845589e26a86bc19c8f03f7","observation_id":"5cab194d-b7e6-4909-ab77-dc442a152d98","resolution":{"observed_at":"2026-08-04T05:30:50.325264Z","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-04T05:30:50.327573Z","title":"50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) , pages=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.327573Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:0c90e46295f26f84d08857d13f810c43321cdc3fa110eecea0e2c16b5567e0eb","observation_id":"7a18ad6d-77e1-450f-bc6c-dcd57f3a35f4","resolution":{"observed_at":"2026-08-04T05:30:50.327573Z","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-04T05:30:50.330671Z","title":"International Conference on Algorithmic Learning Theory , pages=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.330671Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:a4effe666e0fa61fdff22d046569f832453237d955ffd9a21f97a0e95262fb91","observation_id":"01ebca47-2ea3-44d0-bbef-d20731d04d46","resolution":{"observed_at":"2026-08-04T05:30:50.330671Z","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-04T05:30:50.333039Z","title":"2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) , pages=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.333039Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:ae85d11a141aec056ae4be23056030df4dd8913295f9aa4d6f79ef28bbde22e4","observation_id":"97a787be-7e31-40a1-ac7b-c8d00538d544","resolution":{"observed_at":"2026-08-04T05:30:50.333039Z","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-04T05:30:50.335136Z","title":"independent set , author=","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.335136Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:cd967c90350ae32455790da4ba49979a1a289454a61ae673791b488d9fe03503","observation_id":"a21a36be-4a3e-4498-a54c-81e50954788c","resolution":{"observed_at":"2026-08-04T05:30:50.335136Z","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-04T05:30:50.337856Z","title":"Combinatorica , volume=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.337856Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:56b80be329f5e0c9c8de7731b6d3075e0a83f6456ee87952b2c11819dac26e3b","observation_id":"545ecccd-bb10-4f4b-92c9-c4bb8e47c232","resolution":{"observed_at":"2026-08-04T05:30:50.337856Z","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-04T05:30:50.339953Z","title":"the electronic journal of combinatorics , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.339953Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:d8ae5704a7f4d080f65dae1ed0d668fb91507a4b56823a5f9c423684c52e55f4","observation_id":"65d88f36-eeca-4a38-bbd5-05314a3bcf92","resolution":{"observed_at":"2026-08-04T05:30:50.339953Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.28915","last_updated":"2026-05-27T17:50:03Z","snapshot_observed_at":"2026-07-06T23:38:23.512460Z","submitted_at":"2026-05-27T17:50:03Z","title":"A note on the Alon-Saks-Seymour problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.28915","snapshot_observed_at":"2026-08-04T05:30:50.342991Z","title":"arXiv preprint arXiv:2605.28915 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.342991Z"},"links":{"cited_paper":"/paper/2605.28915","citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:ebdbcb8f3f6b5e1dff3ef0bc5b5154bdcd12f0734d9f1bbd729d0c39c655a49b","observation_id":"89a9cb6d-0935-4b50-8566-891b25f4d861","resolution":{"observed_at":"2026-08-04T05:30:50.342991Z","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-04T05:30:50.345393Z","title":"Tech report 91-14, DIMACS, Rutgers University , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.345393Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:663b7cef521606592dda72c679c010a0c4d9cf469d9dd5b0d3e290ab7da33c51","observation_id":"04987de3-cd12-40ae-b629-30bc942d6326","resolution":{"observed_at":"2026-08-04T05:30:50.345393Z","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-04T05:30:50.347493Z","title":"Proceedings of the twentieth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.347493Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:25da1e736f8bacab4e8b705baeda9dfaa1f472b8a3f15ebde0afd970b040f406","observation_id":"af836749-5523-43cf-b8b1-beb25c567360","resolution":{"observed_at":"2026-08-04T05:30:50.347493Z","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-04T05:30:50.349511Z","title":"European Journal of Combinatorics , volume=","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.349511Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:886b8d891117f94a832238475486717a32b7269678bed491c9752f5531649efa","observation_id":"97d864db-3a70-4623-bbef-45d66d7eadba","resolution":{"observed_at":"2026-08-04T05:30:50.349511Z","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-04T05:30:50.351852Z","title":"Discrete Applied Mathematics , volume=","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.351852Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:7a0bb8e1550e58693bf603f6c24cd6ea0af7a323f40eff10577134cee0a04d6e","observation_id":"4afba7f9-6d96-4683-acd5-52af709c70d3","resolution":{"observed_at":"2026-08-04T05:30:50.351852Z","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-04T05:30:50.353720Z","title":"Discrete Applied Mathematics , volume=","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.353720Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:e88c52d35da7d05ea393525c5d814ef694bddba7cf777f725a0b9fc1c4740e3c","observation_id":"38923e79-5da1-40e9-80cf-062336736451","resolution":{"observed_at":"2026-08-04T05:30:50.353720Z","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-04T05:30:50.355662Z","title":"approximate degree and quantum implications of Huang’s sensitivity theorem , author=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.355662Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:2d33482695d1af1d666bdc81c8290446a680a27539c1340e5c3479cc6a3868ef","observation_id":"fd98c51a-605d-44be-a701-32f179c10922","resolution":{"observed_at":"2026-08-04T05:30:50.355662Z","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-04T05:30:50.358035Z","title":"1986 , publisher=","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.358035Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:5820dd765aa8b27da660bd6ebc93d4cb5b730d6a240773347cd3baff522b18dc","observation_id":"0ead82b5-0614-4d8e-aa2a-034f764c17f4","resolution":{"observed_at":"2026-08-04T05:30:50.358035Z","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-04T05:30:50.360168Z","title":"Machine Learning , volume=","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.360168Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:035b012a51dc64d7d96ceddc8a65a5ac19bbbc30687d364d05908117d9eecd3e","observation_id":"5bd613cc-8553-426a-8635-4801d6ad4cea","resolution":{"observed_at":"2026-08-04T05:30:50.360168Z","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-04T05:30:50.362076Z","title":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.362076Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:9e4620629ec9ffd53f520d62181c4232d3675b369f39dfc47ef2b2ef134196b7","observation_id":"3c84c92e-6ee6-4401-a924-3e8d7a9cef21","resolution":{"observed_at":"2026-08-04T05:30:50.362076Z","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-04T05:30:50.364203Z","title":"computational complexity , volume=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.364203Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:39e257cf7cba920f98886f1cc862e1f5d19e424779680b5b09a4f6611d1fd7a5","observation_id":"51dc262f-2c3b-4cc6-9504-c1796a6375f4","resolution":{"observed_at":"2026-08-04T05:30:50.364203Z","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-04T05:30:50.366019Z","title":"Proceedings of the forty-sixth annual ACM symposium on Theory of computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.366019Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:b3d970225002a8957dc11a76a7b45b8e2dfcb5750da5be7c1a3e036f8bb2e0b8","observation_id":"ff5e00e3-3d7b-4306-b679-d9664653aaf6","resolution":{"observed_at":"2026-08-04T05:30:50.366019Z","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-04T05:30:50.367906Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.367906Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:796ea6fa10304763d4b7965912f023a9d3ebe7c9cba7a24c0ec907f8e0909668","observation_id":"bfa932ac-a1dd-4837-a0b6-e567afa9934d","resolution":{"observed_at":"2026-08-04T05:30:50.367906Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.03415","last_updated":"2020-12-07T02:10:37Z","snapshot_observed_at":"2026-07-06T10:21:14.277598Z","submitted_at":"2020-12-07T02:10:37Z","title":"On Query-to-Communication Lifting for Adversary Bounds","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.03415","snapshot_observed_at":"2026-08-04T05:30:50.369964Z","title":"arXiv preprint arXiv:2012.03415 , year=","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.369964Z"},"links":{"cited_paper":"/paper/2012.03415","citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:ee287d2ce543469ded570b72537f456d1ab89ca7c60b0ce01fe5ad9d758e7976","observation_id":"0c69e2a0-c17a-4b33-a74e-ca85ce05c98d","resolution":{"observed_at":"2026-08-04T05:30:50.369964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.00029","last_updated":"2022-08-09T21:16:42Z","snapshot_observed_at":"2026-07-06T13:36:51.591221Z","submitted_at":"2022-07-29T18:20:03Z","title":"Communication Complexity of Collision","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2208.00029","snapshot_observed_at":"2026-08-04T05:30:50.372494Z","title":"arXiv preprint arXiv:2208.00029 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.372494Z"},"links":{"cited_paper":"/paper/2208.00029","citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:201325ecb6bc598f0697de463645ec08a3c3815e62bd0ad64dbdc88106802460","observation_id":"c5b06d5e-03f7-42c6-9c9d-58d63cd86cc8","resolution":{"observed_at":"2026-08-04T05:30:50.372494Z","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-04T05:30:50.374976Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.374976Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:313c35037391fbac5f69e53b683f2deb4f5b3aedce73b0b8b6c62194d516dd63","observation_id":"64f9cdcf-dbaa-4ef0-943e-858baa74741a","resolution":{"observed_at":"2026-08-04T05:30:50.374976Z","resolver_source":null,"status":"parse_uncertain"},"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-04T05:30:50.377484Z","title":"2018 , publisher=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.377484Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:fa7068eb95401662962a38dd62378fe3bee6844281fc6eefc51f98292addcb2d","observation_id":"0f93d1eb-a035-4688-b0ab-59fd150318d1","resolution":{"observed_at":"2026-08-04T05:30:50.377484Z","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-04T05:30:50.379479Z","title":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.379479Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:32ee7066ece4511f93463b1c46a8f8e7d00b700eac599945f3616a2b4041f2e3","observation_id":"5f0258dc-448b-492d-a1a8-3d14db286cad","resolution":{"observed_at":"2026-08-04T05:30:50.379479Z","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-04T05:30:50.381887Z","title":"partition number , author=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.381887Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:f90055081b2fdfdba482c3eaa05c51795cc79eafda0dce6c95a1776292b53da4","observation_id":"3dc4f630-a80f-40c5-bda7-7998b3ad1e78","resolution":{"observed_at":"2026-08-04T05:30:50.381887Z","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-04T05:30:50.383855Z","title":"Gao and B","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T05:30:50.383855Z"},"links":{"citing_paper":"/paper/2608.02533"},"observation_digest":"sha256:c12023908977c6a976d64561d696ad3812f260ab9e6279aa614b6050580c2bf1","observation_id":"dbcbe97a-6d80-4e5d-ab38-3e276a748125","resolution":{"observed_at":"2026-08-04T05:30:50.383855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2608.02533","last_updated":"2026-08-03T17:26:54Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-06T23:39:09.197984Z","submitted_at":"2026-08-03T17:26:54Z","title":"Optimal Unambiguous DNFs and Alon-Saks-Seymour"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":1,"unresolved":29,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":30},"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 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2608.02533."}