{"as_of":"2026-08-17T22:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1d8763830cf4eb1e4e51178219d1efd825411b31a53dac803eb6bc9c11e3bad7","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:55:29.238002Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:32:11.988909Z","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-15T02:23:31.854136Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.03903","snapshot_observed_at":"2026-08-15T21:32:11.988909Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.09809","last_updated":"2026-07-15T16:36:53Z","snapshot_observed_at":"2026-08-15T21:21:32.183775Z","submitted_at":"2025-05-14T21:23:06Z","title":"On Alternating 6-Cycles in Edge-Coloured Graphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T21:32:11.988909Z"},"links":{"cited_paper":"/paper/2505.03903","citing_paper":"/paper/2505.09809"},"observation_digest":"sha256:a846a73b83557d3954aab1edc71782571aace63d6e0f89c2716717225cd46531","observation_id":"f34d325a-f1c3-4f46-aa0d-1f5179e061ea","resolution":{"observed_at":"2026-08-15T21:32:11.988909Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.03903","snapshot_observed_at":"2026-08-15T15:53:43.143896Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.24336","last_updated":"2026-05-27T09:05:37Z","snapshot_observed_at":"2026-08-16T05:04:59.256578Z","submitted_at":"2025-10-28T11:57:53Z","title":"Semi-inducibility of 4-vertex graphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T15:53:43.143896Z"},"links":{"cited_paper":"/paper/2505.03903","citing_paper":"/paper/2510.24336"},"observation_digest":"sha256:193d8ffd3238e7f15efdd21e38db3fc71fa04365242558e29cf7d148812a9719","observation_id":"f07d32be-0ac0-43d9-add4-cc5bb100fc95","resolution":{"observed_at":"2026-08-15T15:53:43.143896Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"cited_work":{"arxiv_id":"2505.03903","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.03903","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"3c125108-049a-47af-91c4-243d9bf20df2","year":2025},"citing_paper":{"arxiv_id":"2605.14138","last_updated":"2026-05-13T21:44:25Z","snapshot_observed_at":"2026-08-16T02:08:48.792071Z","submitted_at":"2026-05-13T21:44:25Z","title":"On Tournament Anti-Sidorenko Orientations of Trees","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-15T02:21:13.823150Z"},"links":{"cited_paper":"/paper/2505.03903","citing_paper":"/paper/2605.14138"},"observation_digest":"sha256:d404104b1e4ce61660f0cc4d286bf94b506afd533b3713d253b17e91ace5c386","observation_id":"749b6d5a-9846-45a4-bc25-9c249e31c262","resolution":{"observed_at":"2026-05-15T02:23:31.855821Z","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/2505.03903/citation-record","integrity":"/paper/2505.03903/integrity","json":"/paper/2505.03903/citation-record.json","paper":"/paper/2505.03903"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:55:29.157835Z","title":"Alon and J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T23:55:29.157835Z"},"links":{"citing_paper":"/paper/2505.03903"},"observation_digest":"sha256:136dee0d06f4e7c84708f218eb49079656a30896c22c9711706f4256d14b3f02","observation_id":"3390c7e1-0b62-4e75-a82a-a1f0630965b3","resolution":{"observed_at":"2026-08-15T23:55:29.157835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.09842","last_updated":"2025-04-19T09:59:08Z","snapshot_observed_at":"2026-08-16T20:18:55.214103Z","submitted_at":"2025-01-16T21:08:35Z","title":"The semi-inducibility problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.09842","snapshot_observed_at":"2026-08-15T23:55:29.163348Z","title":"Basit, B","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T23:55:29.163348Z"},"links":{"cited_paper":"/paper/2501.09842","citing_paper":"/paper/2505.03903"},"observation_digest":"sha256:2014b41c22184a5ca395ba97ef3d8227217c6fbb2c8a539605efa6eba6b81b18","observation_id":"7eda9fed-a250-430e-8878-aeaabd800e38","resolution":{"observed_at":"2026-08-15T23:55:29.163348Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.16542","last_updated":"2025-01-07T05:38:05Z","snapshot_observed_at":"2026-08-16T15:29:31.052217Z","submitted_at":"2023-05-25T23:50:33Z","title":"Sidorenko-Type Inequalities for Pairs of Trees","version":2},"cited_work":{"arxiv_id":"2305.16542","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.16542","snapshot_observed_at":"2026-08-15T23:55:29.527882Z","title":"Sidorenko-Type Inequalities for Pairs of Trees","venue":"math.CO","work_id":"0aabc42f-f5b9-4d17-90d3-9d89baf98ced","year":2023},"citing_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T23:55:29.168143Z"},"links":{"cited_paper":"/paper/2305.16542","citing_paper":"/paper/2505.03903"},"observation_digest":"sha256:55d93ded3f8e51e058fdf827a9fa627c39fd09ffbd92268b0b5696ed730a1792","observation_id":"7a50b2f4-c9e1-4e11-9521-eddeebade149","resolution":{"observed_at":"2026-08-15T23:55:29.534487Z","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":"2208.02045","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:55:29.504034Z","title":"Behague, N","venue":null,"work_id":"b34a87e9-836f-4def-9cd3-4d0628f8723e","year":2023},"citing_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T23:55:29.172920Z"},"links":{"citing_paper":"/paper/2505.03903"},"observation_digest":"sha256:c33f3a176e92e29da242181f2656ef717caa1acc5ff21f1a63521711dabd94dd","observation_id":"649484c5-13d0-4da2-bb42-7cd7b95fb9ea","resolution":{"observed_at":"2026-08-15T23:55:29.512004Z","resolver_source":"raw_fallback","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-15T23:55:29.741935Z","title":"Behague, N","venue":null,"work_id":"bc401176-2adf-40da-b485-8cb4ee84ea15","year":2024},"citing_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T23:55:29.177552Z"},"links":{"citing_paper":"/paper/2505.03903"},"observation_digest":"sha256:2c4d828c6195cfdaa9e87a6c800f6101a800789cb6ae5de00953312eb66cb118","observation_id":"1039c93b-6351-4594-a89e-fe93d218600d","resolution":{"observed_at":"2026-08-15T23:55:29.746336Z","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-15T23:55:29.727878Z","title":"Blekherman and A","venue":null,"work_id":"72644cac-4ad0-4a0f-a787-7ee159d37a79","year":2022},"citing_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T23:55:29.181950Z"},"links":{"citing_paper":"/paper/2505.03903"},"observation_digest":"sha256:634afc059626fd77cbc88b60d6fae95f0218411b1871de8251f2dbbc8329d197","observation_id":"e099ebef-9e9f-4e68-9cac-0927b297131e","resolution":{"observed_at":"2026-08-15T23:55:29.732090Z","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-15T23:55:29.713655Z","title":"Blekherman and A","venue":null,"work_id":"3a21f202-622e-4e59-babe-20831323853f","year":2023},"citing_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T23:55:29.187223Z"},"links":{"citing_paper":"/paper/2505.03903"},"observation_digest":"sha256:eec7e3be16b078ff831b4d0bb0fa6d3064d226326ee7062b28f0ebcfc4ed546e","observation_id":"cfac00ad-d314-46b8-8ee1-5766599d3f49","resolution":{"observed_at":"2026-08-15T23:55:29.718017Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T23:55:29.191673Z","title":"Chao and H.-H","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T23:55:29.191673Z"},"links":{"citing_paper":"/paper/2505.03903"},"observation_digest":"sha256:e82e7f52ecdf480b7ea5c4704b2c80c5b844ee2f34e96975ba79a04ef186da30","observation_id":"ac3d515a-2e11-4b45-ba01-23920d912819","resolution":{"observed_at":"2026-08-15T23:55:29.191673Z","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-15T23:55:29.698961Z","title":"Conlon, J","venue":null,"work_id":"4ff2b5f5-e5da-47e2-96c5-7452e7b50bd2","year":2018},"citing_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T23:55:29.195733Z"},"links":{"citing_paper":"/paper/2505.03903"},"observation_digest":"sha256:603a3a6121d5e943adaee0cfb8b51c9b20f3bc2ea1021cd81be7d8831b53cb16","observation_id":"a16ee5b8-9b5f-4804-a61a-32aa620e1351","resolution":{"observed_at":"2026-08-15T23:55:29.703619Z","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-15T23:55:29.683462Z","title":"Conlon and J","venue":null,"work_id":"b470a680-1518-4fbb-af48-2929f0ee31f0","year":2017},"citing_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T23:55:29.200514Z"},"links":{"citing_paper":"/paper/2505.03903"},"observation_digest":"sha256:2e535f4d2ce3cb56fc2f2b9bdbca914acbfa7664e39f99f0844f5c82dfbafac9","observation_id":"4e27e6de-3fe1-4889-92ea-aa07cd5f7ebe","resolution":{"observed_at":"2026-08-15T23:55:29.688954Z","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-15T23:55:29.667610Z","title":"Conlon and J","venue":null,"work_id":"3d49f269-f05c-4b5e-abee-5825eb172550","year":2024},"citing_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T23:55:29.204464Z"},"links":{"citing_paper":"/paper/2505.03903"},"observation_digest":"sha256:1c5b08365846a0d11ce6612232dd052fb921f83c4983f12e5a6b2e6953b6206f","observation_id":"9ee5f05a-fc60-4edc-99f3-0a9fb9f048ff","resolution":{"observed_at":"2026-08-15T23:55:29.672379Z","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-15T23:55:29.652620Z","title":"Grzesik, J","venue":null,"work_id":"ee9a73a6-8f33-4da1-9c79-267cbd941749","year":2022},"citing_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T23:55:29.208557Z"},"links":{"citing_paper":"/paper/2505.03903"},"observation_digest":"sha256:e115298f99f08bf2902779d64bcad2e4bbd7b74844d1dc4ab25157da1cd2c12a","observation_id":"9ae445b0-f35f-41a9-927d-64f82c033c88","resolution":{"observed_at":"2026-08-15T23:55:29.657183Z","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-15T23:55:29.637530Z","title":null,"venue":null,"work_id":"d4075c48-1040-4a72-a02b-f0fe0c5c6a99","year":2010},"citing_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T23:55:29.213306Z"},"links":{"citing_paper":"/paper/2505.03903"},"observation_digest":"sha256:ddabd90d87cd1123ca0d9a108d0e0b839b41e5ebf4806034a826074c6a162ef5","observation_id":"afe6ff4d-a291-4feb-8505-fa659f18061a","resolution":{"observed_at":"2026-08-15T23:55:29.642543Z","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-15T23:55:29.622037Z","title":null,"venue":null,"work_id":"43840498-3831-4100-acc5-4dfb81d2ab86","year":2024},"citing_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T23:55:29.217357Z"},"links":{"citing_paper":"/paper/2505.03903"},"observation_digest":"sha256:5693077bfa69a591c4ae2f5cc787da6efd22d0e5f5dd977b7888cc4557bb93fd","observation_id":"ed576ccc-9218-458c-8565-c28d487e4a08","resolution":{"observed_at":"2026-08-15T23:55:29.627208Z","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-15T23:55:29.607201Z","title":"Kopparty and B","venue":null,"work_id":"5ed04900-76f0-42d9-a8ab-f85674d37aa7","year":2011},"citing_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T23:55:29.221578Z"},"links":{"citing_paper":"/paper/2505.03903"},"observation_digest":"sha256:782d0621de34ba028485b902e3953ac328bed76f787d43ca9a22bd2a0ad7b54d","observation_id":"5699401c-3dc4-4a4c-8fc4-2ba39d2c73c4","resolution":{"observed_at":"2026-08-15T23:55:29.612193Z","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-15T23:55:29.592192Z","title":null,"venue":null,"work_id":"ce58cfd7-db19-4011-a0d9-8f18799d1140","year":2021},"citing_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T23:55:29.225593Z"},"links":{"citing_paper":"/paper/2505.03903"},"observation_digest":"sha256:c94b4193d23e1263e5e74ae0268011c1ad00d23fd3d3b9395d1a986053c1cdac","observation_id":"10cf6997-20eb-4322-8c60-43ca55ef4c7e","resolution":{"observed_at":"2026-08-15T23:55:29.596995Z","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-15T23:55:29.576745Z","title":"Lov´ asz","venue":null,"work_id":"43d7bb9e-65ff-45dc-a19e-970d226016c3","year":2011},"citing_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T23:55:29.229839Z"},"links":{"citing_paper":"/paper/2505.03903"},"observation_digest":"sha256:1ba3fcf2210c4b8b2dfc383162dcb72c2186ceaee92d340e8933dea97bf12f35","observation_id":"7b5db0b4-512c-4430-a9dd-9fec485de3f6","resolution":{"observed_at":"2026-08-15T23:55:29.581357Z","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-15T23:55:29.561054Z","title":null,"venue":null,"work_id":"375aee85-2378-48a3-bee8-1b61b0972bd3","year":1993},"citing_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T23:55:29.233891Z"},"links":{"citing_paper":"/paper/2505.03903"},"observation_digest":"sha256:e439f167bd2080ab5ae60eea604dfea6f8e2be3dde06752aaf380633134ad7f6","observation_id":"ae798f15-f19b-4844-b285-bc37c2daca58","resolution":{"observed_at":"2026-08-15T23:55:29.566289Z","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":{"arxiv_id":"1406.6738","last_updated":"2015-01-26T18:11:00Z","snapshot_observed_at":"2026-08-14T23:29:02.416791Z","submitted_at":"2014-06-26T00:14:39Z","title":"An information theoretic approach to Sidorenko's conjecture","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.6738","snapshot_observed_at":"2026-08-15T23:55:29.238002Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T23:55:29.238002Z"},"links":{"cited_paper":"/paper/1406.6738","citing_paper":"/paper/2505.03903"},"observation_digest":"sha256:b93e366f26405997d2c9dea3dfc6cbb76cf109968735fe6615261b96f6392d2b","observation_id":"1c143dbe-16c7-49f7-ba71-b8d3724a2f39","resolution":{"observed_at":"2026-08-15T23:55:29.238002Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.03903","last_updated":"2025-05-06T18:18:52Z","latest_version":1,"primary_category":"math.CO","snapshot_observed_at":"2026-08-17T21:16:26.942601Z","submitted_at":"2025-05-06T18:18:52Z","title":"Maximizing Alternating Paths via Entropy"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":2,"verified_fuzzy":9},"total_outbound_references":19},"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 17 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 3 inbound Pith citation observations for arXiv:2505.03903."}