{"as_of":"2026-08-14T06:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8983c3998f3035a4d575880ead2d3af01fd82d1c9e4db85edbd2e21c75385acd","coverage":[{"denominator":8,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T14:10:49.336239Z","state":"measured"},{"denominator":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2411.16744/citation-record","integrity":"/paper/2411.16744/integrity","json":"/paper/2411.16744/citation-record.json","paper":"/paper/2411.16744"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T14:10:49.429305Z","title":null,"venue":null,"work_id":"a5041017-e0f7-43f0-8506-0cccaf81912b","year":2011},"citing_paper":{"arxiv_id":"2411.16744","last_updated":"2024-11-23T19:52:11Z","snapshot_observed_at":"2026-08-12T14:02:35.671015Z","submitted_at":"2024-11-23T19:52:11Z","title":"From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T14:10:49.311114Z"},"links":{"citing_paper":"/paper/2411.16744"},"observation_digest":"sha256:9816d882b4832c44ffc4fa2f2fa332daf49999f8a0acab9a6413b754eb0d82ca","observation_id":"1c5853db-62d2-4d8b-b651-a4ed65753aa7","resolution":{"observed_at":"2026-08-12T14:10:49.432580Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T14:10:49.419475Z","title":"Proof without words: Alternating row sums in pascal’s t riangle","venue":null,"work_id":"f56a90ed-bc1b-4658-a512-a9b9c8361b88","year":2016},"citing_paper":{"arxiv_id":"2411.16744","last_updated":"2024-11-23T19:52:11Z","snapshot_observed_at":"2026-08-12T14:02:35.671015Z","submitted_at":"2024-11-23T19:52:11Z","title":"From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T14:10:49.314894Z"},"links":{"citing_paper":"/paper/2411.16744"},"observation_digest":"sha256:6de4cccf0b838ff4e7bf9ec98b3dbd78b1d8dd4ee01fde14795475b144a515b8","observation_id":"e93c9514-50ec-4175-9e03-fd84368a4abb","resolution":{"observed_at":"2026-08-12T14:10:49.423641Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T14:10:49.410075Z","title":null,"venue":null,"work_id":"2d387c11-a987-4a18-9856-80e72058312a","year":2010},"citing_paper":{"arxiv_id":"2411.16744","last_updated":"2024-11-23T19:52:11Z","snapshot_observed_at":"2026-08-12T14:02:35.671015Z","submitted_at":"2024-11-23T19:52:11Z","title":"From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T14:10:49.318826Z"},"links":{"citing_paper":"/paper/2411.16744"},"observation_digest":"sha256:edc67a75a3ddd0a6abe963f90837720c51310473b668085ad79d9a2dd60ac747","observation_id":"6e3d86a5-0bcf-40f1-af37-de0cf9161655","resolution":{"observed_at":"2026-08-12T14:10:49.413449Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T14:10:49.400304Z","title":"Grimaldi","venue":null,"work_id":"2f58a4db-5814-40cf-a353-2585f11a0885","year":1998},"citing_paper":{"arxiv_id":"2411.16744","last_updated":"2024-11-23T19:52:11Z","snapshot_observed_at":"2026-08-12T14:02:35.671015Z","submitted_at":"2024-11-23T19:52:11Z","title":"From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T14:10:49.323059Z"},"links":{"citing_paper":"/paper/2411.16744"},"observation_digest":"sha256:2b40cb1b67a6c5bbbabf3b871cdc4f46f79c436a1414a71515bd3807289bc4f5","observation_id":"7af3fa82-0d32-4c21-943a-3416b340c367","resolution":{"observed_at":"2026-08-12T14:10:49.403694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T14:10:49.391288Z","title":"An Invitation to Combinatorics","venue":null,"work_id":"ea30cc5b-bc69-401b-b572-29e534ce0080","year":2021},"citing_paper":{"arxiv_id":"2411.16744","last_updated":"2024-11-23T19:52:11Z","snapshot_observed_at":"2026-08-12T14:02:35.671015Z","submitted_at":"2024-11-23T19:52:11Z","title":"From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T14:10:49.326242Z"},"links":{"citing_paper":"/paper/2411.16744"},"observation_digest":"sha256:f144f6791f840dbed3acc0eaefd853d7189c224f5ef6e485651e4f7c56e87e23","observation_id":"dc75e7a8-37e8-4a27-b5c2-4097769a425c","resolution":{"observed_at":"2026-08-12T14:10:49.394525Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"math/0204320","last_updated":"2003-01-30T10:44:32Z","snapshot_observed_at":"2026-07-07T05:29:53.015159Z","submitted_at":"2002-04-26T07:30:59Z","title":"Counting occurrences of some subword patterns","version":2},"cited_work":{"arxiv_id":"math/0204320","doi":null,"metadata_source":"pith","pith_arxiv_id":"math/0204320","snapshot_observed_at":"2026-08-12T14:10:49.361590Z","title":"Counting occurrences of some subword patterns","venue":"math.CO","work_id":"47425e2c-0611-44e2-b066-a20e85e3f3fc","year":2002},"citing_paper":{"arxiv_id":"2411.16744","last_updated":"2024-11-23T19:52:11Z","snapshot_observed_at":"2026-08-12T14:02:35.671015Z","submitted_at":"2024-11-23T19:52:11Z","title":"From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T14:10:49.329663Z"},"links":{"cited_paper":"/paper/math/0204320","citing_paper":"/paper/2411.16744"},"observation_digest":"sha256:f5c193c4a75b54cb5e575be93b3400b2987d56ccf8c64cc6c83e04cb580e4855","observation_id":"9ecdcd93-0deb-4e45-abc7-6ebafc50a60c","resolution":{"observed_at":"2026-08-12T14:10:49.366881Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T14:10:49.382205Z","title":"Counting s ubwords in a partition of a set","venue":null,"work_id":"bc344690-6cb3-4dab-a033-67343860a12a","year":2010},"citing_paper":{"arxiv_id":"2411.16744","last_updated":"2024-11-23T19:52:11Z","snapshot_observed_at":"2026-08-12T14:02:35.671015Z","submitted_at":"2024-11-23T19:52:11Z","title":"From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T14:10:49.333292Z"},"links":{"citing_paper":"/paper/2411.16744"},"observation_digest":"sha256:de5298c7c7264e4bac5d2b498effc61fe35ae1bb1e7c999cc26fad16c2bd5249","observation_id":"405b4f0c-21d6-4127-838f-f9b9f0526335","resolution":{"observed_at":"2026-08-12T14:10:49.385237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-08-12T14:10:49.373182Z","title":"Combinatorics formula repository, 2024","venue":null,"work_id":"44cd3fb8-76a5-41b7-8f5a-d51f714ff6c9","year":2024},"citing_paper":{"arxiv_id":"2411.16744","last_updated":"2024-11-23T19:52:11Z","snapshot_observed_at":"2026-08-12T14:02:35.671015Z","submitted_at":"2024-11-23T19:52:11Z","title":"From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T14:10:49.336239Z"},"links":{"citing_paper":"/paper/2411.16744"},"observation_digest":"sha256:d05e4ea3b0f3230ab3b491ba793f760718ab56d18b7a5a9d47916dad22125dfb","observation_id":"2a8a866d-f29d-41d1-92ee-8b438ab6ab11","resolution":{"observed_at":"2026-08-12T14:10:49.376264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.16744","last_updated":"2024-11-23T19:52:11Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-08-12T14:02:35.671015Z","submitted_at":"2024-11-23T19:52:11Z","title":"From Exponential to Polynomial Complexity: Efficient Permutation Counting with Subword Constraints"},"reference_resolution":{"displayed":8,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":1,"verified_fuzzy":5},"total_outbound_references":8},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 8 of 8 outbound references and 0 inbound Pith citation observations for arXiv:2411.16744."}