{"as_of":"2026-08-16T10:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:56f63fbd1799836092e7867aba34fd66e409663688f3e2e8134ff81849184aaf","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:00:54.717683Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.06183/citation-record","integrity":"/paper/1908.06183/integrity","json":"/paper/1908.06183/citation-record.json","paper":"/paper/1908.06183"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:00:54.982174Z","title":"Mastermind Revisited","venue":null,"work_id":"5fb670ab-6189-4226-962b-05ee76ab35c7","year":2004},"citing_paper":{"arxiv_id":"1908.06183","last_updated":"2019-08-16T21:26:14Z","snapshot_observed_at":"2026-08-16T03:34:09.750589Z","submitted_at":"2019-08-16T21:26:14Z","title":"Search Algorithms for Mastermind","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:00:54.652084Z"},"links":{"citing_paper":"/paper/1908.06183"},"observation_digest":"sha256:4ec29708f871b4b78679b8047561ee886228ebbe34d09449489d2c6afb9760c4","observation_id":"eca3e3c5-9d0a-4803-a265-38d3446ed60f","resolution":{"observed_at":"2026-08-14T13:00:54.987387Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:00:54.963507Z","title":"An Optimal Mastermind (4,7) Strategy and More Results in the Expected Case, 2013","venue":null,"work_id":"5547198d-00ee-431a-9a63-95451226316e","year":2013},"citing_paper":{"arxiv_id":"1908.06183","last_updated":"2019-08-16T21:26:14Z","snapshot_observed_at":"2026-08-16T03:34:09.750589Z","submitted_at":"2019-08-16T21:26:14Z","title":"Search Algorithms for Mastermind","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:00:54.657990Z"},"links":{"citing_paper":"/paper/1908.06183"},"observation_digest":"sha256:3ce7e1b7696e42f80f875c7ec680eaa84f5288360ac12a42e3f3585bb1603447","observation_id":"661070e3-fae6-4c35-bddc-40a9e7c7e902","resolution":{"observed_at":"2026-08-14T13:00:54.969384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:00:54.945407Z","title":"The Computer as Mastermind","venue":null,"work_id":"c8f1c3bf-d82c-4cff-9858-0f0854599848","year":1976},"citing_paper":{"arxiv_id":"1908.06183","last_updated":"2019-08-16T21:26:14Z","snapshot_observed_at":"2026-08-16T03:34:09.750589Z","submitted_at":"2019-08-16T21:26:14Z","title":"Search Algorithms for Mastermind","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:00:54.663053Z"},"links":{"citing_paper":"/paper/1908.06183"},"observation_digest":"sha256:472531a7a131d4bccb5d50aeef8e06c0ccfe148b61fc6577237bf204815ac3e4","observation_id":"5e40b10d-22aa-4942-b1d6-7df70e48b1da","resolution":{"observed_at":"2026-08-14T13:00:54.950571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:00:54.928510Z","title":null,"venue":null,"work_id":"1d10ddf3-96f5-4f58-9f65-1e2492f933ff","year":1984},"citing_paper":{"arxiv_id":"1908.06183","last_updated":"2019-08-16T21:26:14Z","snapshot_observed_at":"2026-08-16T03:34:09.750589Z","submitted_at":"2019-08-16T21:26:14Z","title":"Search Algorithms for Mastermind","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:00:54.668230Z"},"links":{"citing_paper":"/paper/1908.06183"},"observation_digest":"sha256:a7d8ff2796eac2d38b401d970414889c80e7e2793e106889b5c2266b1f0307d0","observation_id":"c179ba16-ee5e-444d-b81a-c83a5940f622","resolution":{"observed_at":"2026-08-14T13:00:54.933962Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:00:54.906328Z","title":"Mastering Mastermind with MCMC","venue":null,"work_id":"4a70f307-af7c-4fb8-b212-843ec1849a2b","year":2018},"citing_paper":{"arxiv_id":"1908.06183","last_updated":"2019-08-16T21:26:14Z","snapshot_observed_at":"2026-08-16T03:34:09.750589Z","submitted_at":"2019-08-16T21:26:14Z","title":"Search Algorithms for Mastermind","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:00:54.673197Z"},"links":{"citing_paper":"/paper/1908.06183"},"observation_digest":"sha256:3bc2e798942fee459437046844d7e1ad6c4985afbcd71d44343f179701249ed8","observation_id":"4dd1f604-d183-43cd-b844-64c2f47df488","resolution":{"observed_at":"2026-08-14T13:00:54.915361Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:00:54.888226Z","title":"A Heuristic Hill-Climbing Algorithm for Mastermind","venue":null,"work_id":"a631612b-624f-4bb8-8e2f-74006efc1432","year":2004},"citing_paper":{"arxiv_id":"1908.06183","last_updated":"2019-08-16T21:26:14Z","snapshot_observed_at":"2026-08-16T03:34:09.750589Z","submitted_at":"2019-08-16T21:26:14Z","title":"Search Algorithms for Mastermind","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:00:54.678309Z"},"links":{"citing_paper":"/paper/1908.06183"},"observation_digest":"sha256:793c1747c6df5abb82be71f11d34753d1139197a1eeebf68ecea96904b3da4f9","observation_id":"d11595b5-a2c2-48fe-92b5-4c0bce387c87","resolution":{"observed_at":"2026-08-14T13:00:54.893949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:00:54.871871Z","title":"Efficient Solutions for Mastermind Using Genetic Algorithms","venue":null,"work_id":"d061f07c-b3d3-4722-adb9-a6a408bae503","year":2009},"citing_paper":{"arxiv_id":"1908.06183","last_updated":"2019-08-16T21:26:14Z","snapshot_observed_at":"2026-08-16T03:34:09.750589Z","submitted_at":"2019-08-16T21:26:14Z","title":"Search Algorithms for Mastermind","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:00:54.683822Z"},"links":{"citing_paper":"/paper/1908.06183"},"observation_digest":"sha256:ba8335a7188a403b8e062e7f4572d358d85c4a826eeefe633d83da6a47f83424","observation_id":"aa820fd7-3e81-42b5-b91d-6f89bedf5c06","resolution":{"observed_at":"2026-08-14T13:00:54.877161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3233/icg-2005-28105","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:00:54.749390Z","title":"ICGA Journal","venue":null,"work_id":"39156ba4-f607-42ff-bde6-0af90ed1cbf7","year":2005},"citing_paper":{"arxiv_id":"1908.06183","last_updated":"2019-08-16T21:26:14Z","snapshot_observed_at":"2026-08-16T03:34:09.750589Z","submitted_at":"2019-08-16T21:26:14Z","title":"Search Algorithms for Mastermind","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T13:00:54.688712Z"},"links":{"citing_paper":"/paper/1908.06183"},"observation_digest":"sha256:34aac8ef5b62906ec6c0c254e79c16b05937da06ccd9e83ddc747a928218c487","observation_id":"20d66183-d450-4ed6-9911-b237f2ca4d8a","resolution":{"observed_at":"2026-08-14T13:00:54.755772Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:00:54.854532Z","title":"Heuristic Solution Methods for the 1-Dimensional and the 2-Dimensional Mastermind Problem","venue":null,"work_id":"f524eb29-73c9-4c2f-8372-216f1cb03a17","year":2005},"citing_paper":{"arxiv_id":"1908.06183","last_updated":"2019-08-16T21:26:14Z","snapshot_observed_at":"2026-08-16T03:34:09.750589Z","submitted_at":"2019-08-16T21:26:14Z","title":"Search Algorithms for Mastermind","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T13:00:54.693996Z"},"links":{"citing_paper":"/paper/1908.06183"},"observation_digest":"sha256:db81a9df784991315214fe3799c7a92ecf92810f8d6c2418e2578f228d2b00be","observation_id":"ce254cd5-f92b-4a3f-b5cb-601238a5a144","resolution":{"observed_at":"2026-08-14T13:00:54.860169Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:00:54.836757Z","title":"Solving Mastermind Using Genetic Algorithms","venue":null,"work_id":"63139038-8f29-40d9-9d5c-2609ed15969e","year":2003},"citing_paper":{"arxiv_id":"1908.06183","last_updated":"2019-08-16T21:26:14Z","snapshot_observed_at":"2026-08-16T03:34:09.750589Z","submitted_at":"2019-08-16T21:26:14Z","title":"Search Algorithms for Mastermind","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T13:00:54.698754Z"},"links":{"citing_paper":"/paper/1908.06183"},"observation_digest":"sha256:8ca59bbb449042f983b7554a79236e908a4d55172610adc15d0ed157799d02b4","observation_id":"1d2daf5a-f287-4a95-b768-522dae80a092","resolution":{"observed_at":"2026-08-14T13:00:54.842299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:00:54.818919Z","title":"NP-completeness of Master Mind and Minesweeper","venue":null,"work_id":"dd396bd9-eeea-436b-8efb-f1beb6c4d221","year":2004},"citing_paper":{"arxiv_id":"1908.06183","last_updated":"2019-08-16T21:26:14Z","snapshot_observed_at":"2026-08-16T03:34:09.750589Z","submitted_at":"2019-08-16T21:26:14Z","title":"Search Algorithms for Mastermind","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T13:00:54.703445Z"},"links":{"citing_paper":"/paper/1908.06183"},"observation_digest":"sha256:684337f00c74d46dd9a8d0acc793fc06bb247a9693831f7540c284e54a9cbbc6","observation_id":"1db28967-aa26-4d82-bd8d-d53e5508e1f3","resolution":{"observed_at":"2026-08-14T13:00:54.824623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:00:54.802469Z","title":"Mastermind is NP-Complete","venue":null,"work_id":"a2055cb7-4991-459a-8f30-758c37f065b1","year":2005},"citing_paper":{"arxiv_id":"1908.06183","last_updated":"2019-08-16T21:26:14Z","snapshot_observed_at":"2026-08-16T03:34:09.750589Z","submitted_at":"2019-08-16T21:26:14Z","title":"Search Algorithms for Mastermind","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T13:00:54.708160Z"},"links":{"citing_paper":"/paper/1908.06183"},"observation_digest":"sha256:68f1b5c0a6e6a0a0da354b89e6d360b2a019fe3cd0afa3f427a319601014577a","observation_id":"b05210f7-141f-493f-9414-2b6cfa4af0ba","resolution":{"observed_at":"2026-08-14T13:00:54.807415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:00:54.785919Z","title":"Playing Mastermind Logically","venue":null,"work_id":"2f34494a-7fbe-479c-9cde-73c8f8324073","year":1983},"citing_paper":{"arxiv_id":"1908.06183","last_updated":"2019-08-16T21:26:14Z","snapshot_observed_at":"2026-08-16T03:34:09.750589Z","submitted_at":"2019-08-16T21:26:14Z","title":"Search Algorithms for Mastermind","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T13:00:54.712864Z"},"links":{"citing_paper":"/paper/1908.06183"},"observation_digest":"sha256:c9b466f08afec92b984dd28feff6f7fb89d956d6236dfd2794c3f80af000c7e6","observation_id":"47bb101d-e088-4dd9-bbf5-4b430bc666b8","resolution":{"observed_at":"2026-08-14T13:00:54.791283Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T13:00:54.768256Z","title":"Thomas.Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)","venue":null,"work_id":"0948c8d8-3975-40dc-bfe0-fbf1fa9824ab","year":2006},"citing_paper":{"arxiv_id":"1908.06183","last_updated":"2019-08-16T21:26:14Z","snapshot_observed_at":"2026-08-16T03:34:09.750589Z","submitted_at":"2019-08-16T21:26:14Z","title":"Search Algorithms for Mastermind","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T13:00:54.717683Z"},"links":{"citing_paper":"/paper/1908.06183"},"observation_digest":"sha256:cb483ae4ef8ed9e63228b37bdf88526f0db3634aaeaa17d8a141d9f6b0983f2a","observation_id":"5d953223-5947-455e-9889-5093a74dc013","resolution":{"observed_at":"2026-08-14T13:00:54.774441Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.06183","last_updated":"2019-08-16T21:26:14Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-16T03:34:09.750589Z","submitted_at":"2019-08-16T21:26:14Z","title":"Search Algorithms for Mastermind"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":12},"total_outbound_references":14},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:1908.06183."}