Pith. sign in

Paper Citation Record · LEDGER

Using Code Generation to Solve Open Instances of Combinatorial Design Problems

As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2501.17725.

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

pith.paper-citation-record.v1
2501.17725 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-11T06:34:44.6726+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-03T03:49:16.974309Z

measured 0 of 1 external citation measurements

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

Source: cited_works

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 587d4db1-a206-4a17-8df9-f3ffaed2e825 · inbound

Improved Upper Bounds for Slicing the Hypercube cites this paper.

Improved Upper Bounds for Slicing the Hypercube Using Code Generation to Solve Open Instances of Combinatorial Design Problems

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-03T03:49:16.974309Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-03T03:49:16.974309Z digest=sha256:9656e54355a82d5be618f264e25159ea7bfc5114d38739034151bc5658bff47a

Observation abd3dcb4-9d1c-44b6-99e8-bcd1a394100d · inbound

Complex generalised weighing matrices in centraliser algebras of monomial representations cites this paper.

Complex generalised weighing matrices in centraliser algebras of monomial representations Using Code Generation to Solve Open Instances of Combinatorial Design Problems

Reference 2025

Resolution
unresolved
no resolver link, observed 2026-08-01T21:36:19.309277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-01T21:36:19.309277Z digest=sha256:f5b3a963252bc41bf4cf9ac40d3912ea6fe658bddd23b7148fe01bf88d57cd72