{"as_of":"2026-08-12T03:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bea3a46dba0c433d90d22ec6db98f35b2caa50b72b58c478a7e046cb9ff8313c","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:51:00.662069Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2501.04032/citation-record","integrity":"/paper/2501.04032/integrity","json":"/paper/2501.04032/citation-record.json","paper":"/paper/2501.04032"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:51:00.961886Z","title":"Kosova, R","venue":null,"work_id":"928d713d-1c4b-41b6-beca-6c99104042ed","year":2023},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.569838Z"},"links":{"citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:2b23ceef58391eeae56a5d9db5aea8e4d2ae84c4d514331c132b25fa6a8bde95","observation_id":"44077270-ae10-469f-955a-b4c365c3c0bd","resolution":{"observed_at":"2026-08-10T22:51:00.966415Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T22:51:00.949533Z","title":null,"venue":null,"work_id":"e67b5f5c-c5a3-4f27-98a6-1c5c59ca98c2","year":2018},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.577757Z"},"links":{"citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:3e8bada3ce5a89508f1f4d9ceae04a449a8797219c01016ca340f95df7d49151","observation_id":"20be9874-8cc8-46a7-845e-15f018e52f90","resolution":{"observed_at":"2026-08-10T22:51:00.953624Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T22:51:00.937127Z","title":"V enkatesulu and C","venue":null,"work_id":"7abbf757-3c79-4ddc-ae66-d54e55dc2746","year":2020},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.583202Z"},"links":{"citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:9d9f0ca34667ac509d207f9e9a03eea8af1dc71fc540fb56a49298c71c3effdc","observation_id":"b1c02e98-ef75-440e-8fb9-6d2b507830e5","resolution":{"observed_at":"2026-08-10T22:51:00.941233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T22:51:00.923928Z","title":null,"venue":null,"work_id":"04a3be59-8419-4249-9c86-02433c1ce6e5","year":2024},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.587635Z"},"links":{"citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:d6825ed3bbacf48c9ea39b8582b7d9830626fc597e0ea07e3f75534b9770f069","observation_id":"346093e0-2de5-44b7-acef-7e26f420207b","resolution":{"observed_at":"2026-08-10T22:51:00.928529Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03276","last_updated":"2024-08-13T14:37:10Z","snapshot_observed_at":"2026-08-11T20:52:15.186263Z","submitted_at":"2024-02-05T18:34:02Z","title":"An approximation of the Collatz map and a lower bound for the average total stopping time","version":3},"cited_work":{"arxiv_id":"2402.03276","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.03276","snapshot_observed_at":"2026-08-10T22:51:00.733235Z","title":"An approximation of the Collatz map and a lower bound for the average total stopping time","venue":"math.DS","work_id":"619c936d-1cca-49aa-9642-a4d29d6b9042","year":2024},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.592584Z"},"links":{"cited_paper":"/paper/2402.03276","citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:a554b14da875aec6f2fbefc335e9fee658a945d60e025b6e4e5d881abfd5c952","observation_id":"c162d5ff-9f52-4b51-89f1-58377a47959c","resolution":{"observed_at":"2026-08-10T22:51:00.737805Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.04777","last_updated":"2024-02-29T17:36:54Z","snapshot_observed_at":"2026-08-06T16:16:19.331457Z","submitted_at":"2024-02-29T17:36:54Z","title":"Specifying and Verifying the Convergence Stairs of the Collatz Program","version":1},"cited_work":{"arxiv_id":"2403.04777","doi":null,"metadata_source":"pith","pith_arxiv_id":"2403.04777","snapshot_observed_at":"2026-08-10T22:51:00.715563Z","title":"Specifying and Verifying the Convergence Stairs of the Collatz Program","venue":"cs.DM","work_id":"cc573c76-d1a1-4678-89ca-b3628f5f12f3","year":2024},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.597715Z"},"links":{"cited_paper":"/paper/2403.04777","citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:b781e6b76735de5ec20b318219e7c9b9e0eeb88ca122dd71f72fcd72184f5f81","observation_id":"846a413f-0622-4e97-aafb-42620b108a57","resolution":{"observed_at":"2026-08-10T22:51:00.721115Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.00073","last_updated":"2022-11-16T16:15:02Z","snapshot_observed_at":"2026-07-06T14:25:20.680537Z","submitted_at":"2022-11-16T16:15:02Z","title":"$3n+3^k$: New Perspective on Collatz Conjecture","version":1},"cited_work":{"arxiv_id":"2212.00073","doi":null,"metadata_source":"pith","pith_arxiv_id":"2212.00073","snapshot_observed_at":"2026-08-10T22:51:00.696635Z","title":"$3n+3^k$: New Perspective on Collatz Conjecture","venue":"math.GM","work_id":"edc2006d-d010-476b-9f5c-32bfa3a518b4","year":2022},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.602929Z"},"links":{"cited_paper":"/paper/2212.00073","citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:db461f482965eae7fd9560b5da9005ce76e66b7d1f58763c19eb628253f8b11f","observation_id":"75d473c2-a92b-4509-96b3-0cad70d17da1","resolution":{"observed_at":"2026-08-10T22:51:00.702725Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T22:51:00.911154Z","title":null,"venue":null,"work_id":"468328ef-a350-440a-8cbd-9989d0592e14","year":2023},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.607622Z"},"links":{"citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:5569d02a340e755e677f5ee335c1c7d29da13a3197ff813722790c202ebf6c8d","observation_id":"89dd4ba9-0672-43cd-8515-17466b093c98","resolution":{"observed_at":"2026-08-10T22:51:00.915086Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T22:51:00.898320Z","title":"Nicola, M","venue":null,"work_id":"cc25cc98-dc45-4680-8f94-dd84d1a1a00e","year":2024},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.612252Z"},"links":{"citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:9e9d7d9f61a1efc0ea567c423e9d740b0befad98da7d66cb23b315eed9fc9374","observation_id":"597f1aac-3998-49cd-81f8-b5bdc521aee8","resolution":{"observed_at":"2026-08-10T22:51:00.902304Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T22:51:00.885804Z","title":"Zhou, ‘‘Proof of the collatz conjecture using logical and probabilistic approaches,’’ Available at SSRN 4903082, 2024","venue":null,"work_id":"4973759b-1d1b-4829-ae82-b98fa0dd6f51","year":2024},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.616579Z"},"links":{"citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:1acf474802b2977158cd84a1f778bf9279f1e196c5fc269517b71791c13ba0f4","observation_id":"3686d666-7b4a-4672-ba64-d10cb54ef4d1","resolution":{"observed_at":"2026-08-10T22:51:00.890358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T22:51:00.874437Z","title":null,"venue":null,"work_id":"bc37467f-1292-42b9-bb80-2c047f4c1e6f","year":2021},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.620545Z"},"links":{"citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:ce31ebcb484f575720a4529c3fdc5544c8a9c1a3ab23b2ce59268e9cacd2983b","observation_id":"3fbd1fa9-dc84-437a-9b2d-b38bfdfebee4","resolution":{"observed_at":"2026-08-10T22:51:00.878762Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T22:51:00.861603Z","title":"Ren and R","venue":null,"work_id":"79cbf710-aa33-45b2-88e8-5bf19056e2e1","year":2019},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.624865Z"},"links":{"citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:c936f09c99183e0af6dc0f33928af7358243c4ad29c5df74e4c9b628fab12888","observation_id":"3efdafb6-5023-4fb1-a718-1040dfdd05ea","resolution":{"observed_at":"2026-08-10T22:51:00.866362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T22:51:00.849918Z","title":null,"venue":null,"work_id":"b676b450-7c92-45d1-a566-4935839e65a8","year":2019},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.628972Z"},"links":{"citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:65aa109387554290ad80e78154ffac1df77c6d98b81fc211fb7b215d9726f575","observation_id":"ea8d1415-8c5c-4aa9-9efe-cf58e2183b15","resolution":{"observed_at":"2026-08-10T22:51:00.853946Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T22:51:00.836699Z","title":"Renza, S","venue":null,"work_id":"2c79b6b4-aad3-4eda-8f65-ac1ce9611ba0","year":2019},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.633365Z"},"links":{"citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:a5ef72aaebd1b9537ceca3d021a74ca2c2202f53c4e533494d6c808f77888910","observation_id":"49fa132e-7b23-4f4e-9240-3ff71a3f37b0","resolution":{"observed_at":"2026-08-10T22:51:00.840842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T22:51:00.825095Z","title":"26, 2019","venue":null,"work_id":"7d4704f6-ba77-4797-8d7e-40c4507e4201","year":2019},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.637276Z"},"links":{"citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:a23ccab34118d240bed641fce90eb079b9ddf6ae39c9a05740edf8139e8b0fb1","observation_id":"1f511e89-5460-490c-98db-7590bf56d601","resolution":{"observed_at":"2026-08-10T22:51:00.829087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T22:51:00.812321Z","title":"Al-Hyari, C","venue":null,"work_id":"1b178354-6868-4d3e-a4c0-4625d87a132a","year":2024},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.641359Z"},"links":{"citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:0a4786591a7f762d27d39f339a54592eb9a7be2f4736edb7f2755f60f89c3771","observation_id":"4159a055-c2d7-4980-b934-47d9aaf1aae7","resolution":{"observed_at":"2026-08-10T22:51:00.817265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T22:51:00.799658Z","title":"Rasool and S","venue":null,"work_id":"6bd7aa6e-af2c-402f-a8fb-9ad7959a4868","year":2023},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.645610Z"},"links":{"citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:9b3c7eaecb41dfadc97dda6bd3d4f085397dd2c9bf564079a712209c0cd8b68f","observation_id":"4dc65819-f23b-4efc-a919-545be8dde376","resolution":{"observed_at":"2026-08-10T22:51:00.803633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T22:51:00.786303Z","title":"Tuncer and H","venue":null,"work_id":"011d36ea-35fe-41d4-acb7-586df817057e","year":2022},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.650024Z"},"links":{"citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:3075dde29f8780f5f291330a583baf7c93b335b26ccdde9172a2f005a302fdfc","observation_id":"90d9c0ae-4ddd-40c5-87a2-65b425707e6d","resolution":{"observed_at":"2026-08-10T22:51:00.790224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T22:51:00.771803Z","title":null,"venue":null,"work_id":"8e7aedeb-0207-4c2a-8474-7a44500e6849","year":2018},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.654340Z"},"links":{"citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:fda1351d015661fda55d846ce7887098809faa1d7043e4ad0b33cacb4da92f91","observation_id":"b1a94562-ef68-4df8-a5e5-0c4436e4166a","resolution":{"observed_at":"2026-08-10T22:51:00.777479Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T22:51:00.759884Z","title":"Baygin, O","venue":null,"work_id":"3c6ae3a8-24f4-40f2-a932-23c8b5dcc085","year":2021},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.658223Z"},"links":{"citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:e403785e4925bcb686e7bc2ba539ce825ec0139bf51042de3a0e3db6ab4414bf","observation_id":"657cb8ba-6020-463e-a96f-a4a2da79263c","resolution":{"observed_at":"2026-08-10T22:51:00.764084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+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-10T22:51:00.746682Z","title":"[Online]","venue":null,"work_id":"da33a1dc-7162-4389-b910-d0fe3d02dd13","year":2024},"citing_paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T22:51:00.662069Z"},"links":{"citing_paper":"/paper/2501.04032"},"observation_digest":"sha256:e2b05f3b9e0e44da3b5df39efc74b3b912683549a80b27d83b2f579a15a71728","observation_id":"67acc7eb-aa91-4bc4-9294-75dc5f68d82b","resolution":{"observed_at":"2026-08-10T22:51:00.750696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.04032","last_updated":"2025-06-30T19:19:37Z","latest_version":2,"primary_category":"cs.MS","snapshot_observed_at":"2026-08-10T22:40:11.141979Z","submitted_at":"2025-01-01T10:52:31Z","title":"Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":6,"verified_exact":3,"verified_fuzzy":12},"total_outbound_references":21},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2501.04032."}