{"as_of":"2026-08-17T01:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7edd34f72b74bddcad6197e54c0369d61841ef24980e509a662e89bff59f216d","coverage":[{"denominator":10,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:53:29.426141Z","state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"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.08111/citation-record","integrity":"/paper/1908.08111/integrity","json":"/paper/1908.08111/citation-record.json","paper":"/paper/1908.08111"},"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-14T11:53:30.239780Z","title":"In: 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria","venue":null,"work_id":"3d36651e-31fe-4d53-a954-40abc90a0749","year":2017},"citing_paper":{"arxiv_id":"1908.08111","last_updated":"2019-08-21T20:31:34Z","snapshot_observed_at":"2026-08-16T22:20:59.754639Z","submitted_at":"2019-08-21T20:31:34Z","title":"Engineering Faster Sorters for Small Sets of Items","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T11:53:29.240216Z"},"links":{"citing_paper":"/paper/1908.08111"},"observation_digest":"sha256:cbd3370601692ab46b381946e8ff51d505577dbd8413232a96df651884fc880c","observation_id":"a837887b-8561-45f9-9ecc-09fe0ed3145a","resolution":{"observed_at":"2026-08-14T11:53:30.244498Z","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-14T11:53:30.058531Z","title":null,"venue":null,"work_id":"338b3509-b290-491e-b446-6d4fa1dab09e","year":1968},"citing_paper":{"arxiv_id":"1908.08111","last_updated":"2019-08-21T20:31:34Z","snapshot_observed_at":"2026-08-16T22:20:59.754639Z","submitted_at":"2019-08-21T20:31:34Z","title":"Engineering Faster Sorters for Small Sets of Items","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T11:53:29.294830Z"},"links":{"citing_paper":"/paper/1908.08111"},"observation_digest":"sha256:9538a12ca332752623cae0906df7a213619ceefb04e6339b5e645866597a02c8","observation_id":"dfe0f5bf-2df5-4ca5-9572-0938cbefef9e","resolution":{"observed_at":"2026-08-14T11:53:30.139221Z","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-14T11:53:30.039062Z","title":"https://github.com/bertdobbelaere/SorterHunter, 2018","venue":null,"work_id":"46651b8d-56a6-4ee2-8564-c0cbbc6b2a53","year":2018},"citing_paper":{"arxiv_id":"1908.08111","last_updated":"2019-08-21T20:31:34Z","snapshot_observed_at":"2026-08-16T22:20:59.754639Z","submitted_at":"2019-08-21T20:31:34Z","title":"Engineering Faster Sorters for Small Sets of Items","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T11:53:29.397713Z"},"links":{"citing_paper":"/paper/1908.08111"},"observation_digest":"sha256:272ac4b20d62463e7425dcda53ee11ca372785fcf6d30f2d52bb78809598b04a","observation_id":"dd712f53-1a72-4dfa-a78a-6a9a1969f10f","resolution":{"observed_at":"2026-08-14T11:53:30.046764Z","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":"1119.32112","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:29.754953Z","title":null,"venue":null,"work_id":"0da3c4bd-3df6-4cef-adff-a4436fb11b06","year":1962},"citing_paper":{"arxiv_id":"1908.08111","last_updated":"2019-08-21T20:31:34Z","snapshot_observed_at":"2026-08-16T22:20:59.754639Z","submitted_at":"2019-08-21T20:31:34Z","title":"Engineering Faster Sorters for Small Sets of Items","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T11:53:29.402299Z"},"links":{"citing_paper":"/paper/1908.08111"},"observation_digest":"sha256:51f806e3614d7c441d29c6b170d4d14407ef88b627c4a42799ad123bf1b5de07","observation_id":"3245cc94-2c07-46d9-a937-2a620866b6eb","resolution":{"observed_at":"2026-08-14T11:53:29.807386Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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-14T11:53:30.024338Z","title":"In: 26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, Limassol, Cyprus, November 10-12, 2014 , 2014, 186--193","venue":null,"work_id":"1e974ca0-4bee-4ba6-a398-bfed7f09dc38","year":2014},"citing_paper":{"arxiv_id":"1908.08111","last_updated":"2019-08-21T20:31:34Z","snapshot_observed_at":"2026-08-16T22:20:59.754639Z","submitted_at":"2019-08-21T20:31:34Z","title":"Engineering Faster Sorters for Small Sets of Items","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T11:53:29.406968Z"},"links":{"citing_paper":"/paper/1908.08111"},"observation_digest":"sha256:451ed59e06446fe5df0ad67a56f6d535519651e145f37969b4b451031c5bb62c","observation_id":"10f733f3-f323-4bb4-84a7-275b600587f8","resolution":{"observed_at":"2026-08-14T11:53:30.029162Z","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.1007/s00165-016-0401-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:29.454733Z","title":"In: Formal Asp","venue":null,"work_id":"f95c42c1-aa08-4a79-a1b0-5fb90737566b","year":2017},"citing_paper":{"arxiv_id":"1908.08111","last_updated":"2019-08-21T20:31:34Z","snapshot_observed_at":"2026-08-16T22:20:59.754639Z","submitted_at":"2019-08-21T20:31:34Z","title":"Engineering Faster Sorters for Small Sets of Items","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T11:53:29.411030Z"},"links":{"citing_paper":"/paper/1908.08111"},"observation_digest":"sha256:0a39cd99220036159c120fd2f523799bb23ca6b8b70df1fad7527b6133ed908a","observation_id":"6cbdaf29-f6c9-40bc-a815-b4e43fac7f39","resolution":{"observed_at":"2026-08-14T11:53:29.523599Z","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-14T11:53:29.980689Z","title":"https://gcc.gnu.org/onlinedocs/gcc/Using-Assembly-Language-with-C.html, 2019","venue":null,"work_id":"f533e791-9c38-4994-9145-198f1e7601b7","year":2019},"citing_paper":{"arxiv_id":"1908.08111","last_updated":"2019-08-21T20:31:34Z","snapshot_observed_at":"2026-08-16T22:20:59.754639Z","submitted_at":"2019-08-21T20:31:34Z","title":"Engineering Faster Sorters for Small Sets of Items","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T11:53:29.414813Z"},"links":{"citing_paper":"/paper/1908.08111"},"observation_digest":"sha256:80a1b7757bf1885b4c3f33ac37217d708b88c7a74c6fb984ef8c46ad11f76da4","observation_id":"45fa08cf-d26c-449c-aa74-53ccd8cdd219","resolution":{"observed_at":"2026-08-14T11:53:30.015091Z","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-14T11:53:29.831858Z","title":"http://pages.ripco.net/ jgamble/nw.html, 2019","venue":null,"work_id":"1608ea47-45b7-4e93-98fa-b8c23e61f170","year":2019},"citing_paper":{"arxiv_id":"1908.08111","last_updated":"2019-08-21T20:31:34Z","snapshot_observed_at":"2026-08-16T22:20:59.754639Z","submitted_at":"2019-08-21T20:31:34Z","title":"Engineering Faster Sorters for Small Sets of Items","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T11:53:29.418657Z"},"links":{"citing_paper":"/paper/1908.08111"},"observation_digest":"sha256:5ab0fe649a415f419db81a8d8bf2ccb67991767415bb2b88c3a088a3f195ea29","observation_id":"740a155c-e51a-42a2-8fa7-16585a9dec1f","resolution":{"observed_at":"2026-08-14T11:53:29.897775Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:29.422299Z","title":"Addison-Wesley, 1998 http://www.worldcat.org/oclc/312994415","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"1908.08111","last_updated":"2019-08-21T20:31:34Z","snapshot_observed_at":"2026-08-16T22:20:59.754639Z","submitted_at":"2019-08-21T20:31:34Z","title":"Engineering Faster Sorters for Small Sets of Items","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T11:53:29.422299Z"},"links":{"citing_paper":"/paper/1908.08111"},"observation_digest":"sha256:55412921f2c03f90759ea45a56ec9430dbca738b2ddfe76b7584c06bdbea1b90","observation_id":"928f1ae4-fc71-4611-a4eb-5ff99e503301","resolution":{"observed_at":"2026-08-14T11:53:29.422299Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T11:53:29.816981Z","title":"In: Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings , 2004, 784--796","venue":null,"work_id":"341f4ee2-bc9c-4ec3-b174-5943cd2a4b45","year":2004},"citing_paper":{"arxiv_id":"1908.08111","last_updated":"2019-08-21T20:31:34Z","snapshot_observed_at":"2026-08-16T22:20:59.754639Z","submitted_at":"2019-08-21T20:31:34Z","title":"Engineering Faster Sorters for Small Sets of Items","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T11:53:29.426141Z"},"links":{"citing_paper":"/paper/1908.08111"},"observation_digest":"sha256:bd790d9fd1dae9f6d1f5b757a8c4fd0a63c582737ed87cd75d190d3f2c47d7f0","observation_id":"e789c606-2103-4ca4-8701-556fc46715e9","resolution":{"observed_at":"2026-08-14T11:53:29.823707Z","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.08111","last_updated":"2019-08-21T20:31:34Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T22:20:59.754639Z","submitted_at":"2019-08-21T20:31:34Z","title":"Engineering Faster Sorters for Small Sets of Items"},"reference_resolution":{"displayed":10,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":6},"total_outbound_references":10},"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 17 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 0 inbound Pith citation observations for arXiv:1908.08111."}