{"as_of":"2026-08-15T22:08:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1ee7efc9291685716a10955d893ab5e0af682abd03f6bfb89bd926c4bcad116b","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:30:02.138289Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+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/2501.01630/citation-record","integrity":"/paper/2501.01630/integrity","json":"/paper/2501.01630/citation-record.json","paper":"/paper/2501.01630"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:30:02.637078Z","title":"Interpretable predictions for crime categories using log loss approach for imbalanced target feature","venue":null,"work_id":"ce868da6-495b-4638-a25c-7d24399bc93f","year":2024},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:01.981922Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:a3f28ad51a820ba38d0678df79fae384ea54135c4baeb20ae89d4f3c8049e602","observation_id":"c2934d52-fe43-4f07-b11c-dd75c3a67428","resolution":{"observed_at":"2026-08-10T22:30:02.640842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.625887Z","title":"A survey on bert and its applications","venue":null,"work_id":"d39988b9-3ff0-4d58-9988-403953cb3ba4","year":2023},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:01.986293Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:7c4064b1b2fd29a9a81712aa24500ae8277b5cc2cd327bc2ebcfdf81eac717df","observation_id":"38011894-5f14-41ab-9ff2-10cb110593d3","resolution":{"observed_at":"2026-08-10T22:30:02.629811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.615053Z","title":"A gentle introduction to deep learning for graphs","venue":null,"work_id":"c297245d-104d-45e2-be33-5db783e34dd2","year":2020},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:01.990059Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:41fd002e73932c115709b37ba77435ec52d3d7f833673f4a4fa097331bab071e","observation_id":"9682c578-b1bb-4bf7-96c9-e47f8d98059d","resolution":{"observed_at":"2026-08-10T22:30:02.618857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.602931Z","title":"Belle and I","venue":null,"work_id":"7b929637-9544-497a-80fa-c78c7492d404","year":2021},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:01.993902Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:b9ba9ec7b6f390ab068b4b5df8c9e04368784ecfb1858eb6ed1cdd8a60bed76c","observation_id":"666679fc-ef78-4881-92db-55f7642946c5","resolution":{"observed_at":"2026-08-10T22:30:02.606856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.591204Z","title":"Interpretability in deep learning for finance: a case study for the heston model, 2021","venue":null,"work_id":"b54b4ced-a134-460a-b5f9-13ff0fc4e12c","year":2021},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:01.997936Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:e5fc4e85036e3b73b96276710effd346a0a001d4fedd5adbc5710a8320570056","observation_id":"2285788e-c956-4591-b716-0785f99e02f3","resolution":{"observed_at":"2026-08-10T22:30:02.595126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.578829Z","title":"Ap- plications of graph convolutional networks in computer vision.Neural Com- puting and Applications , 34(16):13387–13405, 2022","venue":null,"work_id":"d15b03f9-1a35-4aa2-8cf0-41a1a7bd47ab","year":2022},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.001803Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:07afee7e7033c8e9243cddc6983557f36d344b4f62c96451806f117be36565e6","observation_id":"5c32f46f-f4e3-4e31-8cec-6dabd19c2895","resolution":{"observed_at":"2026-08-10T22:30:02.583103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.567322Z","title":"Carvalho, Eduardo M","venue":null,"work_id":"c3767d2f-9e8e-4e0c-9436-ac7725c6d30d","year":2019},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.006088Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:1c94b7a32f32e9bfaf1fd8d975bc83e0eb85ccc5dcbdff056fd8ad22f6006dfd","observation_id":"8d6fe5bc-c37e-49e5-b293-0d213f3cebf1","resolution":{"observed_at":"2026-08-10T22:30:02.571092Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.556233Z","title":"Feature selection for text classification with na ¨ ıve bayes.Expert Systems with Ap- plications, 36(3, Part 1):5432–5435, 2009","venue":null,"work_id":"d7429b14-8740-4787-9cfd-1ac00da5077a","year":2009},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.009785Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:09702ebacba095eabfb00a0d087a6e96578eefe0d3211ad2516be8d4175e24e0","observation_id":"2f0d4711-0e95-4388-ac28-dbf12ae90d97","resolution":{"observed_at":"2026-08-10T22:30:02.560365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.544185Z","title":"Jackknifing documents and additive smoothing for naive bayes with scarce data","venue":null,"work_id":"34105a19-0cd1-4cb3-9262-091f96df8756","year":2015},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.013738Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:f83a6a895a04036b2481a48dee1b0572186a0427832a8331912a037fcf16e7c4","observation_id":"617cd419-bf95-44ee-910a-f46715b50647","resolution":{"observed_at":"2026-08-10T22:30:02.548278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.533069Z","title":"Bert: Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":"5d55aacd-58ef-4ebc-a3c8-63cbe3c67e90","year":2019},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.017432Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:37c0e09429685562c708c80d4f3625f889632d30580d175648a08df8e444dabe","observation_id":"f1417267-c973-48ac-bcfb-a7f3c87bc2fb","resolution":{"observed_at":"2026-08-10T22:30:02.536727Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.521849Z","title":"A convo- lutional encoder model for neural machine translation","venue":null,"work_id":"d6808e51-2592-4f1c-8887-565629691208","year":2017},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.021444Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:ea8002af7d7e9f99a26729bc399314bd2d5f1aff88db2214be6826b757c76cc3","observation_id":"ea3958a1-ffbf-411a-a6c8-ab06e249243d","resolution":{"observed_at":"2026-08-10T22:30:02.525781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.509277Z","title":"node2vec: Scalable feature learning for networks, 2016","venue":null,"work_id":"94afc30c-fe06-41aa-bbfd-5975a517caeb","year":2016},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.025412Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:bd9e80bb295b6c724ad9f6604c4d232db88ab4e31776c418e3e3707271b83b64","observation_id":"087fe371-6307-4351-86e3-d3f035568c74","resolution":{"observed_at":"2026-08-10T22:30:02.513374Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.497976Z","title":"Hamilton","venue":null,"work_id":"56f3f662-74a9-47f9-9c56-93d09cf523e9","year":2020},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.029133Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:159041e3b6e3712ccec78734a4bad60edf132b46251cf80eec7bf6a680e0beef","observation_id":"2cf2a8a3-7bb8-4f81-9d41-9dff9d43192b","resolution":{"observed_at":"2026-08-10T22:30:02.501749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.485990Z","title":"Hamilton, Rex Ying, and Jure Leskovec","venue":null,"work_id":"d79acac2-2039-4f7d-abc1-8208f5d5da61","year":2018},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.032725Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:3adc651f776c9ba9a91d97a7dea6063a6a0e14c742c1cf54c9f7dd1c142a1814","observation_id":"4271d2e2-61fd-46e3-a910-f9c235dca462","resolution":{"observed_at":"2026-08-10T22:30:02.490229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.036397Z","title":"Open graph benchmark: Datasets for machine learning on graphs, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.036397Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:f5093e5a6805498e22d95b3e67fdfde957aacdb4b38e84e8d37c8538be29ee11","observation_id":"9c0591cc-5260-4b8a-b8b3-144e9390c0d4","resolution":{"observed_at":"2026-08-10T22:30:02.036397Z","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-10T22:30:02.468147Z","title":"Ben- son","venue":null,"work_id":"d0b00b95-7c20-4089-8f6e-9e6b85ceb7d0","year":2020},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.040464Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:261af4654d44b5751a1d91ad53e9ad8e644081d0502ad2007ad17aa56e63fe7a","observation_id":"9b12c9d3-258f-4a62-905b-6ba51ec4ea65","resolution":{"observed_at":"2026-08-10T22:30:02.472063Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.455750Z","title":"Toward online node classification on streaming networks","venue":null,"work_id":"f20fd97f-cf22-41c4-b784-03ff8f66c94d","year":2018},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.044297Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:ba54e76558539b023f42a5fdaa46021764e3c16989e04b3e92b46930764e2ffd","observation_id":"fb8cb583-e472-40ed-948f-95bac15b17d4","resolution":{"observed_at":"2026-08-10T22:30:02.459564Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.443676Z","title":"Anomaly detection with graph convolutional networks for insider threat and fraud detection","venue":null,"work_id":"aa7b2839-981b-400c-a7aa-287f10b7464e","year":2019},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.047859Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:d729c3fca5fbacfcaa70cef09d5ed7e16d2f756fc7d96b84ac5ec592f1b9e1d9","observation_id":"9d2072c7-9c28-4c05-97a9-2408da336c2e","resolution":{"observed_at":"2026-08-10T22:30:02.448517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.432466Z","title":null,"venue":null,"work_id":"465e5ddf-b091-4a58-845d-7f94dfb45519","year":2009},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.051500Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:f06cac2ac7e7271db3e0ba5eafdba3e0ef9cb956c9e8100c09cb38e884d4f49e","observation_id":"3f3894e7-4187-4936-80d2-d0e001bced9f","resolution":{"observed_at":"2026-08-10T22:30:02.436198Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.02907","last_updated":"2017-02-22T09:55:36Z","snapshot_observed_at":"2026-08-13T11:38:10.906031Z","submitted_at":"2016-09-09T19:48:41Z","title":"Semi-Supervised Classification with Graph Convolutional Networks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.02907","snapshot_observed_at":"2026-08-10T22:30:02.055134Z","title":"Semi-supervised classification with graph convolutional networks","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.055134Z"},"links":{"cited_paper":"/paper/1609.02907","citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:4db60f70d09a498ec008236372b05464ecaff9babac5266146f8079488d108a1","observation_id":"b13dd31b-cab7-44a4-a4ca-d52bca1518a5","resolution":{"observed_at":"2026-08-10T22:30:02.055134Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.03751","last_updated":"2019-08-19T12:53:49Z","snapshot_observed_at":"2026-08-14T16:50:20.494749Z","submitted_at":"2019-04-07T21:49:26Z","title":"DeepGCNs: Can GCNs Go as Deep as CNNs?","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.03751","snapshot_observed_at":"2026-08-10T22:30:02.059327Z","title":"Thabet, and Bernard Ghanem","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.059327Z"},"links":{"cited_paper":"/paper/1904.03751","citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:287db2172f2b82a485b954b8bac847f280edd07143cbf865b977550cee0478c8","observation_id":"f3091f10-9246-4af9-bea5-28cc717fa7e2","resolution":{"observed_at":"2026-08-10T22:30:02.059327Z","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-10T22:30:02.063186Z","title":"Deep Learning on Graphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.063186Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:2fe47cc2f5fbc356259986dca96bd7e7b0f70e04a2e1d612d4a00bcb4c2a591d","observation_id":"e3e19fd1-0eba-4ff1-94ae-d8b6c70193ad","resolution":{"observed_at":"2026-08-10T22:30:02.063186Z","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-10T22:30:02.413909Z","title":"Abusive language detection with graph convolutional networks, 2019","venue":null,"work_id":"9b09c5e1-458e-4cbc-a7a0-2d2be73e7eed","year":2019},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.066743Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:e8b3dc4d7cfb113f9a4f446f6e850edf7f84527c6eef82974a82a21e9933c2ee","observation_id":"4fa8e2a8-eaff-429f-a8eb-05a14d20ba96","resolution":{"observed_at":"2026-08-10T22:30:02.417962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.401616Z","title":"Fast and Accurate Sen- timent Classification Using an Enhanced Naive Bayes Model, page 194–201","venue":null,"work_id":"ec49a037-b39b-455b-a4fa-6b7a29d374bb","year":2013},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.070305Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:6def43bce02a59d80a833850cda32f2125e57cff6ec838ea7726c88d8b4188b6","observation_id":"7e17e0b9-dbc4-4c94-a0cb-9439fcd74636","resolution":{"observed_at":"2026-08-10T22:30:02.406016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.389965Z","title":"Networks","venue":null,"work_id":"e7f63cfa-a5b4-47f4-9b2e-3e6eb831ea14","year":2018},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.073701Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:f9baabea2bbb4ba32131be7b52c5377e5e9a6ee6e38f87954f0aacab3ef6adbf","observation_id":"0671edd1-af92-49ef-9f5b-899f0cdfb7ab","resolution":{"observed_at":"2026-08-10T22:30:02.393550Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.379087Z","title":null,"venue":null,"work_id":"db880592-4d52-4ba9-b00d-89a618fe6001","year":2023},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.077312Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:27a5367decc898f1c515d36aa68d6510fb1559629254f49df05b47ad6b0e0436","observation_id":"b8ffc32a-4bf8-475b-88d4-02de5704ee76","resolution":{"observed_at":"2026-08-10T22:30:02.382693Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.368337Z","title":"Qader, Musa M","venue":null,"work_id":"57e6e4c0-27e7-4a12-a101-a53422dc1db4","year":2019},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.081255Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:f91922a81043a7914e24c744d5c82391075c8b407560bf18fcec483e8b2ad362","observation_id":"9b60f997-3ddd-449d-b3e3-64114442cf8f","resolution":{"observed_at":"2026-08-10T22:30:02.371967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.357203Z","title":"Text mining: Use of tf-idf to examine the relevance of words to documents","venue":null,"work_id":"4f45ea0f-2c76-4d8e-a75c-c8e62ff41f70","year":2018},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.084643Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:a53fd9f2b38665a576c07ae2aa53f78aa21c3379be2b93d01f7c38dfee3216f2","observation_id":"dc17e495-b238-4f0b-b517-8678f249f4a7","resolution":{"observed_at":"2026-08-10T22:30:02.361004Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.345276Z","title":"Universality of citation distributions: Toward an objective measure of scientific impact","venue":null,"work_id":"a8fc9b7b-0d52-4c9e-9be6-acd0dd40ed53","year":2008},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.089140Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:ad4c5de72bb8b2536a625ccaf14f0df5f906953804f3aecf29a7942365aafe76","observation_id":"ec882c59-98f2-47b9-bea6-b8ae3f84449a","resolution":{"observed_at":"2026-08-10T22:30:02.349710Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.093052Z","title":"Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.093052Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:66f7b627a41dd73d520dd7048ad712055eac4844cd1c970ae22088f12d60d778","observation_id":"4f275474-aeeb-427e-a57a-5ef20d49012f","resolution":{"observed_at":"2026-08-10T22:30:02.093052Z","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-10T22:30:02.325784Z","title":"En- sembles of bert for depression classification","venue":null,"work_id":"5765cb2b-3dd9-46d2-8f39-034909bdf3d1","year":2022},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.096929Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:b3fff5c490f755b73f3e2f8f4b6f65cb40a16fc2cd6b4ff7c478bdf40468075b","observation_id":"7d031e03-33ba-43b3-a367-97132fcf26d4","resolution":{"observed_at":"2026-08-10T22:30:02.330229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.313990Z","title":"Interpretability of machine learning-based prediction models in healthcare","venue":null,"work_id":"514353ac-c3fb-4231-b408-fd3ac3f2c9ea","year":2020},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.100861Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:a11028bb63209f382b6615a50463ac6c640766d0d2feb94a127dd8ed553ff342","observation_id":"71462aef-b62e-4c66-8239-cb71877f70c2","resolution":{"observed_at":"2026-08-10T22:30:02.318073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.302469Z","title":"Node Classification in Signed Social Networks, pages 54–62","venue":null,"work_id":"fa2310fe-f33f-4fea-8bc6-c0a3487894d0","year":2016},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.104685Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:f7dcada1890addd71cfdc16840710b594a27d6c1e180731cb56e29faadd173be","observation_id":"6b24be58-a1c8-4f54-9ddf-42e4f7ace0e4","resolution":{"observed_at":"2026-08-10T22:30:02.306565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.290520Z","title":"Are the discretised lognormal and hooked power law distri- butions plausible for citation data? Journal of Informetrics, 10(2):454–470, 2016","venue":null,"work_id":"0146d4c1-b3ab-4fa8-a4ea-c59c41601223","year":2016},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.108487Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:ea218aa62d992ef9922467032db174cceb56c609f6063b430dcdbec6abaa1bd0","observation_id":"aa5b7a23-7b75-400d-bd24-2206962ee679","resolution":{"observed_at":"2026-08-10T22:30:02.294913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.278201Z","title":"The discretised lognormal and hooked power law distribu- tions for complete citation data: Best options for modelling and regression","venue":null,"work_id":"323d86e3-4f4c-486c-93e9-e299733148b8","year":2016},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.112288Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:35be053beaf8a9dbdd98aa13895beddbf146f074b57efcd7ce320f74624a8ee0","observation_id":"93f1d066-f33e-42b5-a24a-8a8ff7b01fcd","resolution":{"observed_at":"2026-08-10T22:30:02.282455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1706.03762","last_updated":"2023-08-02T00:41:18Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-06-12T17:57:34Z","title":"Attention Is All You Need","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.03762","snapshot_observed_at":"2026-08-10T22:30:02.116146Z","title":"Gomez, Lukasz Kaiser, and Illia Polosukhin","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.116146Z"},"links":{"cited_paper":"/paper/1706.03762","citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:eeabdb919ecf75a0bf5e6e0166e94d7b6f0402ce27ae9f67a18a8d7ca6005509","observation_id":"1303681c-37f4-4d30-a95b-412b138137b8","resolution":{"observed_at":"2026-08-10T22:30:02.116146Z","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-10T22:30:02.265867Z","title":"Dickerson, and Su-In Lee","venue":null,"work_id":"c34b3145-417c-4604-b0ae-f0fd055691b9","year":2021},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.120231Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:bb7a747f224696e343e33f77df8b477fcebea86526aeb9c57ed96e1de74bb25f","observation_id":"72267d35-5519-4076-9ad8-a3382acb37fe","resolution":{"observed_at":"2026-08-10T22:30:02.270229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.252619Z","title":"Naive bayes: applications, variations and vulnerabilities: a review of literature with code snippets for implementation","venue":null,"work_id":"a6a38d6c-87c7-485e-8a90-8959c631c16c","year":2021},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.123904Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:42ce6e515f9026aeeabf1f399cfe9a229cb90a32fa04b78953f2fd053f0b4891","observation_id":"02e5a6e0-d490-4d4e-a0e5-7111b6007f9e","resolution":{"observed_at":"2026-08-10T22:30:02.257088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.240091Z","title":"Research on the application of deep learning-based bert model in sentiment analysis, 2024","venue":null,"work_id":"6c3b10a2-d7e2-4cf9-bb33-5d82d54ac02e","year":2024},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.127442Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:c0298ebfeb0dde028a6e2a6b5762640d50d6de73f6efaff1627970c2a53f47d2","observation_id":"64527990-0be8-4d2d-a791-c317b355a789","resolution":{"observed_at":"2026-08-10T22:30:02.244601Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.228302Z","title":"A comprehensive survey on graph neural networks","venue":null,"work_id":"32b56a3e-b438-4064-89cc-0035c3d82581","year":2020},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.131098Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:f2937e1764ea2fb085b43ba54f4a37c2713cb94ed32782ee33d617f6f4785134","observation_id":"2d32c99b-520e-4ca3-bdd9-6127bdbbcc17","resolution":{"observed_at":"2026-08-10T22:30:02.232367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.216013Z","title":"Bayesian na ¨ ıve bayes classifiers to text classification.Journal of Information Science, 44(1):48–59, 2016","venue":null,"work_id":"2eb458ee-a9e1-4d62-bc69-caf7ef7f6520","year":2016},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.134740Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:9129ca6ad1e219f38c73a5998d9412632f835cf6c35dfbce092f8c5a5569221e","observation_id":"b321eb69-534c-4953-bfb6-2ae9b3ee2d0d","resolution":{"observed_at":"2026-08-10T22:30:02.220202Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+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-10T22:30:02.201372Z","title":"Graph con- volutional networks: a comprehensive review","venue":null,"work_id":"0b031489-5481-4e97-9cf1-4cf2901f80ef","year":2019},"citing_paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T22:30:02.138289Z"},"links":{"citing_paper":"/paper/2501.01630"},"observation_digest":"sha256:c9799d6fdfb00cdc11af2888bf943d2270c31858a726e6f3f9e8352c5832b34c","observation_id":"cbf2e135-bc31-45d3-b4bb-9cf89af0b238","resolution":{"observed_at":"2026-08-10T22:30:02.207577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2501.01630","last_updated":"2025-01-03T04:33:25Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-15T17:34:54.214415Z","submitted_at":"2025-01-03T04:33:25Z","title":"A Probabilistic Model for Node Classification in Directed Graphs"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":34},"total_outbound_references":42},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2501.01630."}