{"as_of":"2026-08-20T03:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3e464071b0c4b0d98c39b90be6cb48e710950958c454865ee86cc618018abf07","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-12T10:32:35.863642Z","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-19T06:32:44.657259+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/2411.19267/citation-record","integrity":"/paper/2411.19267/integrity","json":"/paper/2411.19267/citation-record.json","paper":"/paper/2411.19267"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2302.13389","last_updated":"2023-02-26T19:16:02Z","snapshot_observed_at":"2026-08-16T15:52:37.244388Z","submitted_at":"2023-02-26T19:16:02Z","title":"$K_r$-saturated Graphs and the Two Families Theorem","version":1},"cited_work":{"arxiv_id":"2302.13389","doi":null,"metadata_source":"pith","pith_arxiv_id":"2302.13389","snapshot_observed_at":"2026-08-12T10:32:35.983373Z","title":"$K_r$-saturated Graphs and the Two Families Theorem","venue":"math.CO","work_id":"f56cedd9-5b23-4f37-97ea-1bf9910b9e13","year":2023},"citing_paper":{"arxiv_id":"2411.19267","last_updated":"2024-11-28T16:59:57Z","snapshot_observed_at":"2026-08-19T21:17:25.454039Z","submitted_at":"2024-11-28T16:59:57Z","title":"Twin-free $K_r$-saturated Graphs and Maximally Independent Sets in $K_3$-free Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T10:32:35.818197Z"},"links":{"cited_paper":"/paper/2302.13389","citing_paper":"/paper/2411.19267"},"observation_digest":"sha256:11a34253188169e5250543c6e7ef966a693c037c323c3c959019287d1bf0070a","observation_id":"5f17bb82-20e9-4339-9e57-d74ca968c577","resolution":{"observed_at":"2026-08-12T10:32:35.991865Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:32:35.824405Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2411.19267","last_updated":"2024-11-28T16:59:57Z","snapshot_observed_at":"2026-08-19T21:17:25.454039Z","submitted_at":"2024-11-28T16:59:57Z","title":"Twin-free $K_r$-saturated Graphs and Maximally Independent Sets in $K_3$-free Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T10:32:35.824405Z"},"links":{"citing_paper":"/paper/2411.19267"},"observation_digest":"sha256:3a898a89ec68fb9926c3ce4b005e3ac43eead85f06a42811e23a7d1129d88b5b","observation_id":"89381052-9e99-4563-8998-cfb4c2ec2abc","resolution":{"observed_at":"2026-08-12T10:32:35.824405Z","resolver_source":null,"status":"malformed_identifier"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:32:36.029816Z","title":null,"venue":null,"work_id":"9c57048e-2bcd-431a-aca2-b7780f28b35d","year":1986},"citing_paper":{"arxiv_id":"2411.19267","last_updated":"2024-11-28T16:59:57Z","snapshot_observed_at":"2026-08-19T21:17:25.454039Z","submitted_at":"2024-11-28T16:59:57Z","title":"Twin-free $K_r$-saturated Graphs and Maximally Independent Sets in $K_3$-free Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T10:32:35.829524Z"},"links":{"citing_paper":"/paper/2411.19267"},"observation_digest":"sha256:7918bea46fd61ee147d446c13dc03986ee17bc3a2c85f5a34e41e389a3d0aed4","observation_id":"d362b3b6-65a6-4cf7-856c-4c0a67ab56c8","resolution":{"observed_at":"2026-08-12T10:32:36.035266Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:32:35.835001Z","title":"Erd˝ os, A","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2411.19267","last_updated":"2024-11-28T16:59:57Z","snapshot_observed_at":"2026-08-19T21:17:25.454039Z","submitted_at":"2024-11-28T16:59:57Z","title":"Twin-free $K_r$-saturated Graphs and Maximally Independent Sets in $K_3$-free Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T10:32:35.835001Z"},"links":{"citing_paper":"/paper/2411.19267"},"observation_digest":"sha256:c988a5d888d2828554ec8c504173132d240f087ccfc9092716b266e8a2a6754e","observation_id":"a65f58fa-71be-4133-ad32-15276290b8d2","resolution":{"observed_at":"2026-08-12T10:32:35.835001Z","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-12T10:32:35.840576Z","title":"Erd˝ os, C","venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2411.19267","last_updated":"2024-11-28T16:59:57Z","snapshot_observed_at":"2026-08-19T21:17:25.454039Z","submitted_at":"2024-11-28T16:59:57Z","title":"Twin-free $K_r$-saturated Graphs and Maximally Independent Sets in $K_3$-free Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T10:32:35.840576Z"},"links":{"citing_paper":"/paper/2411.19267"},"observation_digest":"sha256:30941e5844c54042e16f681f66b488edb6c28eb667bc2dbbd3074053414115ac","observation_id":"2ec46d80-f1cd-47c6-a805-ca32ad57f067","resolution":{"observed_at":"2026-08-12T10:32:35.840576Z","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-12T10:32:35.846989Z","title":null,"venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2411.19267","last_updated":"2024-11-28T16:59:57Z","snapshot_observed_at":"2026-08-19T21:17:25.454039Z","submitted_at":"2024-11-28T16:59:57Z","title":"Twin-free $K_r$-saturated Graphs and Maximally Independent Sets in $K_3$-free Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T10:32:35.846989Z"},"links":{"citing_paper":"/paper/2411.19267"},"observation_digest":"sha256:90bf5c38c7f3ea496a3592a2cbdc8d49db78381abd41e38cab9e7bcde7ced1c5","observation_id":"b9a088a4-15d5-428b-bf3e-0450fd85945a","resolution":{"observed_at":"2026-08-12T10:32:35.846989Z","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-12T10:32:35.852333Z","title":"K´ aszonyi and Z","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2411.19267","last_updated":"2024-11-28T16:59:57Z","snapshot_observed_at":"2026-08-19T21:17:25.454039Z","submitted_at":"2024-11-28T16:59:57Z","title":"Twin-free $K_r$-saturated Graphs and Maximally Independent Sets in $K_3$-free Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T10:32:35.852333Z"},"links":{"citing_paper":"/paper/2411.19267"},"observation_digest":"sha256:c7a4c5c6275c7caeeef873042eaec8ad49c10365bf38720a7eea1ad706e2e21a","observation_id":"91e9ea4c-d6cd-4893-ad6a-56f662658bde","resolution":{"observed_at":"2026-08-12T10:32:35.852333Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.06066","last_updated":"2020-12-19T01:21:19Z","snapshot_observed_at":"2026-08-18T17:35:56.246824Z","submitted_at":"2020-12-11T01:08:36Z","title":"Maximizing the number of maximal independent sets of a fixed size","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.06066","snapshot_observed_at":"2026-08-12T10:32:35.857822Z","title":"Song and B","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2411.19267","last_updated":"2024-11-28T16:59:57Z","snapshot_observed_at":"2026-08-19T21:17:25.454039Z","submitted_at":"2024-11-28T16:59:57Z","title":"Twin-free $K_r$-saturated Graphs and Maximally Independent Sets in $K_3$-free Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T10:32:35.857822Z"},"links":{"cited_paper":"/paper/2012.06066","citing_paper":"/paper/2411.19267"},"observation_digest":"sha256:f423272339e8eb035522474a7d3ce9162008c4e3df9834b682b9146c9d29ce01","observation_id":"166aa9ba-e016-4b9a-a3b6-d68b68ee3035","resolution":{"observed_at":"2026-08-12T10:32:35.857822Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T10:32:36.008919Z","title":null,"venue":null,"work_id":"dcef7e9a-b5f3-4821-a129-a40bf0adc5bb","year":1986},"citing_paper":{"arxiv_id":"2411.19267","last_updated":"2024-11-28T16:59:57Z","snapshot_observed_at":"2026-08-19T21:17:25.454039Z","submitted_at":"2024-11-28T16:59:57Z","title":"Twin-free $K_r$-saturated Graphs and Maximally Independent Sets in $K_3$-free Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T10:32:35.863642Z"},"links":{"citing_paper":"/paper/2411.19267"},"observation_digest":"sha256:454e3b650845cbacb01fb7998a43e563ea6aa40d7359ed3117b533c7905f5192","observation_id":"8cefbea6-92bd-4b4a-9e19-5e1c9911ef06","resolution":{"observed_at":"2026-08-12T10:32:36.015834Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.19267","last_updated":"2024-11-28T16:59:57Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-19T21:17:25.454039Z","submitted_at":"2024-11-28T16:59:57Z","title":"Twin-free $K_r$-saturated Graphs and Maximally Independent Sets in $K_3$-free Graphs"},"reference_resolution":{"displayed":9,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":1,"verified_fuzzy":0},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 0 inbound Pith citation observations for arXiv:2411.19267."}