{"as_of":"2026-08-08T08:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:14b80e5420d5b3429694716e0ad10edc67d23b72b0d47e68d40469db11252e50","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:06:04.865292Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-23T04:42:33.551533Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.01092","last_updated":"2024-06-05T00:20:38Z","snapshot_observed_at":"2026-07-06T17:38:30.401240Z","submitted_at":"2024-03-02T04:31:28Z","title":"Pairwise Alignment Improves Graph Domain Adaptation","version":2},"cited_work":{"arxiv_id":"2403.01092","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.01092","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pairwise alignment improves graph domain adaptation","venue":null,"work_id":"d3f73238-b858-4664-a427-bcbbb83bf40f","year":2024},"citing_paper":{"arxiv_id":"2501.17443","last_updated":"2026-05-13T04:42:02Z","snapshot_observed_at":"2026-08-01T21:57:33.150500Z","submitted_at":"2025-01-29T06:48:59Z","title":"Gradual Domain Adaptation for Graph Learning","version":4},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-23T04:41:18.375923Z"},"links":{"cited_paper":"/paper/2403.01092","citing_paper":"/paper/2501.17443"},"observation_digest":"sha256:04976eea5040a2b560b9ec23f7ca79e0f3ec2c94428d1e458ef97e1bc424bc9d","observation_id":"22761c38-e4a4-4a18-b550-27509bfab516","resolution":{"observed_at":"2026-05-23T04:42:33.556240Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.01092","last_updated":"2024-06-05T00:20:38Z","snapshot_observed_at":"2026-07-06T17:38:30.401240Z","submitted_at":"2024-03-02T04:31:28Z","title":"Pairwise Alignment Improves Graph Domain Adaptation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.01092","snapshot_observed_at":"2026-08-07T14:06:04.865292Z","title":"Rethinking propagation for unsupervised graph domain adaptation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.20089","last_updated":"2025-05-31T04:25:27Z","snapshot_observed_at":"2026-08-07T18:13:28.553649Z","submitted_at":"2025-05-26T15:02:08Z","title":"Homophily Enhanced Graph Domain Adaptation","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:06:04.865292Z"},"links":{"cited_paper":"/paper/2403.01092","citing_paper":"/paper/2505.20089"},"observation_digest":"sha256:29d0c1a21fdc2857a534fefc40b74ff7b02ea2c9351225550a32a026923a0143","observation_id":"99927c3e-03c2-410f-a8eb-78446f7af9aa","resolution":{"observed_at":"2026-08-07T14:06:04.865292Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.01092","last_updated":"2024-06-05T00:20:38Z","snapshot_observed_at":"2026-07-06T17:38:30.401240Z","submitted_at":"2024-03-02T04:31:28Z","title":"Pairwise Alignment Improves Graph Domain Adaptation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.01092","snapshot_observed_at":"2026-08-07T12:42:40.984455Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24055","last_updated":"2025-05-29T22:54:40Z","snapshot_observed_at":"2026-08-07T12:34:32.453754Z","submitted_at":"2025-05-29T22:54:40Z","title":"Bridging Source and Target Domains via Link Prediction for Unsupervised Domain Adaptation on Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T12:42:40.984455Z"},"links":{"cited_paper":"/paper/2403.01092","citing_paper":"/paper/2505.24055"},"observation_digest":"sha256:3c73cfbeb5aaf9ef49763e114d6c907ae3525d62e490893715e33d2915758b7a","observation_id":"52d27230-8c4f-4c9a-9940-7dd750ffc24b","resolution":{"observed_at":"2026-08-07T12:42:40.984455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.01092","last_updated":"2024-06-05T00:20:38Z","snapshot_observed_at":"2026-07-06T17:38:30.401240Z","submitted_at":"2024-03-02T04:31:28Z","title":"Pairwise Alignment Improves Graph Domain Adaptation","version":2},"cited_work":{"arxiv_id":"2403.01092","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2403.01092","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pairwise alignment improves graph domain adaptation","venue":null,"work_id":"d3f73238-b858-4664-a427-bcbbb83bf40f","year":2024},"citing_paper":{"arxiv_id":"2604.10882","last_updated":"2026-08-04T02:27:29Z","snapshot_observed_at":"2026-08-07T23:09:21.581982Z","submitted_at":"2026-04-13T01:03:44Z","title":"DIB-OD: Preserving the Invariant Core for Robust Heterogeneous Graph Adaptation via Decoupled Information Bottleneck and Online Distillation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T16:39:40.041966Z"},"links":{"cited_paper":"/paper/2403.01092","citing_paper":"/paper/2604.10882"},"observation_digest":"sha256:1d5ec2a3a4fc737b3a005fb8bf8ae2d75f132ee4ecd5292a6dc564e8da1a202e","observation_id":"f6ff55aa-6d68-41bb-9995-0974cd6e4a79","resolution":{"observed_at":"2026-05-11T08:25:59.770589Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.01092","last_updated":"2024-06-05T00:20:38Z","snapshot_observed_at":"2026-07-06T17:38:30.401240Z","submitted_at":"2024-03-02T04:31:28Z","title":"Pairwise Alignment Improves Graph Domain Adaptation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.01092","snapshot_observed_at":"2026-08-02T16:30:45.138904Z","title":"Pairwise alignment improves graph domain adaptation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2604.10882","last_updated":"2026-08-04T02:27:29Z","snapshot_observed_at":"2026-08-07T23:09:21.581982Z","submitted_at":"2026-04-13T01:03:44Z","title":"DIB-OD: Preserving the Invariant Core for Robust Heterogeneous Graph Adaptation via Decoupled Information Bottleneck and Online Distillation","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T16:30:45.138904Z"},"links":{"cited_paper":"/paper/2403.01092","citing_paper":"/paper/2604.10882"},"observation_digest":"sha256:01e9ec25970a1eb279f4022c77e54bb9b602ee93ee3f11896a22179dded9a0fe","observation_id":"089edc35-3525-45ae-b0a2-1f93d26e5948","resolution":{"observed_at":"2026-08-02T16:30:45.138904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2403.01092/citation-record","integrity":"/paper/2403.01092/integrity","json":"/paper/2403.01092/citation-record.json","paper":"/paper/2403.01092"},"outbound":[],"paper":{"arxiv_id":"2403.01092","last_updated":"2024-06-05T00:20:38Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T17:38:30.401240Z","submitted_at":"2024-03-02T04:31:28Z","title":"Pairwise Alignment Improves Graph Domain Adaptation"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2403.01092."}