{"as_of":"2026-08-11T09:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0e4a963ddec775c526a090819db57d39c2cb227539e6c1ba3a127ad9e3412e61","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-11T06:34:44.6726+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-11T01:04:45.167766Z","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-18T01:00:34.307482Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.17511","last_updated":"2023-06-30T09:56:05Z","snapshot_observed_at":"2026-08-04T17:17:38.192213Z","submitted_at":"2023-06-30T09:56:05Z","title":"Computational Complexity in Algebraic Combinatorics","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.17511","snapshot_observed_at":"2026-08-11T01:04:45.167766Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.18984","last_updated":"2024-12-25T21:23:06Z","snapshot_observed_at":"2026-08-11T04:35:41.783647Z","submitted_at":"2024-12-25T21:23:06Z","title":"Positivity of Schubert Coefficients","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-11T01:04:45.167766Z"},"links":{"cited_paper":"/paper/2306.17511","citing_paper":"/paper/2412.18984"},"observation_digest":"sha256:8ec245b6945d8ecff70266b104280f6a436252ee7d403ada700630cfeea4e734","observation_id":"379c0fd8-cdc0-42f7-956d-31b662fc5081","resolution":{"observed_at":"2026-08-11T01:04:45.167766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.17511","last_updated":"2023-06-30T09:56:05Z","snapshot_observed_at":"2026-08-04T17:17:38.192213Z","submitted_at":"2023-06-30T09:56:05Z","title":"Computational Complexity in Algebraic Combinatorics","version":1},"cited_work":{"arxiv_id":"2306.17511","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.17511","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Computational complexity in algebraic combinatorics","venue":null,"work_id":"7e18131e-20bc-46bb-8d4c-a2cc10e6836d","year":null},"citing_paper":{"arxiv_id":"2511.02649","last_updated":"2026-04-04T04:48:03Z","snapshot_observed_at":"2026-08-06T10:25:42.348288Z","submitted_at":"2025-11-04T15:17:03Z","title":"A geometric and generating function approach to plethysm","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-18T00:59:04.602773Z"},"links":{"cited_paper":"/paper/2306.17511","citing_paper":"/paper/2511.02649"},"observation_digest":"sha256:0bd590b467534d86bc06565a539e6e9283f178b7745f5d37e1b03878e26a81b9","observation_id":"82f2844b-9e25-468d-92f1-aca17ef35def","resolution":{"observed_at":"2026-05-18T01:00:34.310071Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2306.17511/citation-record","integrity":"/paper/2306.17511/integrity","json":"/paper/2306.17511/citation-record.json","paper":"/paper/2306.17511"},"outbound":[],"paper":{"arxiv_id":"2306.17511","last_updated":"2023-06-30T09:56:05Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-04T17:17:38.192213Z","submitted_at":"2023-06-30T09:56:05Z","title":"Computational Complexity in Algebraic Combinatorics"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2306.17511."}