{"as_of":"2026-08-16T22:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:caa1b86688596bcbfb6e437a32268e6530a2a60d088ca4164230a161d2384deb","coverage":[{"denominator":7,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T13:20:37.131179Z","state":"measured"},{"denominator":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"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.05415/citation-record","integrity":"/paper/1908.05415/integrity","json":"/paper/1908.05415/citation-record.json","paper":"/paper/1908.05415"},"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:20:37.269037Z","title":"Coding for write-efficient memory,","venue":null,"work_id":"8a9ad471-3444-42a6-beaf-59681af5128f","year":1989},"citing_paper":{"arxiv_id":"1908.05415","last_updated":"2019-08-15T04:31:58Z","snapshot_observed_at":"2026-08-16T10:00:09.842145Z","submitted_at":"2019-08-15T04:31:58Z","title":"\"LOADS of Space\": Local Order Agnosticism and Bit Flip Efficient Data Structure Codes","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:37.097640Z"},"links":{"citing_paper":"/paper/1908.05415"},"observation_digest":"sha256:cf38327ea16956c4c3d6a2752ad91f6c92d29604f61d72f1c233f9ae12617bf5","observation_id":"021c4f60-cf57-4e19-8c8a-ac8c75e1b8fc","resolution":{"observed_at":"2026-08-14T13:20:37.273970Z","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:20:37.253745Z","title":"Coset coding to extend the lifetime of memory,","venue":null,"work_id":"b7255288-e24d-4f5c-b55d-6fc6d143d050","year":2013},"citing_paper":{"arxiv_id":"1908.05415","last_updated":"2019-08-15T04:31:58Z","snapshot_observed_at":"2026-08-16T10:00:09.842145Z","submitted_at":"2019-08-15T04:31:58Z","title":"\"LOADS of Space\": Local Order Agnosticism and Bit Flip Efficient Data Structure Codes","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:37.105144Z"},"links":{"citing_paper":"/paper/1908.05415"},"observation_digest":"sha256:3beef25a49aa92af1fc81ee4d11a37413571755e98b8860c1704b5b5a7cb9cad","observation_id":"d36c2add-ba2d-41c8-85d1-13103309815a","resolution":{"observed_at":"2026-08-14T13:20:37.259114Z","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:20:37.238411Z","title":"Flip-n-write: A sim- ple deterministic technique to improve pram write performance, energy and endurance,","venue":null,"work_id":"3344f671-1530-48d3-9cf6-105b561d0e1e","year":2009},"citing_paper":{"arxiv_id":"1908.05415","last_updated":"2019-08-15T04:31:58Z","snapshot_observed_at":"2026-08-16T10:00:09.842145Z","submitted_at":"2019-08-15T04:31:58Z","title":"\"LOADS of Space\": Local Order Agnosticism and Bit Flip Efficient Data Structure Codes","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:37.109759Z"},"links":{"citing_paper":"/paper/1908.05415"},"observation_digest":"sha256:9f5d47dcc7e67760471332ab31792575168e831a6db80620b45c8dfd19b3553a","observation_id":"805c2e3b-1d96-4b75-ab46-75149d9468a5","resolution":{"observed_at":"2026-08-14T13:20:37.243717Z","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:20:37.223020Z","title":"Polar codes are opti- mal for write-efficient memories,","venue":null,"work_id":"87264f10-c760-4e44-bc5a-d9e89cbc5c23","year":2013},"citing_paper":{"arxiv_id":"1908.05415","last_updated":"2019-08-15T04:31:58Z","snapshot_observed_at":"2026-08-16T10:00:09.842145Z","submitted_at":"2019-08-15T04:31:58Z","title":"\"LOADS of Space\": Local Order Agnosticism and Bit Flip Efficient Data Structure Codes","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:37.115045Z"},"links":{"citing_paper":"/paper/1908.05415"},"observation_digest":"sha256:1d961e277605e24416587ac7379fc38317151013999f7ad59ca2001aaf331e6b","observation_id":"b7f54887-6ef4-4d85-8cca-810600382fbc","resolution":{"observed_at":"2026-08-14T13:20:37.229040Z","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:20:37.204981Z","title":"Codes in the space of multisets—coding for per- mutation channels with impairments,","venue":null,"work_id":"cc459957-34a3-4032-b352-d8020079048f","year":2018},"citing_paper":{"arxiv_id":"1908.05415","last_updated":"2019-08-15T04:31:58Z","snapshot_observed_at":"2026-08-16T10:00:09.842145Z","submitted_at":"2019-08-15T04:31:58Z","title":"\"LOADS of Space\": Local Order Agnosticism and Bit Flip Efficient Data Structure Codes","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:37.119957Z"},"links":{"citing_paper":"/paper/1908.05415"},"observation_digest":"sha256:45a636d6215193b529cbc7816979a50ac1b1d9b2e1a6c320a70c0ae77a79b11d","observation_id":"9e3b7db7-3521-42c5-9a40-0ba57554a359","resolution":{"observed_at":"2026-08-14T13:20:37.210953Z","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:20:37.186781Z","title":"Compressing sets and mul- tisets of sequences,","venue":null,"work_id":"ebd211c1-c9eb-4ae0-a54c-6f3cd02b7b55","year":2014},"citing_paper":{"arxiv_id":"1908.05415","last_updated":"2019-08-15T04:31:58Z","snapshot_observed_at":"2026-08-16T10:00:09.842145Z","submitted_at":"2019-08-15T04:31:58Z","title":"\"LOADS of Space\": Local Order Agnosticism and Bit Flip Efficient Data Structure Codes","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:37.124528Z"},"links":{"citing_paper":"/paper/1908.05415"},"observation_digest":"sha256:c3908445acc3c846c1a81ed88f8c39a17ccaea2c726d72f7864520e2b6fd243d","observation_id":"057c0f06-f31a-436e-8936-88c02486b407","resolution":{"observed_at":"2026-08-14T13:20:37.192757Z","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:20:37.168936Z","title":"Alon and J","venue":null,"work_id":"4c717086-af80-4406-9de5-2c87c64b4d80","year":2004},"citing_paper":{"arxiv_id":"1908.05415","last_updated":"2019-08-15T04:31:58Z","snapshot_observed_at":"2026-08-16T10:00:09.842145Z","submitted_at":"2019-08-15T04:31:58Z","title":"\"LOADS of Space\": Local Order Agnosticism and Bit Flip Efficient Data Structure Codes","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T13:20:37.131179Z"},"links":{"citing_paper":"/paper/1908.05415"},"observation_digest":"sha256:6ce9fbb1dc9931944f5ac2d72b2932e4ae2e14a167855c5d85d07046522a3f2c","observation_id":"7f67ec47-0fa5-4d2e-9861-d16ad02eead5","resolution":{"observed_at":"2026-08-14T13:20:37.174542Z","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.05415","last_updated":"2019-08-15T04:31:58Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-16T10:00:09.842145Z","submitted_at":"2019-08-15T04:31:58Z","title":"\"LOADS of Space\": Local Order Agnosticism and Bit Flip Efficient Data Structure Codes"},"reference_resolution":{"displayed":7,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":7},"total_outbound_references":7},"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 7 of 7 outbound references and 0 inbound Pith citation observations for arXiv:1908.05415."}