{"as_of":"2026-08-13T15:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:162561d148a354fda47bcef3b57a76aecc080a0a7c77109b4848344776d83f9b","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T11:16:40.784491Z","state":"measured"},{"denominator":25,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":25,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.11067/citation-record","integrity":"/paper/2606.11067/integrity","json":"/paper/2606.11067/citation-record.json","paper":"/paper/2606.11067"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T11:16:40.784491Z","title":"Constraint programming systems for modeling music theories and composition","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:f6b15829907f47ad4bb92647f6f80d1847af71194252880db979aa29b69cb092","observation_id":"4fdc5e8d-0e4a-4a6e-80f7-ef21bd5513a0","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","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-06-27T11:16:40.784491Z","title":"Inner Metric Analysis as a measure of rhythmic syncopation, in: 2024 ISMIR 24th Annual International Symposium of Music Information Retrieval, ISMIR, San Franciso, CA, U.S.A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:7649c6c74ea3d901f5298a082aea7dd873e721e08882923190bfdde43f65b4c5","observation_id":"00407ff3-8a88-46ea-95e0-28bb30ad64f0","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","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-06-27T11:16:40.784491Z","title":"Backtrackingsearchheuristicsforsolvingtheall-partitionarrayproblem.,in:The20thInternationalSociety for Music Information Retrieval Conference, ISMIR, Delft, Netherlands","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:4c4db4f23a33d5004520a1c85bf5f77392870b73f88595d522bf8c452222b122","observation_id":"bb16d9ad-ae99-43c6-9a5c-ce14dcdc13de","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.02353","last_updated":"2023-09-05T16:08:49Z","snapshot_observed_at":"2026-08-13T10:19:56.801496Z","submitted_at":"2023-09-05T16:08:49Z","title":"An improvement to the Kelley-Meka bounds on three-term arithmetic progressions","version":1},"cited_work":{"arxiv_id":"2309.02353","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.02353","snapshot_observed_at":"2026-07-08T23:25:42.061087Z","title":"F., Sisask, O., An improvement to the Kelley–Meka bounds on three-term arithmetic progressions, preprint","venue":"math.NT","work_id":"c5b96535-753b-4a6a-832b-579f1d079374","year":2023},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"cited_paper":"/paper/2309.02353","citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:05bc6114c864418bf71902bd0719d5a71d68ac1cd29f442b8bef70621e296f59","observation_id":"ae40112d-b74b-44e7-9c7a-b9193e1d510a","resolution":{"observed_at":"2026-07-03T07:57:45.449491Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-27T11:16:40.784491Z","title":"The Kelley–Meka bounds for sets free of three-term arithmetic progressions","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:4e2082b73b0aac980742bc45af64b257e1277c14dd5cf329d2d765c4cfd1cefb","observation_id":"b958c4bf-f51c-4a1e-88cc-778662524981","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","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":"2512.07336","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T07:57:45.444812Z","title":"Multiple Mertens theorems for arithmetic progressions.arXiv:2512.07336","venue":null,"work_id":"62f1716b-fbe8-497a-ad8e-ba5b3aa1838e","year":2025},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:76625bc38496d22a118894240b9f0c1c2f18393ad05e577c04ab63281b3d30cd","observation_id":"1d5139af-18aa-47c6-b26d-fd894536bc6a","resolution":{"observed_at":"2026-07-03T07:57:45.446428Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-27T11:16:40.784491Z","title":"Dance music classification using Inner Metric Analysis, in: Golden, B., Raghavan, S., Wasil, E","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:0e9913ee037dedc47e6ff22ed834d6b65fc7f47c6cd6701d849017f97fd13a6a","observation_id":"37aa3623-2796-461d-8226-286221b6c3eb","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","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-06-27T11:16:40.784491Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:fa09d9e5cf7178a1968335687df9da4288fea467333df6c2829ca7ca64d13777","observation_id":"4c611c10-3e12-420a-a8eb-8c6b2030f8d9","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","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-06-27T11:16:40.784491Z","title":"Finding longest arithmetic progressions","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:36233f14ef97ac2d8077d34622b6a73423431d3afde02cefc31090746c7207b9","observation_id":"33380fde-38d4-4005-9713-dd2d46d0b807","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","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-06-27T11:16:40.784491Z","title":"Arithmetic progressions at the journal of the LMS","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:7a498e15a61cb6751328f51880b6cd847ca8bcf297f695c6bcdecc096839665c","observation_id":"d7520f71-084d-4c78-83e6-ada557035e6a","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","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-06-27T11:16:40.784491Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:eed95c1e03d4d9cdb8746ae615cab73cf8e17fe4f09503a7d3d7341130bc73db","observation_id":"baefffa3-d891-4344-86bf-2d35b1861a8b","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","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-06-27T11:16:40.784491Z","title":"A linear sieve algorithm for finding prime numbers","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:0262a60d8ed9c07a423fd6e5f34dc060053976f38fc560da0047fe63c5c09732","observation_id":"15efad97-7d8f-4e68-8d29-a4d05120a1fd","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","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-06-27T11:16:40.784491Z","title":"AnIntroductiontotheTheoryofNumbers","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:a031cf17af75ef1cbd1766d92e1b3fea6eb3ff7bbf1849fb0d68f0b496cb0051","observation_id":"4eca8233-67ea-4a4a-8aba-1be9b1e594cb","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","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-06-27T11:16:40.784491Z","title":"On the normal number of prime factors of a number n","venue":null,"work_id":null,"year":1917},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:a53a98c4a9b2dcba216be7b157a58cdf70237f15ed3c5202989b9907d9a1c134","observation_id":"38aa7058-4994-4831-a054-e4086ac40e0c","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","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-06-27T11:16:40.784491Z","title":"Aclassicalintroductiontomodernnumbertheory.volume84","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:b6eb25165691c6945a09353786e56ac13ee7bee3059f44e1fd8f36648ca9ff22","observation_id":"a29224db-b480-447f-8f04-b785583ce51c","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","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-06-27T11:16:40.784491Z","title":"Strong bounds for 3-progressions, in: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), IEEE, Santa Cruz, CA, U.S.A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:cd5c5182135674d989f0d04b672298e9c416f590c108d4b8e07982a5c1d7cb09","observation_id":"882e8c7e-b86c-431b-a1c3-6e2c67348ab9","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","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-06-27T11:16:40.784491Z","title":"Corpus-based rhythmic pattern analysis of ragtime syncopation, in: Proceedings of the 16th International Society for Music Information Retrieval Conference, ISMIR, Málaga, Spain","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:10d09ab28aa0c81e7c32b96c5fcba2b294ed4c44b6db386fb519121e08131229","observation_id":"93ee0dc1-ad38-462a-a5bf-b9eaf780057b","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","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-06-27T11:16:40.784491Z","title":"Imacpp.https://github.com/pvankranenburg/imacpp","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:3aed80f48c73b6cc84666a700f6ba22f906b050959b974919812066b199e01be","observation_id":"28015f20-3305-403f-9b18-5dbed3bc59c6","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","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-06-27T11:16:40.784491Z","title":"Inner Metric Analysis","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:d8d4aa9c785a9b4f6cd1d0efe7a284ba2009cbb4384983bc7a4b9183a856863f","observation_id":"9a9bc657-579a-45d5-9ceb-301e4c971506","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4153/cmb-1983-078-5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Majorations explicites pour le nombre de diviseurs de n","venue":"Canadian Mathematical Bulletin","work_id":"2ee06cff-4caa-4bb7-9bc4-abec15c0bbd1","year":1983},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:800c9842d7663ae9a2bc08838316996af4cc39c191ab388d5a2a482c21304633","observation_id":"20c1f395-364c-4e39-b297-463c495dd3e8","resolution":{"observed_at":"2026-06-27T11:20:52.628340Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-06-27T11:16:40.784491Z","title":"Linear prime-number sieves: A family tree","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:f86a9cc510d96c1388a8cebc0c0a0f73b1a243500a54fcf5e984e1fcb370e3ee","observation_id":"7600d095-a27b-4518-9702-07f6fd6f1b08","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","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-06-27T11:16:40.784491Z","title":"Applied combinatorics, in: Applied Combinatorics, Second Edition","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:b0251a79b720b13a2bed989e5037a4dcf5dccc815b893dc3962f2700fa341f36","observation_id":"b72635f0-c622-49fd-b235-d55fa074476b","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","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-06-27T11:16:40.784491Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:4d30d789d520dc083a31c49456eaaa3c344118b4c76427e13e452ab992d08658","observation_id":"f1a418f7-1b2d-4e3b-a7e4-0d387147eefa","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","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-06-27T11:16:40.784491Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:7bf828c59392797175facb58824a9d2b789ebac0f24b6c420c380d2e62f087d9","observation_id":"2c2c296a-7e2e-4b0d-8119-940f834f32bd","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","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-06-27T11:16:40.784491Z","title":"The study of syncopation using Inner Metric Analysis: Linking theoretical and experimental analysis of metre in music","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-27T11:16:40.784491Z"},"links":{"citing_paper":"/paper/2606.11067"},"observation_digest":"sha256:4c61050bb2fea6f36fd0c396a2c4e90290ab35cb946c674139d628bfc279877e","observation_id":"f6c0bf72-3578-4aa2-b334-8167c92a4b80","resolution":{"observed_at":"2026-06-27T11:16:40.784491Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.11067","last_updated":"2026-06-09T16:30:26Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-07-06T23:50:11.160843Z","submitted_at":"2026-06-09T16:30:26Z","title":"Enumerating Inclusion-Maximal Arithmetic Progressions"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":25},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2606.11067."}