Pith. sign in

Paper Citation Record · LEDGER

Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux

As of 8 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 0 inbound Pith citation observations for arXiv:2104.11003.

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

pith.paper-citation-record.v1
2104.11003 v2

Coverage vector

measured 9 of 9 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-24T13:57:31.401485Z

measured 9 of 9 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

9 of 9 outbound references displayed

  • verified exact0
  • verified fuzzy3
  • unresolved6
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation c4fc5ebb-a91b-4f9f-8239-2d474c3f1e0c · outbound

This paper cites A partition ofL(3,n ) into saturated chains.

Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux A partition ofL(3,n ) into saturated chains

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T13:59:33.240338Z

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.

source=pdf_text observed=2026-05-24T13:57:31.401485Z digest=sha256:155a81a5e13d041131c701623c42856c59e05d87377f3c728d556f655ea229ce

Observation a2a7550d-2817-4b32-917e-92c2a2854cef · outbound

This paper cites an unresolved cited work.

Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux Unresolved cited work

Reference 2

Resolution
unresolved
raw_fallback, observed 2026-05-24T13:59:33.231843Z

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.

source=pdf_text observed=2026-05-24T13:57:31.401485Z digest=sha256:5254472a0d4f85b173e11e20585588b1ccb15129d67d42ab511f7b74d30053ae

Observation 7e04c92c-03ae-4680-a9ee-f53d58a3ff38 · outbound

This paper cites an unresolved cited work.

Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux Unresolved cited work

Reference 3

Resolution
unresolved
raw_fallback, observed 2026-05-24T13:59:33.235837Z

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.

source=pdf_text observed=2026-05-24T13:57:31.401485Z digest=sha256:b0a0cb40caab300e13e6c9842bf140ebb0eda14246652d8c057e01bdedf26d7b

Observation 3bd24777-6b36-4031-8b01-c27b7b05ffa8 · outbound

This paper cites an unresolved cited work.

Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux Unresolved cited work

Reference 4

Resolution
unresolved
raw_fallback, observed 2026-05-24T13:59:33.244008Z

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.

source=pdf_text observed=2026-05-24T13:57:31.401485Z digest=sha256:adaca3a4568ba157e5d0cc331f37301123ea611cf0010d9702705d354854cbc2

Observation d8ab125c-6937-4b62-8af3-fe8ce4919f26 · outbound

This paper cites an unresolved cited work.

Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux Unresolved cited work

Reference 5

Resolution
unresolved
raw_fallback, observed 2026-05-24T13:59:33.248016Z

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.

source=pdf_text observed=2026-05-24T13:57:31.401485Z digest=sha256:f7199f517830f150cf1fdfad9f97fcd1e5a6108db3ce992af677038200c9f96d

Observation 26488e21-0e62-4c8a-a9be-6f36518c130b · outbound

This paper cites Sylvester.

Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux Sylvester

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T13:59:33.253082Z

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.

source=pdf_text observed=2026-05-24T13:57:31.401485Z digest=sha256:862b275b7b106f981c571a0b92edda7dd22bc713a3f3d36d5499d63fd15a9f7a

Observation 071e62bc-f69f-4499-a537-b725eac5b5c9 · outbound

This paper cites an unresolved cited work.

Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux Unresolved cited work

Reference 7

Resolution
unresolved
raw_fallback, observed 2026-05-24T13:59:33.227391Z

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.

source=pdf_text observed=2026-05-24T13:57:31.401485Z digest=sha256:ad5b3db94668c45510eb4d34a78853738358ca02146aa21e2a4440ef16efc2c0

Observation 329d62ed-857c-401e-96f2-a1ad479ccac2 · outbound

This paper cites an unresolved cited work.

Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux Unresolved cited work

Reference 8

Resolution
unresolved
raw_fallback, observed 2026-05-24T13:59:33.223899Z

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.

source=pdf_text observed=2026-05-24T13:57:31.401485Z digest=sha256:2517fb553ae69c98125c8b0223a28b76a81567f8d6564d8244c1c21e76701b9a

Observation dc2b57b4-cc89-436d-be26-0abbab3c58f3 · outbound

This paper cites Kathy O’Hara’s Constructive proof of the Unimodality of the Gaussian Polyno- mials.

Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux Kathy O’Hara’s Constructive proof of the Unimodality of the Gaussian Polyno- mials

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-05-24T13:59:33.220156Z

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.

source=pdf_text observed=2026-05-24T13:57:31.401485Z digest=sha256:0c6fa253faf20e1c743e510f0965c625d509f80719992f788287befe498985ee

Pith citing papers

No inbound Pith citation observations are available.