{"as_of":"2026-08-16T11:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b8d76a9589644db6f6dc2f1bdcd53fb819b16af3471ae02bc5bfdeccf15f2c10","coverage":[{"denominator":33,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":33,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T15:33:30.741634Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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.01138/citation-record","integrity":"/paper/1908.01138/integrity","json":"/paper/1908.01138/citation-record.json","paper":"/paper/1908.01138"},"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-14T15:33:32.046821Z","title":null,"venue":null,"work_id":"b4a7b4d3-c7c7-4344-8653-349fa3f21a84","year":2018},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.235284Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:e1aae5b6e67df993909f6ffd7ce94f1c2b8888a9c2697716045484b8c123f71f","observation_id":"620d5634-95a7-40b4-97d7-214ec59f13fb","resolution":{"observed_at":"2026-08-14T15:33:32.050605Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:32.033302Z","title":"Springer Undergraduate Texts in Mathematics and Technology (2019)","venue":null,"work_id":"f8aecef5-4276-406d-bf3a-4a7c0ba7dacc","year":2019},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.273488Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:a17ea29823aa7e63e6508a207fddf198aef6e8b11fa83a55d7f878d703fa6185","observation_id":"dc30ebdc-8280-4680-bf62-bec64dfd593d","resolution":{"observed_at":"2026-08-14T15:33:32.037581Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1812.06070","last_updated":"2019-07-23T12:48:54Z","snapshot_observed_at":"2026-08-14T17:43:27.016115Z","submitted_at":"2018-12-14T18:36:06Z","title":"The Boosted DC Algorithm for nonsmooth functions","version":2},"cited_work":{"arxiv_id":"1812.06070","doi":null,"metadata_source":"pith","pith_arxiv_id":"1812.06070","snapshot_observed_at":"2026-08-14T15:33:30.790683Z","title":"The Boosted DC Algorithm for nonsmooth functions","venue":"math.OC","work_id":"75702a5a-82e1-419d-bbe9-97b6be956de6","year":2018},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.356759Z"},"links":{"cited_paper":"/paper/1812.06070","citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:edd76c0e3837565079db2af1f815a066e81049e9fbc41e27d71e7b00efd467b8","observation_id":"88ad4781-fd49-4c5e-844d-ff5630824ec8","resolution":{"observed_at":"2026-08-14T15:33:30.845882Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:32.019162Z","title":"Euro- pean J","venue":null,"work_id":"a81309f5-62ef-4e54-b4eb-bf6f53256ca5","year":2012},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.419396Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:e723e9fc4212f4c381e4eb853c3c985cfc02c8ec667976a85ae0266d8b6ceee3","observation_id":"010f52b4-1847-4386-ae82-dae262d9d5ec","resolution":{"observed_at":"2026-08-14T15:33:32.023536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:32.005272Z","title":null,"venue":null,"work_id":"4b1965e7-abcb-4eaf-b873-c5782d894117","year":2009},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.443244Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:c7f4ee5ef469697f7ea1583be72886f9a493fb0f9440076c4e7f7431c0c213df","observation_id":"0afe33ce-364f-41d9-9939-5dfa06a9d254","resolution":{"observed_at":"2026-08-14T15:33:32.009802Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.990369Z","title":"MPS/SIAM Series on Optimization (2000)","venue":null,"work_id":"709b0553-8164-4ed0-bc28-d0b737c801ba","year":2000},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.490696Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:57a67965f5c9592575180761c591db4af21c3a7f89122e5f6d209367c9510429","observation_id":"3c1bcf52-1ebf-4211-a086-2cc4cee5ca0a","resolution":{"observed_at":"2026-08-14T15:33:31.995811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.977411Z","title":null,"venue":null,"work_id":"118a88d4-fe6c-4e7d-a368-6a4b033bd545","year":2013},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.547590Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:60eb28554e902bfe8b82cb740efca46106ac8ba5cdef4e5fd41e153af3d777da","observation_id":"9851e0f4-fabd-4f6b-868c-b22d8b33e322","resolution":{"observed_at":"2026-08-14T15:33:31.981661Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.947023Z","title":null,"venue":null,"work_id":"76dd2b46-f717-4d1d-a892-9a4ca38fe40a","year":1981},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.592851Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:8ddf40ae6fa5f41c35c276fcbcae0a67c2603821f15d69f97e45503d2ab49981","observation_id":"b9c3bec7-dc52-4c5a-a9ec-b3d2f006ae49","resolution":{"observed_at":"2026-08-14T15:33:31.967993Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.817035Z","title":null,"venue":null,"work_id":"9e8d0cff-6a2b-431f-8ee4-07413ac3c817","year":2018},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.636599Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:77e9534a3a59835659319f11a27d246785c0bbda813bb12ed90211f62474d727","observation_id":"ca59469d-460d-422d-b6ff-63fc9216f9ac","resolution":{"observed_at":"2026-08-14T15:33:31.890702Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.755371Z","title":null,"venue":null,"work_id":"2fe71358-d85b-4402-a5cc-6402d98a650e","year":2008},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.641870Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:6930b247b7d774ee8ba42b3ecd1b04d9819edf86011dc247a063e154621ed5c2","observation_id":"88164408-acf2-4d5b-abc0-859a3febd470","resolution":{"observed_at":"2026-08-14T15:33:31.785775Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.740436Z","title":"Electron","venue":null,"work_id":"b53b2aea-1bff-4bbe-abd5-411fa4d203a3","year":2008},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.646336Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:3872aafbe1a2161ffdeeba3fbcfab87e17c7d8103fcd64d56d2fef90b83320f6","observation_id":"ca856253-a525-4fa4-bf32-c4a0ef7f02a8","resolution":{"observed_at":"2026-08-14T15:33:31.745311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.727035Z","title":null,"venue":null,"work_id":"f038cf5c-9407-41c6-81cd-ef04920df9bc","year":2002},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.650681Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:f0010c10d1c0de3012882eceae38b7c36044c02f437e1ffa27b72a256231cc3d","observation_id":"2c6db348-34b9-4ab4-8aa6-9fff2f93ed86","resolution":{"observed_at":"2026-08-14T15:33:31.731510Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.714089Z","title":null,"venue":null,"work_id":"8a96d581-f7ed-4b1e-bd61-f6d728fa4715","year":2018},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.655527Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:12ba592d6609181bbbf5f927d567ab910de5283bce59f9c9b846b93f6d77720b","observation_id":"8f50806a-3384-4a17-b9fe-7b89c642dee4","resolution":{"observed_at":"2026-08-14T15:33:31.718416Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.700503Z","title":null,"venue":null,"work_id":"e4c05186-d46c-484f-8208-23a1dce12cd5","year":2012},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.660063Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:2fc6c059dae702a118e873e11c5785f220f50b3377f39df2ff991f011154477f","observation_id":"6f647245-5379-4bfa-9fc0-29f785412a9d","resolution":{"observed_at":"2026-08-14T15:33:31.704840Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.688105Z","title":null,"venue":null,"work_id":"2a9b35a9-ec14-4d0e-ac47-7bf722f77d7a","year":2005},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.664670Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:d94abcd3c823fcadac172d0d4719b7b8f6e325a13be818cd72b9c9b32b2e66c7","observation_id":"23b25acf-a791-47f1-aa97-5584d7d359f3","resolution":{"observed_at":"2026-08-14T15:33:31.692232Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.675214Z","title":null,"venue":null,"work_id":"6eda84ad-7aa2-4246-995e-f8d03179e145","year":2018},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.668920Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:086d81b7637f4c194421729a65dcd1cb7925cb822f37753d6f2904528ebe171c","observation_id":"06bed074-570a-4754-a26c-ce1e5fcc6e1d","resolution":{"observed_at":"2026-08-14T15:33:31.679533Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.662092Z","title":null,"venue":null,"work_id":"d4a56aa2-96dc-4dd3-a9e9-08f20bea774d","year":1992},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.673262Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:084e27abf824e9bfd19e7b87df7b9144f8769d351016522f0aa993150dfbb1ea","observation_id":"b4ce1121-494d-4b43-b4a5-9689bdf2c2c6","resolution":{"observed_at":"2026-08-14T15:33:31.666011Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.648617Z","title":null,"venue":null,"work_id":"3e5e27ba-04f5-4d0b-8be3-0091a8cd1aa1","year":1981},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.677849Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:9c8aa1e88c665f96162e91d953987fc1f2488ceb394e4d944f9968319a6c9bdd","observation_id":"7c5c685d-e655-48d5-9ce3-7253ddaa2fc4","resolution":{"observed_at":"2026-08-14T15:33:31.653611Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.542376Z","title":null,"venue":null,"work_id":"40f5fdc1-7395-4e5d-89cb-a8c7e7cda5c8","year":2006},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.682159Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:ec0f4648f0385a1d6a3e215e971c1a6b30bfc35df2ca019f56fdcca5b66f4988","observation_id":"87793f27-48a4-4529-b52e-0b74cec5856d","resolution":{"observed_at":"2026-08-14T15:33:31.597328Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.448715Z","title":null,"venue":null,"work_id":"4d561b64-ba36-40ed-bb47-5fe20fbbb287","year":1987},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.686587Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:8671b9f1c533b8b51c59ccd78de544b4d0ad2d2f38d5b7c33835dea3ea0b6556","observation_id":"05b348d8-4077-4d6d-91c7-d67bd03f8901","resolution":{"observed_at":"2026-08-14T15:33:31.485327Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.361698Z","title":"M., Geremew, W., Reynolds, R., Tran, T.: Nesterov’s smoothing technique and minimizing differences of convex functions for hierarchical clustering","venue":null,"work_id":"f5821187-9b9e-48d8-a158-fb76682c95a0","year":2018},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.690751Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:e81981a0c06be750286bf43efd9201746fba1025ce73bb26c4b67d672f907d0a","observation_id":"9a26f8e2-359b-4b3b-9633-369885084a4d","resolution":{"observed_at":"2026-08-14T15:33:31.400663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.335676Z","title":null,"venue":null,"work_id":"d03c91b6-b9ef-49c0-a8ea-0e329f0830aa","year":2018},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.694557Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:3240d35f4a60370374aa4e03b3c2cab2cd31763d2e0b21848fcecfca53e1703e","observation_id":"5e4c94ce-e55a-469f-b409-8a2029505efc","resolution":{"observed_at":"2026-08-14T15:33:31.339640Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.01509","last_updated":"2022-05-06T00:33:54Z","snapshot_observed_at":"2026-08-14T16:21:05.101088Z","submitted_at":"2019-06-04T15:20:48Z","title":"High-order Moment Portfolio Optimization via An Accelerated Difference-of-Convex Programming Approach and Sums-of-Squares","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.01509","snapshot_observed_at":"2026-08-14T15:33:30.698347Z","title":"ArXiv: 1906.01509 (2019) 19","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.698347Z"},"links":{"cited_paper":"/paper/1906.01509","citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:650a08ea996e5662088d09e87f56c1e764f98a2a25fd8bf542a8a448003a4cb3","observation_id":"16bca759-0ed7-4300-add0-6b3163bc411c","resolution":{"observed_at":"2026-08-14T15:33:30.698347Z","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-14T15:33:31.322328Z","title":"Anal.27(4), 895–919 (2019)","venue":null,"work_id":"4d23d35e-8a22-4ef3-9399-5257f80a045d","year":2019},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.703483Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:cb4ae245345afebef2ffe07b50f7e54459526c846cddda3eeabd1b98134b5096","observation_id":"0fcbadfa-7ae0-4405-a779-cb8774c9b875","resolution":{"observed_at":"2026-08-14T15:33:31.326671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.308645Z","title":"Acta Math","venue":null,"work_id":"03278ccd-d4e4-45b6-84c2-eb1b50969185","year":1997},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.708196Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:5e26f23ce0c7f355d388a543953a549eebf92896269d96fdcb4c56f60a550d70","observation_id":"cfe8351a-7720-4462-b8f3-8b2d4d9242ab","resolution":{"observed_at":"2026-08-14T15:33:31.313314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.294794Z","title":"optimization algorithm for solving the trus- region subproblem","venue":null,"work_id":"813dbedc-cde2-4b94-9e5f-eaba78b4e871","year":1998},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.711871Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:8c370be44ebf8e3e6000eb51c7c1c4e43b29ee29332e8cfc762de8a2da9fd086","observation_id":"e83a5068-6ca4-4141-b13c-ca830a2de010","resolution":{"observed_at":"2026-08-14T15:33:31.298833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.281282Z","title":": Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming.Optimization Methods and Software, 23, 609–629 (2008)","venue":null,"work_id":"b3875fc2-a9a6-4ae5-9bc0-026bf0ea6065","year":2008},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.716038Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:cd2f5c850bba989dda1777fe3bca8c22ca946c7ccd2fb21bdbcf996f1640941d","observation_id":"178e119a-b65b-4b73-be0e-b03bbe94e531","resolution":{"observed_at":"2026-08-14T15:33:31.285892Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.267144Z","title":"N.: Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem","venue":null,"work_id":"18b1bc41-98f4-4714-9b79-6acecfa39acd","year":2012},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.720652Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:6490549f57eec0b89c5e65500a3e56fcc6c88efc49b4e905763378af75508b33","observation_id":"ced82dc0-d696-4f54-af44-150b8a3daef4","resolution":{"observed_at":"2026-08-14T15:33:31.272295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.251419Z","title":"N.: Linear convergence of a type of iterative sequences in nonconvex quadratic programming","venue":null,"work_id":"6e632f50-812c-4ee4-8f29-38aea2d079a4","year":2015},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.724946Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:c8f6d787ae79ab47d84dd87879d1689471ac6781d1c77a9fe5af33bbf7ec6178","observation_id":"1ebc2fb4-3277-47b2-b0ae-3ff12a23ca31","resolution":{"observed_at":"2026-08-14T15:33:31.256254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.236468Z","title":"N., Yen, N.D.: Convergence of the Pham Dinh-Le Thi’s algorithm for the trust-region subproblem","venue":null,"work_id":"18b85d9e-c19e-49f0-9f42-c3d7808b3f4b","year":2013},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.729224Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:69945dcfef165b64966e49fb74f91038e46fd9ab8c34466160d7f93e8aab791a","observation_id":"c1c760b8-2dde-4a77-a424-e739762fb6b8","resolution":{"observed_at":"2026-08-14T15:33:31.241923Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.087447Z","title":"Princeton University Press (1972)","venue":null,"work_id":"65afbd38-09d6-41b1-b0b2-1c40a4fc9d3a","year":1972},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.733286Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:228dc9c56818cf897456ae3044c0c3d122861002779633ac39c7c6cedc6b46d2","observation_id":"037621f8-ced5-4289-aedc-9f1b3c71dd46","resolution":{"observed_at":"2026-08-14T15:33:31.167632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:31.059577Z","title":null,"venue":null,"work_id":"7ead176f-a6a2-496e-b84d-cdba019e6ce7","year":1998},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.737481Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:72fc9a64d0b3c22028e35d162bebdb0a8c96860b85fc358e2c7511eb401daa28","observation_id":"1bf66180-abe1-4452-9cb8-398c393c9fe4","resolution":{"observed_at":"2026-08-14T15:33:31.071953Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-14T15:33:30.980178Z","title":"H., Wang, Y","venue":null,"work_id":"e049f323-1b07-4ddc-93ce-07fcf2f7d0fe","year":null},"citing_paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming","version":4},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T15:33:30.741634Z"},"links":{"citing_paper":"/paper/1908.01138"},"observation_digest":"sha256:71247da1bdf56114009d4f59f19d12229d977fcd0f20dc74267f87f546121beb","observation_id":"ed468fa7-f63e-4862-be8a-1fab37d25862","resolution":{"observed_at":"2026-08-14T15:33:31.048847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.01138","last_updated":"2022-08-02T15:27:53Z","latest_version":4,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T03:36:18.260524Z","submitted_at":"2019-08-03T09:35:37Z","title":"The Boosted DC Algorithm for linearly constrained DC programming"},"reference_resolution":{"displayed":33,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":18,"verified_exact":0,"verified_fuzzy":14},"total_outbound_references":33},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:1908.01138."}