{"as_of":"2026-08-08T07:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f2a029f3c97baa3227dc5a51985e999ecee3d3f9ee6f2bce5d1cd01accbef2e9","coverage":[{"denominator":87,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":87,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:25:21.407031Z","state":"measured"},{"denominator":87,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":87,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2506.07747/citation-record","integrity":"/paper/2506.07747/integrity","json":"/paper/2506.07747/citation-record.json","paper":"/paper/2506.07747"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:25:20.982799Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:20.982799Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:e6485c95396c4f47b0e45cdc58b242b48c062ba08e8749d1d21506f0f1c8bcde","observation_id":"4ad8d4f2-f712-47bb-8079-88bc10f48b42","resolution":{"observed_at":"2026-08-07T10:25:20.982799Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:25:20.989155Z","title":"A spectral algorithm for latent dirichlet allocation","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:20.989155Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:3de388d9165f31dcd11de6f04557d209c8b02f7f165523679ecdde83305287d9","observation_id":"e3c47615-1627-4bee-9ec9-adf3dd8b6fbb","resolution":{"observed_at":"2026-08-07T10:25:20.989155Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:25:20.994175Z","title":"Learning topic models--going beyond svd","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:20.994175Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:68530dfa3d67297ce349b260025e7ae0f9b07deb69d3858cbf41aa74cd18192e","observation_id":"29c2357d-61c4-4c5b-988c-39afbb690787","resolution":{"observed_at":"2026-08-07T10:25:20.994175Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:25:20.999463Z","title":"A practical algorithm for topic modeling with provable guarantees","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:20.999463Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:2c0431f77f82ee5e60caad195eaa55649d7f7bf41e69363a3933c50487af6d18","observation_id":"0fdd0419-0859-45f6-b819-72ca8001fc1d","resolution":{"observed_at":"2026-08-07T10:25:20.999463Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:25:21.004842Z","title":"Computing a nonnegative matrix factorization---provably","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.004842Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:7538ad8fc61ca462314d64d9dcf42322c91aa155dfc0a846a5dd4bc82d2a769e","observation_id":"cb813d30-39a6-4074-827f-6968f9aa21fc","resolution":{"observed_at":"2026-08-07T10:25:21.004842Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:25:21.010051Z","title":"Provable algorithms for inference in topic models","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.010051Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:0bd188cf0c3ae40d78cfe834d66cd8cccec5077d5d5afd0972e9f819a510a5ef","observation_id":"6470da66-78f6-4004-b8af-fa5140600b7e","resolution":{"observed_at":"2026-08-07T10:25:21.010051Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:25:21.015588Z","title":"Learning topic models provably and efficiently","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.015588Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:40aa12cc080282e33bde6b1ead003150e1eed76c14fe16114a3227f5645da3fb","observation_id":"5ebd203b-401f-4dd1-a8ce-36372c1a1ebc","resolution":{"observed_at":"2026-08-07T10:25:21.015588Z","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-07T10:25:22.717631Z","title":"Text algorithms in economics","venue":null,"work_id":"81ff2259-db39-4499-bcfa-7c54ea1d5413","year":2023},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.021504Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:cbfc74937eab32fe5da38206c280016f31a97696b3451323543b3e85bdd0cf79","observation_id":"11be00dc-5715-4b6a-8779-b3ef0681a675","resolution":{"observed_at":"2026-08-07T10:25:22.723876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.697669Z","title":"Naive feature selection: Sparsity in naive bayes","venue":null,"work_id":"8c8cc9b6-8873-4876-92df-f99f51018780","year":2020},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.026936Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:df35d013723b97b5340f2481fda457327d29b608e22497bd312ea037449514d8","observation_id":"3e477dc4-bf2f-4e59-893b-b23164f883c8","resolution":{"observed_at":"2026-08-07T10:25:22.703057Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.680350Z","title":"The adaptive complexity of maximizing a submodular function","venue":null,"work_id":"7259a088-94e7-45bb-b19d-d77a2108a127","year":2018},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.031196Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:5b8ac87a48e4395f842a0747acf14697599553c2e0a5c91337bded285a6ab372","observation_id":"fa3bae8c-cb24-40ee-8d29-316c8a5b6f99","resolution":{"observed_at":"2026-08-07T10:25:22.685890Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.661862Z","title":"An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model","venue":null,"work_id":"44ebc4d8-fe94-49cd-916d-4292090e4d59","year":2019},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.035559Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:0536f39ef0474d04091ee739ae968ae94fad557baf0806aa29d33c1dd3caa3a0","observation_id":"67d177ce-23a7-4745-97fd-94e549bba4ff","resolution":{"observed_at":"2026-08-07T10:25:22.667192Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.645315Z","title":"Who leads? who follows? measuring issue attention and agenda setting by legislators and the mass public using social media data","venue":null,"work_id":"6e4e7042-da0b-45e8-9696-fa5ed073ae2e","year":2019},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.040885Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:dd8780590cbabbf1ff79b21620697a40f0f2a9de303edf4383bd8f6676749866","observation_id":"fa5b2bc0-6dde-4bc9-a4fc-a4cbf236cbd5","resolution":{"observed_at":"2026-08-07T10:25:22.650263Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.15585","last_updated":"2025-04-30T13:14:10Z","snapshot_observed_at":"2026-08-01T17:42:41.008109Z","submitted_at":"2024-02-23T19:52:09Z","title":"Inference for Regression with Variables Generated by AI or Machine Learning","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.15585","snapshot_observed_at":"2026-08-07T10:25:21.045567Z","title":"Inference for regression with variables generated by ai or machine learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.045567Z"},"links":{"cited_paper":"/paper/2402.15585","citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:237198ec00ec0269677921ce3d2400134767f8940ffa256903a75b2259ec5563","observation_id":"be79dd15-a58b-4076-ba7d-8b0ae0912402","resolution":{"observed_at":"2026-08-07T10:25:21.045567Z","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-07T10:25:22.629779Z","title":"Revolving door lobbyists","venue":null,"work_id":"c0b6c4d8-5a62-4e6c-8752-0fd272bb5d23","year":2012},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.051717Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:ffea93e08059fafd363c68d0b15edcc1c4ff009d40954b393ef49a384610cdd7","observation_id":"1a8e914c-dd84-41aa-863d-a2ca077a4818","resolution":{"observed_at":"2026-08-07T10:25:22.634488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:25:21.056938Z","title":"Latent dirichlet allocation","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.056938Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:521d22d3fd24599f65923f3f40c50754aa6b60bad3113b9d9bcb29cfcb8466db","observation_id":"c6d6df55-ae59-449a-8ce1-fcc6e85ad15c","resolution":{"observed_at":"2026-08-07T10:25:21.056938Z","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-07T10:25:22.605124Z","title":"The fast algorithm for submodular maximization","venue":null,"work_id":"41473e47-e38a-498c-accc-e3c5142fe3ff","year":2020},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.061808Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:bcf97459c1d1af251b3e26d5099025b31afe5f14c9515e110a53ad235401096e","observation_id":"1324373c-6351-4983-a2f1-b1b5b0e95205","resolution":{"observed_at":"2026-08-07T10:25:22.609840Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.591195Z","title":"Business news and business cycles","venue":null,"work_id":"c250187b-f1ae-4dc6-b61a-6fbceb3689fc","year":2024},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.066281Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:4472ac9b231c8d9eb54205735d0cfb87a162c8659620d03acab9fc767e4dc323","observation_id":"11e826fe-2709-4751-a190-9ee3e9a3602c","resolution":{"observed_at":"2026-08-07T10:25:22.595403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.575740Z","title":"From pork to policy: The rise of programmatic campaigning in Japanese elections","venue":null,"work_id":"a1d8fb9a-5252-4c3a-94df-afe8a93d1a19","year":2016},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.070975Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:3914aaf234e40951b11b791cd9efa9d6d1e9c8410432623fa10c1ac288b5fb32","observation_id":"def4f4e4-a7e9-465b-9d3a-8e65f9f7a4bb","resolution":{"observed_at":"2026-08-07T10:25:22.580897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:25:21.075815Z","title":"Reading tea leaves: How humans interpret topic models","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.075815Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:bba27c02d2cb114c2ef4abef276064edfa98f0fb75b59cbf3438fa82681c0988","observation_id":"6fd7f383-bcc0-4c2a-9a63-8d1f9d7b1e1f","resolution":{"observed_at":"2026-08-07T10:25:21.075815Z","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-07T10:25:22.546152Z","title":"Submodular function maximization in parallel via the multilinear relaxation","venue":null,"work_id":"86806f63-de37-4e58-8347-4cf20f28a893","year":2019},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.080960Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:c61c9edfe2c70c1826e4ada9c70e30c4e6ddc8e5a785fcee1ac00fa0cbb424b2","observation_id":"c198c5e0-ba06-479b-bfb5-ca5692195bfe","resolution":{"observed_at":"2026-08-07T10:25:22.551467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.530659Z","title":"Marginal likelihood from the gibbs output","venue":null,"work_id":"5bf0ba4b-1731-45bb-8ff6-a64b1a9ed20b","year":1995},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.086121Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:1a8ab35db03eddb26c5c0cf88ec6b753f44b910bfcf4a5aa05383f902ca969f6","observation_id":"c2a38049-efcf-418f-905d-543ffe15c0c4","resolution":{"observed_at":"2026-08-07T10:25:22.535590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.515381Z","title":"Topic modeling in embedding spaces","venue":null,"work_id":"9c2878b5-defa-489c-ae1b-9d666a2b813a","year":2020},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.091003Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:573b1a2c943e20ced2183e8f9ac165403f0a77a948357891d844b7b974878496","observation_id":"a0531849-18a6-49be-a07b-b18aac445467","resolution":{"observed_at":"2026-08-07T10:25:22.519785Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.501026Z","title":"Pitch perfect: Vocal pitch and the emotional intensity of congressional speech","venue":null,"work_id":"ed961b2d-a1c3-4023-b760-795c4e5b01cf","year":2019},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.095760Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:33dedf7a87afbc674774a5b52538131c61d1a177c85ad3a30822f6e6cbbf3f41","observation_id":"660f08b0-9d8f-4cbc-bdc2-5e7fa508b7f7","resolution":{"observed_at":"2026-08-07T10:25:22.505418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.486331Z","title":"Persuasion through slanted language: Evidence from the media coverage of immigration","venue":null,"work_id":"c2baa774-0fc5-4177-a217-7700a5afb6fb","year":2023},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.100983Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:3cf7af1a55e52a89a5a6b86a297702547d930d9cf5d142e1712ef73c8ab0670f","observation_id":"533798ae-1c6d-423c-9ec3-01c299214f6e","resolution":{"observed_at":"2026-08-07T10:25:22.490827Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.468928Z","title":"Graph-sparse lda: a topic model with structured sparsity","venue":null,"work_id":"3c43f9a3-93b2-4961-999e-4ae9463a66db","year":2015},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.106998Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:ae72813448f4df3a9678dec485f556b950f3f61312656a19c5ec177079ad01d7","observation_id":"f6c13009-3702-45fe-bb55-986efc673540","resolution":{"observed_at":"2026-08-07T10:25:22.474185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.452808Z","title":"How to make causal inferences using texts","venue":null,"work_id":"5f05085e-5cdd-4b36-909e-1c150b7e0faa","year":2022},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.111605Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:6de3fbaee203432f419f7ccaa9c7103b3d17ec0a58558af4de163a15bebcdc2c","observation_id":"f9b0830d-1026-4cf1-8dae-ad5e898c66ba","resolution":{"observed_at":"2026-08-07T10:25:22.457699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.436960Z","title":"Submodular maximization with matroid and packing constraints in parallel","venue":null,"work_id":"6cafbf21-1476-474a-9195-333ca99264dc","year":2019},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.117032Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:9571df2b2a5abd545ebbd1e5126c8d26c2fab0995fbfc3e2e0d9836bf64c76fe","observation_id":"4ea29c95-382a-4f22-969f-15de121fdabf","resolution":{"observed_at":"2026-08-07T10:25:22.441769Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.05964","last_updated":"2023-02-03T00:29:28Z","snapshot_observed_at":"2026-08-08T00:24:00.105078Z","submitted_at":"2020-04-13T14:35:28Z","title":"Keyword Assisted Topic Models","version":3},"cited_work":{"arxiv_id":"2004.05964","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.05964","snapshot_observed_at":"2026-08-07T10:25:21.505142Z","title":"Keyword Assisted Topic Models","venue":"cs.CL","work_id":"5fb9cb12-a6bf-4dae-8ca3-31c989a054f7","year":2020},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.122188Z"},"links":{"cited_paper":"/paper/2004.05964","citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:edfa33f0a414136be1ec2196daa06c3c0ef943db508d1f1bdb06a8393573b946","observation_id":"78c80b79-4857-4008-b252-39774a19bddd","resolution":{"observed_at":"2026-08-07T10:25:21.511087Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.420701Z","title":"Submodular maximization with optimal approximation, adaptivity and query complexity","venue":null,"work_id":"3be43144-af17-43ff-a67b-95c6a609ce8c","year":2019},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.127582Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:440436ae30a291438a0451b83b845b9e16b9e48a7c7fb5bf420b50391b40ba8e","observation_id":"2eeca873-7713-4c40-bb77-efd94e12a8eb","resolution":{"observed_at":"2026-08-07T10:25:22.425831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.404557Z","title":"Causalm: Causal model explanation through counterfactual language models","venue":null,"work_id":"8c35fbee-d46d-49bc-aed5-77a57e2ff16b","year":2021},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.132244Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:55b75576598b8ad0b18a107a8c5757fae69af709c6345356d40e8566beb3416b","observation_id":"d5526316-65ad-4440-8684-eefd30ae794c","resolution":{"observed_at":"2026-08-07T10:25:22.409558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.389310Z","title":"Causal inference in natural language processing: Estimation, prediction, interpretation and beyond","venue":null,"work_id":"58bed63e-d9f1-441d-bc85-1a2baf51b616","year":2022},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.136624Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:75cea9ea3be367c72e175358b32e147172f74f83309948e6f3a4562d297212a6","observation_id":"3928f286-e35b-4c9a-bf27-9f7435fca7aa","resolution":{"observed_at":"2026-08-07T10:25:22.394034Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.372403Z","title":"Discovery of treatments from text corpora","venue":null,"work_id":"00ed277d-8bad-47e8-b2b8-56922e53bb24","year":2016},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.142070Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:7a8832994e4e0905a6c999a56b49f6d4f5eb9fc528dcf70847e2d526e2faec09","observation_id":"852deaa7-b2dd-4ee1-bc66-89696e47d71c","resolution":{"observed_at":"2026-08-07T10:25:22.377340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.356305Z","title":"Causal inference with latent treatments","venue":null,"work_id":"478d1954-8ac3-4aa5-9fb6-65b8bbf40cff","year":2023},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.147931Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:88175c587536b7c3508b0c52436a4b3b449493ce91008d6f5dad051f634de2e1","observation_id":"17d448c9-d5db-4c58-bd4a-d227a33df137","resolution":{"observed_at":"2026-08-07T10:25:22.361467Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.339642Z","title":"A network approach to topic models","venue":null,"work_id":"8bd21716-7272-45e0-aa4a-fe2e0aedd2e9","year":2018},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.152239Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:8958f54f8e47fcc1a40e089ca3d1de2d6dcff9f92a656ee5c5fd2aeb31c6645f","observation_id":"d8d22c7e-d797-4cd2-9362-c66d7b2ebb6f","resolution":{"observed_at":"2026-08-07T10:25:22.344964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.319064Z","title":"Budgeted nonparametric learning from data streams","venue":null,"work_id":"3ae96e63-ab40-4b94-98d1-7e878b6e656e","year":2010},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.157296Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:9de52d2ef33556b4315deb398f96817e07119aa2ef3536d7a642df13a51a0649","observation_id":"95062290-7d6b-496d-b430-f81ec6cb538a","resolution":{"observed_at":"2026-08-07T10:25:22.324517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.303327Z","title":"Finding scientific topics","venue":null,"work_id":"bbd1b42c-bb69-4f40-a7b9-aad38a2afd88","year":2004},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.163559Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:a3b5898370090c52cb9cc73bfcbd9dd3ccd90e4c6a69fb2e2d0a4848df2784f1","observation_id":"675967ec-2065-4336-88bc-6c18c04a3012","resolution":{"observed_at":"2026-08-07T10:25:22.307906Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.287636Z","title":"Text as data: A new framework for machine learning and the social sciences","venue":null,"work_id":"5c4ff253-23cf-42d2-9053-22c9524b52f5","year":2022},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.168528Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:bc0504f56091d1737944dd7bd1c2ee8cfedb4dee2b8eea91ce18749a3e83d79e","observation_id":"43256a62-3bdf-4ed8-88c5-2163689d3213","resolution":{"observed_at":"2026-08-07T10:25:22.292828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2203.05794","last_updated":"2022-03-11T08:35:15Z","snapshot_observed_at":"2026-07-06T12:46:41.057346Z","submitted_at":"2022-03-11T08:35:15Z","title":"BERTopic: Neural topic modeling with a class-based TF-IDF procedure","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.05794","snapshot_observed_at":"2026-08-07T10:25:21.172984Z","title":"Bertopic: Neural topic modeling with a class-based tf-idf procedure","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.172984Z"},"links":{"cited_paper":"/paper/2203.05794","citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:02c9a05a16d1d5b7989ec29741061153d26ad1c0e501a8de3b5d5f9f8d6f70cf","observation_id":"f0925e9f-eb3a-415c-a00e-5f76d2466aeb","resolution":{"observed_at":"2026-08-07T10:25:21.172984Z","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-07T10:25:22.269806Z","title":"Near-optimal sensor placements in gaussian processes","venue":null,"work_id":"0e688926-37e7-4a45-b683-d645c93d1d62","year":2005},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.178793Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:0ae3d601ca766ce0b51bda8003f738ba03b0f638ca5f18043937abbd022beb36","observation_id":"12dbb83d-978d-42aa-8798-c284e3ef2c80","resolution":{"observed_at":"2026-08-07T10:25:22.276485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.253885Z","title":"Studying the history of ideas using topic models","venue":null,"work_id":"f815c203-1deb-48a1-b288-717e9a059ea2","year":2008},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.183025Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:8255d960afed3d0e82adaa46c6754972fc9264f183bac2097edfd3fc4107d7c9","observation_id":"79c1c372-6859-47a1-9063-d4b84dc72f11","resolution":{"observed_at":"2026-08-07T10:25:22.258676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:25:21.187336Z","title":"A causal lens for controllable text generation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.187336Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:a2f49d16e49a64c91922cd61a435c7d950d64f8353e4533faa9b89ac6e5d9ce2","observation_id":"4ca92dfc-7a8a-4b4a-b301-5d2f478801f3","resolution":{"observed_at":"2026-08-07T10:25:21.187336Z","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-07T10:25:22.224825Z","title":"A memoization framework for scaling submodular optimization to large scale problems","venue":null,"work_id":"65ca7f24-a275-4ac3-abc8-30a64d65a739","year":2019},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.191525Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:9ffe47333b4eeec9fc579a4bf5da5832a9160fd66b9f3d4b2908022cddf7bb12","observation_id":"6d6f48c2-116c-475e-8526-ab9719704c98","resolution":{"observed_at":"2026-08-07T10:25:22.229576Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.208421Z","title":"Recent advances in text analysis","venue":null,"work_id":"7c23ced6-627c-47c7-bca4-0ca9d0b20296","year":2024},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.196324Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:3fc095fbb7fa812ee6fbf0668161d5f6df7b41ff06551eb26df40aee0d4c9284","observation_id":"dddc663d-11c8-44ff-b327-117d833d7613","resolution":{"observed_at":"2026-08-07T10:25:22.213379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.192829Z","title":"Scalable greedy feature selection via weak submodularity","venue":null,"work_id":"3a68ad3f-d7b4-427c-a6cf-25028bb58263","year":2017},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.202647Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:c11415ad83c754cf518352c060cb96060691d7e8a8413d47751fa9bb2e2b84b0","observation_id":"1e7302ba-d6eb-41ea-97e0-92e4de238da8","resolution":{"observed_at":"2026-08-07T10:25:22.197430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.175696Z","title":"Newsweeder: Learning to filter netnews","venue":null,"work_id":"3a259411-50c6-4026-8689-4b89f2b1552f","year":1995},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.207324Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:0788dfba309817f0bcafb94423f2a3a7aedef8420152aa8348b71c0d124a9899","observation_id":"91b951eb-21a0-4da0-b087-0500615aa4ea","resolution":{"observed_at":"2026-08-07T10:25:22.181135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.157393Z","title":"Machine reading tea leaves: Automatically evaluating topic coherence and topic model quality","venue":null,"work_id":"fd5fd896-a6f8-4be5-b816-b9b423785b27","year":2014},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.211468Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:9bd47e26bfeef59940c1c1ff81e66c2f6142c5c789cc34bda7b02832686daeab","observation_id":"e4fc7246-2be1-4090-a0ae-e544b9461c5e","resolution":{"observed_at":"2026-08-07T10:25:22.163392Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.140037Z","title":"Scaling politically meaningful dimensions using texts and votes","venue":null,"work_id":"75491747-cb88-4884-9cf8-60b26c31eea7","year":2014},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.215551Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:b2c79a4c2e21e32b94f9486fc31ee526c748457ef6505ddebaad240a0e2f79d7","observation_id":"6aaffa5f-f75d-4b65-a3f1-0ed60e08ff5f","resolution":{"observed_at":"2026-08-07T10:25:22.144645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.124931Z","title":"Reuters-21578 text categorization test collection","venue":null,"work_id":"a97f80e0-95da-488d-be2c-4146f7092dbd","year":1997},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.220475Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:9eff7b67f0f951585518dc6670cd7eded448433e79b87b7fe08167e88722a508","observation_id":"ee7079b6-25b8-44a6-92e5-6e1bbeb5d50c","resolution":{"observed_at":"2026-08-07T10:25:22.129812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.109032Z","title":"Pachinko allocation: Dag-structured mixture models of topic correlations","venue":null,"work_id":"e4497621-76ee-4b6f-99cb-5c70bab39bde","year":2006},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.225622Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:9acb1f4157dbb64c1656414c0cd1cfdf4f4ba878fbea1b550f75de835995f263","observation_id":"099af9a6-24cc-4bb6-8cba-fffa37d2c997","resolution":{"observed_at":"2026-08-07T10:25:22.113974Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.093450Z","title":"A class of submodular functions for document summarization","venue":null,"work_id":"e5cde663-ca54-4e46-8931-ace1ccc4ed5e","year":2011},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.230043Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:2bd4763c9bfde22d9a82fc6b7554b7ab0d90ecaf637c2067312b8da7c97b206a","observation_id":"9b17c8d9-49ab-4f44-a77b-eaba64373df6","resolution":{"observed_at":"2026-08-07T10:25:22.098244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.077282Z","title":"Leveraging sparsity for efficient submodular data summarization","venue":null,"work_id":"3936334b-dffe-4ee6-8897-239313e6eb63","year":2016},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.234733Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:8a799af96cf280334403906f9c851869a0d91719c7ae9b0e112b723fc5f1feee","observation_id":"b9a47ad8-1b83-48a4-bc3e-38b3eb78e77e","resolution":{"observed_at":"2026-08-07T10:25:22.081946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:25:21.240097Z","title":"The mythos of model interpretability: In machine learning, the concept of interpretability is both important and slippery","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.240097Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:785f47d52aec2d5ee2d250f0f5f7704ad43030b5cd566f5e086c9cc790ecf1fd","observation_id":"8f8e498f-dd5c-427b-800e-074056e11469","resolution":{"observed_at":"2026-08-07T10:25:21.240097Z","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-07T10:25:22.046981Z","title":"Entropy-rate clustering: Cluster analysis via maximizing a submodular function subject to a matroid constraint","venue":null,"work_id":"7e910fc5-4592-4cc9-ac17-50ed2035f97e","year":2013},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.244423Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:86bdc2d1a96c693e2ca9e967f8d5911a8497fe3e86d2124bd1b1167d29db5748","observation_id":"14013c79-bd75-403d-b09b-4c4fabd1929a","resolution":{"observed_at":"2026-08-07T10:25:22.052983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.031557Z","title":"Artificial intelligence act","venue":null,"work_id":"3f367b5a-883f-4800-ad8b-8285bc733e11","year":2021},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.249069Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:258f07b2c05ef1336f6069dba4480477e926dedf0e3020d608c03d6c6af50f8f","observation_id":"dfbed58f-a377-4d06-8fef-0bc9767ca5f8","resolution":{"observed_at":"2026-08-07T10:25:22.036319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:22.016776Z","title":"Local news and national politics","venue":null,"work_id":"8e8674d9-d11e-497e-8edd-7202e7f5ad87","year":2019},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.253375Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:07cd01c061bd462860b3ded15ab05569e3ab0641a85755d8aaba0c3da3186b76","observation_id":"bef40a68-497f-46dd-bad0-72671dfa8c4d","resolution":{"observed_at":"2026-08-07T10:25:22.021374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.999782Z","title":"Mallet: A machine learning for languagetoolkit","venue":null,"work_id":"06baee72-aaa0-4edd-a803-26be342b5dc0","year":null},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.258228Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:f9494b05164ff28dace2f29cbb4428d97a7fc3365e2ef37877c5e9f0ce9fbd0b","observation_id":"5165a747-decd-412d-914a-edc0c7eae997","resolution":{"observed_at":"2026-08-07T10:25:22.004798Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.982483Z","title":"Optimizing semantic coherence in topic models","venue":null,"work_id":"75ec87cd-543d-4004-be42-693f90d46c93","year":2011},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.263008Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:7ff474cd6f0d8e2f7f7d47dbafecb0c57be682c03b3cbf50003aafd7b55b14b3","observation_id":"d413c33f-f72e-4b9c-a831-9109b5e14340","resolution":{"observed_at":"2026-08-07T10:25:21.987567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.966865Z","title":"Accelerated greedy algorithms for maximizing submodular set functions","venue":null,"work_id":"dc46dbd6-8708-4d1a-b0e8-3a3e630ec89e","year":1978},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.267312Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:6a083277b965f722d454e0d40a0794ff83d3494551bccb5d1a0143973d9b3cf2","observation_id":"2048e5dd-4174-4981-8520-72f145cf455c","resolution":{"observed_at":"2026-08-07T10:25:21.971318Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.951854Z","title":"Distributed submodular maximization: Identifying representative elements in massive data","venue":null,"work_id":"cdad1ff7-07bb-44e6-9929-68a4c26c5b27","year":2013},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.272690Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:32f8219472c7a318abeae0e33e61ff6b9ed42d40ac26f3c0e6757e56207aacf9","observation_id":"6a47840b-0875-4087-9e83-ca7f3b5301c1","resolution":{"observed_at":"2026-08-07T10:25:21.956499Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.936756Z","title":"Lazier than lazy greedy","venue":null,"work_id":"64e11c00-fe94-4866-9245-8f5d64d619a2","year":2015},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.278400Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:3aa4e0b1ac501cf667dfedc4120c9b4114e251eb8caa83f265674b377a2f3f89","observation_id":"94ecd771-8bc4-4a94-90c0-f4e03ed845b4","resolution":{"observed_at":"2026-08-07T10:25:21.941217Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.920641Z","title":"Fast constrained submodular maximization: Personalized data summarization","venue":null,"work_id":"78b49692-1500-4939-afb5-f2cedc9c80bb","year":2016},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.283049Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:aa8182124404a238aeaeaa39b408fff799d6c146f297c08ebef691ea1f110413","observation_id":"c1288cb1-e4f7-4041-8869-21f1d1cea471","resolution":{"observed_at":"2026-08-07T10:25:21.925732Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.00725","last_updated":"2025-03-02T04:36:27Z","snapshot_observed_at":"2026-08-07T17:36:29.221876Z","submitted_at":"2025-03-02T04:36:27Z","title":"Causal Inference on Outcomes Learned from Text","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.00725","snapshot_observed_at":"2026-08-07T10:25:21.289809Z","title":"Causal inference on outcomes learned from text","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.289809Z"},"links":{"cited_paper":"/paper/2503.00725","citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:7ee5f183a0ba476e0a6e2f5b8a186580e3f9448ed50ce93fbd2057a33d99eef4","observation_id":"6161049f-fd2a-4838-b922-9baf113e01fe","resolution":{"observed_at":"2026-08-07T10:25:21.289809Z","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-07T10:25:21.903638Z","title":"Reading between the lines: Prediction of political violence using newspaper text","venue":null,"work_id":"43773bc9-0a00-4cca-8b31-2137573fcfd9","year":2018},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.295017Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:9b83fe49298b84895a6190c6741e8e44704038d830e7d2946f984396fb2f2d93","observation_id":"f4a4a8a5-3ba6-48e1-86d2-1cc83fe7ee44","resolution":{"observed_at":"2026-08-07T10:25:21.908673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.889205Z","title":"Best algorithms for approximating the maximum of a submodular set function","venue":null,"work_id":"2309b102-ae8d-4771-a844-e85a65e26af4","year":1978},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.299688Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:21c94e19e6874fb95cef997fd9e10334de96742f6cefce20fa6dc3fd36efd3b0","observation_id":"241fa533-4f6c-4e9f-b270-30b70033ec1d","resolution":{"observed_at":"2026-08-07T10:25:21.893770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.870512Z","title":"An analysis of approximations for maximizing submodular set functions—i","venue":null,"work_id":"58403f44-7049-4bb4-9b31-89dd98ca244c","year":1978},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.304150Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:b6545d7d6d96a87136e3468ff793fac047a2066382f40508c9ee9ca8fe7b3e45","observation_id":"add8d94e-c0c6-41aa-b56f-4d500496174a","resolution":{"observed_at":"2026-08-07T10:25:21.877949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.853047Z","title":"Approximate bayesian inference with the weighted likelihood bootstrap","venue":null,"work_id":"2b84c04f-0672-4867-a674-2d116d8d8494","year":1994},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.308852Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:2d546cb57965e3ba3f5cf4d17872cfb5a08101d12bf392f3167d44f30e02a576","observation_id":"d40ad743-2f0e-4c91-a5b1-6f5790a2b354","resolution":{"observed_at":"2026-08-07T10:25:21.858160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.837609Z","title":"Concealing corruption: How chinese officials distort upward reporting of online grievances","venue":null,"work_id":"ca3c94d8-bae5-4cb8-af98-b9b078fd986f","year":2018},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.313701Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:5c11e0ff6fd7802da15b319f0bb7aee66bc8b882bee29b13c92ab1dd7c21f64f","observation_id":"c4d5130c-bfcc-4f7e-8eb3-b0b1661b41da","resolution":{"observed_at":"2026-08-07T10:25:21.841971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:25:21.318729Z","title":"Causality","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.318729Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:ea95506d2402a91d2f571d756c6edeb19241e2b3a1b71ca7080fe39d24a3f923","observation_id":"6c3b3407-8a8f-4a82-a43b-310177407acb","resolution":{"observed_at":"2026-08-07T10:25:21.318729Z","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-07T10:25:21.810934Z","title":"On the unreasonable effectiveness of the greedy algorithm: Greedy adapts to sharpness","venue":null,"work_id":"891143af-c1a2-44f6-af72-b01cdd8ffb18","year":2020},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.323427Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:c1644de7c540c12cc0b43964ada3be0bae58b9fbccb403cdf4e9491adaf1ec36","observation_id":"e9364907-6fc0-4c78-9d79-207316b3a485","resolution":{"observed_at":"2026-08-07T10:25:21.815650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.795544Z","title":"Fast parallel algorithms for statistical subset selection problems","venue":null,"work_id":"1450da89-fdd9-4b2e-ad6f-2fbf858b178e","year":2019},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.327933Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:15497937bae587053d4edb911041cdd864909b7cd902cb38e3554edb11abbd74","observation_id":"1905ee07-5adf-4eb2-b415-e33c10206c93","resolution":{"observed_at":"2026-08-07T10:25:21.800178Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.778769Z","title":"Exploring the space of topic coherence measures","venue":null,"work_id":"ef2b33f2-bd8f-4369-806d-bc3ae469d7e3","year":2015},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.332455Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:45d729f2148a7ff702f8030a90f73ff011e66618a3c33a33e43141197b465fe9","observation_id":"e758e3c9-3d3e-44ef-94a6-d42c408b8dac","resolution":{"observed_at":"2026-08-07T10:25:21.784571Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:25:21.336475Z","title":"Estimating causal effects of treatments in randomized and nonrandomized studies","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.336475Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:e0655b2f075b91c62f468c89d31b81dd0a44047a43614e94d5752f5f967ecc9b","observation_id":"8005c079-6d58-4882-bc80-9bebeed33092","resolution":{"observed_at":"2026-08-07T10:25:21.336475Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T10:25:21.340897Z","title":"Randomization analysis of experimental data: The fisher randomization test comment","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.340897Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:9c728a7ce6522b1872fa2429fa09b831836862506ac81928e309c54030cde85b","observation_id":"ac853ece-ef05-44f9-b6b1-81f71597e3fb","resolution":{"observed_at":"2026-08-07T10:25:21.340897Z","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-07T10:25:21.739959Z","title":"Complexity of inference in latent dirichlet allocation","venue":null,"work_id":"d1e8c5a8-3d9e-4239-9509-43f3953bdab6","year":2011},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.345440Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:0ba3343c2a2a855a67f7a7abcd9474ea5c52c2600c5932e263b526cee881641f","observation_id":"a9d4b96e-f110-4820-9776-64e6ff9b1f36","resolution":{"observed_at":"2026-08-07T10:25:21.744562Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1703.01488","last_updated":"2017-03-04T16:28:15Z","snapshot_observed_at":"2026-08-07T21:03:29.194887Z","submitted_at":"2017-03-04T16:28:15Z","title":"Autoencoding Variational Inference For Topic Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.01488","snapshot_observed_at":"2026-08-07T10:25:21.350193Z","title":"Autoencoding variational inference for topic models","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.350193Z"},"links":{"cited_paper":"/paper/1703.01488","citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:1e80d96388223c90e27633d39fcc273a21e0600bfe0a7ebd059afae58cc1f7f9","observation_id":"35ed5d69-0e9d-4a7d-8485-bb63ad387d70","resolution":{"observed_at":"2026-08-07T10:25:21.350193Z","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-07T10:25:21.723858Z","title":null,"venue":null,"work_id":"1079a9e1-09c1-48f9-9771-f9d38b4a181d","year":2021},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.355668Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:eecd29e236f56f72620ae0ac1fca638f7b60bfcdcd868fb53e4f11cb18dc88f4","observation_id":"de7771b2-4509-4921-a88b-00b94773ccdf","resolution":{"observed_at":"2026-08-07T10:25:21.728123Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.708094Z","title":"Get out the vote: determining support or opposition from congressional floor-debate transcripts","venue":null,"work_id":"a5de5e28-f2fc-4a94-8d64-191b061ec671","year":2006},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.360435Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:03c6713a2c037f8f051458fa5eed709a968e70d32a8c9fa2ea55a545fd127f19","observation_id":"db33f876-fe73-4a5b-bcce-98d78da4ae92","resolution":{"observed_at":"2026-08-07T10:25:21.712990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.691823Z","title":"Rising power on the mind","venue":null,"work_id":"a567f83f-7e48-4d45-99e3-9b5fb6a5a344","year":2017},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.365140Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:ec794bbd7a3c3cb5d6956c7af8fa28c780175010c18e0dad9288bbebe1345631","observation_id":"02653d06-408c-48b1-902f-497bf8bb8e23","resolution":{"observed_at":"2026-08-07T10:25:21.696353Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.675429Z","title":"Adapting text embeddings for causal inference","venue":null,"work_id":"95e902c4-dcf9-4c0b-9968-f832734130c7","year":2020},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.369667Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:27c2a404b9085bb59a42b19caa0b1bed929b4b6b6f573785097ebbb7250b86ba","observation_id":"733946b9-61a3-4895-b4c7-ae9dac28d480","resolution":{"observed_at":"2026-08-07T10:25:21.680407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.654374Z","title":"Rethinking lda: Why priors matter","venue":null,"work_id":"d34a6fb8-52c4-4c1c-9e8a-2e9c2af2ed55","year":2009},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.374288Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:df583099ee6b7027b25ea4d23e2892801a2e3303ee030a54d4e5efab405160c7","observation_id":"e03c5d8d-9fa4-483b-aa0c-54e97f13f072","resolution":{"observed_at":"2026-08-07T10:25:21.662495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.637609Z","title":"Evaluation methods for topic models","venue":null,"work_id":"73c5a4b1-edc6-47d5-bb6a-17b16c86bde8","year":2009},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.378965Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:0faf3f9c145e9fde27519b726798b52f1f0f55c76e36325e405d77aadab83cb5","observation_id":"c9507b90-b954-4611-9b63-2bb860ee5737","resolution":{"observed_at":"2026-08-07T10:25:21.642612Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.621356Z","title":"Structured topic models for language","venue":null,"work_id":"5c96d3f6-fbc5-4b0c-be2f-1283bf8452c2","year":2008},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.383914Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:9a8935294e25a8de1c0046ce340f6c770541db6a74929e801322356da91fc614","observation_id":"d282e565-f041-4cb0-a0d9-110f05d50839","resolution":{"observed_at":"2026-08-07T10:25:21.626179Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.605014Z","title":"Effective neural topic modeling with embedding clustering regularization","venue":null,"work_id":"d59b29a5-7377-4646-89d3-5bb50d884867","year":2023},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.388480Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:5f94748c9cfcb6161db9b44e8fdad0471521f64be1600b7ae61c56e5a71786b6","observation_id":"2f3918d8-01a5-4ab6-a28b-ab31c3217aa5","resolution":{"observed_at":"2026-08-07T10:25:21.609609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.589734Z","title":"A survey on neural topic models: methods, applications, and challenges","venue":null,"work_id":"901e98c7-a19b-4564-8614-1f9b8c4cd404","year":2024},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.393298Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:1de311fda4278c872b62f359c23ab3239fbfd562017d9e304172e7827fb6f747","observation_id":"d93f3393-e557-4aca-aba3-7a1e05be9494","resolution":{"observed_at":"2026-08-07T10:25:21.594248Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.573303Z","title":"Fastopic: Pretrained transformer is a fast, adaptive, stable, and transferable topic model","venue":null,"work_id":"14ff44bc-ad50-4c00-b248-bc9d0621225d","year":2024},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.398329Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:08b893e039c01991b88ba80ff9b6cff2169103870aa00d30112135e17a656459","observation_id":"cc918d1f-9386-4446-b255-1c90584e0471","resolution":{"observed_at":"2026-08-07T10:25:21.577984Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.556309Z","title":"Towards the topmost: A topic modeling system toolkit","venue":null,"work_id":"6aeebc44-2706-4f0b-a770-5bbae38936b5","year":2024},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.402782Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:6d2934998011bc1e62cc83092e47957339ab9f69f1245fedc9d601eb1ec6c789","observation_id":"e86b010e-9673-418f-b9db-dbc257b0752d","resolution":{"observed_at":"2026-08-07T10:25:21.561737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T10:25:21.539220Z","title":"Topics, concepts, and measurement: A crowdsourced procedure for validating topics as measures","venue":null,"work_id":"2fb58c5a-601c-4ca5-b00a-8f0f812d4b62","year":2022},"citing_paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-07T10:25:21.407031Z"},"links":{"citing_paper":"/paper/2506.07747"},"observation_digest":"sha256:89e6ed17e19cd8aedecd1159489499f84dc35139d885920af2e5441da90f609d","observation_id":"79b1c407-0eb0-42a2-891b-7899bb5b1c3b","resolution":{"observed_at":"2026-08-07T10:25:21.544106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.07747","last_updated":"2025-06-06T07:05:48Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T10:11:06.283797Z","submitted_at":"2025-06-06T07:05:48Z","title":"E-LDA: Toward Interpretable LDA Topic Models with Strong Guarantees in Logarithmic Parallel Time"},"reference_resolution":{"displayed":87,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":1,"verified_fuzzy":67},"total_outbound_references":87},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 87 of 87 outbound references and 0 inbound Pith citation observations for arXiv:2506.07747."}