{"as_of":"2026-08-17T03:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:44eb7ac1f4ec6fc705012763b459c77ca1d5512978dde1ba4de86e3a5ad2ce10","coverage":[{"denominator":9,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:55:37.546662Z","state":"measured"},{"denominator":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1908.02530/citation-record","integrity":"/paper/1908.02530/integrity","json":"/paper/1908.02530/citation-record.json","paper":"/paper/1908.02530"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:37.681081Z","title":"Abseher, N","venue":null,"work_id":"649dec07-ad31-4575-a174-9476b3f6eda9","year":2017},"citing_paper":{"arxiv_id":"1908.02530","last_updated":"2019-08-07T11:18:27Z","snapshot_observed_at":"2026-08-16T15:33:11.665119Z","submitted_at":"2019-08-07T11:18:27Z","title":"A Constraint Model for the Tree Decomposition of a Graph","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:55:37.511736Z"},"links":{"citing_paper":"/paper/1908.02530"},"observation_digest":"sha256:8c2380b282b02cb72d764fa8bbd5d9df57e7dc6d7fc190622a1aecd87313ecca","observation_id":"fba1f249-304c-4d30-87b8-61122aa7f84d","resolution":{"observed_at":"2026-08-14T14:55:37.685254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:37.670085Z","title":null,"venue":null,"work_id":"321b535e-3cf3-4a20-a1fe-6f30bc4417a4","year":1993},"citing_paper":{"arxiv_id":"1908.02530","last_updated":"2019-08-07T11:18:27Z","snapshot_observed_at":"2026-08-16T15:33:11.665119Z","submitted_at":"2019-08-07T11:18:27Z","title":"A Constraint Model for the Tree Decomposition of a Graph","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:55:37.516517Z"},"links":{"citing_paper":"/paper/1908.02530"},"observation_digest":"sha256:1b9c8c1980949cc6788985d39792296321674230c1aebd405d7243792ceda257","observation_id":"2b59f548-a615-4f40-82e8-3d0bb000acef","resolution":{"observed_at":"2026-08-14T14:55:37.673694Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:37.659006Z","title":null,"venue":null,"work_id":"94218194-d078-4068-9f2e-8de5b1b4f7d0","year":1996},"citing_paper":{"arxiv_id":"1908.02530","last_updated":"2019-08-07T11:18:27Z","snapshot_observed_at":"2026-08-16T15:33:11.665119Z","submitted_at":"2019-08-07T11:18:27Z","title":"A Constraint Model for the Tree Decomposition of a Graph","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:55:37.520579Z"},"links":{"citing_paper":"/paper/1908.02530"},"observation_digest":"sha256:c45177dbde7a516a57c72bab7ebcde5fa773b1c963bd1b42b55ed88aaf87a79b","observation_id":"0970aff0-9cd8-459e-a866-1c176f88421b","resolution":{"observed_at":"2026-08-14T14:55:37.662710Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:37.645663Z","title":null,"venue":null,"work_id":"3f8f7563-6684-482c-b259-7948e2f23cce","year":2012},"citing_paper":{"arxiv_id":"1908.02530","last_updated":"2019-08-07T11:18:27Z","snapshot_observed_at":"2026-08-16T15:33:11.665119Z","submitted_at":"2019-08-07T11:18:27Z","title":"A Constraint Model for the Tree Decomposition of a Graph","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:55:37.524720Z"},"links":{"citing_paper":"/paper/1908.02530"},"observation_digest":"sha256:14862cb3dde8632b2695d72241baa9491f92832a2104c8f734d80f0448cbcf64","observation_id":"d2bd8afb-c49a-40ca-9c31-99a0d458b43e","resolution":{"observed_at":"2026-08-14T14:55:37.650275Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:37.630642Z","title":null,"venue":null,"work_id":"a517745d-9967-4a1e-ba94-f23a80d2c1d4","year":1990},"citing_paper":{"arxiv_id":"1908.02530","last_updated":"2019-08-07T11:18:27Z","snapshot_observed_at":"2026-08-16T15:33:11.665119Z","submitted_at":"2019-08-07T11:18:27Z","title":"A Constraint Model for the Tree Decomposition of a Graph","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:55:37.528747Z"},"links":{"citing_paper":"/paper/1908.02530"},"observation_digest":"sha256:3efa86ab24797dfc25693bc107269d211953925f5778a4d18f26befe1c5eb630","observation_id":"097db4be-c674-4bc2-9bea-16a30a97ba2a","resolution":{"observed_at":"2026-08-14T14:55:37.635584Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:37.616567Z","title":"Dechter and J","venue":null,"work_id":"968078c7-ba6a-4a80-9530-0ee12fde3446","year":1989},"citing_paper":{"arxiv_id":"1908.02530","last_updated":"2019-08-07T11:18:27Z","snapshot_observed_at":"2026-08-16T15:33:11.665119Z","submitted_at":"2019-08-07T11:18:27Z","title":"A Constraint Model for the Tree Decomposition of a Graph","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:55:37.533513Z"},"links":{"citing_paper":"/paper/1908.02530"},"observation_digest":"sha256:015b4526267ef3716d5029faa6ac31b58109bab84082d63046471478e21e3730","observation_id":"753b9ca9-b579-4c36-abbf-84329bfcb9cf","resolution":{"observed_at":"2026-08-14T14:55:37.621407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:37.603135Z","title":"Gogate and R","venue":null,"work_id":"f47f438c-fe69-42a9-a51d-c6f13e3d8ed8","year":2004},"citing_paper":{"arxiv_id":"1908.02530","last_updated":"2019-08-07T11:18:27Z","snapshot_observed_at":"2026-08-16T15:33:11.665119Z","submitted_at":"2019-08-07T11:18:27Z","title":"A Constraint Model for the Tree Decomposition of a Graph","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:55:37.538475Z"},"links":{"citing_paper":"/paper/1908.02530"},"observation_digest":"sha256:e70e59d5971f9e441a200adfce9f46fb9182e1b0923cf8ea1e0ab70dd2ae8b0d","observation_id":"5bc86ed4-62ce-4486-a7bd-7f73ff622eed","resolution":{"observed_at":"2026-08-14T14:55:37.607979Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:37.589616Z","title":"Prosser and C","venue":null,"work_id":"f2d3c156-b31c-4348-ade8-dd6d383bed4e","year":2006},"citing_paper":{"arxiv_id":"1908.02530","last_updated":"2019-08-07T11:18:27Z","snapshot_observed_at":"2026-08-16T15:33:11.665119Z","submitted_at":"2019-08-07T11:18:27Z","title":"A Constraint Model for the Tree Decomposition of a Graph","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:55:37.542560Z"},"links":{"citing_paper":"/paper/1908.02530"},"observation_digest":"sha256:8341fc05dae901c470e6d7602c26c9fdcfb80be5a4003ceb314ddfa25e5e006a","observation_id":"4b86100f-e3d5-472d-87cd-fe0dc08983b2","resolution":{"observed_at":"2026-08-14T14:55:37.594155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:55:37.575003Z","title":"Prud’homme, J.-G","venue":null,"work_id":"2b20e965-27c0-4721-a047-522150184d26","year":2017},"citing_paper":{"arxiv_id":"1908.02530","last_updated":"2019-08-07T11:18:27Z","snapshot_observed_at":"2026-08-16T15:33:11.665119Z","submitted_at":"2019-08-07T11:18:27Z","title":"A Constraint Model for the Tree Decomposition of a Graph","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:55:37.546662Z"},"links":{"citing_paper":"/paper/1908.02530"},"observation_digest":"sha256:d1432de06fb1da009e533a8b0301779083fcf6adfaf96086007f0b2ea1c3c03c","observation_id":"8e4229a3-b06e-449f-8fef-a7253f1bde2b","resolution":{"observed_at":"2026-08-14T14:55:37.580142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.02530","last_updated":"2019-08-07T11:18:27Z","latest_version":1,"primary_category":"cs.DM","snapshot_observed_at":"2026-08-16T15:33:11.665119Z","submitted_at":"2019-08-07T11:18:27Z","title":"A Constraint Model for the Tree Decomposition of a Graph"},"reference_resolution":{"displayed":9,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":5},"total_outbound_references":9},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 0 inbound Pith citation observations for arXiv:1908.02530."}