{"as_of":"2026-08-12T13:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:25eb7737d60ec1ed96fa720dfa9e3bef7bd0146272ba9d5e4f2e8923612fea78","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T23:51:23.754818Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+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/2511.04258/citation-record","integrity":"/paper/2511.04258/integrity","json":"/paper/2511.04258/citation-record.json","paper":"/paper/2511.04258"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.14081","last_updated":"2026-06-10T20:36:59Z","snapshot_observed_at":"2026-08-07T00:15:59.295896Z","submitted_at":"2025-06-17T00:33:22Z","title":"The Parametrised Complexity of Counting Small Sub-Hypergraphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.14081","snapshot_observed_at":"2026-08-03T23:51:23.539847Z","title":"The Complexity of Counting Small Sub-Hypergraphs.arXiv preprint arXiv:2506.14081,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:23.539847Z"},"links":{"cited_paper":"/paper/2506.14081","citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:58188d9bccb135abff0774b159667bbfe79717c87d5f2b053303139d15b100ad","observation_id":"bc9bd803-6e37-4019-85df-7e4ba1df45d7","resolution":{"observed_at":"2026-08-03T23:51:23.539847Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T23:51:23.654790Z","title":"Seshadhri","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:23.654790Z"},"links":{"citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:b05f1c9d98708cc37582ee9bc9b839d86c2273af40717fd6a2d9df03200c8a38","observation_id":"c4d196b1-b59e-4ba0-bf1e-c9517e7a88b0","resolution":{"observed_at":"2026-08-03T23:51:23.654790Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T23:51:23.754818Z","title":"General and fractional hypertree decomposi- tions: Hard and easy cases","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:23.754818Z"},"links":{"citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:364fa3744168a21e217466b47328d3492b7ce23b0e3155b88ebed608b406e21c","observation_id":"1902547c-1420-4a75-a470-291dbaf8667d","resolution":{"observed_at":"2026-08-03T23:51:23.754818Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T23:51:22.292310Z","title":"[GR93] Jim Gray and Andreas Reuter.Transaction Processing: Concepts and Techniques","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":1968,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:22.292310Z"},"links":{"citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:92808f139275b18700875aa24f1a3091dca71a8e140437434c71b4854edeaec3","observation_id":"abfe94a5-3320-416c-bd4f-04b3557e2f58","resolution":{"observed_at":"2026-08-03T23:51:22.292310Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T23:51:22.164852Z","title":"[Di68] Edsger W","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":1974,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:22.164852Z"},"links":{"citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:f3ff549f03ed252a10f90a9dbe4b020742feb6618709cf3019fa9c35c33596c7","observation_id":"0f8da932-5a82-4e24-aac5-2c018cc616bd","resolution":{"observed_at":"2026-08-03T23:51:22.164852Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"0809.3646","last_updated":"2008-09-22T08:17:22Z","snapshot_observed_at":"2026-07-06T01:43:36.430847Z","submitted_at":"2008-09-22T08:17:22Z","title":"Approximating acyclicity parameters of sparse hypergraphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"0809.3646","snapshot_observed_at":"2026-08-03T23:51:22.447402Z","title":"[FPT08] Fedor V","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":1975,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:22.447402Z"},"links":{"cited_paper":"/paper/0809.3646","citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:93757e31841605c2ddb320904b03aec1e7502554c470f5c159b7d665fcaaa9d3","observation_id":"fb28c0f6-3399-455a-aedb-fdcb6af63157","resolution":{"observed_at":"2026-08-03T23:51:22.447402Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T23:51:22.370079Z","title":"Hopcroft, Wolfgang J","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":1993,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:22.370079Z"},"links":{"citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:4cf3db3af6ee240f48b2e680ba2173d9d382da13cdb52ee66dfa1a6a0cefc895","observation_id":"e5504c0e-0e98-4750-85b8-b7a352a7f4ff","resolution":{"observed_at":"2026-08-03T23:51:22.370079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.05896","last_updated":"2019-11-27T21:10:53Z","snapshot_observed_at":"2026-07-06T08:36:54.434076Z","submitted_at":"2019-11-14T02:15:15Z","title":"Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.05896","snapshot_observed_at":"2026-08-03T23:51:23.030073Z","title":"Bera, Noujan Pashanasangi, and C","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":1994,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:23.030073Z"},"links":{"cited_paper":"/paper/1911.05896","citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:46a6ac452c0f534ce74dadea14af2cc674d1d3498317069984e5a92c87134cd2","observation_id":"29060035-1ae9-4a6a-9185-b251dafdb083","resolution":{"observed_at":"2026-08-03T23:51:23.030073Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T23:51:22.858524Z","title":"[CDM17] Radu Curticapean, Holger Dell, and D ´aniel Marx","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":1997,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:22.858524Z"},"links":{"citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:20ad0579261abf4946a633a75877a340e9c61a824eb0d935d594f359afb4f548","observation_id":"59b25927-d3c6-438c-8127-515b7565739e","resolution":{"observed_at":"2026-08-03T23:51:22.858524Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T23:51:23.326885Z","title":"Seshadhri","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":2001,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:23.326885Z"},"links":{"citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:2310411b9b4afa536fbc0fe716c54592dd49cfd609083299d808eec7f9473611","observation_id":"adc555b6-8b1d-4638-aaf2-f9f405a44807","resolution":{"observed_at":"2026-08-03T23:51:23.326885Z","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":"10.1016/s0304-3975(02)00017-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"[Kn74] Donald E","venue":"Theoretical Computer Science","work_id":"ecbbcf20-d78d-423e-9a60-ca2d916059f0","year":null},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":2002,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:22.072089Z"},"links":{"citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:35018f7112a2b00a085f99bf0683285e81662316020cbb956034576225e0d7ba","observation_id":"a6f8959b-5e66-4c90-ad02-48e170103403","resolution":{"observed_at":"2026-08-03T23:53:25.033981Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.08605","last_updated":"2024-09-24T02:58:38Z","snapshot_observed_at":"2026-08-10T23:02:29.749721Z","submitted_at":"2022-11-16T01:29:32Z","title":"A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.08605","snapshot_observed_at":"2026-08-03T23:51:23.425250Z","title":"Seshadhri","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":2015,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:23.425250Z"},"links":{"cited_paper":"/paper/2211.08605","citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:e30d6837a68e24a42a4a3c8115acccccf2e0e579df02164093c5a317b8499c07","observation_id":"8540727e-1b19-4a35-bf0e-efac2c791a34","resolution":{"observed_at":"2026-08-03T23:51:23.425250Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T23:51:22.922626Z","title":"[B25] ´Edouard Bonnet","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:22.922626Z"},"links":{"citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:6db8c9c620812222076342903d62e5dd19aad09fc74746e16812c0cbe441c73c","observation_id":"75330f68-55f5-4a43-9edc-a87656697f6e","resolution":{"observed_at":"2026-08-03T23:51:22.922626Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T23:51:23.094151Z","title":"Efficiently finding and counting patterns with distance constraints in sparse graphs","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:23.094151Z"},"links":{"citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:64843f3ce34133b9c76baf00a4583db19a06591a9b72c57f026d47bc706aa4fa","observation_id":"f954d6e5-75ce-4888-acb1-abe66aa28a7d","resolution":{"observed_at":"2026-08-03T23:51:23.094151Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T23:51:22.726978Z","title":"Finding and counting patterns in sparse graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:22.726978Z"},"links":{"citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:9d9abe88a797fba30c9a9d33fd2faf6f6f0b2f235ba5cef9a6fc39a023f7fcca","observation_id":"e0401753-dc2a-48ce-ae38-0faa82e50ed0","resolution":{"observed_at":"2026-08-03T23:51:22.726978Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T23:51:22.802240Z","title":"Algorithms based on the treewidth of sparse graphs","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:22.802240Z"},"links":{"citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:38d09d90fe1e80dcf1be38939d78e9005e6c613a6f7f0bf3d7303372910b642f","observation_id":"17edc1e2-ad5c-4b8d-a956-d69dd892576a","resolution":{"observed_at":"2026-08-03T23:51:22.802240Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.08376","last_updated":"2025-03-04T00:49:55Z","snapshot_observed_at":"2026-08-04T07:55:43.569643Z","submitted_at":"2024-10-10T21:19:57Z","title":"Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.08376","snapshot_observed_at":"2026-08-03T23:51:22.514242Z","title":"[PPS24] Daniel Paul-Pena and C","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:22.514242Z"},"links":{"cited_paper":"/paper/2410.08376","citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:23677f95a3ef637713ac7735c7f08cef2c4ad30cec3e38d0b72092eff613dd03","observation_id":"6abca642-8934-4ca7-a931-d8c91e855661","resolution":{"observed_at":"2026-08-03T23:51:22.514242Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T23:51:22.660614Z","title":"Bera, Noujan Pashanasangi, and C","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:22.660614Z"},"links":{"citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:fe2ffd711928b9365b24cba1ce027ad905e243ddfa47e68e3f8e1553f9982250","observation_id":"ffdc492f-5b88-4e3e-a0cd-6041b4adadaa","resolution":{"observed_at":"2026-08-03T23:51:22.660614Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T23:51:22.573153Z","title":"Seshadhri","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:22.573153Z"},"links":{"citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:6a620490d39c90df0c664e001abc14378fb5ff6bc2195e8df61a46264bc4c1af","observation_id":"ca131c8b-eab8-40dc-854f-89a92adc5dba","resolution":{"observed_at":"2026-08-03T23:51:22.573153Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T23:51:23.157877Z","title":"Counting homomorphic cycles in degenerate graphs","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T23:51:23.157877Z"},"links":{"citing_paper":"/paper/2511.04258"},"observation_digest":"sha256:e436118e17e3fb624199fa4a03024a5070481c0984b35b35a55447642af5d39c","observation_id":"94400eca-0a22-4c65-92dd-e29953f39472","resolution":{"observed_at":"2026-08-03T23:51:23.157877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.04258","last_updated":"2026-06-30T13:57:37Z","latest_version":2,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-08T05:21:34.220353Z","submitted_at":"2025-11-06T10:49:07Z","title":"Counting Patterns in Degenerate Graphs in Constant Space"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":20},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2511.04258."}