{"as_of":"2026-08-22T02:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3e23bbcc0038d9584a344052b550ba71ad149e0815f2ec5cc3a4bf29fa1633b4","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-21T06:32:19.484+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-15T19:52:07.692626Z","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-13T11:09:14.844818Z","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:8fc85accb6bea2feebed20b10936baeff6f77be52917fcdb1be269294b15fbb5","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-13T11:09:14.844818Z","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:1a2b1a1e63c4fa93a091ac9d7dc48039261ba1991d2297032cc4a2a49039628e","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-13T11:09:14.844818Z","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:25d09882e174559877e99be4793edcb4c72a4d532a5a910fe81a26e0c9665e46","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-13T11:09:14.844818Z","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:5f726f82c925a7acae3b082ad5574123544589bb72c0b32ff91620c4c1f9f7b5","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-13T11:09:14.844818Z","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:bc3778c8a3ace6d190d10887ad3fe41f736a01d21a9c1c13e4c9c72a77438285","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-08-15T10:06:24.475450Z","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-13T11:09:14.844818Z","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:e17c5194b104ebcbd148740d95e3971b88cc54d6c42a236429a26fbd2bb11869","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-13T11:09:14.844818Z","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:83b3730cb5865a1ec2a75bcb38837b5aec0df0e4e7715aa9993ebc29b4f39bb8","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-08-14T06:26:14.806558Z","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-13T11:09:14.844818Z","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:3ca7a99a059a23a2c913b174230f9b376bb4d84dcacd79ab4ad3e441fea0dff6","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-13T11:09:14.844818Z","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:6cdf25b418828b1fdc8104d18f1aedd4d6987f001d7a698653c7f635f481ea17","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-13T11:09:14.844818Z","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:773c81caf02218ee2edeb6600550fc8afb0e6899a8c385e7d5fa9437627b766f","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-13T11:09:14.844818Z","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:d9891c55d357fe91d9f6349e17cc7f129533a7664ca3cabc6ed923d72b5a75f0","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-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T16:15:50.425033Z","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-13T11:09:14.844818Z","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:326760dc2b97f86d47d5a8fdb40fe2706c862ac03a88a04a169c75be4143eefc","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-13T11:09:14.844818Z","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:2bff81a3745e1c23c16f33accd5d9b25e11bfd6290c1ac9d1a21c31ff9838cd2","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-13T11:09:14.844818Z","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:af50202cdbe2e7b8a9e12118d5501fb1c5408e6c215cb124debba3d70d078c45","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-13T11:09:14.844818Z","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:81b4f291c79a7c8d7e808c5753a81e025720eea78a580099bd482e4ec40f461a","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-13T11:09:14.844818Z","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:7aea6673feef78e0b2a553a363a6c2ce9d71b35e3f2e5354c762bbd6ccfafc36","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-16T13:10:31.961561Z","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-13T11:09:14.844818Z","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:a474ba4e9312bcfa38f68fad04c96df49781c4de364760f06d17b538853a6f2f","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-13T11:09:14.844818Z","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:616e9ca79603d8c5a4283371b9018bd4a2a6bd262cb3800caac361e4868cf108","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-13T11:09:14.844818Z","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:06b6b18be8ee631d88ec32628583ca3c5e43a8fcdf6418b09d64bfaeca5a1cfd","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-13T11:09:14.844818Z","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:a5b652a7d3d55bacc045dde048bc0ef147c5480f3684877c7b939d57805d4a6b","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-13T11:09:14.844818Z","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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:2511.04258."}