{"as_of":"2026-08-21T06:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2fa746689c181c6aa4e07d7524002f19e8b085b26141a833d0730899138c15e8","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T08:45:43.814516Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T08:45:43.814516Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-03T12:48:11.764212Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"cited_work":{"arxiv_id":"2606.11642","doi":null,"metadata_source":"pith","pith_arxiv_id":"2606.11642","snapshot_observed_at":"2026-07-03T12:48:11.764212Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","venue":"cs.HC","work_id":"46268af2-5a8c-4de4-9b8e-10c8baa93961","year":2026},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"cited_paper":"/paper/2606.11642","citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:680aa760b0674c560fe42759bee14d9a3bd15e3be35d8516ec05926e3e0358fd","observation_id":"9a7e54d5-4cbf-45f8-ae43-b9e987612072","resolution":{"observed_at":"2026-07-03T12:48:11.765716Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2606.11642/citation-record","integrity":"/paper/2606.11642/integrity","json":"/paper/2606.11642/citation-record.json","paper":"/paper/2606.11642"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"cited_work":{"arxiv_id":"2606.11642","doi":null,"metadata_source":"pith","pith_arxiv_id":"2606.11642","snapshot_observed_at":"2026-07-03T12:48:11.764212Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","venue":"cs.HC","work_id":"46268af2-5a8c-4de4-9b8e-10c8baa93961","year":2026},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"cited_paper":"/paper/2606.11642","citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:680aa760b0674c560fe42759bee14d9a3bd15e3be35d8516ec05926e3e0358fd","observation_id":"9a7e54d5-4cbf-45f8-ae43-b9e987612072","resolution":{"observed_at":"2026-07-03T12:48:11.765716Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-27T08:45:43.814516Z","title":"CONDITIONAL ENTROPY LetXbe the character sequence andCthe linguistic context","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:67b70ccb2e2cb15e00be73ab160570069c85557ddd92c12178f9a507d2668539","observation_id":"39c5fa06-8877-449e-81c4-d6f03b02d5d4","resolution":{"observed_at":"2026-06-27T08:45:43.814516Z","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-06-27T08:45:43.814516Z","title":"worst-case","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:48c7e51a74a7a0a535e84d3f5ab1fec04de36fb5e1451cc7fa3b6d3186a68771","observation_id":"5fe56359-4da9-4933-822c-3f022b76135e","resolution":{"observed_at":"2026-06-27T08:45:43.814516Z","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-06-27T08:45:43.814516Z","title":"key count","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:05aee5ef68b6cd371a7662c71d08e6e0c72425bf5d7565e5f901536973894e00","observation_id":"158e98d8-4255-4a1f-929c-c8c24c3b92e1","resolution":{"observed_at":"2026-06-27T08:45:43.814516Z","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-06-27T08:45:43.814516Z","title":"3 keys are a practical minimum","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:1c9636fb720e31f273d682a0b7fd86d7498b74333c4954c3ac76562fc28e0bfc","observation_id":"c85c9401-9d3b-455d-bc44-b8ef3f3b06fa","resolution":{"observed_at":"2026-06-27T08:45:43.814516Z","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-06-27T08:45:43.814516Z","title":"Zoomboard: A diminutive qwerty soft keyboard using iter- ative zooming for ultra-small devices,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:bdf9e219351fb7dd96cf54db7160c235645371cf0cd728eff53121c1effd1797","observation_id":"1af09701-b377-4625-9ce6-9232b455c90d","resolution":{"observed_at":"2026-06-27T08:45:43.814516Z","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-06-27T08:45:43.814516Z","title":"Swipeboard: A text entry technique for ultra-small interfaces that supports novice to expert transitions,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:987e0feac4c4e54a750e71cf28a40b42816bb7c48eb009282f05406da2600029","observation_id":"dceb8ebf-a9ef-4516-9577-eec562315b36","resolution":{"observed_at":"2026-06-27T08:45:43.814516Z","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-06-27T08:45:43.814516Z","title":"Forceboard: Subtle text entry leveraging pres- sure,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:dc621f503fa16f7e774682a4234b6b848621ba8db812d77eeac0e2d9c2d721d0","observation_id":"4fae6a88-155e-4496-934c-ec1e0660c52e","resolution":{"observed_at":"2026-06-27T08:45:43.814516Z","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-06-27T08:45:43.814516Z","title":"Dualkey: Miniature screen text entry via finger identification,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:9d41d4670c15227f1f3308b3313fd6f3757dc63d5a2aa36bb045019bd35447f4","observation_id":"f0139e68-2252-45cd-8c2f-3bbb9d45610b","resolution":{"observed_at":"2026-06-27T08:45:43.814516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.14590","last_updated":"2020-11-19T20:28:59Z","snapshot_observed_at":"2026-08-16T19:10:07.874655Z","submitted_at":"2020-10-27T20:11:25Z","title":"F-theory amplitudes","version":2},"cited_work":{"arxiv_id":"2010.14590","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2010.14590","snapshot_observed_at":"2026-07-03T12:48:11.766915Z","title":"Nomon: Efficient communication with a single switch,","venue":null,"work_id":"dae12878-c492-441c-8bed-80dd8e4f0cb4","year":2010},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"cited_paper":"/paper/2010.14590","citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:cc15fb1474152eb47a381f27c361b465f92a3281bd5692e4f65c8e23260129f8","observation_id":"41485f1f-0a02-468c-a9e3-5b9f1d8660d5","resolution":{"observed_at":"2026-07-03T12:48:11.768341Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-27T08:45:43.814516Z","title":"The challenges of intelligent text entry on mobile devices: Two-thumb input with statistical de- coding,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:b8d2e3c79526831307dcda9618337afa425c3d507b5e5205f25dc793f2ed5917","observation_id":"4bd10fd1-ec48-4f15-813e-7545365887fd","resolution":{"observed_at":"2026-06-27T08:45:43.814516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1909.03442","last_updated":"2019-09-08T12:16:33Z","snapshot_observed_at":"2026-08-12T22:28:29.578966Z","submitted_at":"2019-09-08T12:16:33Z","title":"CUDA: Contradistinguisher for Unsupervised Domain Adaptation","version":1},"cited_work":{"arxiv_id":"1909.03442","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1909.03442","snapshot_observed_at":"2026-07-03T12:48:11.769409Z","title":"Neural language models for text messaging,","venue":null,"work_id":"fcfbe37a-d38a-4214-882f-db823387abeb","year":1909},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"cited_paper":"/paper/1909.03442","citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:dc857658bae615cfe99410ccd46a99431c97ca29ebcea931a94b59a2cdb88bc0","observation_id":"96ba346b-19f8-41cb-86f9-774f0528cdfb","resolution":{"observed_at":"2026-07-03T12:48:11.770837Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.04805","last_updated":"2019-05-24T20:37:26Z","snapshot_observed_at":"2026-08-14T18:16:28.847993Z","submitted_at":"2018-10-11T00:50:01Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","version":2},"cited_work":{"arxiv_id":"1810.04805","doi":"10.1111/jofi.12885","metadata_source":"pith","pith_arxiv_id":"1810.04805","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","venue":"cs.CL","work_id":"ed240a10-5b19-406c-baa5-30803f465785","year":2018},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"cited_paper":"/paper/1810.04805","citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:559881062521790f1d3d7db2f60da04630550e55d8001b8afa1a7b941961e6b5","observation_id":"81415bed-cf30-4833-8f37-bd78b6080324","resolution":{"observed_at":"2026-07-03T12:48:11.773138Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14165","last_updated":"2020-07-22T19:47:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-28T17:29:03Z","title":"Language Models are Few-Shot Learners","version":4},"cited_work":{"arxiv_id":"2005.14165","doi":"10.1145/1926385.1926423","metadata_source":"pith","pith_arxiv_id":"2005.14165","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Language Models are Few-Shot Learners","venue":"cs.CL","work_id":"214732c0-2edd-44a0-af9e-28184a2b8279","year":2020},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"cited_paper":"/paper/2005.14165","citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:6861ae1966ae9e32b16577c923e57c1907a28a7abbe32d825b686d4bd137d5ec","observation_id":"d631ddfe-5c99-4e57-b483-6bb7aee0ccff","resolution":{"observed_at":"2026-07-03T12:48:11.760190Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:33.42086+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:33.42086+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.13660","last_updated":"2024-08-09T20:18:57Z","snapshot_observed_at":"2026-08-18T01:06:50.520785Z","submitted_at":"2024-01-24T18:53:53Z","title":"MambaByte: Token-free Selective State Space Model","version":3},"cited_work":{"arxiv_id":"2401.13660","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.13660","snapshot_observed_at":"2026-07-03T12:48:11.761335Z","title":"N., and Rush, A","venue":null,"work_id":"7408d5c4-b707-4822-a8dd-a52f418b53d6","year":2024},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"cited_paper":"/paper/2401.13660","citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:38165934107f14427adba5ca550148fe376558956b6129f58063699caa4be5c9","observation_id":"fceec1e2-66e4-434a-b6f1-23bfd43da695","resolution":{"observed_at":"2026-07-03T12:48:11.763034Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-27T08:45:43.814516Z","title":"Learning complex, ex- tended sequences using the principle of history compression,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:4cc4aced96e79d256bb0e0891b6438cbb03d6ed86aaec94176f8cd3aa0c4566c","observation_id":"1a39bceb-107d-4e27-8d62-7f1871342183","resolution":{"observed_at":"2026-06-27T08:45:43.814516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.14827","last_updated":"2024-01-26T10:33:08Z","snapshot_observed_at":"2026-08-18T13:57:21.304169Z","submitted_at":"2023-04-28T13:14:36Z","title":"ChatGPT Evaluation on Sentence Level Relations: A Focus on Temporal, Causal, and Discourse Relations","version":3},"cited_work":{"arxiv_id":"2304.14827","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2304.14827","snapshot_observed_at":"2026-07-03T12:48:11.756205Z","title":"Gptzip: Deep compres- sion of large language model prompts,","venue":null,"work_id":"c89725ba-42f4-4d7d-9d5a-4275ef826033","year":2023},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"cited_paper":"/paper/2304.14827","citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:4c9b5215783ecb73ab1a8fbbdb34ce6f292f85ba57f219f866b1c6ce69f2d0eb","observation_id":"a129f18d-6757-44d6-b5b9-fd24860ee650","resolution":{"observed_at":"2026-07-03T12:48:11.757731Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-06-27T08:45:43.814516Z","title":"Cover and Joy A","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:4001685363b6cacc7e904b9ad23b23cee3e74e818cc71d876bb117fd761baf83","observation_id":"efd76dfa-c376-4d25-9502-7e41d840ea95","resolution":{"observed_at":"2026-06-27T08:45:43.814516Z","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-06-27T08:45:43.814516Z","title":"Bleu: A method for automatic evaluation of machine translation,","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:4da8690b0a31beee52cd2a367db530f8d053364e51ce7c90dcdc64e71fddb58d","observation_id":"5f16ff63-9279-4596-a033-41095007736b","resolution":{"observed_at":"2026-06-27T08:45:43.814516Z","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-06-27T08:45:43.814516Z","title":"Bertscore: Evaluating text generation with bert,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-27T08:45:43.814516Z"},"links":{"citing_paper":"/paper/2606.11642"},"observation_digest":"sha256:806406cce5dcafd0a0daa77f22972cd025d35b84a994feac34bc1e5717fdbd05","observation_id":"f36e3f76-f713-4fb8-958b-eec8fcc87596","resolution":{"observed_at":"2026-06-27T08:45:43.814516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.11642","last_updated":"2026-06-10T04:06:41Z","latest_version":1,"primary_category":"cs.HC","snapshot_observed_at":"2026-08-14T05:03:48.114648Z","submitted_at":"2026-06-10T04:06:41Z","title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":1,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":12,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":20},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 1 inbound Pith citation observation for arXiv:2606.11642."}