Paper Citation Record · LEDGER

Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2506.01254 v2

Coverage vector

measured 12 of 12 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T11:51:15.524826Z

measured 12 of 12 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

12 of 12 outbound references displayed

verified exact0
verified fuzzy7
unresolved5
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 7398cbae-e632-4e29-b4ca-37f8edd41bf4 · outbound

This paper cites Bojanowski, E.

Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management Bojanowski, E

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:51:16.253818Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 38452487-9918-446a-abff-cf44e4db128e · outbound

This paper cites Efficient Estimation of Word Representations in Vector Space.

Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management Efficient Estimation of Word Representations in Vector Space

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-07T11:51:14.971769Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2f73c6f8-693f-414f-b939-e7ec056ed750 · outbound

This paper cites Pennington, R.

Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management Pennington, R

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:51:16.235372Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation ca20415a-167e-45b9-9754-966fd8eab350 · outbound

This paper cites Aoe, ”An efﬁcient digital search algorithm by using a d ouble-array structure,” IEEE transactions on Software Engineering, vo l.

Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management Aoe, ”An efﬁcient digital search algorithm by using a d ouble-array structure,” IEEE transactions on Software Engineering, vo l

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:51:16.216947Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 27a96792-5650-4381-9889-95a7b35ea071 · outbound

This paper cites an unresolved cited work.

Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management Unresolved cited work

Reference 5

Resolution: unresolved; raw_fallback, observed 2026-08-07T11:51:16.198613Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 769d2595-d9d7-4fc0-8ca2-daec7d6b5789 · outbound

This paper cites Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Training.

Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Training

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-07T11:51:15.067642Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 56000855-ee8b-4e71-b4c0-41db90a1d266 · outbound

This paper cites Jacob, S.

Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management Jacob, S

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:51:16.176204Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation dbcd1aeb-7b3f-4f90-85f1-2cba5862a0c5 · outbound

This paper cites Krishnamoorthi, ”Quantizing deep convolutional net works for efﬁ- cient inference: A whitepaper,” arXiv preprint arXiv:1806 .08342, 2018.

Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management Krishnamoorthi, ”Quantizing deep convolutional net works for efﬁ- cient inference: A whitepaper,” arXiv preprint arXiv:1806 .08342, 2018

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:51:16.018190Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation d02efe8f-6c41-44f3-a4f2-67c2e094bfa5 · outbound

This paper cites Distilling the Knowledge in a Neural Network.

Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management Distilling the Knowledge in a Neural Network

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-07T11:51:15.289221Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e4dc7435-c515-4b42-964d-3d166f4628b0 · outbound

This paper cites Sennrich, B.

Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management Sennrich, B

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:51:15.855972Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 1c4fc5a6-c63f-4a29-8989-c1fd135bed59 · outbound

This paper cites SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processing.

Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management SentencePiece: A simple and language independent subword tokenizer and detokenizer for Neural Text Processing

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-07T11:51:15.439814Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cf06c23a-3840-4edb-86d4-ae721c41d373 · outbound

This paper cites Heaﬁeld, ”KenLM: Faster and smaller language model q ueries,” in Proceedings of the sixth workshop on statistical machine tr anslation, 2011, pp.

Memory-Efficient FastText: A Comprehensive Approach Using Double-Array Trie Structures and Mark-Compact Memory Management Heaﬁeld, ”KenLM: Faster and smaller language model q ueries,” in Proceedings of the sixth workshop on statistical machine tr anslation, 2011, pp

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T11:51:15.676280Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Pith citing papers

No inbound Pith citation observations are available.