{"as_of":"2026-08-18T21:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:69b4538ec6471123e95642b9eed6be3fda64cec0d343048edacd1865a9f531df","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:18:03.498987Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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.09362/citation-record","integrity":"/paper/1908.09362/integrity","json":"/paper/1908.09362/citation-record.json","paper":"/paper/1908.09362"},"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-14T11:18:04.101939Z","title":"Multi-column deep neural networks for image classification","venue":null,"work_id":"045a786d-febc-4f2a-b44d-3ce4421cca08","year":2012},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.332548Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:aa8594a306cf465a6f18e6f7513df3549210bc1746d58ad5d97e88fca9884459","observation_id":"d59605ff-574b-4869-9a58-df93920b1e2c","resolution":{"observed_at":"2026-08-14T11:18:04.106761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:04.085373Z","title":"Text classification from labeled and unlabeled documents using em","venue":null,"work_id":"6c4df71d-2c0b-499c-8f54-59b62ec8157f","year":2000},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.337929Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:c9d0691f4c9f71cd55efbf66750a5e39c4c62fdd33e8b33fcbef59eb2af2b3a2","observation_id":"92de3bed-0b1a-4849-843f-88df6bc4fd9e","resolution":{"observed_at":"2026-08-14T11:18:04.090924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:04.061994Z","title":"The e-commerce product classification challenge","venue":null,"work_id":"4d4849a8-82bb-4530-b997-92100e596f95","year":2001},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.342616Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:cc1a458fc83019636ba309f84f1598cbb9f54b1e9fd7eddcc2a965c000ee7c37","observation_id":"b96e687c-2e16-4dac-86e9-ff1088800b7b","resolution":{"observed_at":"2026-08-14T11:18:04.067566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:04.046431Z","title":"Application of machine learning on brain cancer multiclass classification","venue":null,"work_id":"5eee181e-1801-4979-88b8-a6d0ca21c4ce","year":2017},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.347154Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:7107ae9c2108f1cd49f5b393107cd5eaae9f57de0027dc9f0a2991138764a806","observation_id":"c5e1ba4d-a8f5-4f17-a52c-83e300a8bc59","resolution":{"observed_at":"2026-08-14T11:18:04.051585Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:04.030131Z","title":"Multicategory classification by support vector machines","venue":null,"work_id":"a8427d1c-10be-488f-b879-e7ff78d47cd0","year":1999},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.352354Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:2bccc3781ab36325c20986de2de6943bfc058e63c1cc0c6833f064479fe39990","observation_id":"e2c48165-75f7-417e-8b84-7e49ed917e8d","resolution":{"observed_at":"2026-08-14T11:18:04.034586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:04.014471Z","title":"Logarithmic time online multiclass prediction","venue":null,"work_id":"c7b6c593-ca48-44f1-92ac-4b874d74c379","year":2015},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.357480Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:3a6bff24e05d0d47c2ecd36e80a000565be223a7afbdcd65a82d5d28700c732f","observation_id":"e5444724-9fe0-463f-999b-2bf5df49445f","resolution":{"observed_at":"2026-08-14T11:18:04.019638Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.995869Z","title":"Multiclass learning with simplex coding","venue":null,"work_id":"204802a2-1f8c-47ef-8ce6-28e83b63587c","year":2012},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.362198Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:59b9655628db39131c396d1900936e7bbddaab748b268abcd43f34d0ce8af942","observation_id":"b85bba0d-ff4d-40b7-8dfb-1373066574db","resolution":{"observed_at":"2026-08-14T11:18:04.002590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.981043Z","title":"Multi-class support vector machines","venue":null,"work_id":"ae5274d4-00ba-41fd-a729-b5612a3e14f9","year":1998},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.366568Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:031d7a7b4458e1f5d55bb19e097ff59dd5e20ced108fc4a0dcd706b8edef30e6","observation_id":"b1822088-3a00-42dc-84e6-88c81a702537","resolution":{"observed_at":"2026-08-14T11:18:03.985545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.966410Z","title":"Multi-label prediction via compressed sensing","venue":null,"work_id":"e244c9a4-383c-4565-b0a6-3665817faa17","year":2009},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.371047Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:a9651d901e6db6f14ac80deb3d3b8815d8cbe7a172a184f415f500a83ad1f978","observation_id":"055242ac-0f1c-412f-bad6-1de0d873545e","resolution":{"observed_at":"2026-08-14T11:18:03.972013Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.952650Z","title":"Fastxml: A fast, accurate and stable tree-classifier for extreme multi-label learning","venue":null,"work_id":"e27c3761-b434-46e2-a6ed-f4174077707f","year":2014},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.376923Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:4da542ef401d14efad3497f79757918b20d5305f6e0967b6c5ca7c3e4f0e2c3a","observation_id":"4b14d65e-21e6-4289-9103-b306c6848cfe","resolution":{"observed_at":"2026-08-14T11:18:03.957716Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.937517Z","title":"Gradient boosted decision trees for high dimensional sparse output","venue":null,"work_id":"211275c6-0d3d-456b-84a0-811771f1c128","year":2017},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.382125Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:5ad0e70e0f61d950fa22e7ae7d896fa4535f819a96e31e7b1ab5b7c74873f3b0","observation_id":"dbdfa563-4087-46d0-9eed-0d3574296d22","resolution":{"observed_at":"2026-08-14T11:18:03.942748Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.916521Z","title":"Pd-sparse: A primal and dual sparse approach to extreme multiclass and multilabel classification","venue":null,"work_id":"94330d62-f8b6-4fc1-bcca-c0a4345402af","year":2016},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.386822Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:240005295947e5e8c465a1ab5a1ec2aa262bc3488e1170cf1f750032f8f5175b","observation_id":"6466dc49-30ce-42fc-9073-ecb7f0064163","resolution":{"observed_at":"2026-08-14T11:18:03.925633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.888280Z","title":"Learning machines","venue":null,"work_id":"7aede5bf-e53a-4338-aef7-674a69a647c1","year":1965},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.391124Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:75b3464980c3e3362d3c5a4d40326bc9319ed6a9453c9ef496f24d1d40b352c9","observation_id":"342bbde0-f2f2-49b1-a735-2dce70e77377","resolution":{"observed_at":"2026-08-14T11:18:03.897903Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.871516Z","title":"Classification by pairwise coupling","venue":null,"work_id":"aba14f9e-a495-4e2f-ab3e-08425f4139b4","year":1998},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.395307Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:a9e8d7e0f08fcefb47d7f579ec9573acca1b287c3bb7be77787b5efa31cc73ea","observation_id":"843e110e-d684-4a52-981e-a42a05abff7b","resolution":{"observed_at":"2026-08-14T11:18:03.876114Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.854074Z","title":"Solving multiclass learning problems via error-correcting output codes","venue":null,"work_id":"6003d5ba-ffd5-49ca-b968-b98f0cf05dea","year":1995},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.399559Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:776e77a8b00b16ceb0a3eeb144ac5bacefbbfdadcc0e620e1a8947f540eb19f3","observation_id":"fa952a61-801e-4d04-9bb0-3426fa95dec9","resolution":{"observed_at":"2026-08-14T11:18:03.860426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.838175Z","title":"On the learnability and design of output codes for multiclass problems","venue":null,"work_id":"1d0b44ef-2281-4270-8198-e6e4e7137abf","year":2002},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.403984Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:4ba0c05b6143576411f0a5823c9b4da2da4c401800c0fdf7e854c87cfaf1b9a8","observation_id":"804b839d-2706-45be-8759-c942ebc65b42","resolution":{"observed_at":"2026-08-14T11:18:03.843676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.818173Z","title":"Traffic sign recognition using evolution- ary adaboost detection and forest-ecoc classification","venue":null,"work_id":"6a59aa19-e846-471b-8845-12d76e4e4792","year":2009},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.410358Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:2adf3a37720356f111564f1435bda5d07fd151e0aeb58a102a37f55440a7378e","observation_id":"206cfd8f-bf06-4b28-ad5f-cbcc75ca0b86","resolution":{"observed_at":"2026-08-14T11:18:03.822685Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.803389Z","title":"Discriminant ecoc: A heuristic method for application dependent design of error correcting output codes","venue":null,"work_id":"eee2d407-47d2-4286-91f7-dd0d5d56e541","year":2006},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.417176Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:eaf6bd2b61139861dd9e9f08d3fbc334a6c9d32a093e1124b7b8cdf6823c907c","observation_id":"b88c7045-f6cf-411a-8f74-22aeccbc7214","resolution":{"observed_at":"2026-08-14T11:18:03.808214Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.789828Z","title":"Evolving output codes for multiclass problems","venue":null,"work_id":"0851c5a7-1178-4b77-a473-c82b2f21f28b","year":2008},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.422109Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:0477b4551e5568dd7d6d84edfd5aa9f5aedf8452b0e52dfc7c85cb0c05b8a602","observation_id":"65db72f6-5aed-4eee-8c7c-90702b272009","resolution":{"observed_at":"2026-08-14T11:18:03.794238Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.774290Z","title":"Minimal design of error-correcting output codes","venue":null,"work_id":"12ac3944-b111-42e3-a18e-38ea899d8aa7","year":2012},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.427098Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:0851e869f68bf814f96512dec66bcaf81626c1df99241a51c8fd894863bb30a6","observation_id":"17892be9-59ed-45a5-b465-25793f1e0271","resolution":{"observed_at":"2026-08-14T11:18:03.779890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.759092Z","title":"A genetic-based subspace analysis method for improving error-correcting output coding","venue":null,"work_id":"86538e7a-fb1f-46d9-ab49-8726cebe80ff","year":2013},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.432135Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:63da3a0216edcee9773480522cc035f9829cd33272808c33a6d6bce61f58c8eb","observation_id":"45ff6508-377b-40bc-a326-53aaea0f6bf3","resolution":{"observed_at":"2026-08-14T11:18:03.763544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.744556Z","title":"On the design of an ecoc-compliant genetic algorithm","venue":null,"work_id":"ff266be0-72ed-4c81-977c-99786e703d19","year":2014},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.436718Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:4d1b0292192dfc83c08ee91398ba85acdee46990f51fe9b8717aaaba2a2c13e4","observation_id":"8467b5be-a628-4d36-920f-d03548e84801","resolution":{"observed_at":"2026-08-14T11:18:03.748970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.730465Z","title":"Spectral error correcting output codes for efficient multiclass recognition","venue":null,"work_id":"cd3a7ae6-3913-402f-af7a-72495c616858","year":2009},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.442999Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:e4118f307d7d73de7b1cc6e2ec0bd9e602555b9f245d79f891aa4d7d22934463","observation_id":"50d31e83-fb74-4dd2-81fa-06f9f8391f6e","resolution":{"observed_at":"2026-08-14T11:18:03.735295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.715755Z","title":"Sparse output coding for large-scale visual recognition","venue":null,"work_id":"3322b0f8-1393-44a9-b355-93e06c25f192","year":2013},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.447351Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:11cff8f20d5581b606ae93bc25b6a571efc37cc9e03abdf515622a3b575e46fe","observation_id":"6cce507b-f1d6-417f-8e4f-15eb5a754a65","resolution":{"observed_at":"2026-08-14T11:18:03.720790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.701259Z","title":"Thinned-ecoc ensemble based on sequential code shrinking","venue":null,"work_id":"f10563c0-e56b-4416-b733-59757e1abba0","year":2012},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.451942Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:ffb95900a49707625399d0e5641237d8dab4e45295b040fbded23a143fcf6c28","observation_id":"3ef25dcb-785b-4fb7-9bcf-365270f767dc","resolution":{"observed_at":"2026-08-14T11:18:03.706250Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.684214Z","title":"Multiclass from binary: Expanding one-versus-all, one-versus-one and ecoc-based approaches","venue":null,"work_id":"ecf97e06-8af7-48c2-8f76-a1439be714c8","year":2014},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.456053Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:7000edff67b39dc0d9716a3d57ed9fa0baa8999a28b5558cdb1f13ef104905d5","observation_id":"da1159f8-fb8c-4f12-8895-1b300e532681","resolution":{"observed_at":"2026-08-14T11:18:03.688916Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.669441Z","title":"Ecoc-one: A novel coding and decoding strategy","venue":null,"work_id":"ce41d40f-161c-49c5-b046-33ba07f84175","year":2006},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.461199Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:8b74caabe54c5d36d935bbfb23ec1ac12661085b62c990afdd5c5dbf2fb01350","observation_id":"0024c7d8-9e2c-4e19-8a8d-5bc8029020f8","resolution":{"observed_at":"2026-08-14T11:18:03.673577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.652323Z","title":"On the decoding process in ternary error-correcting output codes","venue":null,"work_id":"4e11655b-4c87-4451-8dc0-aaf9fed7c861","year":2010},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.465501Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:efaebbb75a4ad12125c8b2b226948ffb5b6381b5f2a9cb6f6b265f111a984f65","observation_id":"3c2e72f7-0926-4624-b675-bf6c7417a4da","resolution":{"observed_at":"2026-08-14T11:18:03.658425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.635862Z","title":"Distributed representations of words and phrases and their compositionality","venue":null,"work_id":"fde2c3f1-cf4a-4273-9f76-d58af90270fe","year":2013},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.469920Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:56fcf04f24e2e57356fa576999bbc0b91cceda07b49ebae3bc2e4e0b59e9ce33","observation_id":"774c307c-d74b-4ed2-9798-61722fd294be","resolution":{"observed_at":"2026-08-14T11:18:03.641219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1801.04540","last_updated":"2018-03-20T08:56:25Z","snapshot_observed_at":"2026-08-18T13:59:49.143654Z","submitted_at":"2018-01-14T12:00:43Z","title":"Fix your classifier: the marginal value of training the last weight layer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.04540","snapshot_observed_at":"2026-08-14T11:18:03.474789Z","title":"Fix your classifier: the marginal value of training the last weight layer","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.474789Z"},"links":{"cited_paper":"/paper/1801.04540","citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:208241498eedfb1ca7dff1f3b096d74d4304f8a5c343f993a2e8dd3cdb29d239","observation_id":"b0308e5a-1299-4818-97d7-89e68e1f2024","resolution":{"observed_at":"2026-08-14T11:18:03.474789Z","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-14T11:18:03.618728Z","title":"Libsvm: a library for support vector machines","venue":null,"work_id":"15132d10-3eb0-44e2-ac88-6e8cc13f4a87","year":2011},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.479688Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:19a0d4d1fb4388593dcec30903dde08d97e95663eea7d13fd56db0fc7893cf6f","observation_id":"166e3215-2436-48e9-961b-61bd376c40d8","resolution":{"observed_at":"2026-08-14T11:18:03.624549Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.600364Z","title":"Inferring networks of substitutable and complementary products","venue":null,"work_id":"74fddf4b-a421-4f5d-b67a-6daa861468fa","year":2015},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.484373Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:848daef2a6f851752adb3897027911d01fe19a37c8de2de82b420f8614165f55","observation_id":"c4d3829d-e79b-40da-874b-bdf055421ad2","resolution":{"observed_at":"2026-08-14T11:18:03.605373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.585196Z","title":"Image-based recommendations on styles and substitutes","venue":null,"work_id":"95b44de0-4e75-4ade-adda-3e165ca06e97","year":2015},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.489562Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:fbfa53c5776edda68a28bddc14c635be5cd4428a3366058ac3e5775d9e1bf75e","observation_id":"ffb1e9ec-23f2-433d-a9ee-490d297d1ab8","resolution":{"observed_at":"2026-08-14T11:18:03.590293Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.565728Z","title":"Reducing multiclass to binary: A unifying approach for margin classifiers","venue":null,"work_id":"c93aaefd-9256-49d4-bb66-bac426fd200b","year":2000},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.494477Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:d3cf72a82b60d57ea6949ccedac99ca42e40cdb156b9413d3517b47f0676bb71","observation_id":"6ff4d986-5078-46d5-83a0-310728981fa2","resolution":{"observed_at":"2026-08-14T11:18:03.573495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-14T11:18:03.547259Z","title":"Lightgbm: A highly efficient gradient boosting decision tree","venue":null,"work_id":"75561c12-74a9-4773-9e8c-fa959a28c6a9","year":2017},"citing_paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T11:18:03.498987Z"},"links":{"citing_paper":"/paper/1908.09362"},"observation_digest":"sha256:06c85693da439603255e5c2e92ed14584e0b2a8909604302dac2b293931a6b65","observation_id":"c1560a1d-4562-4742-9abc-88206b88b535","resolution":{"observed_at":"2026-08-14T11:18:03.553435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.09362","last_updated":"2019-08-25T17:12:01Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-18T20:51:51.108315Z","submitted_at":"2019-08-25T17:12:01Z","title":"LightMC: A Dynamic and Efficient Multiclass Decomposition Algorithm"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":34},"total_outbound_references":35},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:1908.09362."}