{"as_of":"2026-08-22T10:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ecae4f91c33d8f7c5189ae75119f2cb0e056eedbbc87ddf08af6f411dfbb0745","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T12:20:50.793015Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:50:18.289516Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":1,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2411.17362","last_updated":"2024-11-26T12:08:14Z","snapshot_observed_at":"2026-08-18T14:47:52.684227Z","submitted_at":"2024-11-26T12:08:14Z","title":"Characterizing graphs with high inducibility","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.17362","snapshot_observed_at":"2026-08-15T23:50:18.289516Z","title":"Ueltzen,Characterizing graphs with high inducibility, arXiv preprint 2411.17362","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.03954","last_updated":"2025-08-21T08:31:30Z","snapshot_observed_at":"2026-08-15T23:39:23.966622Z","submitted_at":"2025-05-06T20:14:09Z","title":"The edge-statistics conjecture for hypergraphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T23:50:18.289516Z"},"links":{"cited_paper":"/paper/2411.17362","citing_paper":"/paper/2505.03954"},"observation_digest":"sha256:dcd311623a6340f1f3ab8c517bfb77d2e7338804e1a304380132ac63055946c3","observation_id":"c8c15435-b243-4d2d-96c3-950af925fadf","resolution":{"observed_at":"2026-08-15T23:50:18.289516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.17362","last_updated":"2024-11-26T12:08:14Z","snapshot_observed_at":"2026-08-18T14:47:52.684227Z","submitted_at":"2024-11-26T12:08:14Z","title":"Characterizing graphs with high inducibility","version":1},"cited_work":{"arxiv_id":"2411.17362","doi":"10.48550/arxiv.2411.17362","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.17362","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"fdc00f1d-8360-4def-ae6b-cdf50cfb2a93","year":2024},"citing_paper":{"arxiv_id":"2606.00290","last_updated":"2026-06-30T16:04:06Z","snapshot_observed_at":"2026-08-16T01:50:15.127606Z","submitted_at":"2026-05-29T19:22:36Z","title":"The inducibility of 6-vertex graphs","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-28T21:44:05.246033Z"},"links":{"cited_paper":"/paper/2411.17362","citing_paper":"/paper/2606.00290"},"observation_digest":"sha256:468a35284714cfc9d49e91ec9993f4cbd7d3dae606ec46d73a1384592babc410","observation_id":"e391024a-3508-4339-81a4-a3df900afeb7","resolution":{"observed_at":"2026-06-28T22:22:42.847012Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.17362","last_updated":"2024-11-26T12:08:14Z","snapshot_observed_at":"2026-08-18T14:47:52.684227Z","submitted_at":"2024-11-26T12:08:14Z","title":"Characterizing graphs with high inducibility","version":1},"cited_work":{"arxiv_id":"2411.17362","doi":"10.48550/arxiv.2411.17362","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.17362","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"fdc00f1d-8360-4def-ae6b-cdf50cfb2a93","year":2024},"citing_paper":{"arxiv_id":"2606.00290","last_updated":"2026-06-30T16:04:06Z","snapshot_observed_at":"2026-08-16T01:50:15.127606Z","submitted_at":"2026-05-29T19:22:36Z","title":"The inducibility of 6-vertex graphs","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-01T07:34:20.851377Z"},"links":{"cited_paper":"/paper/2411.17362","citing_paper":"/paper/2606.00290"},"observation_digest":"sha256:a0e078c79fc65aff83ecea7ee3c93b8e2410d9e19011a8a3b1343b19c9546e80","observation_id":"10af7838-6a6c-4c25-8fd5-036a7c1f6dd7","resolution":{"observed_at":"2026-07-01T07:35:28.173092Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.17362","last_updated":"2024-11-26T12:08:14Z","snapshot_observed_at":"2026-08-18T14:47:52.684227Z","submitted_at":"2024-11-26T12:08:14Z","title":"Characterizing graphs with high inducibility","version":1},"cited_work":{"arxiv_id":"2411.17362","doi":"10.48550/arxiv.2411.17362","metadata_source":"arxiv_reference","pith_arxiv_id":"2411.17362","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"fdc00f1d-8360-4def-ae6b-cdf50cfb2a93","year":2024},"citing_paper":{"arxiv_id":"2606.06202","last_updated":"2026-06-04T14:07:23Z","snapshot_observed_at":"2026-08-16T01:50:54.092955Z","submitted_at":"2026-06-04T14:07:23Z","title":"Exact extremal constructions for the inducibility of blowup graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-28T00:34:56.072813Z"},"links":{"cited_paper":"/paper/2411.17362","citing_paper":"/paper/2606.06202"},"observation_digest":"sha256:d21d1f097a89c88f35c5a87b88a32e2a05cd50051ad39ece542c04462d0a1a5b","observation_id":"f9fc7b8d-5ed3-4b68-8818-40812dacf519","resolution":{"observed_at":"2026-07-02T14:17:03.071224Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2411.17362/citation-record","integrity":"/paper/2411.17362/integrity","json":"/paper/2411.17362/citation-record.json","paper":"/paper/2411.17362"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/s0963548319000294","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:20:51.370250Z","title":null,"venue":null,"work_id":"afccd7be-8b56-4d46-9497-925958fbdfc4","year":2020},"citing_paper":{"arxiv_id":"2411.17362","last_updated":"2024-11-26T12:08:14Z","snapshot_observed_at":"2026-08-18T14:47:52.684227Z","submitted_at":"2024-11-26T12:08:14Z","title":"Characterizing graphs with high inducibility","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T12:20:50.660438Z"},"links":{"citing_paper":"/paper/2411.17362"},"observation_digest":"sha256:fa52ecea2952f5dc0b396b2cb6adc8794ee090fb4f438fee3999eab0e3003848","observation_id":"9eca67c5-ee4c-42c9-bdad-a2863a587f7e","resolution":{"observed_at":"2026-08-12T12:20:51.380216Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ejc.2015.08","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:20:51.329114Z","title":"Balogh, P","venue":null,"work_id":"ec3517fb-288a-4de8-bd4d-4dd2aa4d46da","year":2016},"citing_paper":{"arxiv_id":"2411.17362","last_updated":"2024-11-26T12:08:14Z","snapshot_observed_at":"2026-08-18T14:47:52.684227Z","submitted_at":"2024-11-26T12:08:14Z","title":"Characterizing graphs with high inducibility","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T12:20:50.668854Z"},"links":{"citing_paper":"/paper/2411.17362"},"observation_digest":"sha256:e68d340668a13814de5327c1ba7e775dc05632c769ffc5237317b9fb4b257a63","observation_id":"3f713ea9-562b-4015-b84b-8c8ab8f4786a","resolution":{"observed_at":"2026-08-12T12:20:51.338022Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.19086/aic.12047","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:20:51.298869Z","title":"Fox and L","venue":null,"work_id":"54bd211d-9c78-4bde-98a9-e016546128ce","year":2020},"citing_paper":{"arxiv_id":"2411.17362","last_updated":"2024-11-26T12:08:14Z","snapshot_observed_at":"2026-08-18T14:47:52.684227Z","submitted_at":"2024-11-26T12:08:14Z","title":"Characterizing graphs with high inducibility","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T12:20:50.676856Z"},"links":{"citing_paper":"/paper/2411.17362"},"observation_digest":"sha256:42a1c3a1792e5b56f04001997a365537316de1543b6d5b657e5ae03a688bc026","observation_id":"2a94f9af-3446-4ae8-a734-713f968b2f15","resolution":{"observed_at":"2026-08-12T12:20:51.308139Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T12:20:50.685315Z","title":"Hefetz and M","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2411.17362","last_updated":"2024-11-26T12:08:14Z","snapshot_observed_at":"2026-08-18T14:47:52.684227Z","submitted_at":"2024-11-26T12:08:14Z","title":"Characterizing graphs with high inducibility","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T12:20:50.685315Z"},"links":{"citing_paper":"/paper/2411.17362"},"observation_digest":"sha256:d65dffb0b800172b448b0fa641e2233a2f5710bde1437935e4e4c1324a2a02e6","observation_id":"85347cfa-5050-492e-9d8b-4373f5c52b3c","resolution":{"observed_at":"2026-08-12T12:20:50.685315Z","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-12T12:20:50.691870Z","title":"Janson, T","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2411.17362","last_updated":"2024-11-26T12:08:14Z","snapshot_observed_at":"2026-08-18T14:47:52.684227Z","submitted_at":"2024-11-26T12:08:14Z","title":"Characterizing graphs with high inducibility","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T12:20:50.691870Z"},"links":{"citing_paper":"/paper/2411.17362"},"observation_digest":"sha256:669a3146666673117f98de39a36d049b19cf0bfaef447095a84e59109a906b8f","observation_id":"3a961c78-5797-4f2e-8252-581abccaf8f9","resolution":{"observed_at":"2026-08-12T12:20:50.691870Z","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-12T12:20:50.705636Z","title":"Král’, S","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.17362","last_updated":"2024-11-26T12:08:14Z","snapshot_observed_at":"2026-08-18T14:47:52.684227Z","submitted_at":"2024-11-26T12:08:14Z","title":"Characterizing graphs with high inducibility","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T12:20:50.705636Z"},"links":{"citing_paper":"/paper/2411.17362"},"observation_digest":"sha256:e9f3178dbefc937e046288c2ded0d72aad6ddf4665c751deab114e90002a4ba1","observation_id":"58eb2b30-2091-4d5f-8549-8d5a8069f7da","resolution":{"observed_at":"2026-08-12T12:20:50.705636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1112/jlms.12192","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T12:20:51.188661Z","title":null,"venue":null,"work_id":"d881b5be-4096-4d90-afc9-8d1419e8a443","year":2019},"citing_paper":{"arxiv_id":"2411.17362","last_updated":"2024-11-26T12:08:14Z","snapshot_observed_at":"2026-08-18T14:47:52.684227Z","submitted_at":"2024-11-26T12:08:14Z","title":"Characterizing graphs with high inducibility","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T12:20:50.723714Z"},"links":{"citing_paper":"/paper/2411.17362"},"observation_digest":"sha256:88ad87e7ab3140aef31e6ec76197934b9c995ccb995354741b6bb817851a6c52","observation_id":"9120eefe-be07-4042-a9d6-63aa27e5aed1","resolution":{"observed_at":"2026-08-12T12:20:51.195681Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11856-019-1929-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-20T11:03:42.707129Z","title":"Martinsson, F","venue":"Israel Journal of Mathematics","work_id":"dd910cd9-bc6c-46df-bdd2-6e5aa297b38d","year":2019},"citing_paper":{"arxiv_id":"2411.17362","last_updated":"2024-11-26T12:08:14Z","snapshot_observed_at":"2026-08-18T14:47:52.684227Z","submitted_at":"2024-11-26T12:08:14Z","title":"Characterizing graphs with high inducibility","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T12:20:50.733148Z"},"links":{"citing_paper":"/paper/2411.17362"},"observation_digest":"sha256:a6460dc75c5db78f48c7d6c7358bfd9cb4423be87e12e0789dabe2ed11641924","observation_id":"6f724f7b-cb01-4cc1-a313-af6879e7e32e","resolution":{"observed_at":"2026-08-12T12:20:51.168104Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T12:20:50.743001Z","title":"Pippenger and M","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2411.17362","last_updated":"2024-11-26T12:08:14Z","snapshot_observed_at":"2026-08-18T14:47:52.684227Z","submitted_at":"2024-11-26T12:08:14Z","title":"Characterizing graphs with high inducibility","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T12:20:50.743001Z"},"links":{"citing_paper":"/paper/2411.17362"},"observation_digest":"sha256:61ee7e18161ab58b08a3bcfe46d0a617fe87192f4a4abd9c18b8c50f15e2ad68","observation_id":"82776b2d-c8b6-4e60-8f7c-89573d565fcf","resolution":{"observed_at":"2026-08-12T12:20:50.743001Z","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-12T12:20:51.484987Z","title":"Robbins.A remark on Stirling’s formula","venue":null,"work_id":"e8d0f42a-d879-4b68-8305-52cb73ada6f5","year":1955},"citing_paper":{"arxiv_id":"2411.17362","last_updated":"2024-11-26T12:08:14Z","snapshot_observed_at":"2026-08-18T14:47:52.684227Z","submitted_at":"2024-11-26T12:08:14Z","title":"Characterizing graphs with high inducibility","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T12:20:50.751546Z"},"links":{"citing_paper":"/paper/2411.17362"},"observation_digest":"sha256:f297fb5d9da1c8498e3dc6cc2dcf6b36de3214366df4d9768824c55a5f75633d","observation_id":"0b0243ee-4bc9-4793-a091-84693d006c96","resolution":{"observed_at":"2026-08-12T12:20:51.501517Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T12:20:51.451933Z","title":null,"venue":null,"work_id":"e705219c-6557-4fcf-902b-0aced919d297","year":2024},"citing_paper":{"arxiv_id":"2411.17362","last_updated":"2024-11-26T12:08:14Z","snapshot_observed_at":"2026-08-18T14:47:52.684227Z","submitted_at":"2024-11-26T12:08:14Z","title":"Characterizing graphs with high inducibility","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T12:20:50.776264Z"},"links":{"citing_paper":"/paper/2411.17362"},"observation_digest":"sha256:384cd8acb908701463ba0475a2dc989d431ea9518153936d25026485a5ae1895","observation_id":"91269cf1-ede3-4760-9c65-dd854acfc320","resolution":{"observed_at":"2026-08-12T12:20:51.460942Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-12T12:20:50.785340Z","title":"Yuster.On the exact maximum induced density of almost all graphs and their inducibility","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2411.17362","last_updated":"2024-11-26T12:08:14Z","snapshot_observed_at":"2026-08-18T14:47:52.684227Z","submitted_at":"2024-11-26T12:08:14Z","title":"Characterizing graphs with high inducibility","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T12:20:50.785340Z"},"links":{"citing_paper":"/paper/2411.17362"},"observation_digest":"sha256:c46c1ddd635ccd314c8e52d2cb1ab99c896a2b73a42c0813d1f91b148fd2b8c2","observation_id":"2ea7a530-6aac-4bcd-b005-571bc77db079","resolution":{"observed_at":"2026-08-12T12:20:50.785340Z","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-12T12:20:51.410209Z","title":"If P[Zf = s] = 0, the claim is trivial","venue":null,"work_id":"e2bd08d4-97e9-4220-9bc6-d42f5ba9a899","year":null},"citing_paper":{"arxiv_id":"2411.17362","last_updated":"2024-11-26T12:08:14Z","snapshot_observed_at":"2026-08-18T14:47:52.684227Z","submitted_at":"2024-11-26T12:08:14Z","title":"Characterizing graphs with high inducibility","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T12:20:50.793015Z"},"links":{"citing_paper":"/paper/2411.17362"},"observation_digest":"sha256:4a8d133ff0c1cfc7f1b1d50a274f23986219fff2311359f7bfa7544d7f8a6768","observation_id":"d652bc23-3cfc-447b-be6c-495ee05c5591","resolution":{"observed_at":"2026-08-12T12:20:51.425766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.17362","last_updated":"2024-11-26T12:08:14Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-18T14:47:52.684227Z","submitted_at":"2024-11-26T12:08:14Z","title":"Characterizing graphs with high inducibility"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":5,"verified_fuzzy":1},"total_outbound_references":13},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 4 inbound Pith citation observations for arXiv:2411.17362."}