{"as_of":"2026-08-16T05:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7d84d81ab05d70e05736167710fed5648ed32b7db45b784582d9f44a6a2481bc","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-15T06:32:42.880941+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-08-13T21:11:50.238459Z","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:718b251b00edaf1118b94ddd348499b8aa29cc05aed1a7714dfb7adc84ca5974","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-08-13T21:11:50.238459Z","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:f3636ada30d6055315cdbf956aebe97f24db005b99a0e7bdd0b259e5252f8508","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-08-13T21:11:50.238459Z","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:ab3d5e98c0c94bc70f56f6c24a826c6aa7b31a2e552b5da20e20222b7cdbb0f6","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-15T20:41:52.887148Z","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-08-13T21:11:50.238459Z","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:9df6921e9b178d89be79b4388b86c5a6725eebe724f8a23e123f752f8d436217","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-13T21:11:50.238459Z","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:f4e9706144df634230d6e5e03652e5ceaa716841c07182bdf5086e25f2ae9c6e","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-08-13T21:11:50.238459Z","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:225b33f415881765b634378a3c547006a8bcb7a69a2a85a5bc97b72a98d1b15f","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-13T21:11:50.238459Z","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:ef5021bfce3197266bf6e30eaeff5dad9f4f3c776e9e5d2ca49706a5256306c4","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-08-13T21:11:50.238459Z","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:73c2497344983c81ea71355d2bc6e1ad08eba6f125b9bd8ff0f9178b5600094e","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-08-13T21:11:50.238459Z","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:ceeda09857907be80d4a0f389f7697789c57799ba74b0f635d931d36132cd057","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-08-13T21:11:50.238459Z","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:aefe4fbf97a048c6bd86e33c2641ffb6d5ad9db3aba7d730a0c85289ce727d90","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-08-13T21:11:50.238459Z","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:b81f56aae738808bd75c2d11cb77fed774a03cb093a8b5a43a47aec4257e8db7","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-08-13T21:11:50.238459Z","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:3ee92ad5c76741e8da30219c5c0c0c6d0997979bf767f41c29b36fc0a5f938a5","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-08-13T21:11:50.238459Z","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:f9fa66c3f5e30c3b7c5f4d7b8b5875ca11327c7e094df2f628865a333093bca4","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-08-13T21:11:50.238459Z","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:30414a3e591b3b9cd00c020bd4abaafc78e835e8c152d9a98fd2464273ffc001","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-08-13T21:11:50.238459Z","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:180b59325a89622685c78d118271b8eb4879c314c5658c0cc8e732b6a6ba0499","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-08-13T21:11:50.238459Z","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:c859717c5ab8cc48b8893255e432935b762a8537c3a556c53d82444d3f134f14","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-08-13T21:11:50.238459Z","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:8bc9d85638137b526fde13e98c354da9e8bf65e45c422f804bc331dea1747b99","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-08-13T21:11:50.238459Z","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:afc6e313fe713203ec142200a3147d5267c6b6053a4a9215d48c3ad0fd4b990d","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-08-13T21:11:50.238459Z","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:0dca01633a88ffde5fa9c76a5bebef4b0242e2838452584045368c31d9b7f5fd","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-08-13T21:11:50.238459Z","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:c0e6e758269edf58572ed3594316ad80249296b516eb004b5bfbda9a4702ddbe","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-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-08-13T21:11:50.238459Z","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:7ef83396bdc784627531ca12b9dc556603118e661c5305cfed22ed16974a86cc","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-08-13T21:11:50.238459Z","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:40725c2bd4b5a2355954048e9b979b6feb9ef3ef8a7b909a3bdb01b98dd855c1","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-08-13T21:11:50.238459Z","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:c69e35f88cfe7590c9dac52ed1dcfa33b4e1040e85802c7e41ddaa1345b93394","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-08-13T21:11:50.238459Z","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:d4b8a2f1cff4a44ad8715c3f6d3c4b03ced7dab50e8b7def2737fb732073fdfc","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-08-13T21:11:50.238459Z","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:089f6bfab407d558ee5c8505b19880bc705b2cf75bdfaf17c0129ede592a73e2","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-08-13T21:11:50.238459Z","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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 0 inbound Pith citation observations for arXiv:2606.11067."}