{"as_of":"2026-08-16T18:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:de83539ed163a125aa58b8f2d8c1d8c56818d4603866f51020512e392edb59cc","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:48:35.081298Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:48:34.440026Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-14T11:48:35.145895Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"cited_work":{"arxiv_id":"1908.08281","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.08281","snapshot_observed_at":"2026-08-14T11:48:35.145895Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","venue":"cs.SI","work_id":"8f91e44f-f8c4-4dd1-8e12-88902c6cbfaf","year":2019},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.440026Z"},"links":{"cited_paper":"/paper/1908.08281","citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:2e467586c516cc2338ab9790608ee5b71f446fbeda6ec9c143c3592efbb01c0c","observation_id":"4dc732e3-61b9-43ee-82e1-8301b0a01a4a","resolution":{"observed_at":"2026-08-14T11:48:35.204195Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/1908.08281/citation-record","integrity":"/paper/1908.08281/integrity","json":"/paper/1908.08281/citation-record.json","paper":"/paper/1908.08281"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"cited_work":{"arxiv_id":"1908.08281","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.08281","snapshot_observed_at":"2026-08-14T11:48:35.145895Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","venue":"cs.SI","work_id":"8f91e44f-f8c4-4dd1-8e12-88902c6cbfaf","year":2019},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.440026Z"},"links":{"cited_paper":"/paper/1908.08281","citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:2e467586c516cc2338ab9790608ee5b71f446fbeda6ec9c143c3592efbb01c0c","observation_id":"4dc732e3-61b9-43ee-82e1-8301b0a01a4a","resolution":{"observed_at":"2026-08-14T11:48:35.204195Z","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-14T11:48:36.788258Z","title":null,"venue":null,"work_id":"0aaa6a55-9bf0-4021-87d5-78e3e3bf4195","year":null},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.450554Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:120b5e7645a553b745fb9455af0e914767865e3f73f780ce050d7ff24765a808","observation_id":"1f71ebd3-d2c6-4e70-a05d-5911d7c0373d","resolution":{"observed_at":"2026-08-14T11:48:36.800595Z","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-14T11:48:36.699529Z","title":"The first stage comprises random sampling in order to find a lower- dimensional subspace which captures the most of the action of X∈ Rm×n","venue":null,"work_id":"0ccd8a50-7663-424b-bf8e-c4277976a924","year":null},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.456977Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:4459c16d5284f437b1453713b8fa87e0993f4c2bd512406451fccdaa398d51d4","observation_id":"8754b1c2-48f1-42b0-835f-f3a2b805e3d4","resolution":{"observed_at":"2026-08-14T11:48:36.764596Z","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-14T11:48:36.604102Z","title":"It contains a large amount of Greek places of interest along with valuable information related to them","venue":null,"work_id":"1d753e00-23df-43aa-a4b9-015ed89b4834","year":null},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.465200Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:0f594efcc2d1712080bd30fd2e94e202d42ba6f2a5ec7aa689c325fa564cf3f9","observation_id":"5e6a5db0-9767-497b-9f09-7b9d60e9752a","resolution":{"observed_at":"2026-08-14T11:48:36.613409Z","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-14T11:48:36.432984Z","title":"These methods are block randomized SVD for matrix inversion and conjugate gradient for solving a set of linear equations both related to optimizing f given fixed hyperedge weights w","venue":null,"work_id":"b72cb197-fa50-48ee-be92-a126e39e1b52","year":null},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.471596Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:f0df6b509da1a5a103e91992f9d3526d45a1fc70999f207677615c257adc5868","observation_id":"70d5479c-d6f9-4df0-8f51-253ff014fb53","resolution":{"observed_at":"2026-08-14T11:48:36.556815Z","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-14T11:48:36.366446Z","title":"Multimedia social search based on hy- pergraph learning,","venue":null,"work_id":"3be8e940-135b-4ad7-8ef1-8950fc0d0be9","year":2016},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.476945Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:2f872c4f2db034ef68d7cf19ba6667329ffc6a86b1d2869adc0255c998a38192","observation_id":"c19bc2e9-24ca-4c4d-a619-2858fdc29fb6","resolution":{"observed_at":"2026-08-14T11:48:36.384656Z","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-14T11:48:36.303051Z","title":"Finding structure with randomness: Probabilistic algorithms for constructing ap- proximate matrix decompositions,","venue":null,"work_id":"29bc846d-1c6b-49aa-ae19-f06871f0e512","year":2011},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.568842Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:a79d2e7ec9b5a9aa123a78994e49e2dffcebf55e2655fec282c72af4ed397cfb","observation_id":"06e1fb7f-bdb1-4387-9a4f-aaed058c8a37","resolution":{"observed_at":"2026-08-14T11:48:36.314248Z","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-14T11:48:36.187641Z","title":"Low-rank approximation of large-scale matrices via randomized methods,","venue":null,"work_id":"e49f6859-8b63-4754-946c-466397136a41","year":2018},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.649741Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:28212599f34fa49aead1c4fb215addd05f721a744995bdaf36f13def485aa15a","observation_id":"ba9faab2-80a8-4c6e-90eb-5a98e6c27be7","resolution":{"observed_at":"2026-08-14T11:48:36.203055Z","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-14T11:48:36.152782Z","title":"A randomized al- gorithm for the decomposition of matrices,","venue":null,"work_id":"e46da4b0-2808-4740-951c-ac4e03162153","year":2011},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.689839Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:610b0e124a7d1d89fbd3faae6143347e6f02a420115c41a475a7452edd5ca682","observation_id":"7183a5f4-f61b-4eec-9865-1d8b90bbe690","resolution":{"observed_at":"2026-08-14T11:48:36.168744Z","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-14T11:48:36.052235Z","title":"Randomized algorithms for the low-rank approx- imation of matrices,","venue":null,"work_id":"5851c204-a5ac-4392-b01d-d9709424bfb1","year":2007},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.698868Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:05cc80c406ec4614b4d34fd7c1ad8907f34d936345061ba6a3e2d68245006957","observation_id":"cd9a37a4-f844-4a13-b0d6-6061f6b51465","resolution":{"observed_at":"2026-08-14T11:48:36.115743Z","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-14T11:48:36.026465Z","title":"A fast frequent directions algorithm for low rank approximation,","venue":null,"work_id":"22b8fc6b-c3e8-4713-ad79-b710254e4192","year":2018},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.710059Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:df578f701e360cdc1c366f9c8da4a5f0b7071907ccfc015f3e433a4a2a688451","observation_id":"07c0a1af-003f-4fe1-ad1c-265757305499","resolution":{"observed_at":"2026-08-14T11:48:36.034322Z","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-14T11:48:35.868552Z","title":"Low rank approxi- mation of a sparse matrix based on lu factorization with column and row tournament pivoting,","venue":null,"work_id":"53faf54a-01d9-4c7b-ac72-60d7d115bd14","year":2018},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.717656Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:c0ab4611acd88f1bd6b069a226220b4c85430c60b045bda1b9a4d044cc39d609","observation_id":"f496aac0-acc8-4ed8-bb59-8d756f297992","resolution":{"observed_at":"2026-08-14T11:48:35.876579Z","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-14T11:48:35.838454Z","title":"Fast randomized singular value thresholding for low-rank optimization,","venue":null,"work_id":"23b3df7f-7bac-4868-b7c4-e258bc190cc8","year":2018},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.726013Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:ea05e8c692555c1f509875294827d40e43affca6ab6af48e2f0bf194dae9d359","observation_id":"39797f30-a836-462e-a0a4-7f41516a2bd9","resolution":{"observed_at":"2026-08-14T11:48:35.851470Z","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-14T11:48:35.713100Z","title":"Image ranking via attribute boosted hypergraph,","venue":null,"work_id":"fa5d30fb-f7f3-44b6-a6b4-36f70e23560e","year":2012},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.737148Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:ac491ac675176b44a56aaa3ee4fa0e25176542c8adeb8d020d467e6e31e81aee","observation_id":"44541678-0ad3-4657-86db-438316691d1b","resolution":{"observed_at":"2026-08-14T11:48:35.789811Z","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-14T11:48:35.691822Z","title":"Unified hy- pergraph for image ranking in a multimodal context,","venue":null,"work_id":"f9af1cf9-709a-4aa9-9d0c-d1db0c0d0a77","year":2012},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.743124Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:1696c9864f1bd13e2978dfd806e0f5a6f8b7365c2727cde48bfde8987befa787","observation_id":"0ee1fc8b-3b27-43c6-ac04-25766528270c","resolution":{"observed_at":"2026-08-14T11:48:35.697934Z","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-14T11:48:35.663412Z","title":"Visual-textual joint relevance learning for tag-based social image search,","venue":null,"work_id":"9a48d33a-7953-4fbf-809e-a489fa1c9d22","year":2013},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.748787Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:f9c574bfd391b54b3d4852b4e3c2fa93fe48c1866e3552d2918b6d6fb97a1a1b","observation_id":"226a6392-1bfe-4e70-85f7-bb298af59ca3","resolution":{"observed_at":"2026-08-14T11:48:35.670845Z","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-14T11:48:35.639766Z","title":"Weight estimation in hyper- graph learning,","venue":null,"work_id":"8954f32f-1567-4932-bc9b-aa7db8e945bd","year":2015},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.754159Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:289fe05ac46f0c5f2fc843ef7b9a1147a4e2471213ea6b48a21c85a7c303ad6f","observation_id":"10df95fd-effa-4a2c-be8b-593305015fdf","resolution":{"observed_at":"2026-08-14T11:48:35.646351Z","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-14T11:48:35.565174Z","title":"Adaptive al- gorithms for hypergraph learning,","venue":null,"work_id":"2d1bf8c9-0a29-4cb7-8696-3ec28783669f","year":2016},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.836430Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:4192c0f6ce1451938d8dd3cc3a1945d89508e063e466f24fd87ddd0de4340e50","observation_id":"3e014d38-2caa-4cc3-ad88-ce942c995ddc","resolution":{"observed_at":"2026-08-14T11:48:35.598924Z","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-14T11:48:35.480091Z","title":"Hackbusch, A Sparse Matrix Arithmetic Based on H- Matrices","venue":null,"work_id":"defb27a8-ed5d-4879-b501-ddd8e67ae6c3","year":1999},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.915290Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:a6b979861f5ab2d7ab3a65789d316d3938261c23d2fb65e8cc28ef53f395fa41","observation_id":"2dbd8293-a2fa-40f0-af90-e8f414e3bd4b","resolution":{"observed_at":"2026-08-14T11:48:35.501766Z","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-14T11:48:35.453431Z","title":"Simultaneous image tagging and geo-location prediction within hypergraph ranking frame- work,","venue":null,"work_id":"876d99f0-a5c4-4e7b-ab79-796fe03a1e50","year":2014},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:34.966718Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:a2d092c05dd096d8a7c3ccb50c675ef62f9e267c1791810b8462e2e43c91ab54","observation_id":"50ab64f5-f8aa-4950-a922-e4377c595967","resolution":{"observed_at":"2026-08-14T11:48:35.464022Z","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-14T11:48:35.426470Z","title":"Learning with hy- pergraphs: Clustering, classification, and embedding,","venue":null,"work_id":"266e5314-e159-44e2-acdc-05ca9a1df1f3","year":2007},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:35.043632Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:3f352396e56ca21e1484799741941e409d84317a062377f943655f9cf0f1812f","observation_id":"282f794a-8f16-4d3b-8626-0b3014261ecd","resolution":{"observed_at":"2026-08-14T11:48:35.433846Z","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-14T11:48:35.319569Z","title":"Higher order learn- ing with graphs,","venue":null,"work_id":"84c7ddb3-51b0-4095-8d66-fed3133ae86d","year":2006},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:35.052398Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:a44eaf54ff9f3a4a77ced50f1c90294f9b7d908338c106c1cae04cb2ef1241bb","observation_id":"7b775f72-8e5d-49a7-af40-6c6c5978206b","resolution":{"observed_at":"2026-08-14T11:48:35.367322Z","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-14T11:48:35.288839Z","title":"Learning with local and global consistency,","venue":null,"work_id":"84b38b65-a5a5-46bb-a33d-d0b7fcefb66b","year":2004},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:35.067514Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:d93b150863d88e868477bac66412cdc8b599f4867bc0bb0e5739f016b08d4058","observation_id":"ef8952ce-f22c-4adc-bbd1-adedaf036fac","resolution":{"observed_at":"2026-08-14T11:48:35.297532Z","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-14T11:48:35.265207Z","title":"Music recommendation by unified hypergraph: Combining social media information and music content,","venue":null,"work_id":"6aca0110-7129-4951-a8b2-c0054c915df2","year":2010},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:35.074314Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:e496994bc62abac7dbf0f561ff3cf6e34a3089c9ae2d0b256643e70a43136ff1","observation_id":"8f27a1fc-4b23-460e-ac59-781ec0a6621e","resolution":{"observed_at":"2026-08-14T11:48:35.271695Z","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-14T11:48:35.235321Z","title":"Barrett, M","venue":null,"work_id":"6c458834-0c8a-4f70-82e1-507a40408612","year":1994},"citing_paper":{"arxiv_id":"1908.08281","last_updated":"2019-08-22T09:41:04Z","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T11:48:35.081298Z"},"links":{"citing_paper":"/paper/1908.08281"},"observation_digest":"sha256:7a71fb582598524f5b4828d23f625494a7b9cc3e02c7d3d22f8eda0586ad9fbc","observation_id":"309b94b1-1ab6-4737-8c00-b5783873b894","resolution":{"observed_at":"2026-08-14T11:48:35.245300Z","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.08281","last_updated":"2019-08-22T09:41:04Z","latest_version":1,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-16T12:02:50.675201Z","submitted_at":"2019-08-22T09:41:04Z","title":"Block Randomized Optimization for Adaptive Hypergraph Learning"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":23},"total_outbound_references":25},"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 25 of 25 outbound references and 1 inbound Pith citation observation for arXiv:1908.08281."}