{"as_of":"2026-08-17T15:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:95680a224fe025b06b0ccecfd4f57c4042b5b428f409a074e09462a98f4d13ce","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:15:08.927389Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2608.13310/citation-record","integrity":"/paper/2608.13310/integrity","json":"/paper/2608.13310/citation-record.json","paper":"/paper/2608.13310"},"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-14T14:15:09.406920Z","title":"Recognizing Sumsets is NP-Complete","venue":null,"work_id":"209d08d4-4d82-4361-b4a8-bf4c2a923c00","year":2025},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.813380Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:36a93637fb9a06f633a787a8853c0abc5e9fefd32ba028a2dfc5406f6cd38ed6","observation_id":"8fe9dd5b-7b7f-4e3b-a72d-9307905d21c1","resolution":{"observed_at":"2026-08-14T14:15:09.410882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.364776Z","title":"Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max","venue":null,"work_id":"02643de0-fcbc-4956-9d42-c18de83e697f","year":2019},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.832662Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:b2a1f3aaed0f09d6b81431f77730079d0d02b4b9c722c16ad401a37a50714695","observation_id":"0b2ec280-f19e-43d9-8f62-276fea60bdff","resolution":{"observed_at":"2026-08-14T14:15:09.368613Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.308513Z","title":"Chan and Moshe Lewenstein","venue":null,"work_id":"36704a19-5239-433b-83d5-099091d9c261","year":2015},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.853939Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:e301686119d20897ae861a41e650fcc1acf4976c7702232c1cf09567df58b160","observation_id":"eb3f38c4-785c-4fb2-9446-a5ad5d8a3ffc","resolution":{"observed_at":"2026-08-14T14:15:09.312370Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.285513Z","title":"An Improved Pseudopolynomial Time Algorithm for Subset Sum","venue":null,"work_id":"6e0ad9c0-9278-4c88-ab0a-93a0e6896329","year":2024},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.860566Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:8aa1b2e3eb790081228e71245d206e1930e7f8f16cf77f672c649a6f276d97e9","observation_id":"b6bb12ad-b83c-4037-ae72-dc5de9b66231","resolution":{"observed_at":"2026-08-14T14:15:09.289488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.250311Z","title":"Chan, Virginia Vassilevska Williams, and Yinzhan Xu","venue":null,"work_id":"dc70a333-6cca-4b04-bd4f-aebbef34a24c","year":2023},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.871986Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:b493069f927a95c3d084edc0369fc1d4a24be542035940beb4221a79c48232dc","observation_id":"87f72117-90cf-462c-a3a7-467c7cb36a4b","resolution":{"observed_at":"2026-08-14T14:15:09.253916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.239120Z","title":"In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023), pages 2980–2990","venue":null,"work_id":"3f9ac200-535d-4ca7-9591-f3578be332e2","year":2023},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.875375Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:580477fabbf2c716d9b6f7ce3aa380c86689f5e8a6fb37a28dafacaf5ffe59c2","observation_id":"df2c376f-27ee-4da6-b8aa-a4af5bb67d0a","resolution":{"observed_at":"2026-08-14T14:15:09.243849Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.194958Z","title":"0-1 Knapsack in Nearly Quadratic Time","venue":null,"work_id":"f88cb401-232e-418a-a195-1f2872fb189d","year":2024},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.888115Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:d7464cf09029df70f5074a2af98bf2de79833274f4a022ebc07c0a0f2837de60","observation_id":"88654096-a081-4f23-9d71-aece514d813e","resolution":{"observed_at":"2026-08-14T14:15:09.198839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.182718Z","title":"In 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026), volume 374 of LIPIcs, pages 119:1–119:23","venue":null,"work_id":"80e36c69-c447-4b05-ae75-734467dd63b2","year":2026},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.891862Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:53f47a65b942046e702b8d6f11a1fe0759ec10e832074e5a3e64c8e4bd241b97","observation_id":"867c269b-e490-4538-a935-ce59bfce88ec","resolution":{"observed_at":"2026-08-14T14:15:09.186669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.041059Z","title":"On the Fine-Grained Com- plexity of One-Dimensional Dynamic Programming","venue":null,"work_id":"7d066c3b-22f7-49f2-a305-7fbf034eb8da","year":2017},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.898489Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:f005e18079970fcece625298b4841933c25a487b81d7210b7cf6d35b0868bf80","observation_id":"65f66af7-77d8-484f-b779-b359191ca5b4","resolution":{"observed_at":"2026-08-14T14:15:09.046405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"math/0501167","last_updated":"2005-04-28T17:39:39Z","snapshot_observed_at":"2026-07-07T05:45:56.417604Z","submitted_at":"2005-01-11T17:33:19Z","title":"Factorization of polynomials in one variable over the tropical semiring","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"math/0501167","snapshot_observed_at":"2026-08-14T14:15:08.902812Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.902812Z"},"links":{"cited_paper":"/paper/math/0501167","citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:f9522a91f84a4c236057e346e82dcaa156acd781ff941fdfac02fc017cc0c73c","observation_id":"6579b8de-50eb-4dc1-b045-193da5753c12","resolution":{"observed_at":"2026-08-14T14:15:08.902812Z","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-14T14:15:09.029103Z","title":"On lower bounds for the maximum consecutive subsums problem and the (min,+)-convolution","venue":null,"work_id":"0634837d-f15c-476a-bf8c-d60c6fa40d05","year":2014},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.906916Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:b88c625ff160f0969d1d5b604913f6ffb9a7572b7cc7b9733c6eb7d18ea5ea1b","observation_id":"15674962-2f2c-4d07-908b-4af991b80399","resolution":{"observed_at":"2026-08-14T14:15:09.033219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.228258Z","title":"Universe Reduction for APSP: Equivalence of Three Fine-Grained Hypotheses","venue":null,"work_id":"4d1027e1-697d-437e-9f02-622d19438bfd","year":2026},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":1949,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.878556Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:dbb18d93bd061221c3ce80c30361ef617bb75e17f62e0faeaf8e73bf5b8c8f2d","observation_id":"13fef928-bbbf-4a56-8ec0-e6fd63b216a5","resolution":{"observed_at":"2026-08-14T14:15:09.231985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.375147Z","title":"Better approximations for tree sparsity in nearly-linear time","venue":null,"work_id":"124bbbbf-7d63-47ff-a7f0-6424c6f0dcf9","year":2017},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":1952,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.827697Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:24c43c2379436c45227847b877aa266964e13e8e8edeadb7ca3f5956c81b727d","observation_id":"01be77bc-6c39-41d2-b09d-fcc49cf22e33","resolution":{"observed_at":"2026-08-14T14:15:09.378939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.205814Z","title":"Simple and faster algorithms for knapsack","venue":null,"work_id":"db885c8d-a2b2-4e77-a674-ba331f9a0b95","year":2024},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":1963,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.884799Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:e18da3c036b56929cb6987ed9cb3af9390713f0518ebeb7b7b9d32d4ef96863b","observation_id":"83860693-c14f-487e-86eb-66a0dc3395fb","resolution":{"observed_at":"2026-08-14T14:15:09.209744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.273379Z","title":"Chan and Ryan Williams","venue":null,"work_id":"a8d9b385-c6d1-4e09-827b-7246c3538c75","year":2016},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":1965,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.865070Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:2848db534f1c06719b6b157e8dad00fe558f98848ff04e09cd5d0a4fa7f25618","observation_id":"75147177-cab4-4d49-8888-152866679906","resolution":{"observed_at":"2026-08-14T14:15:09.277600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:08.993906Z","title":"Faster all-pairs shortest paths via circuit complexity","venue":null,"work_id":"de3f9958-756a-400a-95f6-ec685fbcb6fb","year":2014},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":1979,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.922977Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:994d29e1b74153f7945d302093103931d8c3b3a6a75db95c326a7fca2e1bf5d7","observation_id":"0c0f7514-3d5b-4474-b67a-2adafbfa4c1f","resolution":{"observed_at":"2026-08-14T14:15:08.997697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.016843Z","title":"A subquadratic approximation scheme for partition","venue":null,"work_id":"f4c6e4af-618c-4ac0-84bf-b64917caa9a9","year":2019},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":1987,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.910721Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:cb09e29fa3a99e7634dbb254798b73783a1ad27495b540a1d7d9e61f154cd6af","observation_id":"c702fa67-e6fc-4be5-8f47-1a8fe6acb4bd","resolution":{"observed_at":"2026-08-14T14:15:09.021593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.343065Z","title":"Knapsack with Small Items in Near-Quadratic Time","venue":null,"work_id":"7c8fe5a8-4ae0-435f-88d2-5d669a75bca1","year":2024},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":1992,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.841370Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:fa2cad8534bfa7c6a3f87b934e7269094dae7adf21098e2811ff92d3a01f301c","observation_id":"cd14c7ad-162d-4f39-b8d3-85b98d7e5e32","resolution":{"observed_at":"2026-08-14T14:15:09.347014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2607.10492","last_updated":"2026-07-11T21:57:20Z","snapshot_observed_at":"2026-08-09T09:19:41.613873Z","submitted_at":"2026-07-11T21:57:20Z","title":"Polynomials over idempotent semifields","version":1},"cited_work":{"arxiv_id":"2607.10492","doi":null,"metadata_source":"pith","pith_arxiv_id":"2607.10492","snapshot_observed_at":"2026-08-14T14:15:08.956730Z","title":"Polynomials over idempotent semifields","venue":"math.AC","work_id":"043b27e7-10d5-4bac-b1e7-6fa774c98ce0","year":2026},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":1998,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.914979Z"},"links":{"cited_paper":"/paper/2607.10492","citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:b15289f97027dd343715439163ddbc653b623e8aabb6abc3ede60a2b1485c4e4","observation_id":"9f759534-3ff1-4b84-8c05-e4211eea3390","resolution":{"observed_at":"2026-08-14T14:15:08.964497Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.216438Z","title":"Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths","venue":null,"work_id":"5de146c9-fc44-4251-8c5c-5dfd9f44f0c5","year":2021},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.881723Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:77b94c30f02b2b08c7ab99d5527acc9947b74420fe7432a3af749edf230a0350","observation_id":"b95c46aa-3fdb-4c95-b45d-5e937cac72e9","resolution":{"observed_at":"2026-08-14T14:15:09.220804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:08.982956Z","title":"Frances Yao","venue":null,"work_id":"7e18be5b-d390-465b-9ebf-b65be96e880f","year":1980},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.927389Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:5b24782c0e587deb2bf8262b569e7cb1de3a515683bc44ec52777500b48a0174","observation_id":"94998022-351a-4526-a655-3cf63665027d","resolution":{"observed_at":"2026-08-14T14:15:08.986820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.297095Z","title":"Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results","venue":null,"work_id":"c0d131b5-9e56-4f13-acd4-5a8a217f7052","year":2024},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.857187Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:16a7893fa93a3ec2e1cae4255edc4060b2044f58afea1e2f81885f30f171502d","observation_id":"02ef1886-519a-4f77-9519-c9ead3c6975e","resolution":{"observed_at":"2026-08-14T14:15:09.300885Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.261378Z","title":"Chan, Virginia Vassilevska Williams, and Yinzhan Xu","venue":null,"work_id":"a4411058-7773-49ad-b04c-b4e684a049f3","year":2022},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.868313Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:73698320eee33f0074e904188d11c641e73a0e6a7b8967a4ab32899769860d34","observation_id":"5946a33b-8f43-4143-9ee8-443462e93b9a","resolution":{"observed_at":"2026-08-14T14:15:09.265852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.396011Z","title":"In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), volume 132 of LIPIcs, pages 19:1–19:13","venue":null,"work_id":"d5124164-ab90-4ba0-bff1-b405f1b39b0e","year":2019},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.818465Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:61a25ee6a5bdfd69a78efcad8f14a22912e85eaa8466af1e18e481d57c1c4363","observation_id":"5a808cfa-685f-4169-aa17-c253a794b441","resolution":{"observed_at":"2026-08-14T14:15:09.400097Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.354056Z","title":"Fast Convolutions for Near-Convex Sequences","venue":null,"work_id":"a049c534-fe6c-4c41-ba86-d5167cb78b5d","year":2023},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.836471Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:cd98d0049ef7599b879f87222f0af99d9f65ebe71fe88b49a903ad6e5e72b48f","observation_id":"dd143680-1d5d-4d02-ac67-38d20a0dee21","resolution":{"observed_at":"2026-08-14T14:15:09.357681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.005541Z","title":"Limited subsets of a free monoid","venue":null,"work_id":"4686cb85-b7b1-4c37-a081-129ad36b46d4","year":1978},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.919026Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:cd0a2f914ecd0fef27192b7d47a3920956ab31c2277b081acfdfc0a1f511916e","observation_id":"e4ed7c4f-fe78-40e0-869b-bbec012bec45","resolution":{"observed_at":"2026-08-14T14:15:09.009439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.321154Z","title":"Faster Min-Plus Product for Mono- tone Instances","venue":null,"work_id":"db18c59c-53a2-47e3-9ca9-0aa6dda898b5","year":2022},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.849589Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:dcad7b0d63ce616c5bc48d10404ab756637a996de13fcfc4c7194bd7a21fb3d4","observation_id":"c9d27792-c4ab-49ce-8eaf-bea54635ad44","resolution":{"observed_at":"2026-08-14T14:15:09.324953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.385569Z","title":"Chan, Erik D","venue":null,"work_id":"22026127-102b-4f38-9450-9c3a6316c96c","year":2006},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.823146Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:f759eed10dc58c964250e110096613dc4973c8f946377a76ae941a2a76fe3890","observation_id":"b1ca29cb-8bb8-46a6-a3d0-1db9384124f6","resolution":{"observed_at":"2026-08-14T14:15:09.388941Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.331717Z","title":"Faster Algorithms for Bounded-Difference Min-Plus Product","venue":null,"work_id":"039741e9-c016-469b-86bd-237b1688cb24","year":2022},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.845146Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:c72e47b3433e415b87929a36e6a90985624e8e2fcf73525159350218fc04be74","observation_id":"3b049106-be24-4395-ad9e-fb74d58fcfca","resolution":{"observed_at":"2026-08-14T14:15:09.335770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:15:09.170567Z","title":"On the Fine-Grained Complexity of the Unbounded SubsetSum and the Frobenius Problem","venue":null,"work_id":"f3792cf1-904c-4789-9f05-4cd2196b5c68","year":2022},"citing_paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-14T14:15:08.894972Z"},"links":{"citing_paper":"/paper/2608.13310"},"observation_digest":"sha256:6c221f024a4c24f78cbfd063e5fd81ddc7ddff075a06be9f831d2b97bcd743b6","observation_id":"653d1e76-c47f-49c9-a0d7-5d878c21006a","resolution":{"observed_at":"2026-08-14T14:15:09.175095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.13310","last_updated":"2026-08-13T14:37:04Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-16T23:12:44.853934Z","submitted_at":"2026-08-13T14:37:04Z","title":"On the Structure of $(\\min,+)$ Convolution"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":1,"verified_fuzzy":28},"total_outbound_references":30},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2608.13310."}