{"as_of":"2026-08-06T12:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aed70336cf6ee343a903a00debba38361a6b363e8dde7e129467668688078f10","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-11T11:50:26.030339Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+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/2607.00536/citation-record","integrity":"/paper/2607.00536/integrity","json":"/paper/2607.00536/citation-record.json","paper":"/paper/2607.00536"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T07:52:02.335338Z","title":"Min-cost bipartite perfect match- ing with delays","venue":null,"work_id":"8c7974d0-ffac-4798-839a-5adbb4fd6680","year":2017},"citing_paper":{"arxiv_id":"2607.00536","last_updated":"2026-07-01T07:25:14Z","snapshot_observed_at":"2026-08-02T06:50:34.758386Z","submitted_at":"2026-07-01T07:25:14Z","title":"Online Matching with Size-Based and Convex Delays","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-02T04:37:15.042623Z"},"links":{"citing_paper":"/paper/2607.00536"},"observation_digest":"sha256:c827fd63be2024af40c71ca230cd2285f8685191fe604fbfe4270e3843b0f710","observation_id":"3ce6ef57-350f-432d-8650-07af021b2174","resolution":{"observed_at":"2026-07-06T07:52:02.336871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.approx-random.2017.1","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"2 Yossi Azar, Ashish Chiplunkar, and Haim Kaplan","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"b4b8851c-e186-46f6-97ab-2a29e935fe40","year":2017},"citing_paper":{"arxiv_id":"2607.00536","last_updated":"2026-07-01T07:25:14Z","snapshot_observed_at":"2026-08-02T06:50:34.758386Z","submitted_at":"2026-07-01T07:25:14Z","title":"Online Matching with Size-Based and Convex Delays","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-02T04:37:15.042623Z"},"links":{"citing_paper":"/paper/2607.00536"},"observation_digest":"sha256:ba4734028f118aac27bd51a24e0d9477849bdbe176da12d71777de97131ed8e3","observation_id":"4c0bfdf2-4613-408c-9d3f-550678fc1533","resolution":{"observed_at":"2026-07-02T04:46:37.683645Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611974782.67","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"3 Yossi Azar, Ashish Chiplunkar, Shay Kutten, and Noam Touitou","venue":null,"work_id":"533a3594-5e8c-493e-b9be-5bb24d09222d","year":2020},"citing_paper":{"arxiv_id":"2607.00536","last_updated":"2026-07-01T07:25:14Z","snapshot_observed_at":"2026-08-02T06:50:34.758386Z","submitted_at":"2026-07-01T07:25:14Z","title":"Online Matching with Size-Based and Convex Delays","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-02T04:37:15.042623Z"},"links":{"citing_paper":"/paper/2607.00536"},"observation_digest":"sha256:776da3326565802d69e97ba902d7b14307cdfd3dc6ce8c2cc2cd3e84735602fe","observation_id":"4a42afb0-2ca9-4790-9ac4-8ded9f5f2640","resolution":{"observed_at":"2026-07-02T04:46:37.697716Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.esa.2020.8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"2c8c5f14-c7b9-47e7-bd80-9ab1f949b903","year":2020},"citing_paper":{"arxiv_id":"2607.00536","last_updated":"2026-07-01T07:25:14Z","snapshot_observed_at":"2026-08-02T06:50:34.758386Z","submitted_at":"2026-07-01T07:25:14Z","title":"Online Matching with Size-Based and Convex Delays","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-02T04:37:15.042623Z"},"links":{"citing_paper":"/paper/2607.00536"},"observation_digest":"sha256:917d240fc07882bb355e8c4500cb5bc2c21dc6bed78ad1b7198265b34314a584","observation_id":"f75d177d-f93f-4950-8a56-1860ee4c93ca","resolution":{"observed_at":"2026-07-02T04:46:37.695638Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s00224-019-09963-7","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"5 Yossi Azar, Runtian Ren, and Danny Vainstein","venue":"Theory of Computing Systems","work_id":"97ec5239-3f98-42fd-88ae-45760d82fd97","year":2021},"citing_paper":{"arxiv_id":"2607.00536","last_updated":"2026-07-01T07:25:14Z","snapshot_observed_at":"2026-08-02T06:50:34.758386Z","submitted_at":"2026-07-01T07:25:14Z","title":"Online Matching with Size-Based and Convex Delays","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-02T04:37:15.042623Z"},"links":{"citing_paper":"/paper/2607.00536"},"observation_digest":"sha256:bd21a642b0344a5dc8c9307728879886d8032a0cea55f2da0d88b676c4bd170d","observation_id":"747f36a7-6ec7-45eb-af3b-8851353f6833","resolution":{"observed_at":"2026-07-02T04:46:37.691322Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/2783434","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"7 Sujoy Bhore, Michał Pawłowski, and Seeun William Umboh","venue":"Journal of the ACM","work_id":"72592d76-ea16-4c9f-8b0b-1af1f01baaad","year":null},"citing_paper":{"arxiv_id":"2607.00536","last_updated":"2026-07-01T07:25:14Z","snapshot_observed_at":"2026-08-02T06:50:34.758386Z","submitted_at":"2026-07-01T07:25:14Z","title":"Online Matching with Size-Based and Convex Delays","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-02T04:37:15.042623Z"},"links":{"citing_paper":"/paper/2607.00536"},"observation_digest":"sha256:60d7d4804d58a9f445d78e882bca67c74196724340787513e976a15d39499935","observation_id":"3a5eeac8-f258-4ead-bc54-2fbcebd8a632","resolution":{"observed_at":"2026-07-02T04:46:37.693600Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.13428","last_updated":"2026-07-14T05:01:43Z","snapshot_observed_at":"2026-08-03T11:02:45.439072Z","submitted_at":"2026-04-15T02:56:51Z","title":"Online TCP Acknowledgment under General Delays","version":2},"cited_work":{"arxiv_id":"2604.13428","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.13428","snapshot_observed_at":"2026-07-02T04:46:37.676646Z","title":"Online TCP Acknowledgment under General Delays","venue":"cs.DS","work_id":"a3d76a53-4559-4564-b910-fd768a587cd1","year":2026},"citing_paper":{"arxiv_id":"2607.00536","last_updated":"2026-07-01T07:25:14Z","snapshot_observed_at":"2026-08-02T06:50:34.758386Z","submitted_at":"2026-07-01T07:25:14Z","title":"Online Matching with Size-Based and Convex Delays","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-11T11:50:26.030339Z"},"links":{"cited_paper":"/paper/2604.13428","citing_paper":"/paper/2607.00536"},"observation_digest":"sha256:9464652de649fe26937394513cb222db02af459232fd9cfce0e947ed68d34683","observation_id":"c869b2b2-ca15-4e32-9818-05975916b8cc","resolution":{"observed_at":"2026-07-02T04:46:37.681332Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8395.28435","doi":"10.1145/28395.28435","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Saks , editor =","venue":null,"work_id":"2b14b5d5-1aac-4ab7-9024-973c0ce31d55","year":1987},"citing_paper":{"arxiv_id":"2607.00536","last_updated":"2026-07-01T07:25:14Z","snapshot_observed_at":"2026-08-02T06:50:34.758386Z","submitted_at":"2026-07-01T07:25:14Z","title":"Online Matching with Size-Based and Convex Delays","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-02T04:37:15.042623Z"},"links":{"citing_paper":"/paper/2607.00536"},"observation_digest":"sha256:85b5d49ddd31baa0d5e3df3a56152d6e90552283b099ba75aa23728fabe7cd59","observation_id":"6391d259-371a-47bf-af9c-00ea365680bf","resolution":{"observed_at":"2026-07-02T04:46:37.675286Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/19m1237879","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Metrical Task Systems on Trees via Mirror Descent and Unfair Gluing , journal =","venue":"SIAM Journal on Computing","work_id":"dd150f80-d061-4067-ae52-e796cda56a5a","year":2021},"citing_paper":{"arxiv_id":"2607.00536","last_updated":"2026-07-01T07:25:14Z","snapshot_observed_at":"2026-08-02T06:50:34.758386Z","submitted_at":"2026-07-01T07:25:14Z","title":"Online Matching with Size-Based and Convex Delays","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-02T04:37:15.042623Z"},"links":{"citing_paper":"/paper/2607.00536"},"observation_digest":"sha256:c20ed21a21d81facc680c1baed588a0f148833ff85bd90358a6b631feb011670","observation_id":"bfcb5019-1bf3-4bd3-826f-ef83318098d8","resolution":{"observed_at":"2026-07-02T04:46:37.706940Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"In 32nd European Conference on Object-Oriented Programming (ECOOP 2018)","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","work_id":"74c3329f-8204-4fce-a337-6f66b116862f","year":2021},"citing_paper":{"arxiv_id":"2607.00536","last_updated":"2026-07-01T07:25:14Z","snapshot_observed_at":"2026-08-02T06:50:34.758386Z","submitted_at":"2026-07-01T07:25:14Z","title":"Online Matching with Size-Based and Convex Delays","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-02T04:37:15.042623Z"},"links":{"citing_paper":"/paper/2607.00536"},"observation_digest":"sha256:a415e0ace470ef2cc9f7871736669e8edbc9bf2bcc709ba7ef636df3577cb7a5","observation_id":"21deec35-f687-4d8b-b413-82f545c70187","resolution":{"observed_at":"2026-07-02T04:46:37.699660Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.approx/random","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T04:46:37.684325Z","title":"2023.17,doi:10.4230/LIPICS.APPROX/RANDOM.2023.17","venue":null,"work_id":"3599c4f3-974d-420d-a32b-f9618dcd6f07","year":2023},"citing_paper":{"arxiv_id":"2607.00536","last_updated":"2026-07-01T07:25:14Z","snapshot_observed_at":"2026-08-02T06:50:34.758386Z","submitted_at":"2026-07-01T07:25:14Z","title":"Online Matching with Size-Based and Convex Delays","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-02T04:37:15.042623Z"},"links":{"citing_paper":"/paper/2607.00536"},"observation_digest":"sha256:99016c488a7d09a10a3854b73049a5dbc38050c433ee94ec00e79774de079249","observation_id":"b2c5e655-dacf-45c0-a364-bae0e1feadfd","resolution":{"observed_at":"2026-07-02T04:46:37.685774Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2021.100647","doi":"10.1016/j.disopt.2021.100647","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DISOPT.2021.100647","venue":"Discrete Optimization","work_id":"5374391a-d064-4a59-9ab4-dd70b09d17a1","year":2021},"citing_paper":{"arxiv_id":"2607.00536","last_updated":"2026-07-01T07:25:14Z","snapshot_observed_at":"2026-08-02T06:50:34.758386Z","submitted_at":"2026-07-01T07:25:14Z","title":"Online Matching with Size-Based and Convex Delays","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-02T04:37:15.042623Z"},"links":{"citing_paper":"/paper/2607.00536"},"observation_digest":"sha256:eea3698b7ada6d8133b9a981c8a68602a61720ef9e8c106bc416d268c4486c48","observation_id":"9b090735-c0d4-4395-9d44-e06b6191208a","resolution":{"observed_at":"2026-07-02T04:46:37.702485Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.approx/random.2024.12","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"19 Ngoc Mai Le, Seeun William Umboh, and Ningyuan Xie","venue":"arXiv (Cornell University)","work_id":"6efa8baf-f3e5-4d81-9f44-5d6b6b63244e","year":2024},"citing_paper":{"arxiv_id":"2607.00536","last_updated":"2026-07-01T07:25:14Z","snapshot_observed_at":"2026-08-02T06:50:34.758386Z","submitted_at":"2026-07-01T07:25:14Z","title":"Online Matching with Size-Based and Convex Delays","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-02T04:37:15.042623Z"},"links":{"citing_paper":"/paper/2607.00536"},"observation_digest":"sha256:7fbe70d4e339e7da328d5df8dff88d0927b1d0fa043c0bb90077591989fcca7a","observation_id":"2c19f1a0-ff01-4bc8-9afc-ea1071c22adf","resolution":{"observed_at":"2026-07-02T04:46:37.704811Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611977554.ch59","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"20 Xingwu Liu, Zhida Pan, Yuyi Wang, and Roger Wattenhofer","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"6a57ebae-40f7-4813-a3bb-ae061a54f59c","year":2018},"citing_paper":{"arxiv_id":"2607.00536","last_updated":"2026-07-01T07:25:14Z","snapshot_observed_at":"2026-08-02T06:50:34.758386Z","submitted_at":"2026-07-01T07:25:14Z","title":"Online Matching with Size-Based and Convex Delays","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-02T04:37:15.042623Z"},"links":{"citing_paper":"/paper/2607.00536"},"observation_digest":"sha256:591e41845c45e899178ea26de0c789eb1f50b7c93f413c3eef5d4a44e6cf3093","observation_id":"238d4f66-feb6-4661-beb2-2b087ef835e7","resolution":{"observed_at":"2026-07-02T04:46:37.709138Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.isaac.2018.62","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"arXiv (Cornell University)","work_id":"6d0dde9c-7c3b-4b79-8935-cff06602efb7","year":2018},"citing_paper":{"arxiv_id":"2607.00536","last_updated":"2026-07-01T07:25:14Z","snapshot_observed_at":"2026-08-02T06:50:34.758386Z","submitted_at":"2026-07-01T07:25:14Z","title":"Online Matching with Size-Based and Convex Delays","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-02T04:37:15.042623Z"},"links":{"citing_paper":"/paper/2607.00536"},"observation_digest":"sha256:a58f6868a807c1a3eac2e224451e7bf0d13e10c90fa5ee06a0a8c86ac0c28be1","observation_id":"3c910574-325a-4352-b6a0-1dbd98fa63a8","resolution":{"observed_at":"2026-07-02T04:46:37.711191Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.00536","last_updated":"2026-07-01T07:25:14Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-02T06:50:34.758386Z","submitted_at":"2026-07-01T07:25:14Z","title":"Online Matching with Size-Based and Convex Delays"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":2,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":0,"verified_exact":9,"verified_fuzzy":1},"total_outbound_references":15},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2607.00536."}