{"as_of":"2026-08-08T05:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d3150b1bd46938d583d9c5fc8bd86c22fd98ab7c3ab1acf7c6c4f2079a069744","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:51:15.524826Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2506.01254/citation-record","integrity":"/paper/2506.01254/integrity","json":"/paper/2506.01254/citation-record.json","paper":"/paper/2506.01254"},"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-07T11:51:16.245565Z","title":"Bojanowski, E","venue":null,"work_id":"3fd1f1e4-0fc8-41a4-b9ee-4fba40ec93b4","year":2017},"citing_paper":{"arxiv_id":"2506.01254","last_updated":"2026-07-04T05:17:09Z","snapshot_observed_at":"2026-08-07T11:44:20.639839Z","submitted_at":"2025-06-02T02:11:22Z","title":"Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:51:14.939452Z"},"links":{"citing_paper":"/paper/2506.01254"},"observation_digest":"sha256:c8b8d88f538896e4e96838bd1816ad9c6d844af72ff767ad099025030f689e7b","observation_id":"7398cbae-e632-4e29-b4ca-37f8edd41bf4","resolution":{"observed_at":"2026-08-07T11:51:16.253818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1301.3781","last_updated":"2013-09-07T00:30:40Z","snapshot_observed_at":"2026-07-06T03:04:11.148340Z","submitted_at":"2013-01-16T18:24:43Z","title":"Efficient Estimation of Word Representations in Vector Space","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1301.3781","snapshot_observed_at":"2026-08-07T11:51:14.971769Z","title":"Mikolov, K","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.01254","last_updated":"2026-07-04T05:17:09Z","snapshot_observed_at":"2026-08-07T11:44:20.639839Z","submitted_at":"2025-06-02T02:11:22Z","title":"Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:51:14.971769Z"},"links":{"cited_paper":"/paper/1301.3781","citing_paper":"/paper/2506.01254"},"observation_digest":"sha256:3116054e170333919382ca1af8455f6707f8bb768ac6e80c084c4a711f21eede","observation_id":"38452487-9918-446a-abff-cf44e4db128e","resolution":{"observed_at":"2026-08-07T11:51:14.971769Z","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-07T11:51:16.226897Z","title":"Pennington, R","venue":null,"work_id":"807fe570-6a36-4703-879a-f5b7a681ff16","year":2014},"citing_paper":{"arxiv_id":"2506.01254","last_updated":"2026-07-04T05:17:09Z","snapshot_observed_at":"2026-08-07T11:44:20.639839Z","submitted_at":"2025-06-02T02:11:22Z","title":"Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:51:14.981827Z"},"links":{"citing_paper":"/paper/2506.01254"},"observation_digest":"sha256:f593d46f2330a0da393e4994a2a9e45ed9fc6cab88f81f7a331f97d0f4773598","observation_id":"2f73c6f8-693f-414f-b939-e7ec056ed750","resolution":{"observed_at":"2026-08-07T11:51:16.235372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:51:16.210272Z","title":"Aoe, ”An efficient digital search algorithm by using a d ouble-array structure,” IEEE transactions on Software Engineering, vo l","venue":null,"work_id":"7861d62a-c31d-4f52-894a-729197caf1e4","year":1989},"citing_paper":{"arxiv_id":"2506.01254","last_updated":"2026-07-04T05:17:09Z","snapshot_observed_at":"2026-08-07T11:44:20.639839Z","submitted_at":"2025-06-02T02:11:22Z","title":"Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:51:14.988850Z"},"links":{"citing_paper":"/paper/2506.01254"},"observation_digest":"sha256:86a7bc9f151218437ad4ca30a8b7e7b47465ea63d4155b56a955e21566e98b03","observation_id":"ca20415a-167e-45b9-9754-966fd8eab350","resolution":{"observed_at":"2026-08-07T11:51:16.216947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:51:16.190760Z","title":null,"venue":null,"work_id":"c14ab039-3d5a-4f91-a309-6ba74d6b4c2c","year":2017},"citing_paper":{"arxiv_id":"2506.01254","last_updated":"2026-07-04T05:17:09Z","snapshot_observed_at":"2026-08-07T11:44:20.639839Z","submitted_at":"2025-06-02T02:11:22Z","title":"Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:51:15.010958Z"},"links":{"citing_paper":"/paper/2506.01254"},"observation_digest":"sha256:693a1df0cb23d5f68147832680cbf50d20458fc5b79a4911c5d8a0bb48829b2e","observation_id":"27a96792-5650-4381-9889-95a7b35ea071","resolution":{"observed_at":"2026-08-07T11:51:16.198613Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.01887","last_updated":"2020-06-23T03:28:30Z","snapshot_observed_at":"2026-08-07T09:53:59.286406Z","submitted_at":"2017-12-05T19:48:11Z","title":"Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.01887","snapshot_observed_at":"2026-08-07T11:51:15.067642Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.01254","last_updated":"2026-07-04T05:17:09Z","snapshot_observed_at":"2026-08-07T11:44:20.639839Z","submitted_at":"2025-06-02T02:11:22Z","title":"Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:51:15.067642Z"},"links":{"cited_paper":"/paper/1712.01887","citing_paper":"/paper/2506.01254"},"observation_digest":"sha256:869ce5508f3f885e741b33281f80507fa2dc6976f0d02fbbfbb76d6203e0535c","observation_id":"769d2595-d9d7-4fc0-8ca2-daec7d6b5789","resolution":{"observed_at":"2026-08-07T11:51:15.067642Z","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-07T11:51:16.171300Z","title":"Jacob, S","venue":null,"work_id":"d1b5bdac-e515-4c86-8b57-4c556da16e7c","year":2018},"citing_paper":{"arxiv_id":"2506.01254","last_updated":"2026-07-04T05:17:09Z","snapshot_observed_at":"2026-08-07T11:44:20.639839Z","submitted_at":"2025-06-02T02:11:22Z","title":"Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:51:15.140153Z"},"links":{"citing_paper":"/paper/2506.01254"},"observation_digest":"sha256:9f93c849e97980d3088cb07affc300afa8096ecdd34fb81dd7606ab1d30287a1","observation_id":"56000855-ee8b-4e71-b4c0-41db90a1d266","resolution":{"observed_at":"2026-08-07T11:51:16.176204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:51:15.918058Z","title":"Krishnamoorthi, ”Quantizing deep convolutional net works for effi- cient inference: A whitepaper,” arXiv preprint arXiv:1806 .08342, 2018","venue":null,"work_id":"f368ec62-b6be-4dc6-bc88-97e05debef23","year":2018},"citing_paper":{"arxiv_id":"2506.01254","last_updated":"2026-07-04T05:17:09Z","snapshot_observed_at":"2026-08-07T11:44:20.639839Z","submitted_at":"2025-06-02T02:11:22Z","title":"Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:51:15.220270Z"},"links":{"citing_paper":"/paper/2506.01254"},"observation_digest":"sha256:34133eebef3a46330eaaf50071b6c938e9f8cb5d851349ff9e42d09106753d4d","observation_id":"dbcd1aeb-7b3f-4f90-85f1-2cba5862a0c5","resolution":{"observed_at":"2026-08-07T11:51:16.018190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1503.02531","last_updated":"2015-03-09T15:44:49Z","snapshot_observed_at":"2026-07-06T04:11:24.157003Z","submitted_at":"2015-03-09T15:44:49Z","title":"Distilling the Knowledge in a Neural Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.02531","snapshot_observed_at":"2026-08-07T11:51:15.289221Z","title":"Hinton, O","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2506.01254","last_updated":"2026-07-04T05:17:09Z","snapshot_observed_at":"2026-08-07T11:44:20.639839Z","submitted_at":"2025-06-02T02:11:22Z","title":"Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:51:15.289221Z"},"links":{"cited_paper":"/paper/1503.02531","citing_paper":"/paper/2506.01254"},"observation_digest":"sha256:7e4bcc8b994cb66906abb0b9a12d6dde1dee09ad062328929542987c783402f1","observation_id":"d02efe8f-6c41-44f3-a4f2-67c2e094bfa5","resolution":{"observed_at":"2026-08-07T11:51:15.289221Z","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-07T11:51:15.762385Z","title":"Sennrich, B","venue":null,"work_id":"eb2181b1-b267-4b06-971b-96d7b3159034","year":2015},"citing_paper":{"arxiv_id":"2506.01254","last_updated":"2026-07-04T05:17:09Z","snapshot_observed_at":"2026-08-07T11:44:20.639839Z","submitted_at":"2025-06-02T02:11:22Z","title":"Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:51:15.374101Z"},"links":{"citing_paper":"/paper/2506.01254"},"observation_digest":"sha256:d006cac6a81222c950376eba7ee649a93a8af7bd540dfc2a496ea41bb6ab3862","observation_id":"e4dc7435-c515-4b42-964d-3d166f4628b0","resolution":{"observed_at":"2026-08-07T11:51:15.855972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1808.06226","last_updated":"2018-08-19T16:49:06Z","snapshot_observed_at":"2026-07-06T06:56:20.935388Z","submitted_at":"2018-08-19T16:49:06Z","title":"SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1808.06226","snapshot_observed_at":"2026-08-07T11:51:15.439814Z","title":"Kudo and J","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.01254","last_updated":"2026-07-04T05:17:09Z","snapshot_observed_at":"2026-08-07T11:44:20.639839Z","submitted_at":"2025-06-02T02:11:22Z","title":"Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:51:15.439814Z"},"links":{"cited_paper":"/paper/1808.06226","citing_paper":"/paper/2506.01254"},"observation_digest":"sha256:327b8717739c376bd6ccb32b7f89c6f34371dd5790c9dae28a199f6dd1e7a423","observation_id":"1c4fc5a6-c63f-4a29-8989-c1fd135bed59","resolution":{"observed_at":"2026-08-07T11:51:15.439814Z","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-07T11:51:15.613946Z","title":"Heafield, ”KenLM: Faster and smaller language model q ueries,” in Proceedings of the sixth workshop on statistical machine tr anslation, 2011, pp","venue":null,"work_id":"f07ec8a5-e7d7-4d98-8183-ab4ad7469bbc","year":2011},"citing_paper":{"arxiv_id":"2506.01254","last_updated":"2026-07-04T05:17:09Z","snapshot_observed_at":"2026-08-07T11:44:20.639839Z","submitted_at":"2025-06-02T02:11:22Z","title":"Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:51:15.524826Z"},"links":{"citing_paper":"/paper/2506.01254"},"observation_digest":"sha256:661cb16cb6060f0e24dabc2db78b7f191fd9ec416510c7d2af8340feb75ffc31","observation_id":"cf06c23a-3840-4edb-86d4-ae721c41d373","resolution":{"observed_at":"2026-08-07T11:51:15.676280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.01254","last_updated":"2026-07-04T05:17:09Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T11:44:20.639839Z","submitted_at":"2025-06-02T02:11:22Z","title":"Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":7},"total_outbound_references":12},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:2506.01254."}