Pith. sign in

Paper Citation Record · LEDGER

On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods

As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:1303.4375.

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

pith.paper-citation-record.v1
1303.4375 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 5 of 5 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 5 of 5 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-15T18:42:26.753303Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-11T12:41:05.074582Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 04ca195f-ad4f-4099-a478-0c7ba24d793e · inbound

Deep ReLU networks -- injectivity capacity upper bounds cites this paper.

Deep ReLU networks -- injectivity capacity upper bounds On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods

Reference 64

Resolution
unresolved
no resolver link, observed 2026-08-11T00:14:23.064423Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T00:14:23.064423Z digest=sha256:89c09d25d9da339b2a2cfa165cae4d44dcd5e26d4fb83b70572f8d38558359d8

Observation 79ec0164-f6ae-44ec-8f9b-187f4f701d65 · inbound

Fully lifted \emph{blirp} interpolation -- a large deviation view cites this paper.

Fully lifted \emph{blirp} interpolation -- a large deviation view On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods

Reference 95

Resolution
unresolved
no resolver link, observed 2026-08-15T18:39:35.726594Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T18:39:35.726594Z digest=sha256:6bed6ab881b8360246d5608ad5090ee0a37fdef64ed253b97334a4f2bab3f582

Observation 3269a00b-fc5c-4113-ba5f-78b1353f99f5 · inbound

A large deviation view of \emph{stationarized} fully lifted blirp interpolation cites this paper.

A large deviation view of \emph{stationarized} fully lifted blirp interpolation On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods

Reference 96

Resolution
unresolved
no resolver link, observed 2026-08-15T18:39:20.168385Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T18:39:20.168385Z digest=sha256:d1198c7f7298fb8642035fd2254915883712a67ddc79e458a30112176917b573

Observation 9efda6df-c03e-4cf1-bf30-475b0d8a9f50 · inbound

Rare dense solutions clusters in asymmetric binary perceptrons -- local entropy via fully lifted RDT cites this paper.

Rare dense solutions clusters in asymmetric binary perceptrons -- local entropy via fully lifted RDT On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods

Reference 84

Resolution
unresolved
no resolver link, observed 2026-08-15T18:42:26.753303Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-15T18:42:26.753303Z digest=sha256:12c66dfeb18073aa501c816d6bedd29f0a07ad22cf68fa11c675601d02730323

Observation 9780a5eb-664f-454d-b7e0-26f48f976920 · inbound

Ultrametric OGP - parametric RDT \emph{symmetric} binary perceptron connection cites this paper.

Ultrametric OGP - parametric RDT \emph{symmetric} binary perceptron connection On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods

Reference 90

Resolution
verified exact
arxiv_id, observed 2026-07-04T18:25:33.987746Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-10T03:09:42.968897Z digest=sha256:acda89aab526d698ba00397a39b3197a2ddd682e62003e80082fcfc63632375c