{"as_of":"2026-08-18T22:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bdfbf0aef802d380ef8ebbd1924b6ac47d48868069ac02a180e17d9284623b2a","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T00:39:35.568317Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T15:57:30.313371Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-08T16:19:18.720719Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19420","snapshot_observed_at":"2026-08-10T15:57:30.313371Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.13467","last_updated":"2025-01-23T08:32:27Z","snapshot_observed_at":"2026-08-14T15:22:49.320904Z","submitted_at":"2025-01-23T08:32:27Z","title":"Multi-Level Attention and Contrastive Learning for Enhanced Text Classification with an Optimized Transformer","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T15:57:30.313371Z"},"links":{"cited_paper":"/paper/2412.19420","citing_paper":"/paper/2501.13467"},"observation_digest":"sha256:c72ce9655d990ec20849644295a11ce7adf811cce4f1170c992a7951393a6446","observation_id":"88a83fde-d0fa-4298-8296-a475f84a7c22","resolution":{"observed_at":"2026-08-10T15:57:30.313371Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.19420","snapshot_observed_at":"2026-08-10T14:55:04.110839Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.14859","last_updated":"2025-01-24T18:54:14Z","snapshot_observed_at":"2026-08-15T10:25:36.750074Z","submitted_at":"2025-01-24T18:54:14Z","title":"Dynamic Adaptation of LoRA Fine-Tuning for Efficient and Task-Specific Optimization of Large Language Models","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T14:55:04.110839Z"},"links":{"cited_paper":"/paper/2412.19420","citing_paper":"/paper/2501.14859"},"observation_digest":"sha256:cf1d6a608c347380dadbde519953402f43fc41b949d2baad064e997ea828d2f9","observation_id":"2590dbea-fc8b-42b7-9406-065bd20e7ecd","resolution":{"observed_at":"2026-08-10T14:55:04.110839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"cited_work":{"arxiv_id":"2412.19420","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.19420","snapshot_observed_at":"2026-08-08T16:19:18.720719Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","venue":"cs.DB","work_id":"b876b717-474f-4441-a684-807863b11abf","year":2024},"citing_paper":{"arxiv_id":"2502.06243","last_updated":"2025-02-10T08:22:25Z","snapshot_observed_at":"2026-08-15T14:40:29.698811Z","submitted_at":"2025-02-10T08:22:25Z","title":"Multi-Scale Transformer Architecture for Accurate Medical Image Classification","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T16:19:18.499654Z"},"links":{"cited_paper":"/paper/2412.19420","citing_paper":"/paper/2502.06243"},"observation_digest":"sha256:ec1aed103158f3cb22e7cb5636f49e988dc16617a5f132a92260ffd769106adb","observation_id":"32d1a750-0460-42eb-b7ae-a936708cc833","resolution":{"observed_at":"2026-08-08T16:19:18.724208Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.19420/citation-record","integrity":"/paper/2412.19420/integrity","json":"/paper/2412.19420/citation-record.json","paper":"/paper/2412.19420"},"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-11T00:39:36.383513Z","title":"Dynamic Risk Control and Asset Allocation Using Q-Learning in Financial Markets","venue":null,"work_id":"4a35f75d-e89b-4516-80e3-7fccf9029d5b","year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.389815Z"},"links":{"citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:b1da2c4933a3b0f95d0966a09e8d035ca1b0d1833a94bab3741f9fc7bbb3eada","observation_id":"69dc9dcb-5a26-4062-b8ae-4601f1da5765","resolution":{"observed_at":"2026-08-11T00:39:36.392566Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.03097","last_updated":"2024-12-04T07:50:27Z","snapshot_observed_at":"2026-08-18T11:13:39.633150Z","submitted_at":"2024-12-04T07:50:27Z","title":"Enhancing Recommendation Systems with GNNs and Addressing Over-Smoothing","version":1},"cited_work":{"arxiv_id":"2412.03097","doi":null,"metadata_source":"pith","pith_arxiv_id":"2412.03097","snapshot_observed_at":"2026-08-11T00:39:36.052997Z","title":"Enhancing Recommendation Systems with GNNs and Addressing Over-Smoothing","venue":"cs.IR","work_id":"13588fbf-dc23-4ceb-8db5-1173bb0dbc07","year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.398187Z"},"links":{"cited_paper":"/paper/2412.03097","citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:a3f330a025b1a12183991ddce15423e2d127f5ad121ef69ff0d38573d2d6871a","observation_id":"99d7ecbc-3bd7-4923-b3b8-0b4fab0c19f7","resolution":{"observed_at":"2026-08-11T00:39:36.062295Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.11703","last_updated":"2024-09-18T04:56:52Z","snapshot_observed_at":"2026-08-16T13:17:37.310326Z","submitted_at":"2024-09-18T04:56:52Z","title":"Harnessing LLMs for API Interactions: A Framework for Classification and Synthetic Data Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.11703","snapshot_observed_at":"2026-08-11T00:39:35.405830Z","title":"Harnessing LLMs for API Interactions: A Framework for Classification and Synthetic Data Generation,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.405830Z"},"links":{"cited_paper":"/paper/2409.11703","citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:786e14d073195e88994c6e8b59cb4d5673aa4a155eff20eff2d72e773c9529d7","observation_id":"0631f532-8d41-4566-b1b3-b42e19a3d068","resolution":{"observed_at":"2026-08-11T00:39:35.405830Z","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-11T00:39:35.413585Z","title":"Comparison of Tree-Based Feature Selection Algorithms on Biological Omics Dataset,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.413585Z"},"links":{"citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:39c02cf37e638eee542c4ab33d0c5ae9bc237c53e5bea98c0d62dc6c021ad213","observation_id":"84224822-e140-4e6e-9e38-9bc3805b3c69","resolution":{"observed_at":"2026-08-11T00:39:35.413585Z","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-11T00:39:36.343876Z","title":"Probabilistic Support Prediction: Fast frequent itemset mining in dense data,","venue":null,"work_id":"61b319fb-385a-4d74-b6c0-79ef752eac32","year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.420766Z"},"links":{"citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:912fa84912c69ca9793c391752420504e38af13eb01bb1fc26402a5b15ffdbe7","observation_id":"aba7aa23-bc8f-49ff-b9c5-8d3ef1f887e0","resolution":{"observed_at":"2026-08-11T00:39:36.355665Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:39:36.320497Z","title":"Data Heterogeneity's Impact on the Performance of Frequent Itemset Mining Algorithms,","venue":null,"work_id":"de5f1cdf-aad8-4090-b857-e93ffd3d9206","year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.427501Z"},"links":{"citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:f8e3629bb1cdf704596d2ec7c52a5ffc976fdf5c66821b2d0862b55855cdc15c","observation_id":"27b3922b-0071-4dad-9cc1-e35232acba8e","resolution":{"observed_at":"2026-08-11T00:39:36.326775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:39:36.295924Z","title":"Secure Two-Party Frequent Itemset Mining with Guaranteeing Differential Privacy,","venue":null,"work_id":"1772fb90-cdc2-4007-8605-42b45726f2fc","year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.442633Z"},"links":{"citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:04fc0cf6db7837fe78536a8c6bdcf779e94ad52c55d8f6216d2cb31ad3354b07","observation_id":"ea2c9ae8-84a1-4979-8cc2-7998b017cfc8","resolution":{"observed_at":"2026-08-11T00:39:36.303235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:39:36.258897Z","title":"Optimization of frequent itemset mining parallelization algorithm based on spark platform,","venue":null,"work_id":"31cf0b03-3ae3-46f2-a1fa-2fab6c7b0086","year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.451551Z"},"links":{"citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:ae095670dfcefbb4ac38f8d1c3e82a92a196ff70e8c447526c71d5d3b4e75254","observation_id":"9dc8a286-ba9e-48d8-a695-c87778dcf296","resolution":{"observed_at":"2026-08-11T00:39:36.267071Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.15598","last_updated":"2024-11-23T16:25:03Z","snapshot_observed_at":"2026-08-18T07:30:53.352965Z","submitted_at":"2024-11-23T16:25:03Z","title":"Optimizing Gesture Recognition for Seamless UI Interaction Using Convolutional Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.15598","snapshot_observed_at":"2026-08-11T00:39:35.462006Z","title":"Optimizing Gesture Recognition for Seamless UI Interaction Using Convolutional Neural Networks","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.462006Z"},"links":{"cited_paper":"/paper/2411.15598","citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:ecfee3e230b20f543f7e6bd74ed6ae0e7cdd11cdcd5f454a05b5a7ad61544f22","observation_id":"7e62a591-12fe-4ee4-8813-e3942905327c","resolution":{"observed_at":"2026-08-11T00:39:35.462006Z","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-11T00:39:35.469292Z","title":"Calibration Learning for Few-shot Novel Product Description,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.469292Z"},"links":{"citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:d736d44fbff7d1e5bec291e931a94843c76bf7f8d03b8d4ac6868985e910b971","observation_id":"728f9c3f-627c-43a9-9d61-290fbb2495d1","resolution":{"observed_at":"2026-08-11T00:39:35.469292Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.03606","last_updated":"2024-12-04T08:15:27Z","snapshot_observed_at":"2026-08-18T18:20:47.395690Z","submitted_at":"2024-12-04T08:15:27Z","title":"Advanced Risk Prediction and Stability Assessment of Banks Using Time Series Transformer Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.03606","snapshot_observed_at":"2026-08-11T00:39:35.476565Z","title":"Advanced Risk Prediction and Stability Assessment of Banks Using Time Series Transformer Models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.476565Z"},"links":{"cited_paper":"/paper/2412.03606","citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:af777e60f6e648cd6ffae517156cb6e391dce19ca26d0a08dfadc3e1d2014e3a","observation_id":"b1b0bcf1-dd42-44a0-b139-ab6bc6b914d9","resolution":{"observed_at":"2026-08-11T00:39:35.476565Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.15195","last_updated":"2024-11-19T16:23:49Z","snapshot_observed_at":"2026-08-16T13:45:48.484123Z","submitted_at":"2024-11-19T16:23:49Z","title":"Graph Neural Network-Based Entity Extraction and Relationship Reasoning in Complex Knowledge Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.15195","snapshot_observed_at":"2026-08-11T00:39:35.483572Z","title":"Graph Neural Network-Based Entity Extraction and Relationship Reasoning in Complex Knowledge Graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.483572Z"},"links":{"cited_paper":"/paper/2411.15195","citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:34611a560bff009017bbc682beb800cfd28ecc32bf9185aaa164ddc66e48a908","observation_id":"02c4cdf8-9bee-4602-9848-decdab8ebf66","resolution":{"observed_at":"2026-08-11T00:39:35.483572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.06862","last_updated":"2024-12-09T08:08:03Z","snapshot_observed_at":"2026-08-14T09:25:49.382106Z","submitted_at":"2024-12-09T08:08:03Z","title":"Stock Type Prediction Model Based on Hierarchical Graph Neural Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.06862","snapshot_observed_at":"2026-08-11T00:39:35.491963Z","title":"Stock Type Prediction Model Based on Hierarchical Graph Neural Network","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.491963Z"},"links":{"cited_paper":"/paper/2412.06862","citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:28bfdbfc427f38ff9269a85e33327f8286713434377dd166a93ddce1e9a6a5e9","observation_id":"4d96a41d-8ce4-4f59-861f-1765a46bb8e7","resolution":{"observed_at":"2026-08-11T00:39:35.491963Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.14327","last_updated":"2024-10-08T07:14:04Z","snapshot_observed_at":"2026-08-16T21:32:23.861498Z","submitted_at":"2024-09-22T06:27:07Z","title":"Transforming Multidimensional Time Series into Interpretable Event Sequences for Advanced Data Mining","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.14327","snapshot_observed_at":"2026-08-11T00:39:35.499130Z","title":"Transforming Multidimensional Time Series into Interpretable Event Sequences for Advanced Data Mining,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.499130Z"},"links":{"cited_paper":"/paper/2409.14327","citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:1b57439b4116a9a7c12d76c0871581d1bf27c80d521e38a1289211433ccb1c84","observation_id":"04b7bf51-a852-4162-83e7-64b8bb6360cf","resolution":{"observed_at":"2026-08-11T00:39:35.499130Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.02211","last_updated":"2024-12-03T07:04:10Z","snapshot_observed_at":"2026-08-16T13:46:41.022499Z","submitted_at":"2024-12-03T07:04:10Z","title":"An Automated Data Mining Framework Using Autoencoders for Feature Extraction and Dimensionality Reduction","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.02211","snapshot_observed_at":"2026-08-11T00:39:35.504950Z","title":"An Automated Data Mining Framework Using Autoencoders for Feature Extraction and Dimensionality Reduction,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.504950Z"},"links":{"cited_paper":"/paper/2412.02211","citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:9aa2ec27497db311ccf6e777b998cce39a367955b2055168756e4ea18aa2b9ea","observation_id":"f08225f2-6c1d-4a96-a5bf-32c59ee5002d","resolution":{"observed_at":"2026-08-11T00:39:35.504950Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.18622","last_updated":"2024-11-27T18:59:50Z","snapshot_observed_at":"2026-08-17T17:01:27.883471Z","submitted_at":"2024-11-27T18:59:50Z","title":"Leveraging Semi-Supervised Learning to Enhance Data Mining for Image Classification under Limited Labeled Data","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.18622","snapshot_observed_at":"2026-08-11T00:39:35.511499Z","title":"Leveraging Semi-Supervised Learning to Enhance Data Mining for Image Classification under Limited Labeled Data,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.511499Z"},"links":{"cited_paper":"/paper/2411.18622","citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:01d4c69448c9f60d42dd3cadebbd0f107f13c9b7449ad0d2dc5b6f6cbb011722","observation_id":"b5b00f41-c46e-41bd-ae1d-035dafbd8b1a","resolution":{"observed_at":"2026-08-11T00:39:35.511499Z","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-11T00:39:36.199443Z","title":"Self-Supervised Credit Scoring with Masked Autoencoders: Addressing Data Gaps and Noise Robustly,","venue":null,"work_id":"1c429caf-dead-4cf7-831e-0f87a0010de7","year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.519868Z"},"links":{"citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:f047512fb0296226477ef72d06fad602846774ec3cbab833e32d9717beb0a967","observation_id":"f298d99f-1a9b-4d6a-a141-15a2386e2f62","resolution":{"observed_at":"2026-08-11T00:39:36.212993Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:39:36.177037Z","title":"Self- Supervised Graph Neural Networks for Enhanced Feature Extraction in Heterogeneous Information Networks,","venue":null,"work_id":"c0922e0f-6a9e-44a1-b274-a1b9a63201e5","year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.526123Z"},"links":{"citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:e1fb2d38212b054d49eebb7188d3677b40f2d164b509abf5b14b707a6c04968b","observation_id":"717bd985-2a73-47b0-b487-1f800df7c4b9","resolution":{"observed_at":"2026-08-11T00:39:36.183398Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.06249","last_updated":"2024-12-09T06:47:42Z","snapshot_observed_at":"2026-08-18T17:03:51.550002Z","submitted_at":"2024-12-09T06:47:42Z","title":"Optimizing Multi-Task Learning for Enhanced Performance in Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.06249","snapshot_observed_at":"2026-08-11T00:39:35.531977Z","title":"Optimizing Multi-Task Learning for Enhanced Performance in Large Language Models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.531977Z"},"links":{"cited_paper":"/paper/2412.06249","citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:25d94bbec7d209e9004ae1c35f800de877808cee695a2f3c0dd0bb57f9a4fc9e","observation_id":"64556f6e-1148-41f3-84a7-d4a2db550347","resolution":{"observed_at":"2026-08-11T00:39:35.531977Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04718","last_updated":"2024-12-06T02:17:30Z","snapshot_observed_at":"2026-08-16T13:00:31.745942Z","submitted_at":"2024-12-06T02:17:30Z","title":"Adaptive Optimization for Enhanced Efficiency in Large-Scale Language Model Training","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04718","snapshot_observed_at":"2026-08-11T00:39:35.538864Z","title":"Adaptive Optimization for Enhanced Efficiency in Large-Scale Language Model Training,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.538864Z"},"links":{"cited_paper":"/paper/2412.04718","citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:8405d3d1835e73059a57e26bab46ae48705834f081950f41371cff3c6dd8c5fa","observation_id":"be00fb9f-d4c7-4821-a4ba-033bc2fa26ae","resolution":{"observed_at":"2026-08-11T00:39:35.538864Z","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-11T00:39:36.149401Z","title":"Multi-Source Data-Driven LSTM Framework for Enhanced Stock Price Prediction and Volatility Analysis,","venue":null,"work_id":"ef5e6450-4cca-4bca-b367-f87ac5f84185","year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.544652Z"},"links":{"citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:a126f67ccb871808d248d2499af8a8bd2c1a047e4f1ce39aeb9c2e040fe04bcd","observation_id":"78ba4ada-4ac6-4d01-be08-53337ea864f5","resolution":{"observed_at":"2026-08-11T00:39:36.157145Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.14521","last_updated":"2024-12-19T04:37:47Z","snapshot_observed_at":"2026-08-18T10:20:15.136107Z","submitted_at":"2024-12-19T04:37:47Z","title":"Dynamic User Interface Generation for Enhanced Human-Computer Interaction Using Variational Autoencoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.14521","snapshot_observed_at":"2026-08-11T00:39:35.550447Z","title":"Dynamic User Interface Generation for Enhanced Human-Computer Interaction Using Variational Autoencoders,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.550447Z"},"links":{"cited_paper":"/paper/2412.14521","citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:a01792de91f482d5ebd6d5b315b7000f57531d37ee50d87351c0d13e9d8fd5b8","observation_id":"b3447239-ddc9-40ee-9eb4-4b2ddb81ccb8","resolution":{"observed_at":"2026-08-11T00:39:35.550447Z","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-11T00:39:36.109361Z","title":"Investigation of Creating Accessibility Linked Data Based on Publicly Available Accessibility Datasets,","venue":null,"work_id":"10fa4bfb-b096-4063-974d-f5f2c09c0961","year":2023},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.556584Z"},"links":{"citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:8c45f261f8951a4761e90057921888b2332cb1cac253f463721d30a509d94dae","observation_id":"90d46598-cfcd-4a99-80fa-3c364cefd242","resolution":{"observed_at":"2026-08-11T00:39:36.119232Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2411.16567","last_updated":"2024-11-25T16:51:11Z","snapshot_observed_at":"2026-08-18T00:40:19.743254Z","submitted_at":"2024-11-25T16:51:11Z","title":"Enhancing Few-Shot Learning with Integrated Data and GAN Model Approaches","version":1},"cited_work":{"arxiv_id":"2411.16567","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.16567","snapshot_observed_at":"2026-08-11T00:39:35.637757Z","title":"Enhancing Few-Shot Learning with Integrated Data and GAN Model Approaches","venue":"cs.LG","work_id":"dc53b1a4-6aba-4de3-b65f-25241c6f2db0","year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.562107Z"},"links":{"cited_paper":"/paper/2411.16567","citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:12f16187834284142765d89e7f930af635bc394b4002d685f863eb5fb0ba7d31","observation_id":"68813e7e-3de3-4b1a-9c3f-ae3374d79bc4","resolution":{"observed_at":"2026-08-11T00:39:35.648515Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T00:39:36.080973Z","title":"New spark solutions for distributed frequent itemset and association rule mining algorithms,","venue":null,"work_id":"12c1b57a-77a4-41da-8cd6-4a4863b870ea","year":2024},"citing_paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T00:39:35.568317Z"},"links":{"citing_paper":"/paper/2412.19420"},"observation_digest":"sha256:19c9029583c59747f4d1f02229fa02f6ed7454934ce3660ce99c9153ac54ded5","observation_id":"3d052795-50a5-4a93-a79f-b7411fe0b727","resolution":{"observed_at":"2026-08-11T00:39:36.091342Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.19420","last_updated":"2024-12-27T03:13:13Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-18T22:30:24.141810Z","submitted_at":"2024-12-27T03:13:13Z","title":"A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":2,"verified_fuzzy":10},"total_outbound_references":25},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 3 inbound Pith citation observations for arXiv:2412.19420."}