{"as_of":"2026-08-08T21:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1e84c0dc4efb1c5a8f9770c383ab888a95ad6466d76d1c4f42cc503f0e5299b1","coverage":[{"denominator":17,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":17,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T07:17:10.846036Z","state":"measured"},{"denominator":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T00:05:40.061043Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","snapshot_observed_at":"2026-08-07T23:36:26.301529Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2607.21517","snapshot_observed_at":"2026-08-01T00:05:40.061043Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.27869","last_updated":"2026-07-30T08:44:15Z","snapshot_observed_at":"2026-08-07T23:36:48.947635Z","submitted_at":"2026-07-30T08:44:15Z","title":"A Recursive Construction Improving the Lower Bound on the Shannon Capacity of $C_7$","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T00:05:40.061043Z"},"links":{"cited_paper":"/paper/2607.21517","citing_paper":"/paper/2607.27869"},"observation_digest":"sha256:1b2373f9a6c2a33d15cdbbae2cbb705be876c6931477f83245dd6d56fab06a05","observation_id":"ec526226-364e-4a2b-8b8d-934c67a303cc","resolution":{"observed_at":"2026-08-01T00:05:40.061043Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2607.21517/citation-record","integrity":"/paper/2607.21517/integrity","json":"/paper/2607.21517/citation-record.json","paper":"/paper/2607.21517"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T07:17:09.344909Z","title":"The Shannon capacity of a graph and the independence numbers of its powers.IEEE Transactions on Information Theory, 52(5):2172–2176, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","snapshot_observed_at":"2026-08-07T23:36:26.301529Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T07:17:09.344909Z"},"links":{"citing_paper":"/paper/2607.21517"},"observation_digest":"sha256:f8f0dde67b5237aeed91c88d30e581e2ea6a7598bc91fe1a899981d80c620b6c","observation_id":"47a68f9e-506d-488b-8aae-23c888229b4c","resolution":{"observed_at":"2026-08-01T07:17:09.344909Z","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-01T07:17:09.427567Z","title":"A combinatorial packing problem","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","snapshot_observed_at":"2026-08-07T23:36:26.301529Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T07:17:09.427567Z"},"links":{"citing_paper":"/paper/2607.21517"},"observation_digest":"sha256:521aa38c8b463a212ac398852f2f29c047290ace0920b94c717c72866a706019","observation_id":"fdc0382b-7a8e-4bee-b279-5fb2e40e3027","resolution":{"observed_at":"2026-08-01T07:17:09.427567Z","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-01T07:17:09.486262Z","title":"A limit theorem for the Shannon capacities of odd cycles I.Proceedings of the American Mathematical Society, 131(11):3559–3569, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","snapshot_observed_at":"2026-08-07T23:36:26.301529Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T07:17:09.486262Z"},"links":{"citing_paper":"/paper/2607.21517"},"observation_digest":"sha256:3a2fd27787852e35bae19e9650e16b4cd6971b626ecb5ecde8ca2d34f314175e","observation_id":"b439689d-c1eb-43f4-bb04-224ab48c7bbe","resolution":{"observed_at":"2026-08-01T07:17:09.486262Z","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-01T07:17:09.564995Z","title":"On the inde- pendence numbers of the cubes of odd cycles.The Electronic Journal of Combinatorics, page P10, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","snapshot_observed_at":"2026-08-07T23:36:26.301529Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T07:17:09.564995Z"},"links":{"citing_paper":"/paper/2607.21517"},"observation_digest":"sha256:960d01b6a65e0af050b0c6a1030ddc9d3ef2298bc9dd83738976fb5dfeabf0ee","observation_id":"e1ac3a0f-3b17-4d97-ab0c-cc1030f62488","resolution":{"observed_at":"2026-08-01T07:17:09.564995Z","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-01T07:17:09.623193Z","title":"Some remarks on the Shannon capacity of odd cycles.Ars Combinatoria, 66:243–258, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","snapshot_observed_at":"2026-08-07T23:36:26.301529Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T07:17:09.623193Z"},"links":{"citing_paper":"/paper/2607.21517"},"observation_digest":"sha256:4ce1f4f80803852a1e65d118ab3bdcc3920759eb25db085eec1051e3e03858f1","observation_id":"2098612f-3f71-47a0-954a-1e3e5d97b4e3","resolution":{"observed_at":"2026-08-01T07:17:09.623193Z","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-01T07:17:09.758222Z","title":"The asymptotic spec- trum distance, graph limits, and the Shannon capacity.arXiv preprint arXiv:2404.16763, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","snapshot_observed_at":"2026-08-07T23:36:26.301529Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T07:17:09.758222Z"},"links":{"citing_paper":"/paper/2607.21517"},"observation_digest":"sha256:0b80902898e6e98b60feec266a649b602bce3e07794efb0e42040d53187f5162","observation_id":"7727ef33-45b1-4a06-bd00-5a26bd359f48","resolution":{"observed_at":"2026-08-01T07:17:09.758222Z","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-01T07:17:09.846491Z","title":"Linear Shannon capacity of Cayley graphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","snapshot_observed_at":"2026-08-07T23:36:26.301529Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T07:17:09.846491Z"},"links":{"citing_paper":"/paper/2607.21517"},"observation_digest":"sha256:1a386fff6c1bac37c6c1d6d617e5154b0af57ad90163674c39e59ba4103c8a46","observation_id":"4d388c7f-d26c-48e9-b0ad-79527da148a2","resolution":{"observed_at":"2026-08-01T07:17:09.846491Z","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-01T07:17:09.987641Z","title":"Cliqueishardtoapproximatewithin n1−ε.Acta Mathematica, 182(1):105–142, 1999","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","snapshot_observed_at":"2026-08-07T23:36:26.301529Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T07:17:09.987641Z"},"links":{"citing_paper":"/paper/2607.21517"},"observation_digest":"sha256:dc7b5f9889623d0244ce0199e8fdac4fa7d9dd2ba6eae7eb0ed7dc2888a0833b","observation_id":"f8c4e2e1-b9cd-45ee-bfa0-cb609d9374b0","resolution":{"observed_at":"2026-08-01T07:17:09.987641Z","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-01T07:17:10.131326Z","title":"Advances in the Shannon capacity of graphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","snapshot_observed_at":"2026-08-07T23:36:26.301529Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T07:17:10.131326Z"},"links":{"citing_paper":"/paper/2607.21517"},"observation_digest":"sha256:878175a286e896bdd2d11405b9c01b1436b0609c4d3b2329fb625725a2f66020","observation_id":"69fae594-fef9-4f7f-95ec-88d7e52509b2","resolution":{"observed_at":"2026-08-01T07:17:10.131326Z","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-01T07:17:10.266217Z","title":"On the Shannon capacity of a graph.IEEE Transactions on Information theory, 25(1):1–7, 1979","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","snapshot_observed_at":"2026-08-07T23:36:26.301529Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T07:17:10.266217Z"},"links":{"citing_paper":"/paper/2607.21517"},"observation_digest":"sha256:adadcd1eccad8de2214a7a775992baa761b3a43d6c1da7659173a80e3e08511b","observation_id":"dcfb4874-6d1f-4f35-a7b5-46f3ce92d6aa","resolution":{"observed_at":"2026-08-01T07:17:10.266217Z","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-01T07:17:10.387356Z","title":"New lower bounds for the Shannon capacity of odd cycles.Designs, Codes and Cryptography, 84(1):13– 22, 2017","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","snapshot_observed_at":"2026-08-07T23:36:26.301529Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T07:17:10.387356Z"},"links":{"citing_paper":"/paper/2607.21517"},"observation_digest":"sha256:1302b56f2e5f286633e945e9170426535986ea070952db7d072e8c097f6c8574","observation_id":"b62cb53d-a054-4c5b-834a-f158501f95e1","resolution":{"observed_at":"2026-08-01T07:17:10.387356Z","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-01T07:17:10.465714Z","title":"New lower bound on the Shannon capacity of C7 from circular graphs.Information Processing Letters, 143:37– 40, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","snapshot_observed_at":"2026-08-07T23:36:26.301529Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T07:17:10.465714Z"},"links":{"citing_paper":"/paper/2607.21517"},"observation_digest":"sha256:9bc25eb234303bf7d19cfec5bdeb4f22b2a61cc7cd428d41c04f8e9d66656b35","observation_id":"3a2ad0a6-936d-4acd-be39-1873e21a7370","resolution":{"observed_at":"2026-08-01T07:17:10.465714Z","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-01T07:17:10.545803Z","title":"Mathemati- cal discoveries from program search with large language models.Nature, 625(7995):468–475, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","snapshot_observed_at":"2026-08-07T23:36:26.301529Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T07:17:10.545803Z"},"links":{"citing_paper":"/paper/2607.21517"},"observation_digest":"sha256:afd7999b414069ca9f9d7fceeebfc77ae8e902b5b7b99993a81ddc338581fad1","observation_id":"367eb8ef-1340-4b78-90ac-c16eb144fcdf","resolution":{"observed_at":"2026-08-01T07:17:10.545803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.23881","last_updated":"2025-05-29T17:45:50Z","snapshot_observed_at":"2026-08-08T16:53:18.849917Z","submitted_at":"2025-05-29T17:45:50Z","title":"Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.23881","snapshot_observed_at":"2026-08-01T07:17:10.629745Z","title":"Using reasoning models to generate search heuristics that solve open instances of combinatorial design problems.arXiv preprint arXiv:2505.23881, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","snapshot_observed_at":"2026-08-07T23:36:26.301529Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T07:17:10.629745Z"},"links":{"cited_paper":"/paper/2505.23881","citing_paper":"/paper/2607.21517"},"observation_digest":"sha256:07776a62ea7015a4749d4e3f6cc9f8b0ebdd72b657031bbddeebe0f0f6a23566","observation_id":"4f218138-a712-4ec1-bb41-59768e675d55","resolution":{"observed_at":"2026-08-01T07:17:10.629745Z","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-01T07:17:10.709694Z","title":"The zero error capacity of a noisy channel.IRE Transac- tions on Information Theory, 2(3):8–19, 1956","venue":null,"work_id":null,"year":1956},"citing_paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","snapshot_observed_at":"2026-08-07T23:36:26.301529Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T07:17:10.709694Z"},"links":{"citing_paper":"/paper/2607.21517"},"observation_digest":"sha256:d963f3bdf56f33e4d2d29467520a1772cb3113e4076dbb18dc8e0ce38fd61d9e","observation_id":"ceafe3e2-042c-429a-9f11-f6bf4adfa218","resolution":{"observed_at":"2026-08-01T07:17:10.709694Z","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-01T07:17:10.769945Z","title":"Improved lower bound on the Shannon capacity of C7.Information processing letters, 81(5):277–282, 2002","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","snapshot_observed_at":"2026-08-07T23:36:26.301529Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T07:17:10.769945Z"},"links":{"citing_paper":"/paper/2607.21517"},"observation_digest":"sha256:cb1ba5cb0c8968c145f7de9222cd46a5f8a2c0c2378e934c9b4ac21f17437190","observation_id":"59c60cd4-b504-4844-a373-c73fe44a4d4d","resolution":{"observed_at":"2026-08-01T07:17:10.769945Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.07932","last_updated":"2025-08-11T12:47:59Z","snapshot_observed_at":"2026-08-05T21:48:24.882293Z","submitted_at":"2025-08-11T12:47:59Z","title":"\\(X\\)-evolve: Solution space evolution powered by large language models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.07932","snapshot_observed_at":"2026-08-01T07:17:10.846036Z","title":"Cycle Code","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","snapshot_observed_at":"2026-08-07T23:36:26.301529Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T07:17:10.846036Z"},"links":{"cited_paper":"/paper/2508.07932","citing_paper":"/paper/2607.21517"},"observation_digest":"sha256:33fe4f33cec27af7c72480835468b137ddab3f25e3c159541ee34fafe8119946","observation_id":"0bf3c529-5ba0-44fb-a133-6046adb07f8c","resolution":{"observed_at":"2026-08-01T07:17:10.846036Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.21517","last_updated":"2026-07-30T17:24:58Z","latest_version":2,"primary_category":"cs.IT","snapshot_observed_at":"2026-08-07T23:36:26.301529Z","submitted_at":"2026-07-23T17:01:36Z","title":"Improved lower bounds for the Shannon capacity of odd cycles"},"reference_resolution":{"displayed":17,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":17},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 1 inbound Pith citation observation for arXiv:2607.21517."}