{"as_of":"2026-08-18T05:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d45014288aed90531378d70c527625563c9b5840625e323f8e7365b1bdea6656","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T01:18:39.798518Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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-05-17T05:35:13.118221Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-17T05:35:13.269307Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"cited_work":{"arxiv_id":"2506.12151","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.12151","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"UniVG-R1: Reasoning guided universal visual grounding with reinforce- ment learning","venue":null,"work_id":"e4c5eb72-d75e-4cda-9c4e-f3e8e1c00cd6","year":2025},"citing_paper":{"arxiv_id":"2505.15436","last_updated":"2025-12-05T05:44:39Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-21T12:18:15Z","title":"Adaptive Chain-of-Focus Reasoning via Dynamic Visual Search and Zooming for Efficient VLMs","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-17T05:35:13.118221Z"},"links":{"cited_paper":"/paper/2506.12151","citing_paper":"/paper/2505.15436"},"observation_digest":"sha256:447854d11dd6814b39348d91cc03d578b1c9f424a2e3ddb0a5dc23a7155419ba","observation_id":"9fc83d9f-0dd9-4850-9e04-6db2dcce43e6","resolution":{"observed_at":"2026-05-17T05:35:13.271559Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2506.12151/citation-record","integrity":"/paper/2506.12151/integrity","json":"/paper/2506.12151/citation-record.json","paper":"/paper/2506.12151"},"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-07T01:18:44.152165Z","title":"Ahlswede and G.O.H","venue":null,"work_id":"79f726c1-a509-4a7c-83da-a397f07ad270","year":1978},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:37.774615Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:e53657956caa3734741455b70b47f6e0b89cd3c25c54ca60fd58538ce7f6ee5a","observation_id":"09cc2f41-2139-494e-a4a0-07c6ba041804","resolution":{"observed_at":"2026-08-07T01:18:44.193570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:43.989550Z","title":"Alessandrini","venue":null,"work_id":"651ca873-d2b5-41ce-83d2-cba8987f38d6","year":2013},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:37.804060Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:b49999c910d9ae1a86f14cd90fdbb79dc3fada2744b1bd40ca61da01996cc8f4","observation_id":"26e5db65-f821-45a6-89a4-93410a8f84c9","resolution":{"observed_at":"2026-08-07T01:18:44.055707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:43.834736Z","title":null,"venue":null,"work_id":"999edc37-1409-4775-812a-c169b8399667","year":1981},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:37.860543Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:a08f2b79c3ddf4080dea184f3afff29f82afa7c69cbdbd25b49bfd343966e240","observation_id":"4d2da736-d55c-4fe6-a3c2-c4260c2110b2","resolution":{"observed_at":"2026-08-07T01:18:43.899003Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:43.707896Z","title":"Blekherman and A","venue":null,"work_id":"8d41a970-2478-45fe-8106-be78f97805b5","year":2022},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:37.959851Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:1a6f7fb15ffd80943332d93b7c253b33a20f362d0ead3bf895ead69bbbe821bf","observation_id":"6f62b20a-863c-4290-8d9d-35b942ff0219","resolution":{"observed_at":"2026-08-07T01:18:43.764491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:43.511183Z","title":"Blekherman and A","venue":null,"work_id":"36a5d208-4b58-47c4-bd42-ec83e0bdbb61","year":2023},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:38.070488Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:4f4c57f43519184ab9707d3cd13e8ffa162baea2665dfe02fbe064defec41c9a","observation_id":"3c2bdde0-aeba-4083-a370-f82e6a88979a","resolution":{"observed_at":"2026-08-07T01:18:43.581732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:43.420827Z","title":"Blekherman, A","venue":null,"work_id":"0fdc4dbf-304c-4889-b6a8-1d9799f6e10b","year":2022},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:38.173103Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:8771ea231ede88a10ff9d1f75fc2b597deb67351cab1fe39e3ae188c79f54ba1","observation_id":"bca85e41-cd75-431f-95e2-bfa9cf6c82e2","resolution":{"observed_at":"2026-08-07T01:18:43.460066Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:43.274233Z","title":"Blekherman, A","venue":null,"work_id":"17da6258-a3e3-4ce1-b5dc-24c8b0414790","year":2024},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:38.235848Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:81406f36474de612e07a2975bd5ab024ca9f80e1bef09f8d14a69b927b87a9d6","observation_id":"1f2a9fac-b34b-4157-8d4e-eb031f312249","resolution":{"observed_at":"2026-08-07T01:18:43.346545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:43.048776Z","title":"Bollob´ as","venue":null,"work_id":"3e6cc9d4-39ca-49ca-b886-aaf339cb239f","year":1975},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:38.292418Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:624e26101d3461002c0a1a8c1cd5753b9e935ab4e9c70752d0ea829a75c9cd10","observation_id":"b4a8f8c9-9ae7-45ff-90fb-977a5b5eeeeb","resolution":{"observed_at":"2026-08-07T01:18:43.180824Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04972","last_updated":"2024-12-09T10:16:13Z","snapshot_observed_at":"2026-08-17T22:46:28.694217Z","submitted_at":"2024-12-06T11:46:11Z","title":"Undecidability of polynomial inequalities in tournaments","version":2},"cited_work":{"arxiv_id":"2412.04972","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.04972","snapshot_observed_at":"2026-08-07T01:18:40.224040Z","title":"Undecidability of polynomial inequalities in tournaments","venue":"math.CO","work_id":"571c7b77-f839-4fc7-9cde-a6cf961ee454","year":2024},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:38.352000Z"},"links":{"cited_paper":"/paper/2412.04972","citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:938060bb07d30789535902a174b0dad3b3d4aa4f34650aebc22ecda8f41d200c","observation_id":"7a7e4b3f-a210-4a04-9f5b-bb23b54e420c","resolution":{"observed_at":"2026-08-07T01:18:40.303339Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:42.884464Z","title":"Conlon, J","venue":null,"work_id":"66a7779a-814f-49bc-aad6-d28c781c8379","year":2010},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:38.426506Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:8abb4ba77403a821ba1f34f0a5e1cd1ee020e036e19cbef70ac4924fbc9cc17e","observation_id":"f5a7ed98-24f4-4783-a2cb-a0228419a041","resolution":{"observed_at":"2026-08-07T01:18:42.962313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2303.01997","last_updated":"2024-05-26T14:30:24Z","snapshot_observed_at":"2026-08-16T15:51:01.608933Z","submitted_at":"2023-03-03T15:09:18Z","title":"Domination inequalities and dominating graphs","version":2},"cited_work":{"arxiv_id":"2303.01997","doi":null,"metadata_source":"pith","pith_arxiv_id":"2303.01997","snapshot_observed_at":"2026-08-07T01:18:40.104293Z","title":"Domination inequalities and dominating graphs","venue":"math.CO","work_id":"2ce309f4-296e-499c-a007-62f44b844eb4","year":2023},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:38.516757Z"},"links":{"cited_paper":"/paper/2303.01997","citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:efcec23e42279643386b60045333f3f234c7947ea11bb6f0f4f248c028b1b00f","observation_id":"0c706e7c-da48-4f53-ba7a-7ff4884af25e","resolution":{"observed_at":"2026-08-07T01:18:40.160206Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:42.706487Z","title":"Dasc˘ alu and A","venue":null,"work_id":"663ccd52-e5d7-42cb-ae5a-f0f733c7600e","year":2025},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:38.608022Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:03cfa8fb81d19d1f94dfb72eaa35e37fab1b429bbb58f00af03e5eadb53efb04","observation_id":"b66319a1-6e0f-469a-a143-dac2af9f3c78","resolution":{"observed_at":"2026-08-07T01:18:42.789940Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:42.535722Z","title":"Freedman, L","venue":null,"work_id":"bc467ea6-b203-437c-a114-6fb4151292d4","year":2007},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:38.707403Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:52cae5aa96611f5303cd4e69adbda00a5d249b38364d9fa609043c8016c228d1","observation_id":"f84e89c2-ff75-477a-8f3e-798f8646b1c8","resolution":{"observed_at":"2026-08-07T01:18:42.621612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:42.370172Z","title":"Hatami, and S","venue":null,"work_id":"a832401d-8129-4c9a-841a-305db8f3cf4b","year":2011},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:38.814402Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:7a19cb2016cc657aa06c43358d89319257f4eaa42ae106fbafadfb2d324585ee","observation_id":"5c09b35f-9751-49fe-a430-5a8194f92c1c","resolution":{"observed_at":"2026-08-07T01:18:42.429902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:42.273006Z","title":"Janson, K","venue":null,"work_id":"16c77a52-55ed-41f7-b8da-ab24a2930b92","year":2004},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:38.882630Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:4df2bf1b5beeefedcf7f946d9464d91d458fead5ccdca2bdfec8ddf4989a5ba9","observation_id":"c446a957-4ab6-447c-bcf1-25b5add67643","resolution":{"observed_at":"2026-08-07T01:18:42.309083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:42.130351Z","title":"Kopparty and B","venue":null,"work_id":"ed27ac51-9812-4e80-8ffb-0e4e2fd8c1b4","year":2011},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:38.984857Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:e275cf0e103efde1939840bdd3dd877260a7d6811c0613ed90d9f79cdc7e3d20","observation_id":"33246299-2332-4295-a989-13bb0988ecca","resolution":{"observed_at":"2026-08-07T01:18:42.204339Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:41.975508Z","title":"Lov´ asz","venue":null,"work_id":"6f623925-c4d9-49d3-9656-089584151be1","year":null},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:39.055807Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:d06429256fea21b91b5f87452b26599d076738a01f8e56aec92999db284dcc50","observation_id":"1c70dbee-6c91-490a-93cd-a231ba6f7f21","resolution":{"observed_at":"2026-08-07T01:18:42.038456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:41.878525Z","title":"Lov´ asz","venue":null,"work_id":"8bf73a11-d758-4536-b414-067a891cace7","year":2011},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:39.120583Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:cb22f034d83c82f938b733819f40dd75b36aabc6c6d895040d0d1f8b94b2f639","observation_id":"f9791d70-741b-42c8-998c-07eb5488fd9a","resolution":{"observed_at":"2026-08-07T01:18:41.919237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:41.736671Z","title":"Lov´ asz.Large Networks and Graph Limits.Amer","venue":null,"work_id":"4b7ee7df-e721-4666-98eb-a5b7df622e51","year":2012},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:39.177727Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:1ccbd584daed97b650204947d0aad2eb98eeb5d346ff9191c1ee056e1337195f","observation_id":"488fb0e6-fb2f-45d6-b288-b3db0b369a4a","resolution":{"observed_at":"2026-08-07T01:18:41.796870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:41.585123Z","title":"Random graphons and a weak Positivstellensatz for graphs","venue":null,"work_id":"5e087e55-9829-4508-8a65-491d9d2f585f","year":2012},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:39.218865Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:4863d9fc752995b56c5a54b20515c8d6f7e91e6d4e3beff659cd67a04b8e78ab","observation_id":"1caaf844-1b29-4b29-9413-02ec1fa31434","resolution":{"observed_at":"2026-08-07T01:18:41.639585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:41.419996Z","title":"Nikiforov","venue":null,"work_id":"e0d0ecaf-493a-4593-b4ab-a31ba2653dfc","year":2011},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:39.267405Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:99097ac623f27fe90909a1a4d1c4235632efaa741504196ed5c028ee6d9c1153","observation_id":"c445e49d-b8c6-4ca6-965f-3af9f5cefab4","resolution":{"observed_at":"2026-08-07T01:18:41.507476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:41.277989Z","title":"Razborov","venue":null,"work_id":"88ae995e-107b-48c4-a1a2-44b02ba73f5f","year":2007},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:39.319904Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:a9e4e1d91978d42f7cdcb7007c2b89077795ec701ad7b428cd4a0312c6092d10","observation_id":"51a92b70-98a6-41fe-95fe-0591c46b3f77","resolution":{"observed_at":"2026-08-07T01:18:41.320459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:41.112096Z","title":"Razborov","venue":null,"work_id":"3c4c0f8d-eacc-4293-b950-87aba786f240","year":2008},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:39.376489Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:ee6ca5c1f18fdea05fc0c6c1916c77ad9185301bcb23ef8314b10e923340f310","observation_id":"99914e89-37e9-405d-9bc2-00e8b6d85d40","resolution":{"observed_at":"2026-08-07T01:18:41.208157Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:40.911860Z","title":null,"venue":null,"work_id":"14dbe0f0-ca15-4f3a-89e1-1dbf6c0ca984","year":2016},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:39.456086Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:a03011fa5eb9f96eb73231b4bc6065ea5dcd86b3a5c4bf76b2cfa7363f465188","observation_id":"3eb79a15-e43f-40f2-913c-cbc3f3cd826f","resolution":{"observed_at":"2026-08-07T01:18:41.019454Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:40.744738Z","title":"Sa˘ glam","venue":null,"work_id":"e4dfa0b7-0d5a-4a90-ac3b-a454ae35e097","year":2018},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:39.513490Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:dac38ab5d5491c98276037551cfa624de323b4d8d6f045d81e6162e3f6bcf680","observation_id":"d6f5426a-95b0-4822-9277-24ad0645864a","resolution":{"observed_at":"2026-08-07T01:18:40.836052Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:40.538667Z","title":"Sidorenko","venue":null,"work_id":"42607ee2-5a8c-4af1-b835-6744c350d189","year":1993},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:39.575366Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:b13cf5a14b4f71f37b04ca5e40b10a52764d1aa00cdd493d8505c8f9396efe60","observation_id":"b13ba2c4-8e7c-4d47-863b-21a7c1f9955a","resolution":{"observed_at":"2026-08-07T01:18:40.628624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-07T01:18:40.379053Z","title":"Sidorenko","venue":null,"work_id":"88da40a0-8b6e-44c6-825d-b2a6f0f18fe1","year":1994},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:39.700940Z"},"links":{"citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:5f15fc72e859ff689f3f7011d3c35cc2c3ab9dbfc569dfeaaf7ee38fb600d274","observation_id":"023a16d6-ae87-4b7e-8b27-09dac9dfb8e8","resolution":{"observed_at":"2026-08-07T01:18:40.437939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.09870","last_updated":"2022-11-17T20:20:47Z","snapshot_observed_at":"2026-08-17T22:47:10.587232Z","submitted_at":"2022-11-17T20:20:47Z","title":"The Graph Density Domination Exponent","version":1},"cited_work":{"arxiv_id":"2211.09870","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.09870","snapshot_observed_at":"2026-08-07T01:18:39.909904Z","title":"The Graph Density Domination Exponent","venue":"math.CO","work_id":"87dafae7-788d-4cd8-92d4-163b6c18f72d","year":2022},"citing_paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T01:18:39.798518Z"},"links":{"cited_paper":"/paper/2211.09870","citing_paper":"/paper/2506.12151"},"observation_digest":"sha256:8a4cf5d0d3087444e8c0c6bcd52ec211fb1d4a47dc062f5d066f58097530dd8b","observation_id":"0f5523dd-2de8-4000-a4c5-ae8e856b671c","resolution":{"observed_at":"2026-08-07T01:18:40.003665Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.12151","last_updated":"2025-08-24T13:36:58Z","latest_version":2,"primary_category":"math.CO","snapshot_observed_at":"2026-08-17T22:46:49.124535Z","submitted_at":"2025-06-13T18:10:33Z","title":"On Domination Exponents for Pairs of Graphs"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":3,"verified_fuzzy":23},"total_outbound_references":28},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 1 inbound Pith citation observation for arXiv:2506.12151."}