{"as_of":"2026-08-05T08:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c64843c5a3a3d2a48c6ada614526a160121acb41ac658f9b3774db76cb5afd28","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-16T23:39:03.625388Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T03:36:52.861264Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-10T12:15:01.137692Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"cited_work":{"arxiv_id":"2512.10217","doi":"10.48550/arxiv.2512.10217","metadata_source":"pith","pith_arxiv_id":"2512.10217","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","venue":"cs.DB","work_id":"fae9b8d1-6e79-4f1d-9f35-9dbf85580f53","year":2025},"citing_paper":{"arxiv_id":"2604.22663","last_updated":"2026-04-24T15:40:25Z","snapshot_observed_at":"2026-07-06T23:09:01.221922Z","submitted_at":"2026-04-24T15:40:25Z","title":"Cuts and Gauges for Submodular Width","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-08T10:18:24.575806Z"},"links":{"cited_paper":"/paper/2512.10217","citing_paper":"/paper/2604.22663"},"observation_digest":"sha256:8a0d6d828e297bf1a17a28bea2c5419791cbd160eccd0f53308f0ca1528eb640","observation_id":"72e12d79-bdfc-4eae-9ab9-5bf6b5323b70","resolution":{"observed_at":"2026-05-08T22:04:19.098864Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"cited_work":{"arxiv_id":"2512.10217","doi":"10.48550/arxiv.2512.10217","metadata_source":"pith","pith_arxiv_id":"2512.10217","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","venue":"cs.DB","work_id":"fae9b8d1-6e79-4f1d-9f35-9dbf85580f53","year":2025},"citing_paper":{"arxiv_id":"2606.02183","last_updated":"2026-06-01T12:38:26Z","snapshot_observed_at":"2026-08-03T17:16:55.808855Z","submitted_at":"2026-06-01T12:38:26Z","title":"Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-06-28T12:24:54.245797Z"},"links":{"cited_paper":"/paper/2512.10217","citing_paper":"/paper/2606.02183"},"observation_digest":"sha256:df1dacba727f80dfa56869584d69e88eed86ff215db468174d2c703e318ec434","observation_id":"0f29d2f9-ac17-49da-ad13-915810bbb5b2","resolution":{"observed_at":"2026-07-02T01:16:24.473338Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.10217","snapshot_observed_at":"2026-08-02T03:36:52.861264Z","title":"Ngo, and Dan Suciu","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.13875","last_updated":"2026-07-15T14:24:27Z","snapshot_observed_at":"2026-08-04T09:33:06.532295Z","submitted_at":"2026-07-15T14:24:27Z","title":"Lexicographic Direct Access with Functional Dependencies","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-02T03:36:52.861264Z"},"links":{"cited_paper":"/paper/2512.10217","citing_paper":"/paper/2607.13875"},"observation_digest":"sha256:9b8616bbb74ac603130a6adaa11be616ad07e390a9b282a758e8c23fcd7552b0","observation_id":"64872b2e-d364-4b55-b077-81fb56e19648","resolution":{"observed_at":"2026-08-02T03:36:52.861264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2512.10217/citation-record","integrity":"/paper/2512.10217/integrity","json":"/paper/2512.10217/citation-record.json","paper":"/paper/2512.10217"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Abo Khamis, R","venue":null,"work_id":"fb052f75-b381-4141-8314-1ae08a5bc78e","year":2020},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:bf1c12bd2413058e5262130b287a0f3018c5566c992d6941b10acd8ebb7380cd","observation_id":"e6f21e5e-ddae-45d0-b793-ff5b11dbf77e","resolution":{"observed_at":"2026-05-16T23:41:23.556433Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Abo Khamis, H","venue":null,"work_id":"e30ff5ba-c010-4a4d-8b54-f23ed0ec2a0f","year":2016},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:36e49040bdb5ee71c510a4ff8545c431e3e99249662b6d41f5651a04ac9fdbf1","observation_id":"212276ac-f982-47f2-97c9-30c17289fb77","resolution":{"observed_at":"2026-05-16T23:41:23.565697Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Abo Khamis, H","venue":null,"work_id":"b57b88ba-aef2-48e3-9d08-b49e89812c51","year":2016},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:770bb3527c0852584d29cd07f28c02c3facf0089635bf6aae82ffdc7947ba204","observation_id":"d9192606-9dc3-4d9d-b640-ca804aec4f2d","resolution":{"observed_at":"2026-05-16T23:41:23.591273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1612.02503","last_updated":"2023-12-23T20:48:44Z","snapshot_observed_at":"2026-08-03T17:17:28.483643Z","submitted_at":"2016-12-08T01:06:40Z","title":"What do Shannon-type Inequalities, Submodular Width, and Disjunctive Datalog have to do with one another?","version":5},"cited_work":{"arxiv_id":"1612.02503","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1612.02503","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Abo Khamis, H","venue":null,"work_id":"28c28406-b336-42c9-914c-7714ef282f4e","year":2017},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"cited_paper":"/paper/1612.02503","citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:0579cb5f50ba9f371a15de4c075717db6a37ff02ab285f3290fafa834d99c539","observation_id":"8689c227-63ed-4a3e-8677-0dd8c96ec747","resolution":{"observed_at":"2026-05-16T23:41:22.606054Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Abo Khamis, H","venue":null,"work_id":"a83ee1bf-7fd0-4bb6-9e42-1851c9e27f3e","year":2025},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:e927124664c9cadf42a56b52f6398b3ffebe5b2f235f6d07f281b896cdbd47b4","observation_id":"24fb590f-5588-4d51-a8f9-f5aed2daa9a6","resolution":{"observed_at":"2026-05-16T23:41:23.589669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Alon,On the number of subgraphs of prescribed type of graphs with a given number of edges, Israel J","venue":null,"work_id":"1e5a9acd-0850-45ca-8d90-30f1dc4ea20f","year":1981},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:ee925c2e90d20c7e49514369b5006365ddcc3d05064847cde31aeae4ee2fd44f","observation_id":"dca353b6-0577-482f-be2e-e38dfbb0c78f","resolution":{"observed_at":"2026-05-16T23:41:23.615645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Atserias, M","venue":null,"work_id":"6947bc29-db52-4fd2-87a0-deecb62988c9","year":2008},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:9f589fa9a65c8806043cf682dbc5954964056abee04a920b410618f920c67070","observation_id":"270c13f1-ff25-40d7-9b65-e8f3b68ab43d","resolution":{"observed_at":"2026-05-16T23:41:23.618703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Comput., 42 (2013), pp","venue":null,"work_id":"d79e300b-5e2f-452a-9208-de1cafd2baad","year":2013},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:f64294d35a7957c79048d87c2af0f14805c331bb91c2375e755de2b61b5a7c96","observation_id":"c3c44fce-e0dc-4a39-8377-3b035d8cdda0","resolution":{"observed_at":"2026-05-16T23:41:23.601481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Bagan, A","venue":null,"work_id":"3a9a8359-fab6-46d1-bb92-6d1c03ccd6c0","year":2007},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:57d58a5aa856448bb73a77a9f907d928a62f5f36c6443f42aaa5faf2dbc911ae","observation_id":"185d0f8b-c86f-46f1-ac70-e0aaca43b5af","resolution":{"observed_at":"2026-05-16T23:41:23.622302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.04369","last_updated":"2024-04-05T19:31:11Z","snapshot_observed_at":"2026-07-06T17:56:18.931340Z","submitted_at":"2024-04-05T19:31:11Z","title":"A Fine-grained Classification of Subquadratic Patterns for Subgraph Listing and Friends","version":1},"cited_work":{"arxiv_id":"2404.04369","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.04369","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Bringmann and E","venue":null,"work_id":"1dbdf9f3-45a9-4a50-905e-532f372eec21","year":2024},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"cited_paper":"/paper/2404.04369","citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:48e38ccbd49bac3efa6493e72ed5823da98f016ff6f2517bb81ffb05400e1690","observation_id":"de0331df-2a53-4c2e-beeb-c8ae263cb70c","resolution":{"observed_at":"2026-05-16T23:41:22.601327Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Kouck´ y and N","venue":null,"work_id":"4c6274eb-b8a9-4686-86a3-0e1c7c548353","year":2025},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:c0c7f9db93e9d644a24e971d25891893898b6068c5dc5026ac59179776097c2d","observation_id":"b4286188-766a-4c7d-8982-25446136ae5d","resolution":{"observed_at":"2026-05-16T23:41:23.563813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"342d43bc-c0c6-41ce-a320-601116043d6f","year":1977},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:91dc2fc2acc1f4dc5900ab9dc7c160586d8b32d651f9f04a9b80bf105f4b7ae0","observation_id":"937fd113-0705-42a9-b645-a8a4c82a9719","resolution":{"observed_at":"2026-05-16T23:41:23.605806Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"89a62a4b-33be-4f54-b031-ddf738acdadf","year":1986},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:9513c871531e67cec34c7e7691fc124d8a528a7641060c394ee7b97a2cfdb3f1","observation_id":"243f2175-d4ec-4e46-990c-04ade0c8ec29","resolution":{"observed_at":"2026-05-16T23:41:23.570472Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Dalirrooyfard, S","venue":null,"work_id":"27e5e0f3-29f2-474d-9696-3bc70ed96764","year":2024},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:73ccc3986b11195653e8f9c752d48b5b08e73657a8350563c2a5b4632451830e","observation_id":"5fd9f0aa-224b-4aa5-9308-ff6f5e73b545","resolution":{"observed_at":"2026-05-16T23:41:23.581064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Dalirrooyfard, T","venue":null,"work_id":"2a6a839e-ccb6-4ac7-8cf9-b1e4dcf838d8","year":2021},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:44b000eca9e1da0d72e440557c590c8b5bcf15c777b6530bd18e2bc915f631ca","observation_id":"3d647104-17a9-40d4-9a38-2828c790d236","resolution":{"observed_at":"2026-05-16T23:41:23.612251Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"8b340b94-fdc6-4b11-9678-52d6f5731424","year":2024},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:45df7102cdd199bd788155b0358d4e7165d5b5242f815fc31f66a615babe3107","observation_id":"dad61e08-dc83-46b9-8536-2800e71ca4ca","resolution":{"observed_at":"2026-05-16T23:41:23.606060Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Eisenbrand and F","venue":null,"work_id":"24ebc3f8-98ea-4e6b-b5b7-e7eca28bdc39","year":2004},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:237977bad101791afc99b3ee28a6213f09ff71d4f59adfa8f800bedf5593f8f0","observation_id":"1d3ff76c-0f52-4303-b440-67ff8094a5ab","resolution":{"observed_at":"2026-05-16T23:41:23.602500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Friedgut and J","venue":null,"work_id":"4e05d7b0-2ff5-45ff-92b1-7907cc3a1d88","year":1998},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:24512edd52a5c0db51ab7ac1ee7bab4563846ebbb060a86ab53eeffa410a8aa7","observation_id":"723e9acd-ddf3-4968-b82c-f5f1c90a1ae7","resolution":{"observed_at":"2026-05-16T23:41:23.585743Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Gottlob, G","venue":null,"work_id":"5ddcb021-8e5e-4745-997a-05583ec368e3","year":2016},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:a976bbb51553f467207d9db9b5d2cc5928fa3507d6d30ea586d6eab0dd410eac","observation_id":"cad2931f-ef4d-400f-9199-4de73ea05ced","resolution":{"observed_at":"2026-05-16T23:41:23.609056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Gottlob, S","venue":null,"work_id":"0dc3adf5-0157-4005-bd5b-492107aa0ded","year":2012},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:08cb6da616ac648c5e55f8279e0537d0b62aa177c7e283507a301ea6af039b07","observation_id":"9d41b5a8-e24c-4add-96ac-5eb3f29b3967","resolution":{"observed_at":"2026-05-16T23:41:23.596508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Grohe and D","venue":null,"work_id":"69af6dd1-1831-4364-9003-808a66bdfedc","year":2006},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:f9487f400a6e9cc286dc15f9ca947a5158067d0a4bc6f325e321093cdc2d91c4","observation_id":"823ba4bb-defb-4aa5-adae-bc18e1845cb1","resolution":{"observed_at":"2026-05-16T23:41:23.559287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Algorithms, 11 (2014), pp","venue":null,"work_id":"a19b6322-0857-4ae9-8c0a-aeb5257c5aed","year":2014},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:8b949e7adc8efc958b11f454ceec8285ef28bd50708e678467c0050a3f5fd07a","observation_id":"3b83a42e-92e4-42a0-990d-acac9f6e8e52","resolution":{"observed_at":"2026-05-16T23:41:23.628836Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"feca6ef8-b5f7-420f-bc21-9e53ed50226e","year":2025},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:28a28469dad26ca9c7383d61abb29e12453853dcd7abc13f453a012ee3bcbbe0","observation_id":"84636eb3-5d4a-4ec6-add9-ff6ec79432f7","resolution":{"observed_at":"2026-05-16T23:41:23.537208Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Itai and M","venue":null,"work_id":"e929c9c4-a873-4c05-87a6-5b5f2616f003","year":1977},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:8503e20d2a7d274619d7b1f8f67186f4f00c8732a21f3f5eb1019edd5c64dc78","observation_id":"79a02652-aaed-4b8c-950a-d3d127737934","resolution":{"observed_at":"2026-05-16T23:41:23.631985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"7c649c3a-1f02-49ad-92e7-5b30c53e20d6","year":2025},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:ab3d00ab6637b3fe4aeec0b9a18c4eef09c1aaa1cd2251ee64e83f34091d0746","observation_id":"2013a990-7739-40a1-b3ba-dd8cf89467bb","resolution":{"observed_at":"2026-05-16T23:41:23.634941Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"9826afc6-c557-4144-8983-2babc15acaa6","year":2024},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:19608bbebd976269b1a8476ae3ffa7f8c5866fa3a078589c2b972be7ed03b32f","observation_id":"bc6f90e6-3a50-45b6-a719-e9827d421f7c","resolution":{"observed_at":"2026-05-16T23:41:23.597993Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Marx,Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries, J","venue":null,"work_id":"0cf657ac-ab47-4c8e-b5c3-75d34a0250d0","year":2013},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:4241808fb6eeebbdef917e95540eb8f10af1a81553c0ddf40af8e595951315d0","observation_id":"37ca9a56-3aa2-480d-b004-89892e1bfa1c","resolution":{"observed_at":"2026-05-16T23:41:23.609586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"5921de26-7f67-415b-9815-1cf3b6acdf68","year":2018},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:af5a82333b8f96f728621dcfee10abbc447efc480f5d624a04ab27d6dd48312c","observation_id":"33d8ebe9-cfcb-4eee-bd98-90931db9e7a7","resolution":{"observed_at":"2026-05-16T23:41:23.572246Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"732da762-fc36-4c8c-b943-e57c1095c752","year":2012},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:1d05029e29633d4e2923fdf9cf8834e6af4545df879f583a7bda98ec25373e5d","observation_id":"09f47137-d555-4cc7-837c-e3557cb33de0","resolution":{"observed_at":"2026-05-16T23:41:23.625467Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"6d6935c4-6f64-4e10-a9fc-4200db0a2f5f","year":2013},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:0706096d914c49a8ff36429918f032a825c0f9e4a1ba22ffb0fd1b60b30e90e7","observation_id":"d6950e87-0096-484b-b6f2-b104f1cd608f","resolution":{"observed_at":"2026-05-16T23:41:23.575790Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"b96537c6-df58-4135-8150-dae88d30528e","year":1979},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:e20fad0d3b89511677bdfba6b85c168dcbab6caf171a411af690e4635b13ccd2","observation_id":"a45aa46e-e4d0-4630-9e5d-536fc8f84966","resolution":{"observed_at":"2026-05-16T23:41:23.553388Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"fe95d00d-b6ad-4fdb-8666-6a9e9057f387","year":2023},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:6a188732ddbbc7ca6eadf7c797bf0ac106fcb0641c9a02df22f227bd23bf21e9","observation_id":"b6c42eac-f1d9-456b-8ea7-a42b7af70e4e","resolution":{"observed_at":"2026-05-16T23:41:23.599527Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"5b34c81a-d2cc-43ea-a961-c52a0b2eb9ef","year":2014},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:edcd593ab6431a4e757e37155ae896118d5a9f61667dfebfdc6296b0934b205a","observation_id":"eb000c9b-d562-4d35-b3e5-1ed93191cf92","resolution":{"observed_at":"2026-05-16T23:41:23.544263Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"sum of chains","venue":null,"work_id":"bd83eb69-f417-40a8-8444-16d869b331b8","year":2022},"citing_paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-16T23:39:03.625388Z"},"links":{"citing_paper":"/paper/2512.10217"},"observation_digest":"sha256:61ea552cf82a58f817c45f005012c7dea407de7376969db7f5d00bce7673c566","observation_id":"5d1ed718-5b4a-4107-823b-1cb32a6fd794","resolution":{"observed_at":"2026-05-16T23:41:23.546944Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2512.10217","last_updated":"2026-04-06T18:25:04Z","latest_version":3,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-03T08:35:40.119444Z","submitted_at":"2025-12-11T02:08:02Z","title":"PANDAExpress: a Simpler and Faster PANDA Algorithm"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":2,"verified_fuzzy":20},"total_outbound_references":34},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 3 inbound Pith citation observations for arXiv:2512.10217."}