{"as_of":"2026-08-17T09:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3ccd538e5139854ee3c066e25ebefa9707f1622852225db23d762940666fa1b1","coverage":[{"denominator":50,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":50,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:50:13.686881Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/1908.03080/citation-record","integrity":"/paper/1908.03080/integrity","json":"/paper/1908.03080/citation-record.json","paper":"/paper/1908.03080"},"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-14T14:50:14.130997Z","title":null,"venue":null,"work_id":"6f2ef006-1aa5-4e6c-bcc1-b8ba92225253","year":2012},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.536518Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:afcbfbc0093e0ebc46bc0be3007af873069b2362c497658fa5db09494ea6a74f","observation_id":"e0b58236-94dd-4ad9-b21c-c46efc704001","resolution":{"observed_at":"2026-08-14T14:50:14.134473Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:14.180065Z","title":"import capacity","venue":null,"work_id":"574bfc23-1875-42b7-80a9-bf7f341c3806","year":1957},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.514406Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:84f7e467a04acc97e9921c195efe96c42f15ba14176bcd9e33fa1a00b33a0764","observation_id":"5c7711c3-7562-497e-8b95-b783256979cc","resolution":{"observed_at":"2026-08-14T14:50:14.183302Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:14.170526Z","title":"approximated","venue":null,"work_id":"7d628aee-2ce4-4fbc-9e29-2d82771d897e","year":null},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.519488Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:2c8d0bce983243a4a4719c11453c4691cf2cd66aec0d324425336cbfc3e5f19c","observation_id":"46cc7c72-dab6-450d-820d-c8b2c9803250","resolution":{"observed_at":"2026-08-14T14:50:14.173939Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:14.160822Z","title":"In this section, we extend our results to a more general framework where for eachn∈ [N],Xn is an arbitrary polyhedron, instead of having the particular structure given in (2.2)","venue":null,"work_id":"5d4f7da5-6452-4afb-969c-4c914ee73070","year":null},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.524279Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:dea50b9584cd026ea5a897f1ee1a7c5a6864b1a216ab49099fc14ebef774f2da","observation_id":"500378bb-6713-4b3a-a048-c4b42f82aa27","resolution":{"observed_at":"2026-08-14T14:50:14.164639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:14.150871Z","title":null,"venue":null,"work_id":"5d50bbdd-f379-4d84-99fe-2021fd6291ea","year":null},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.528483Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:9a1c7e298483ee71a819282038bb491e0e02497fd11651693d33e1be0467d4ca","observation_id":"23799dc8-ae0a-4c78-bb0d-70e006cd74e8","resolution":{"observed_at":"2026-08-14T14:50:14.154458Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:14.141135Z","title":null,"venue":null,"work_id":"0ee5381f-bf80-4334-bc97-bfea6ec648b1","year":null},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.532370Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:9fda1ff1d53c13244a72b3b74285d6772636ea9ea180d96fe350a5e9ab75e1e2","observation_id":"0da6f9cd-f58a-4653-b98c-b0379a1ccbed","resolution":{"observed_at":"2026-08-14T14:50:14.144459Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:14.121349Z","title":null,"venue":null,"work_id":"7d464055-64e6-4ba0-bdd7-e477c8b6dd26","year":1979},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.540598Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:92d80d3ee599c3415bf8d96b161fcbab688a215d97931d3282cce1b55aa7b759","observation_id":"4acdae82-6e1d-4029-b7a5-5c968e1cecae","resolution":{"observed_at":"2026-08-14T14:50:14.124892Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:14.111572Z","title":null,"venue":null,"work_id":"78d2c909-4945-4b34-a8a9-082e19d5cf5d","year":2018},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.544285Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:9d5fa6e2ac52dd3b43f52b7eb5239a1fe1112940c50998bab956b84c3c6323a6","observation_id":"96529b6f-935d-4cef-bb07-c20009d26f96","resolution":{"observed_at":"2026-08-14T14:50:14.115095Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:14.101376Z","title":"Atallah, M","venue":null,"work_id":"d121a204-de3c-4361-ae88-7f557d185075","year":2004},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.547726Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:6f424e05399fef8119d1a99498a0402842b431b723f45c502bfea2c35273df2b","observation_id":"3d41178f-e454-45c1-9f89-c9a625d0dbd2","resolution":{"observed_at":"2026-08-14T14:50:14.104591Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:14.091168Z","title":null,"venue":null,"work_id":"2af04466-82c1-45f7-af99-a61c63453826","year":1993},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.551104Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:048c0801958834fac8a040c133068ac286932d2deb6e43d208acf2c2ee3ba16e","observation_id":"2d89900a-9deb-40f1-afd0-e55a38b78980","resolution":{"observed_at":"2026-08-14T14:50:14.094688Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:14.080460Z","title":null,"venue":null,"work_id":"16ea5b09-af1f-48ed-9add-5a5f2fb23ab7","year":1994},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.554732Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:f444266352328d22bfbee83a840bdc2762566c43fc37d579754418bf4d04e5d5","observation_id":"b4471d24-d1f4-4ee4-b067-859ac7c40896","resolution":{"observed_at":"2026-08-14T14:50:14.084950Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:14.071391Z","title":null,"venue":null,"work_id":"90f3f68f-70af-418c-92c5-3097daf76199","year":2015},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.558202Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:850d4a67f7b382fe845b7474f98c3650e98668f805303ba7cb22beeb4a471106","observation_id":"dfd3664d-5549-44a0-bc9b-21f931bd3ca5","resolution":{"observed_at":"2026-08-14T14:50:14.074692Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:14.061746Z","title":null,"venue":null,"work_id":"5855f58b-2294-4917-bcc9-6d58e87caa7a","year":1962},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.561858Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:688b85dc194a1c4044814411e611f8a67d49bc05919a97c1a0aaf493679969ef","observation_id":"dbb70d3d-560a-482e-8927-1cf39a42c6e5","resolution":{"observed_at":"2026-08-14T14:50:14.065089Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-08-14T14:50:13.565383Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.565383Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:8358a99f42ff957b241c1d83caccfa138d3f3c0f64570755ed88f2a08dfb54ce","observation_id":"29559b13-4c5d-4208-b2fd-58274f0f10ac","resolution":{"observed_at":"2026-08-14T14:50:13.565383Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:50:14.046986Z","title":null,"venue":null,"work_id":"5abf2a81-c291-4361-be73-0f542077e9e1","year":1989},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.568904Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:e76956fdf0423aad15dc7ff0d9beda93550b2b27a97703be0bed7dbd4b915dab","observation_id":"353b24d5-9d11-407f-8023-34705b7c93cb","resolution":{"observed_at":"2026-08-14T14:50:14.050139Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:14.037429Z","title":null,"venue":null,"work_id":"8ac5e15c-3960-4f7d-9fc3-617d5966dca1","year":1972},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.572146Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:6245948b8d8d79b988436649551734edd33c8e7153b3218e42c1e6a1bdd1fc2d","observation_id":"f234dbf7-a0aa-4ab4-908a-30897f824b68","resolution":{"observed_at":"2026-08-14T14:50:14.040963Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:14.028731Z","title":null,"venue":null,"work_id":"527555dc-3e86-46dd-91aa-5d6bababdcbe","year":2014},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.575486Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:a63474550035fb23e6f8c80299b1605d72537c94896455bd7b0e8da8ce9e48a6","observation_id":"fdf17a59-e927-4e05-91d6-96e3147743d1","resolution":{"observed_at":"2026-08-14T14:50:14.031935Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:14.018669Z","title":"Clifton, M","venue":null,"work_id":"5f64e961-58bf-4c94-a1d6-35be21d08019","year":2002},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.578726Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:e506fbe0c208a6ed06df2f1788f81a5bcb07fa1b3206175db17983399c587f33","observation_id":"f95d660d-560c-4670-9791-3cc2a6605656","resolution":{"observed_at":"2026-08-14T14:50:14.022576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:14.009424Z","title":"Cohen and D","venue":null,"work_id":"f5429e0e-76c2-4211-aec5-54f75d3790ed","year":1984},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.581727Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:11aab15ca2b32ac313dc1a023b240b71318ffc5594ef6cd588fe16efeb8af088","observation_id":"21b0a756-0fbd-43df-84d6-51764c7c37ed","resolution":{"observed_at":"2026-08-14T14:50:14.012579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:14.000397Z","title":null,"venue":null,"work_id":"6dfddc70-89b3-4491-896d-40a8db00f8b6","year":2009},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.585958Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:6449b5d29c2dec78141ee3f8f3d6693bf1ac2db7d39a0771b249f622cee6e4c7","observation_id":"88eaf5ac-3117-42a8-8954-fd564682511f","resolution":{"observed_at":"2026-08-14T14:50:14.003776Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.992144Z","title":"Deng, M.-J","venue":null,"work_id":"3a229070-98c7-477e-9510-14a087302d0f","year":2017},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.589354Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:00e7b939a5cad6079b6efbcf1446a44e10de5229122dd17c70f6ee4b16c6840e","observation_id":"a0fa2d65-d5b0-4209-b91a-1b833dd3ed03","resolution":{"observed_at":"2026-08-14T14:50:13.995267Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.983101Z","title":null,"venue":null,"work_id":"0c0fae04-8916-493b-a4f6-0e41b44705b6","year":1983},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.592413Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:3df6887c33f7ca60b0082612d5d7fee27ce4d548469f8a04861d236bca497612","observation_id":"39c84795-d2bf-4148-92cd-0ed8f2ae1833","resolution":{"observed_at":"2026-08-14T14:50:13.986217Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.972093Z","title":"Glowinski and A","venue":null,"work_id":"476cfb7d-b988-48d4-9a26-c9c70c0453e5","year":1975},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.595656Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:bb6fa60ed8eb5a3ca27c383f5fa9128fd5b6864a7de5a3cc62cc3394c12e819a","observation_id":"68836542-95f2-4e59-b265-ae9c3b6523ff","resolution":{"observed_at":"2026-08-14T14:50:13.976235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.962823Z","title":"Goldreich, S","venue":null,"work_id":"ab8b787d-ea28-4efe-bdaa-1a55f8600adb","year":1987},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.599606Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:c47b130cf35cf63e64cf52fd306b2e18d78d18edca930666e6958f8954e029b2","observation_id":"0ec2fa43-3c5f-46be-8eec-7d80266b6a28","resolution":{"observed_at":"2026-08-14T14:50:13.966454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.953459Z","title":"Gubin, B","venue":null,"work_id":"35847227-27a3-49a8-861e-dd9034e6c3d7","year":1967},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.602793Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:1dfc09a8e96dfd6d2c138b60447d63ddca3d6fe1f15849abc08edbb7810271ba","observation_id":"73c345bc-78df-4266-a8d5-e16ba15b6e43","resolution":{"observed_at":"2026-08-14T14:50:13.956763Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.944694Z","title":null,"venue":null,"work_id":"43797715-32a7-47d2-bd5a-190ab6690f37","year":2019},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.606718Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:e5609329c0229b06f5fee1028c853c82316cc95e3d532d2efcdd9fdd5b13a099","observation_id":"44e033f2-b600-4fbf-a8b9-4d3d620f5b18","resolution":{"observed_at":"2026-08-14T14:50:13.947908Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.935155Z","title":null,"venue":null,"work_id":"6d1d906e-8ce0-44cf-9a77-035e406ba2ba","year":1960},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.610089Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:560982588e5f3ae58aa098f6701a553041d61dbb894481bbd8529361d736f3df","observation_id":"f226b5f5-cc35-42c2-8aa5-6961da8f3635","resolution":{"observed_at":"2026-08-14T14:50:13.938612Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.925854Z","title":null,"venue":null,"work_id":"f2af39f2-94b7-4345-a073-15b38bfb9273","year":2005},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.613774Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:508c0cf2dbbdc5d3c373daba13f6f9a697851024a718a09bffe04abb7ff8b21d","observation_id":"52f6eaf9-f20d-40c0-a31b-1e4be6dcb493","resolution":{"observed_at":"2026-08-14T14:50:13.929584Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.917409Z","title":"Jacquot, O","venue":null,"work_id":"75823806-f810-467b-8b8c-5a9b99dea13d","year":2019},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.617009Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:4ee586d62df8c5fe547ab2653803bf4cd98cbfa63ef29d07eafaff1224cbe9ad","observation_id":"1b826ca3-c917-4c67-8fed-d3f5fe73436e","resolution":{"observed_at":"2026-08-14T14:50:13.920639Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.908599Z","title":"Jacquot, O","venue":null,"work_id":"777aa2a1-3d97-43cd-b885-8e455845915b","year":2019},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.620407Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:4f9524543bae11c6ed8eb7b61447627f7a2567399c66da5e0ae0aff8b6a26ba0","observation_id":"124a3edd-7a2e-4478-9889-e3054d5bafdf","resolution":{"observed_at":"2026-08-14T14:50:13.911700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.898178Z","title":"Jagannathan, K","venue":null,"work_id":"9b073ca4-eaca-4afc-970a-97976bd1e8c9","year":2006},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.623615Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:739cab63dcbe0ac0786fb9a0e39b41823349ee9b25e89950b41a12c7a33c81d0","observation_id":"ae85fa1f-7bfe-4fdc-add3-c334469f85f3","resolution":{"observed_at":"2026-08-14T14:50:13.902073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.889357Z","title":"Katiraei, R","venue":null,"work_id":"4fc238c8-5dcc-473c-9fdb-3cb282f917e6","year":2008},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.626905Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:f1e9b8e988f97f5991edab814ad7e434c960298a0a35d6490a323733addb8cf9","observation_id":"88c70b8a-3f94-405b-95de-8d22ed12aa6a","resolution":{"observed_at":"2026-08-14T14:50:13.892667Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.880697Z","title":null,"venue":null,"work_id":"44709fde-c888-4ca3-915b-0c9a8b9a4e44","year":1995},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.630211Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:e9cc5c343971d6c197492a42d208ff8747a7732f1f4c418e819cbc9158fd1624","observation_id":"ee233b08-abab-439d-9414-4b7bc7a5091c","resolution":{"observed_at":"2026-08-14T14:50:13.883600Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.871764Z","title":"Lemaréchal, A","venue":null,"work_id":"2e87ce99-325f-44a2-a10f-359771f513ed","year":1995},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.633465Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:fdcc06383580f49e12970b83e49b7bd569b04005f5d66e39014221fca9263edb","observation_id":"1c8d072a-2660-4188-b765-cf10c907d446","resolution":{"observed_at":"2026-08-14T14:50:13.875112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.862547Z","title":null,"venue":null,"work_id":"e006707f-dc5c-40e9-a618-ff6e2d43514f","year":1982},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.636585Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:293a576af5f49eb811934bdd35c3041452383e1536a20c64ab265e3e559b866d","observation_id":"e61047e9-45c9-47f7-8c5c-49d6f3273661","resolution":{"observed_at":"2026-08-14T14:50:13.865641Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.853486Z","title":null,"venue":null,"work_id":"a69cb6b1-bc2b-40e1-a208-66cf81d60bd3","year":2017},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.640067Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:fce90531c74e4c6dd5bf5205122eb4b1fc99b94a6dae1256d5df858f8bf7f312","observation_id":"90e84a46-c02c-4996-959f-2c4b477f72fe","resolution":{"observed_at":"2026-08-14T14:50:13.856794Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.844074Z","title":"Munkres, Algorithms for the assignment and transportation problems, SIAM J","venue":null,"work_id":"7be8d1cb-0493-4a01-b445-8e9a6c0489fe","year":1957},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.643428Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:9de4355c28734249fd43a32d8c32711906624d26dff556631a340dc070bd4c83","observation_id":"11b187cb-4a3c-49ee-ab6e-9bc8dd301d4c","resolution":{"observed_at":"2026-08-14T14:50:13.847825Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.833739Z","title":"Nishihara, S","venue":null,"work_id":"1ada89c4-ccbb-4ff2-a053-0138699672e0","year":2014},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.646759Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:f2a7ebe3a441b9c5b3d66f7ed2fa80fbed4529d35d9d25f4819b5ca6369acc45","observation_id":"545d4ccf-6c1f-499f-a8c9-8d1da34c23da","resolution":{"observed_at":"2026-08-14T14:50:13.837244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.824513Z","title":null,"venue":null,"work_id":"2ee9bdda-2ebb-485f-aab2-63df38e0bab6","year":2006},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.650011Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:78cb94db4ae8f0229f859938fb696bd5a1d5236d1a151ea06ac64b757207c4ce","observation_id":"565f4891-020d-4703-a88d-4ed99cca852d","resolution":{"observed_at":"2026-08-14T14:50:13.827963Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.815176Z","title":"Rais and A","venue":null,"work_id":"fb22f789-7afc-4dbc-9885-d7cb931af531","year":2011},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.653028Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:7930cc921920ebc70b5c5fe4097b814e8e580ee9ac11d7bcec38ff309f7dd571","observation_id":"17896cd9-9657-4ecb-a20f-cf18bf955b7a","resolution":{"observed_at":"2026-08-14T14:50:13.818712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.805820Z","title":null,"venue":null,"work_id":"1325af22-fb2b-4648-95df-2115527cb3af","year":2019},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.656158Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:e31b9842b70f3bbd5884c2abdd94b6299a75d5ccb5de122c95c33793c8680668","observation_id":"059bda62-1540-42b0-91a4-dc0690dcd2ce","resolution":{"observed_at":"2026-08-14T14:50:13.809061Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.796974Z","title":"Seong, M","venue":null,"work_id":"8d09940b-7b2a-4719-8695-d746b3c16a77","year":2006},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.659382Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:2bc2b3cc33790a3a8d94ed6e27c9d5ddede24af853ef3127c9836fd95fef6f1c","observation_id":"8315432b-7af5-4bb6-86fc-3ba363dbd9b5","resolution":{"observed_at":"2026-08-14T14:50:13.800115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.787802Z","title":null,"venue":null,"work_id":"1386644a-0d71-4c95-a8fc-b3978c0fbcfb","year":2016},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.662624Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:468d040228200c019377bb9f7d60a5397aacafd28aeb5c423e08f804821ac52c","observation_id":"3cd28f41-8870-4709-b8f6-285817186180","resolution":{"observed_at":"2026-08-14T14:50:13.790937Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.777406Z","title":"Von Neumann , Functional operators: Measures and integrals, vol","venue":null,"work_id":"e051370f-fbe4-4798-8be0-f9890bcfe3eb","year":1950},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.666468Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:272e3340f679cc3fd3d278029249b22b3dcecd8fa4becd16588f3db2c791e7b8","observation_id":"7cab7b22-9335-485d-90b1-13727efada7d","resolution":{"observed_at":"2026-08-14T14:50:13.781774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.767056Z","title":"Xiao and S","venue":null,"work_id":"acd7eddb-985f-4fa9-bcf2-690850760b40","year":2006},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.669880Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:6d95ebce6b7790562ddd1338c0e5f96d6ffd463656d50a7f7a2c6333c7bf7235","observation_id":"a1635ca5-d1f6-4ffd-a1d0-bbea708e81d6","resolution":{"observed_at":"2026-08-14T14:50:13.770523Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.756633Z","title":null,"venue":null,"work_id":"95478399-1d4f-4afd-9bee-47b53fa89bac","year":2004},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.673283Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:e84f60c0341d9598fc0365ce97fd05f0c0c493cab047ade2d92768b78d741704","observation_id":"3ab6f47b-f8ac-45d2-a0f4-cdd62bd54a61","resolution":{"observed_at":"2026-08-14T14:50:13.760021Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.746662Z","title":null,"venue":null,"work_id":"8b26b208-2022-4317-bcb3-5d9320780748","year":1986},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.676628Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:3282d7ddf244d66cf9cf624c449a955b0d540760bd876ca3ddf21b95cc323f2d","observation_id":"30fcbaed-55f5-4dca-be69-c7aeafe81993","resolution":{"observed_at":"2026-08-14T14:50:13.750221Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.735890Z","title":"Yu and M","venue":null,"work_id":"b80dd379-8865-48c8-bfc0-149971570544","year":2017},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.679759Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:111902eb8264666097461baaa9b9adaae29c03130a104d976fe3f857dd409ecc","observation_id":"cf26a5d6-48ee-4d6a-b065-ff47304b0777","resolution":{"observed_at":"2026-08-14T14:50:13.739577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.725510Z","title":null,"venue":null,"work_id":"f67c1023-8442-42f4-b582-b2ff629b04a7","year":2012},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.683283Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:a8556b5dcab9eb41d62879f4c56de2c456c200cbb4a853382df843ef0f7ee7a0","observation_id":"a7c952a1-f9d6-4e8f-b2d0-70f625b04708","resolution":{"observed_at":"2026-08-14T14:50:13.729363Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-14T14:50:13.713484Z","title":"Zulhasnine, C","venue":null,"work_id":"2a00232a-6e83-4991-b706-a4217c0f14ee","year":2010},"citing_paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T14:50:13.686881Z"},"links":{"citing_paper":"/paper/1908.03080"},"observation_digest":"sha256:20e0dfdc40a91485ac9fe80f79aabed813e61e769d2880cc5c04af0f0bc962ce","observation_id":"cf4b8f76-2620-4a67-b719-f873f910109b","resolution":{"observed_at":"2026-08-14T14:50:13.718244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.03080","last_updated":"2020-06-22T21:51:56Z","latest_version":3,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T10:27:07.141886Z","submitted_at":"2019-08-07T07:09:41Z","title":"A Privacy-preserving Method to Optimize Distributed Resource Allocation"},"reference_resolution":{"displayed":50,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":0,"verified_fuzzy":23},"total_outbound_references":50},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 50 of 50 outbound references and 0 inbound Pith citation observations for arXiv:1908.03080."}