{"as_of":"2026-08-08T04:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:af4d116e61aa3e35e1741640cff18ee579697c23456c009b020633e207f275bf","coverage":[{"denominator":11,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:22:56.919458Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T19:58:12.692868Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2506.03603","last_updated":"2025-06-04T06:24:53Z","snapshot_observed_at":"2026-08-07T10:56:50.435798Z","submitted_at":"2025-06-04T06:24:53Z","title":"The vertex sets of subtrees of a tree","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.03603","snapshot_observed_at":"2026-08-04T19:58:12.692868Z","title":"The vertex sets of subtrees of a tree","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09035","last_updated":"2026-06-10T08:50:02Z","snapshot_observed_at":"2026-08-04T19:58:11.352867Z","submitted_at":"2025-09-10T22:11:08Z","title":"Asymptotic structure. III. Excluding a fat tree","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T19:58:12.692868Z"},"links":{"cited_paper":"/paper/2506.03603","citing_paper":"/paper/2509.09035"},"observation_digest":"sha256:c111eca517381d3e3750e48f28139968057d0ffa996e612427a302710ce8c971","observation_id":"bbb749de-11f4-44f8-82e6-77309f950ce5","resolution":{"observed_at":"2026-08-04T19:58:12.692868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.03603/citation-record","integrity":"/paper/2506.03603/integrity","json":"/paper/2506.03603/citation-record.json","paper":"/paper/2506.03603"},"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-07T11:22:57.185669Z","title":"A characterization of rigid circuit graphs","venue":null,"work_id":"1609556b-884a-4445-9720-392f43b9c684","year":1974},"citing_paper":{"arxiv_id":"2506.03603","last_updated":"2025-06-04T06:24:53Z","snapshot_observed_at":"2026-08-07T10:56:50.435798Z","submitted_at":"2025-06-04T06:24:53Z","title":"The vertex sets of subtrees of a tree","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:22:56.884581Z"},"links":{"citing_paper":"/paper/2506.03603"},"observation_digest":"sha256:befea836c085e20862375d70a881449a214f89a6aeb0313a222d4e72b4a47dc8","observation_id":"69714f03-e9c1-492f-b38f-1d4c46841de8","resolution":{"observed_at":"2026-08-07T11:22:57.189151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:22:57.174568Z","title":"The intersection graphs of subtrees in trees are exactly the chordal graphs","venue":null,"work_id":"b65ecfce-d1bf-420a-b8a1-20fec4590fbf","year":1974},"citing_paper":{"arxiv_id":"2506.03603","last_updated":"2025-06-04T06:24:53Z","snapshot_observed_at":"2026-08-07T10:56:50.435798Z","submitted_at":"2025-06-04T06:24:53Z","title":"The vertex sets of subtrees of a tree","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:22:56.888677Z"},"links":{"citing_paper":"/paper/2506.03603"},"observation_digest":"sha256:23f585d27bde84115468b518a043ffca4dcd5c10b961251fa3541f023a418e98","observation_id":"980e3565-3485-4dc9-bf6e-69ba49dbeb6f","resolution":{"observed_at":"2026-08-07T11:22:57.178111Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:22:57.163471Z","title":"A Helly type problem in trees","venue":null,"work_id":"9a24843f-fbeb-407d-84bc-91b39b4d4185","year":1970},"citing_paper":{"arxiv_id":"2506.03603","last_updated":"2025-06-04T06:24:53Z","snapshot_observed_at":"2026-08-07T10:56:50.435798Z","submitted_at":"2025-06-04T06:24:53Z","title":"The vertex sets of subtrees of a tree","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:22:56.892398Z"},"links":{"citing_paper":"/paper/2506.03603"},"observation_digest":"sha256:aedc2d64d80082cff9f3f8f2833f1a77a0de060f6b0eb89f8cf9a1fd4ec01a1e","observation_id":"85e2c588-e6d6-4880-a99c-a18bb0ab4552","resolution":{"observed_at":"2026-08-07T11:22:57.167166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:22:57.152610Z","title":"On the representation of triangulated graphs in trees","venue":null,"work_id":"8ea3db58-0f0d-40bd-8e73-5248a4d5e950","year":1984},"citing_paper":{"arxiv_id":"2506.03603","last_updated":"2025-06-04T06:24:53Z","snapshot_observed_at":"2026-08-07T10:56:50.435798Z","submitted_at":"2025-06-04T06:24:53Z","title":"The vertex sets of subtrees of a tree","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:22:56.896472Z"},"links":{"citing_paper":"/paper/2506.03603"},"observation_digest":"sha256:da253680da42ca86719a96c6642d423005537c7e169451ecd4e7678f931b9ec1","observation_id":"e4e933e5-6b4f-46c3-a0eb-683271dae4f1","resolution":{"observed_at":"2026-08-07T11:22:57.155898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:22:57.137644Z","title":"Representation of a finite graph by a set of intervals on the real line","venue":null,"work_id":"4c531969-2ab9-4a9a-a046-796ada5911a5","year":1962},"citing_paper":{"arxiv_id":"2506.03603","last_updated":"2025-06-04T06:24:53Z","snapshot_observed_at":"2026-08-07T10:56:50.435798Z","submitted_at":"2025-06-04T06:24:53Z","title":"The vertex sets of subtrees of a tree","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:22:56.899717Z"},"links":{"citing_paper":"/paper/2506.03603"},"observation_digest":"sha256:0e2a7a268417353ed48101028bf5cacb112cc87c5315ac8ac13c6745cf32b787","observation_id":"05e9b889-9ba4-4d01-8e8c-b2e68b2e3c91","resolution":{"observed_at":"2026-08-07T11:22:57.145277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:22:57.126694Z","title":"Path-width and additive quasi-isometries","venue":null,"work_id":"a9c8b9d6-f52b-4212-8947-3e77832f6817","year":2025},"citing_paper":{"arxiv_id":"2506.03603","last_updated":"2025-06-04T06:24:53Z","snapshot_observed_at":"2026-08-07T10:56:50.435798Z","submitted_at":"2025-06-04T06:24:53Z","title":"The vertex sets of subtrees of a tree","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:22:56.903056Z"},"links":{"citing_paper":"/paper/2506.03603"},"observation_digest":"sha256:9311c475089635944b0e12a4a14e5fb366789745dd5b027aae8ad1b7cc81acaa","observation_id":"381e0a96-815f-4e11-94f8-ffa7be774891","resolution":{"observed_at":"2026-08-07T11:22:57.130188Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:22:57.115130Z","title":"The tree-width compactness theorem for hypergraphs","venue":null,"work_id":"4642ccca-0c4b-45a4-8803-203e792d6da4","year":null},"citing_paper":{"arxiv_id":"2506.03603","last_updated":"2025-06-04T06:24:53Z","snapshot_observed_at":"2026-08-07T10:56:50.435798Z","submitted_at":"2025-06-04T06:24:53Z","title":"The vertex sets of subtrees of a tree","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:22:56.906859Z"},"links":{"citing_paper":"/paper/2506.03603"},"observation_digest":"sha256:534d4aa88222db8c1d4cc60b40aac476987cdf5484da1c0e63c05472c1cdfafd","observation_id":"54622089-891b-4a8a-b52c-b9bbe03fd3a4","resolution":{"observed_at":"2026-08-07T11:22:57.118555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:22:57.103782Z","title":"Configurations in graphs of large minimum degree, connectivity, or chromatic Number","venue":null,"work_id":"4701f5a0-7685-4621-8975-4ee44d6ac36b","year":1989},"citing_paper":{"arxiv_id":"2506.03603","last_updated":"2025-06-04T06:24:53Z","snapshot_observed_at":"2026-08-07T10:56:50.435798Z","submitted_at":"2025-06-04T06:24:53Z","title":"The vertex sets of subtrees of a tree","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:22:56.909954Z"},"links":{"citing_paper":"/paper/2506.03603"},"observation_digest":"sha256:bbf96d9e227ffca4b84a8b714936a0c7b33054a5fecd4d11692ffe95cb9c91a7","observation_id":"7308dfa7-06b1-48e1-b42f-f171be6e1d07","resolution":{"observed_at":"2026-08-07T11:22:57.107819Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:22:56.970882Z","title":"A structure theorem for the consecutive 1’s property","venue":null,"work_id":"2e425cf9-4a10-43e8-ba3e-6e48556a92d8","year":1972},"citing_paper":{"arxiv_id":"2506.03603","last_updated":"2025-06-04T06:24:53Z","snapshot_observed_at":"2026-08-07T10:56:50.435798Z","submitted_at":"2025-06-04T06:24:53Z","title":"The vertex sets of subtrees of a tree","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:22:56.913145Z"},"links":{"citing_paper":"/paper/2506.03603"},"observation_digest":"sha256:48f4e8444e38a2bf9568f653510b7b8f726da0045402700fe034e41e9951c727","observation_id":"3fb0490f-65d4-40b3-8881-239b9b50568b","resolution":{"observed_at":"2026-08-07T11:22:56.974202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:22:56.960132Z","title":"Matroids and graphs","venue":null,"work_id":"e63a665d-6763-4793-91fd-11c141a277b7","year":1959},"citing_paper":{"arxiv_id":"2506.03603","last_updated":"2025-06-04T06:24:53Z","snapshot_observed_at":"2026-08-07T10:56:50.435798Z","submitted_at":"2025-06-04T06:24:53Z","title":"The vertex sets of subtrees of a tree","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:22:56.916210Z"},"links":{"citing_paper":"/paper/2506.03603"},"observation_digest":"sha256:eccb853d61d4dbdf91253a680074727cdc7affb2dd10ec62481e69343ffe7a1a","observation_id":"e8bdbcc8-f295-443a-9f47-d9a109eb2ffe","resolution":{"observed_at":"2026-08-07T11:22:56.963546Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T11:22:56.945297Z","title":"Representations of chordal graphs as subtrees of a tree","venue":null,"work_id":"b30d3b0b-3247-43bd-bfee-8fcfa9eba30e","year":1978},"citing_paper":{"arxiv_id":"2506.03603","last_updated":"2025-06-04T06:24:53Z","snapshot_observed_at":"2026-08-07T10:56:50.435798Z","submitted_at":"2025-06-04T06:24:53Z","title":"The vertex sets of subtrees of a tree","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:22:56.919458Z"},"links":{"citing_paper":"/paper/2506.03603"},"observation_digest":"sha256:5f6b8fdfca753ce968c7f8fe0ca1800515bad74eb92f7d8e753dc7415e7d279d","observation_id":"e3e099a7-7d0e-4a7d-b73d-1b5387a89a2b","resolution":{"observed_at":"2026-08-07T11:22:56.952345Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.03603","last_updated":"2025-06-04T06:24:53Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-07T10:56:50.435798Z","submitted_at":"2025-06-04T06:24:53Z","title":"The vertex sets of subtrees of a tree"},"reference_resolution":{"displayed":11,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":11},"total_outbound_references":11},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 11 of 11 outbound references and 1 inbound Pith citation observation for arXiv:2506.03603."}