{"as_of":"2026-08-15T22:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:13942f30fd6849d016c9e262a3e23a44bdfebbae0d7a4d41fdfb50a0bf5777bc","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:11:58.379108Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T22:46:12.763587Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2105.15181","last_updated":"2021-05-31T17:45:02Z","snapshot_observed_at":"2026-07-06T11:14:31.306862Z","submitted_at":"2021-05-31T17:45:02Z","title":"Extending higher Bruhat orders to non-longest words in $S_n$","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.15181","snapshot_observed_at":"2026-08-07T05:11:58.379108Z","title":"The cluster complex of an hereditary Artin algebra","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.08858","last_updated":"2025-06-10T14:48:25Z","snapshot_observed_at":"2026-08-15T06:07:13.661338Z","submitted_at":"2025-06-10T14:48:25Z","title":"Preorders on maximal chains: hyperplane arrangements, Cambrian lattices, and maximal green sequences","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T05:11:58.379108Z"},"links":{"cited_paper":"/paper/2105.15181","citing_paper":"/paper/2506.08858"},"observation_digest":"sha256:71a63c285c5879ece80667dcb3f45da8b45fd43528984c0ab22d245b8405cb44","observation_id":"afcedd51-6293-4996-b493-7205fdc40f2e","resolution":{"observed_at":"2026-08-07T05:11:58.379108Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.15181","last_updated":"2021-05-31T17:45:02Z","snapshot_observed_at":"2026-07-06T11:14:31.306862Z","submitted_at":"2021-05-31T17:45:02Z","title":"Extending higher Bruhat orders to non-longest words in $S_n$","version":1},"cited_work":{"arxiv_id":"2105.15181","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2105.15181","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Extending higher Bruhat orders to non-longest words inS n","venue":null,"work_id":"d37ab35b-a9d8-41f6-b50a-9dd0b826d341","year":2021},"citing_paper":{"arxiv_id":"2604.24573","last_updated":"2026-04-27T15:02:36Z","snapshot_observed_at":"2026-07-06T23:10:33.821313Z","submitted_at":"2026-04-27T15:02:36Z","title":"Commutation classes of reduced words and higher Bruhat orders for affine permutations","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-08T02:26:35.622459Z"},"links":{"cited_paper":"/paper/2105.15181","citing_paper":"/paper/2604.24573"},"observation_digest":"sha256:609510e6e364eb777ddd53c1638302ba7a0e5ccf55f2cdd56a03eda0156fd5dd","observation_id":"9e6eb4ff-60ae-4949-8c51-ebdd65c1487d","resolution":{"observed_at":"2026-05-11T22:46:12.774501Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2105.15181/citation-record","integrity":"/paper/2105.15181/integrity","json":"/paper/2105.15181/citation-record.json","paper":"/paper/2105.15181"},"outbound":[],"paper":{"arxiv_id":"2105.15181","last_updated":"2021-05-31T17:45:02Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-07-06T11:14:31.306862Z","submitted_at":"2021-05-31T17:45:02Z","title":"Extending higher Bruhat orders to non-longest words in $S_n$"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2105.15181."}