{"as_of":"2026-08-08T02:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9f805f05b2b2bcfcade4ea15eb3518511293ce8cfcd4e2ed6c20481465e743d7","coverage":[{"denominator":9,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-24T13:57:31.401485Z","state":"measured"},{"denominator":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2104.11003/citation-record","integrity":"/paper/2104.11003/integrity","json":"/paper/2104.11003/citation-record.json","paper":"/paper/2104.11003"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A partition ofL(3,n ) into saturated chains","venue":null,"work_id":"6f18c710-91a2-4d63-a9eb-347650cd9483","year":1980},"citing_paper":{"arxiv_id":"2104.11003","last_updated":"2026-05-09T01:40:52Z","snapshot_observed_at":"2026-07-06T11:02:42.843922Z","submitted_at":"2021-04-22T11:58:28Z","title":"Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-24T13:57:31.401485Z"},"links":{"citing_paper":"/paper/2104.11003"},"observation_digest":"sha256:155a81a5e13d041131c701623c42856c59e05d87377f3c728d556f655ea229ce","observation_id":"c4fc5ebb-a91b-4f9f-8239-2d474c3f1e0c","resolution":{"observed_at":"2026-05-24T13:59:33.240338Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"e00a42f5-b780-4cce-a610-48809469e732","year":1990},"citing_paper":{"arxiv_id":"2104.11003","last_updated":"2026-05-09T01:40:52Z","snapshot_observed_at":"2026-07-06T11:02:42.843922Z","submitted_at":"2021-04-22T11:58:28Z","title":"Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-24T13:57:31.401485Z"},"links":{"citing_paper":"/paper/2104.11003"},"observation_digest":"sha256:5254472a0d4f85b173e11e20585588b1ccb15129d67d42ab511f7b74d30053ae","observation_id":"a2a7550d-2817-4b32-917e-92c2a2854cef","resolution":{"observed_at":"2026-05-24T13:59:33.231843Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"a429e26b-f693-40d7-a035-97b1f913ff29","year":2013},"citing_paper":{"arxiv_id":"2104.11003","last_updated":"2026-05-09T01:40:52Z","snapshot_observed_at":"2026-07-06T11:02:42.843922Z","submitted_at":"2021-04-22T11:58:28Z","title":"Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-24T13:57:31.401485Z"},"links":{"citing_paper":"/paper/2104.11003"},"observation_digest":"sha256:b0a0cb40caab300e13e6c9842bf140ebb0eda14246652d8c057e01bdedf26d7b","observation_id":"7e04c92c-03ae-4680-a9ee-f53d58a3ff38","resolution":{"observed_at":"2026-05-24T13:59:33.235837Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"52dd2e55-354b-4006-99d3-d42b1823630e","year":2010},"citing_paper":{"arxiv_id":"2104.11003","last_updated":"2026-05-09T01:40:52Z","snapshot_observed_at":"2026-07-06T11:02:42.843922Z","submitted_at":"2021-04-22T11:58:28Z","title":"Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-24T13:57:31.401485Z"},"links":{"citing_paper":"/paper/2104.11003"},"observation_digest":"sha256:adaca3a4568ba157e5d0cc331f37301123ea611cf0010d9702705d354854cbc2","observation_id":"3bd24777-6b36-4031-8b01-c27b7b05ffa8","resolution":{"observed_at":"2026-05-24T13:59:33.244008Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7ae4648d-f80f-4d73-ace5-7986d68590b0","year":1980},"citing_paper":{"arxiv_id":"2104.11003","last_updated":"2026-05-09T01:40:52Z","snapshot_observed_at":"2026-07-06T11:02:42.843922Z","submitted_at":"2021-04-22T11:58:28Z","title":"Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-24T13:57:31.401485Z"},"links":{"citing_paper":"/paper/2104.11003"},"observation_digest":"sha256:f7199f517830f150cf1fdfad9f97fcd1e5a6108db3ce992af677038200c9f96d","observation_id":"d8ab125c-6937-4b62-8af3-fe8ce4919f26","resolution":{"observed_at":"2026-05-24T13:59:33.248016Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Sylvester","venue":null,"work_id":"4b39ff63-8f3d-49a2-b767-129cbd6ef02f","year":1973},"citing_paper":{"arxiv_id":"2104.11003","last_updated":"2026-05-09T01:40:52Z","snapshot_observed_at":"2026-07-06T11:02:42.843922Z","submitted_at":"2021-04-22T11:58:28Z","title":"Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-24T13:57:31.401485Z"},"links":{"citing_paper":"/paper/2104.11003"},"observation_digest":"sha256:862b275b7b106f981c571a0b92edda7dd22bc713a3f3d36d5499d63fd15a9f7a","observation_id":"26488e21-0e62-4c8a-a9be-6f36518c130b","resolution":{"observed_at":"2026-05-24T13:59:33.253082Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"fa6f4f4e-f52f-4292-a56a-de673911af29","year":2004},"citing_paper":{"arxiv_id":"2104.11003","last_updated":"2026-05-09T01:40:52Z","snapshot_observed_at":"2026-07-06T11:02:42.843922Z","submitted_at":"2021-04-22T11:58:28Z","title":"Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-24T13:57:31.401485Z"},"links":{"citing_paper":"/paper/2104.11003"},"observation_digest":"sha256:ad5b3db94668c45510eb4d34a78853738358ca02146aa21e2a4440ef16efc2c0","observation_id":"071e62bc-f69f-4499-a537-b725eac5b5c9","resolution":{"observed_at":"2026-05-24T13:59:33.227391Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"c72a7d39-71f9-4bd7-8fb2-fe46dec3c1af","year":1980},"citing_paper":{"arxiv_id":"2104.11003","last_updated":"2026-05-09T01:40:52Z","snapshot_observed_at":"2026-07-06T11:02:42.843922Z","submitted_at":"2021-04-22T11:58:28Z","title":"Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-24T13:57:31.401485Z"},"links":{"citing_paper":"/paper/2104.11003"},"observation_digest":"sha256:2517fb553ae69c98125c8b0223a28b76a81567f8d6564d8244c1c21e76701b9a","observation_id":"329d62ed-857c-401e-96f2-a1ad479ccac2","resolution":{"observed_at":"2026-05-24T13:59:33.223899Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Kathy O’Hara’s Constructive proof of the Unimodality of the Gaussian Polyno- mials","venue":null,"work_id":"e0a27590-a2c9-409e-8697-32fd45049f65","year":1989},"citing_paper":{"arxiv_id":"2104.11003","last_updated":"2026-05-09T01:40:52Z","snapshot_observed_at":"2026-07-06T11:02:42.843922Z","submitted_at":"2021-04-22T11:58:28Z","title":"Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-24T13:57:31.401485Z"},"links":{"citing_paper":"/paper/2104.11003"},"observation_digest":"sha256:0c6fa253faf20e1c743e510f0965c625d509f80719992f788287befe498985ee","observation_id":"dc2b57b4-cc89-436d-be26-0abbab3c58f3","resolution":{"observed_at":"2026-05-24T13:59:33.220156Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2104.11003","last_updated":"2026-05-09T01:40:52Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-07-06T11:02:42.843922Z","submitted_at":"2021-04-22T11:58:28Z","title":"Constructing explicit Sperner chain decompositions for $L(3,n)$ and $L(4,n)$ via Greedy Algorithms and chain tableaux"},"reference_resolution":{"displayed":9,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":9},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"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."}