{"as_of":"2026-08-13T13:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7a911943d7e54381408858f3c3f1dce41a75739163ae24e29644edfd18892514","coverage":[{"denominator":11,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:19:00.356533Z","state":"measured"},{"denominator":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"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.14676/citation-record","integrity":"/paper/2411.14676/integrity","json":"/paper/2411.14676/citation-record.json","paper":"/paper/2411.14676"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.01630","last_updated":"2023-11-02T22:49:41Z","snapshot_observed_at":"2026-08-13T05:33:47.267876Z","submitted_at":"2023-11-02T22:49:41Z","title":"Generalizations of Matrix Multiplication can solve the Light Bulb Problem","version":1},"cited_work":{"arxiv_id":"2311.01630","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.01630","snapshot_observed_at":"2026-08-12T15:19:00.668216Z","title":"Generalizations of Matrix Multiplication can solve the Light Bulb Problem","venue":"cs.DS","work_id":"ace59d42-cc79-484d-80e5-ab3b31d47e51","year":2023},"citing_paper":{"arxiv_id":"2411.14676","last_updated":"2024-11-22T02:17:48Z","snapshot_observed_at":"2026-08-12T14:59:29.527492Z","submitted_at":"2024-11-22T02:17:48Z","title":"Depth-first search for tensor rank and border rank over finite fields","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T15:19:00.280159Z"},"links":{"cited_paper":"/paper/2311.01630","citing_paper":"/paper/2411.14676"},"observation_digest":"sha256:d251a28df2781b709e6e42f31f8acdac06529de95fa296903781da3c74e18b9c","observation_id":"d8e0a2ac-57dd-4d00-98dc-0d4c4c6c57a4","resolution":{"observed_at":"2026-08-12T15:19:00.680920Z","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":{"arxiv_id":"2309.04683","last_updated":"2024-01-02T16:02:37Z","snapshot_observed_at":"2026-08-13T10:17:32.856472Z","submitted_at":"2023-09-09T04:40:32Z","title":"Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming","version":2},"cited_work":{"arxiv_id":"2309.04683","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.04683","snapshot_observed_at":"2026-08-12T15:19:00.633476Z","title":"Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming","venue":"cs.CC","work_id":"9553c455-e598-4c0e-82a2-5ff3ad2ff0ac","year":2023},"citing_paper":{"arxiv_id":"2411.14676","last_updated":"2024-11-22T02:17:48Z","snapshot_observed_at":"2026-08-12T14:59:29.527492Z","submitted_at":"2024-11-22T02:17:48Z","title":"Depth-first search for tensor rank and border rank over finite fields","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T15:19:00.287255Z"},"links":{"cited_paper":"/paper/2309.04683","citing_paper":"/paper/2411.14676"},"observation_digest":"sha256:c257143e03ad4b97c0e976c7f5c14ad27bd3c4c6a5de7ddfcd7c61d4e1d48a5f","observation_id":"818efe62-2810-403b-96b2-7b404c388c9c","resolution":{"observed_at":"2026-08-12T15:19:00.641678Z","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-12T15:19:00.765134Z","title":null,"venue":null,"work_id":"226fb3fb-438c-4b7a-a593-6417d817a3ea","year":2013},"citing_paper":{"arxiv_id":"2411.14676","last_updated":"2024-11-22T02:17:48Z","snapshot_observed_at":"2026-08-12T14:59:29.527492Z","submitted_at":"2024-11-22T02:17:48Z","title":"Depth-first search for tensor rank and border rank over finite fields","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T15:19:00.293784Z"},"links":{"citing_paper":"/paper/2411.14676"},"observation_digest":"sha256:829aaf3e2c08782088c3bb1200ff7abb4f49a56719550b2d3fa51a28b1f1bb5d","observation_id":"24cccf0c-8161-49e0-a553-6ccedf6a6d7b","resolution":{"observed_at":"2026-08-12T15:19:00.772214Z","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":{"arxiv_id":"2211.05345","last_updated":"2022-11-10T05:11:04Z","snapshot_observed_at":"2026-08-13T13:45:34.777145Z","submitted_at":"2022-11-10T05:11:04Z","title":"Finding Triangles and Other Small Subgraphs in Geometric Intersection Graphs","version":1},"cited_work":{"arxiv_id":"2211.05345","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.05345","snapshot_observed_at":"2026-08-12T15:19:00.602143Z","title":"Finding Triangles and Other Small Subgraphs in Geometric Intersection Graphs","venue":"cs.CG","work_id":"9342a704-479c-4e25-a30b-59449598e8a0","year":2022},"citing_paper":{"arxiv_id":"2411.14676","last_updated":"2024-11-22T02:17:48Z","snapshot_observed_at":"2026-08-12T14:59:29.527492Z","submitted_at":"2024-11-22T02:17:48Z","title":"Depth-first search for tensor rank and border rank over finite fields","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T15:19:00.301573Z"},"links":{"cited_paper":"/paper/2211.05345","citing_paper":"/paper/2411.14676"},"observation_digest":"sha256:905885f2df82420e544d07eeffba2ab78572533af585b364c116a678872c1cfe","observation_id":"a3340fd7-c447-4643-acf4-44029e3819e0","resolution":{"observed_at":"2026-08-12T15:19:00.610488Z","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-12T15:19:00.730946Z","title":null,"venue":null,"work_id":"da8f7ec3-137f-409c-9c6e-08dae582e3c1","year":2024},"citing_paper":{"arxiv_id":"2411.14676","last_updated":"2024-11-22T02:17:48Z","snapshot_observed_at":"2026-08-12T14:59:29.527492Z","submitted_at":"2024-11-22T02:17:48Z","title":"Depth-first search for tensor rank and border rank over finite fields","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T15:19:00.308634Z"},"links":{"citing_paper":"/paper/2411.14676"},"observation_digest":"sha256:d934a1b2fdcffab0216018a50272a38415aeaa0e9ff94ac4a845376ea8d3ea5f","observation_id":"28adafc1-c1c5-49bd-8b40-1ea5f69a34d4","resolution":{"observed_at":"2026-08-12T15:19:00.739021Z","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":{"arxiv_id":"1108.2830","last_updated":"2011-08-19T09:02:22Z","snapshot_observed_at":"2026-07-06T02:32:23.318637Z","submitted_at":"2011-08-14T00:23:37Z","title":"A New General-Purpose Method to Multiply 3x3 Matrices Using Only 23 Multiplications","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1108.2830","snapshot_observed_at":"2026-08-12T15:19:00.315081Z","title":"and Bard, Gregory V","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2411.14676","last_updated":"2024-11-22T02:17:48Z","snapshot_observed_at":"2026-08-12T14:59:29.527492Z","submitted_at":"2024-11-22T02:17:48Z","title":"Depth-first search for tensor rank and border rank over finite fields","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T15:19:00.315081Z"},"links":{"cited_paper":"/paper/1108.2830","citing_paper":"/paper/2411.14676"},"observation_digest":"sha256:38f5500c38d9aef086f8d000c41a6a7f8b253dcb378f6ba1f61677c872205e1e","observation_id":"7784e81a-5539-405a-9765-945ed864b94c","resolution":{"observed_at":"2026-08-12T15:19:00.315081Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:19:00.702993Z","title":null,"venue":null,"work_id":"b9d9e404-033c-4653-8e13-6f537d76dcbc","year":2022},"citing_paper":{"arxiv_id":"2411.14676","last_updated":"2024-11-22T02:17:48Z","snapshot_observed_at":"2026-08-12T14:59:29.527492Z","submitted_at":"2024-11-22T02:17:48Z","title":"Depth-first search for tensor rank and border rank over finite fields","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T15:19:00.323144Z"},"links":{"citing_paper":"/paper/2411.14676"},"observation_digest":"sha256:9e472d173312b9f4744276adb58dda3c789c10336d265729e78432094024bfbb","observation_id":"f2defcc8-95f1-4833-8619-86a0225546b8","resolution":{"observed_at":"2026-08-12T15:19:00.711502Z","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":{"arxiv_id":"1903.11391","last_updated":"2019-08-19T07:18:38Z","snapshot_observed_at":"2026-08-08T14:53:38.838032Z","submitted_at":"2019-03-27T12:53:51Z","title":"Local Search for Fast Matrix Multiplication","version":2},"cited_work":{"arxiv_id":"1903.11391","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.11391","snapshot_observed_at":"2026-08-12T15:19:00.507275Z","title":"Local Search for Fast Matrix Multiplication","venue":"cs.LO","work_id":"b361c1ad-d55c-4f1b-ac65-f120f37968e0","year":2019},"citing_paper":{"arxiv_id":"2411.14676","last_updated":"2024-11-22T02:17:48Z","snapshot_observed_at":"2026-08-12T14:59:29.527492Z","submitted_at":"2024-11-22T02:17:48Z","title":"Depth-first search for tensor rank and border rank over finite fields","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T15:19:00.331668Z"},"links":{"cited_paper":"/paper/1903.11391","citing_paper":"/paper/2411.14676"},"observation_digest":"sha256:2e181d6f4c13473fe27f866378f365460e2bdd55794660ac7efac27cd41029e8","observation_id":"a9dc8e52-c5a4-4c05-872a-7491058dba8c","resolution":{"observed_at":"2026-08-12T15:19:00.514691Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T15:19:00.339736Z","title":null,"venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2411.14676","last_updated":"2024-11-22T02:17:48Z","snapshot_observed_at":"2026-08-12T14:59:29.527492Z","submitted_at":"2024-11-22T02:17:48Z","title":"Depth-first search for tensor rank and border rank over finite fields","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T15:19:00.339736Z"},"links":{"citing_paper":"/paper/2411.14676"},"observation_digest":"sha256:f967557cf1ef8cef22341193ff02992b7dbf50dd1988756d506f18fce0594f88","observation_id":"c1fb12eb-030d-4d12-acbd-209c8eaf5731","resolution":{"observed_at":"2026-08-12T15:19:00.339736Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.01175","last_updated":"2022-12-02T13:58:57Z","snapshot_observed_at":"2026-08-13T13:29:22.120373Z","submitted_at":"2022-12-02T13:58:57Z","title":"Flip Graphs for Matrix Multiplication","version":1},"cited_work":{"arxiv_id":"2212.01175","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.01175","snapshot_observed_at":"2026-08-12T15:19:00.458156Z","title":"Flip Graphs for Matrix Multiplication","venue":"cs.SC","work_id":"e4284294-bdaf-4180-a843-93538f0e6a11","year":2022},"citing_paper":{"arxiv_id":"2411.14676","last_updated":"2024-11-22T02:17:48Z","snapshot_observed_at":"2026-08-12T14:59:29.527492Z","submitted_at":"2024-11-22T02:17:48Z","title":"Depth-first search for tensor rank and border rank over finite fields","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T15:19:00.347347Z"},"links":{"cited_paper":"/paper/2212.01175","citing_paper":"/paper/2411.14676"},"observation_digest":"sha256:b5c85b3964c156fa428ee83972a45acf8e7fb92c0e5f5ff69ad08775fddc60d9","observation_id":"10d07502-23d7-4103-9451-4ce1e667369b","resolution":{"observed_at":"2026-08-12T15:19:00.471218Z","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":{"arxiv_id":"1611.01559","last_updated":"2016-11-04T22:46:27Z","snapshot_observed_at":"2026-08-11T10:58:34.567117Z","submitted_at":"2016-11-04T22:46:27Z","title":"How hard is the tensor rank?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.01559","snapshot_observed_at":"2026-08-12T15:19:00.356533Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2411.14676","last_updated":"2024-11-22T02:17:48Z","snapshot_observed_at":"2026-08-12T14:59:29.527492Z","submitted_at":"2024-11-22T02:17:48Z","title":"Depth-first search for tensor rank and border rank over finite fields","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T15:19:00.356533Z"},"links":{"cited_paper":"/paper/1611.01559","citing_paper":"/paper/2411.14676"},"observation_digest":"sha256:fc89eb967532313add3defad8623438263ef2beffb2688d3d8e97f4c73a1cd9a","observation_id":"552c14bb-ff67-4ecf-b1a6-87d388100266","resolution":{"observed_at":"2026-08-12T15:19:00.356533Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2411.14676","last_updated":"2024-11-22T02:17:48Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-12T14:59:29.527492Z","submitted_at":"2024-11-22T02:17:48Z","title":"Depth-first search for tensor rank and border rank over finite fields"},"reference_resolution":{"displayed":11,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":5,"verified_fuzzy":0},"total_outbound_references":11},"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 13 August 2026, this Paper Citation Record lists 11 of 11 outbound references and 0 inbound Pith citation observations for arXiv:2411.14676."}