{"as_of":"2026-08-17T19:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:21377f72d812f62b0f0a3dd86ffbea21a663aef613ad070780f74735c3c397dd","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T23:11:55.586725Z","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-06T17:49:55.388427Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.06635","last_updated":"2025-04-25T00:15:04Z","snapshot_observed_at":"2026-08-16T12:51:46.834768Z","submitted_at":"2025-03-09T14:24:09Z","title":"Deep Cut-informed Graph Embedding and Clustering","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.06635","snapshot_observed_at":"2026-08-15T23:11:55.586725Z","title":"Deep cut- informed graph embedding and clustering","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.05533","last_updated":"2025-05-12T05:13:49Z","snapshot_observed_at":"2026-08-15T23:04:10.397122Z","submitted_at":"2025-05-08T15:24:23Z","title":"Rethinking Graph Contrastive Learning through Relative Similarity Preservation","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T23:11:55.586725Z"},"links":{"cited_paper":"/paper/2503.06635","citing_paper":"/paper/2505.05533"},"observation_digest":"sha256:c7d44742911b9e892ed05009d67f0556af67261f3facd11d947193ae7a61c430","observation_id":"d74e853b-8541-49b3-aa0e-8f9bb965f477","resolution":{"observed_at":"2026-08-15T23:11:55.586725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.06635","last_updated":"2025-04-25T00:15:04Z","snapshot_observed_at":"2026-08-16T12:51:46.834768Z","submitted_at":"2025-03-09T14:24:09Z","title":"Deep Cut-informed Graph Embedding and Clustering","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.06635","snapshot_observed_at":"2026-08-07T15:42:25.247442Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.14020","last_updated":"2025-05-29T07:45:13Z","snapshot_observed_at":"2026-08-10T04:37:41.311777Z","submitted_at":"2025-05-20T07:22:03Z","title":"Disentangled Multi-span Evolutionary Network against Temporal Knowledge Graph Reasoning","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T15:42:25.247442Z"},"links":{"cited_paper":"/paper/2503.06635","citing_paper":"/paper/2505.14020"},"observation_digest":"sha256:cd5c8dae5073abbade4c0d28165b13bd403a003d91a75f0af74552a82add5790","observation_id":"ddfeee3a-b463-41fb-ae8c-acc629898828","resolution":{"observed_at":"2026-08-07T15:42:25.247442Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.06635","last_updated":"2025-04-25T00:15:04Z","snapshot_observed_at":"2026-08-16T12:51:46.834768Z","submitted_at":"2025-03-09T14:24:09Z","title":"Deep Cut-informed Graph Embedding and Clustering","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.06635","snapshot_observed_at":"2026-08-07T14:14:53.925670Z","title":"arXiv preprint arXiv:2503.06635 (2025)","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19722","last_updated":"2025-05-26T09:10:19Z","snapshot_observed_at":"2026-08-08T10:27:02.164065Z","submitted_at":"2025-05-26T09:10:19Z","title":"Distilling Closed-Source LLM's Knowledge for Locally Stable and Economic Biomedical Entity Linking","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:14:53.925670Z"},"links":{"cited_paper":"/paper/2503.06635","citing_paper":"/paper/2505.19722"},"observation_digest":"sha256:482c3ea134e290ed9fb136b43fdb37f043c189144f1c45b098598fbafeaca20e","observation_id":"915f5274-040a-4cd0-97ad-2d40ca7c4d9a","resolution":{"observed_at":"2026-08-07T14:14:53.925670Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.06635","last_updated":"2025-04-25T00:15:04Z","snapshot_observed_at":"2026-08-16T12:51:46.834768Z","submitted_at":"2025-03-09T14:24:09Z","title":"Deep Cut-informed Graph Embedding and Clustering","version":3},"cited_work":{"arxiv_id":"2503.06635","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.06635","snapshot_observed_at":"2026-08-06T17:49:55.388427Z","title":"Deep Cut-informed Graph Embedding and Clustering","venue":"cs.LG","work_id":"e4b4023d-a516-43fb-ac5e-d41ca6549dd5","year":2025},"citing_paper":{"arxiv_id":"2507.09890","last_updated":"2025-07-14T03:49:12Z","snapshot_observed_at":"2026-08-06T17:42:24.987757Z","submitted_at":"2025-07-14T03:49:12Z","title":"Soft Graph Clustering for single-cell RNA Sequencing Data","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T17:49:55.112236Z"},"links":{"cited_paper":"/paper/2503.06635","citing_paper":"/paper/2507.09890"},"observation_digest":"sha256:231ac1cf880505cac8c2151be0d14f7a6d78fe823b989f16b1ff3907a9b48c9e","observation_id":"ec1251db-efee-4bca-9009-8cc7ea7b6498","resolution":{"observed_at":"2026-08-06T17:49:55.394715Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2503.06635/citation-record","integrity":"/paper/2503.06635/integrity","json":"/paper/2503.06635/citation-record.json","paper":"/paper/2503.06635"},"outbound":[],"paper":{"arxiv_id":"2503.06635","last_updated":"2025-04-25T00:15:04Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T12:51:46.834768Z","submitted_at":"2025-03-09T14:24:09Z","title":"Deep Cut-informed Graph Embedding and Clustering"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2503.06635."}