{"as_of":"2026-08-07T09:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:64ff5a1339fb774094b8642155290a7a7bd00f22ac098e5cc6308e4605fa6b36","coverage":[{"denominator":51,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":51,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-21T07:55:11.088587Z","state":"measured"},{"denominator":51,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":51,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2605.18579/citation-record","integrity":"/paper/2605.18579/integrity","json":"/paper/2605.18579/citation-record.json","paper":"/paper/2605.18579"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.02893","last_updated":"2020-03-27T19:07:58Z","snapshot_observed_at":"2026-07-06T08:05:24.076802Z","submitted_at":"2019-07-05T15:26:26Z","title":"Invariant Risk Minimization","version":3},"cited_work":{"arxiv_id":"1907.02893","doi":"10.1038/s41591-023-02608-w","metadata_source":"pith","pith_arxiv_id":"1907.02893","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Invariant Risk Minimization","venue":"stat.ML","work_id":"d76c6842-b84d-44ec-bcea-b80cd8d07981","year":2019},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"cited_paper":"/paper/1907.02893","citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:3e60ce91bf588fd6657815a4525cf944777110adb373029764cd285d9cc13793","observation_id":"12ae193f-00a9-4b90-8e99-f1b2f0d96b0a","resolution":{"observed_at":"2026-05-21T07:59:50.892956Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"ConGraT: Self-supervised contrastive pretraining for joint graph and text embeddings","venue":null,"work_id":"e5062ab3-a4c8-43c5-b2ed-8a7dfbb735a1","year":2024},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:d97d10e02156538ffc26baf7846cfa04724d83ea86bf260de84ea6b865a36e49","observation_id":"475fe7cb-86da-4eab-bcd5-1662a0b04fd0","resolution":{"observed_at":"2026-05-21T08:14:52.601675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Multi-level graph convolutional networks for cross-platform anchor link prediction","venue":null,"work_id":"40845e08-5ac9-47d0-8507-bdd869303514","year":2020},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:67ac08fedc147f8d7cdb08d059981d2c99c31664d856b8a1286624c336fa1529","observation_id":"3b407021-883a-4993-8a32-03a28239bfd5","resolution":{"observed_at":"2026-05-21T08:14:52.596731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Brainnet: Epileptic wave detection from seeg with hierarchical graph diffusion learning","venue":null,"work_id":"6c534230-530e-42d7-8cf7-0f8101ff7b26","year":2022},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:a97cd7aef1b0438c648d5a3a545be5fc3b754a5b8cc1bc8c88be46ecc4dda748","observation_id":"0cf304c2-18f4-4e23-82da-907529764e77","resolution":{"observed_at":"2026-05-21T08:14:52.599545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.08170","last_updated":"2024-04-11T05:01:12Z","snapshot_observed_at":"2026-08-04T08:10:16.676870Z","submitted_at":"2024-02-13T02:03:26Z","title":"LLaGA: Large Language and Graph Assistant","version":3},"cited_work":{"arxiv_id":"2402.08170","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.08170","snapshot_observed_at":"2026-07-03T11:08:03.233122Z","title":"Llaga: Large language and graph assistant","venue":null,"work_id":"9edfdc5b-0d8e-4af3-9231-528bf4791a54","year":2024},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"cited_paper":"/paper/2402.08170","citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:d921a5afc3d79f26370353e3a3e46f7616f7309caaa45606a2f3ad2ec79f1796","observation_id":"2a5791f5-3e36-46ee-80b8-be381d4f7f16","resolution":{"observed_at":"2026-05-21T07:59:50.884465Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Text-space graph foundation models: Comprehensive benchmarks and new insights.Advances in Neural Information Processing Systems, 37:7464– 7492","venue":null,"work_id":"a8e4eb5f-b84e-4be0-99d8-3cc4e91f07b6","year":2024},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:80f272b3d0525dca5bc0ae8d8744297f51fcc27775e3568deb3e7eace041db73","observation_id":"fcf26826-ed44-4a3b-bf61-2d454a89e043","resolution":{"observed_at":"2026-05-21T08:14:52.603982Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.14683","last_updated":"2024-10-19T18:47:33Z","snapshot_observed_at":"2026-07-06T18:34:33.717998Z","submitted_at":"2024-06-20T19:11:35Z","title":"TAGLAS: An atlas of text-attributed graph datasets in the era of large graph and language models","version":2},"cited_work":{"arxiv_id":"2406.14683","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.14683","snapshot_observed_at":"2026-06-30T07:34:21.243055Z","title":"Taglas: An atlas of text-attributed graph datasets in the era of large graph and language models","venue":null,"work_id":"d4e0e2c3-4991-4fdf-85cf-80f77ddc7f39","year":2024},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"cited_paper":"/paper/2406.14683","citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:0bf019adcf8afd6d410f2f8ca04df0a8772c04f3d4ec8299ae8f075c3fe5b943","observation_id":"87779dad-e61e-49dc-91b6-7bf6c37530b4","resolution":{"observed_at":"2026-05-21T07:59:50.879709Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Domain-adversarial training of neural networks","venue":null,"work_id":"bc40c5b1-6e8f-45ca-92ed-6aa9a0b905c5","year":2016},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:2bdb253f953f9e80dfc1f0499f66bdc119e88abc42a957c114ae9e810cc56584","observation_id":"b1a0d912-f627-4951-a6db-e57e9f2df1cd","resolution":{"observed_at":"2026-05-21T08:14:52.594403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.19523","last_updated":"2024-03-07T02:45:36Z","snapshot_observed_at":"2026-07-06T15:35:45.200564Z","submitted_at":"2023-05-31T03:18:03Z","title":"Harnessing Explanations: LLM-to-LM Interpreter for Enhanced Text-Attributed Graph Representation Learning","version":5},"cited_work":{"arxiv_id":"2305.19523","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.19523","snapshot_observed_at":"2026-07-03T19:08:49.777340Z","title":"Harnessing explanations: Llm-to-lm interpreter for enhanced text- attributed graph representation learning","venue":null,"work_id":"bcd8b1e4-d878-4081-80a6-6b55a25109c5","year":2023},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"cited_paper":"/paper/2305.19523","citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:bca6612e0bbcff86d00a984d32e1500f6ad553ad2b524d14afd9f0f5396e200b","observation_id":"eb8685ac-0d6a-4f7a-a36d-57f0f365a27f","resolution":{"observed_at":"2026-05-21T07:59:50.889496Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Graphmae: Self-supervised masked graph autoencoders","venue":null,"work_id":"2be9c843-d95e-4124-99bd-c5d46df6ba98","year":2022},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:5b933d0ca30e096cd31cbfad5e42fc02978a69bbe87d5cb1389f636d9299041e","observation_id":"ec640ed9-2904-40e1-b18f-a783ee17dde3","resolution":{"observed_at":"2026-05-21T08:14:52.662060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-07T15:53:55.330797Z","title":"Open graph benchmark: Datasets for machine learning on graphs","venue":null,"work_id":"39cc4a5f-a4c0-4922-a15f-e07bc2f727e8","year":2020},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:42b2fcfaf8b27c1dc742cdc154e5be3502e74bff35ba47d0b080bf168d6f31ff","observation_id":"13055ab8-5589-470b-a6b2-80ad3a4ea53d","resolution":{"observed_at":"2026-05-21T08:14:52.660054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Can gnn be good adapter for llms? InProceedings of the ACM web conference 2024, pages 893–904","venue":null,"work_id":"df496841-70cb-4fc4-b3b0-fe04fd057767","year":2024},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:c56ba17ca5da70c3d000c5f1e045755e0db2fcf0644aca18c4a7dfc37166d9b8","observation_id":"2d64338b-7fe8-4e76-a6a2-5d4a01b17a76","resolution":{"observed_at":"2026-05-21T08:14:52.655922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Out-of-distribution generalization via risk ex- trapolation (rex)","venue":null,"work_id":"516172f0-81bf-4520-b609-4e31418fb08f","year":2021},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:354d88a7d8fdc73d3109df7e2e65c87fa96682431b57a946dd0b165907a69fd4","observation_id":"e3f302fb-10d4-484d-b908-931c5f0c3303","resolution":{"observed_at":"2026-05-21T08:14:52.658038Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Learning invariant graph representations for out-of-distribution generalization.Advances in Neural Information Processing Systems, 35:11828–11841","venue":null,"work_id":"3c156f4a-c75f-4c85-aa16-d475d86c417d","year":2022},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:f3fce5e930c7dde9b53c8de536ea22077f486781f9560097195851ee9f3dac76","observation_id":"775243e5-622e-4e01-b00d-5d8e66882a1f","resolution":{"observed_at":"2026-05-21T08:14:52.664657Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"GRENADE: Graph-centric language model for self-supervised representation learning on text-attributed graphs","venue":null,"work_id":"91dda0e0-da24-49c7-8136-5ae23ca54cf0","year":2023},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:62c26418fe7edc3c583ec5834028b93a2b58733facc8b324b95c68d0da99c352","observation_id":"c00eef25-491b-4c89-8d04-8878f2730f84","resolution":{"observed_at":"2026-05-21T08:14:52.669372Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Zerog: Investigating cross- dataset zero-shot transferability in graphs","venue":null,"work_id":"66ce45a7-94e7-4547-b3e8-5d42d86df173","year":2024},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:ff8080181ef1c4a8bf2434026a779a605ab9e21abbb58f7321c7dbce1a7b73e6","observation_id":"2b823fed-e7ee-4ef1-a55b-04e51af3f3c7","resolution":{"observed_at":"2026-05-21T08:14:52.651668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.00149","last_updated":"2024-07-12T23:01:32Z","snapshot_observed_at":"2026-07-06T16:25:46.699214Z","submitted_at":"2023-09-29T21:15:26Z","title":"One for All: Towards Training One Graph Model for All Classification Tasks","version":3},"cited_work":{"arxiv_id":"2310.00149","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.00149","snapshot_observed_at":"2026-07-03T20:08:56.258128Z","title":"One for all: Towards training one graph model for all classifi- cation tasks","venue":null,"work_id":"34b1ef59-3652-420a-aa23-7b03bc35b175","year":2023},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"cited_paper":"/paper/2310.00149","citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:93f3219e46bb6f8d65c94eb5fc8c8f5cdcf01f41a6fc499766feb3b9e233ba22","observation_id":"85db4da7-f0b8-45d4-982d-3b1a63b4ca9b","resolution":{"observed_at":"2026-05-21T07:59:50.870907Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11829","last_updated":"2025-03-10T16:14:30Z","snapshot_observed_at":"2026-07-06T16:34:54.717394Z","submitted_at":"2023-10-18T09:31:21Z","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","version":4},"cited_work":{"arxiv_id":"2310.11829","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2310.11829","snapshot_observed_at":"2026-07-03T20:08:56.262293Z","title":"Yu, and Chuan Shi","venue":null,"work_id":"117053a0-f799-46f7-9169-9e226438c848","year":2023},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"cited_paper":"/paper/2310.11829","citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:046b03039f7d3e25ee0d479c3c1e7ae447b85b70e970f622aba81a8140dfad4a","observation_id":"d8b68de1-6ef3-4c72-8fff-3e9a672bd2ad","resolution":{"observed_at":"2026-05-21T07:59:50.862419Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2510.19384","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-01T22:26:17.546134Z","title":"Learning noise-resilient and transferable graph-text alignment via dynamic quality assessment","venue":null,"work_id":"affc12b2-6ba8-4bcc-8d7a-539e9d61992b","year":2025},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:904b55feb4ce65555571229b2e4c98323ce313352fb10ec0c67bf17f363ddcbe","observation_id":"6520c30e-8248-4d1f-8753-32fba9cf6bd3","resolution":{"observed_at":"2026-05-21T07:59:50.866906Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Learning transferable features with deep adaptation networks","venue":null,"work_id":"a7384674-7039-457c-a77f-a691290c9833","year":2015},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:6f15bee9205691380a21b3a393b09a45f39e59fe3ff54751743ae0be6e910331","observation_id":"101f5f9e-e0c5-4459-8100-ac98958d27eb","resolution":{"observed_at":"2026-05-21T08:14:52.653764Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05101","last_updated":"2019-01-04T21:01:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-11-14T14:24:06Z","title":"Decoupled Weight Decay Regularization","version":3},"cited_work":{"arxiv_id":"1711.05101","doi":"10.1137/1.9781611972825.47","metadata_source":"pith","pith_arxiv_id":"1711.05101","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Decoupled Weight Decay Regularization","venue":"cs.LG","work_id":"07ef7360-d385-4033-83f7-8384a6325204","year":2017},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"cited_paper":"/paper/1711.05101","citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:9e412dfaa5c06e7c70e3a56a6f5266177b2c594db44c6a8a140e51394e64ed48","observation_id":"1bd30992-702a-452d-88d2-0b7f5380932a","resolution":{"observed_at":"2026-05-21T07:59:50.858105Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.02901","last_updated":"2022-01-09T23:19:38Z","snapshot_observed_at":"2026-07-06T09:35:50.977461Z","submitted_at":"2020-07-06T17:25:47Z","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","version":2},"cited_work":{"arxiv_id":"2007.02901","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2007.02901","snapshot_observed_at":"2026-07-04T16:19:56.407223Z","title":"and Cangea, C","venue":null,"work_id":"e4ceb7de-e4e0-4a74-94a6-4d8848ca54e3","year":2007},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"cited_paper":"/paper/2007.02901","citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:472f014c3b3df229ddb5b3974907b665e91ee8cd8e89eda3cf1487b4ebf95a67","observation_id":"2d92804a-5eeb-4063-b40e-164802ad10f0","resolution":{"observed_at":"2026-05-21T07:59:50.854881Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"f520d2da-9431-4431-b93b-89f8516d7643","year":2016},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:2a57f9d15ad3e3e9a28cdcc91c89889133448fe9bbdda3b9f628c9f2bff90cb0","observation_id":"8c13fd3d-ce55-4161-b85e-9bd23e4c5308","resolution":{"observed_at":"2026-05-21T08:14:52.640763Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-09T07:16:04.687562Z","title":"Learning transferable visual models from natural language supervision","venue":null,"work_id":"ad3e05b3-af3a-4fa2-ab30-c45f9f403277","year":2021},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:5609d0a381096e3ddc4560606d5b11c3116cd3bcb515f308b662979f55695b93","observation_id":"3e8bc9c8-31e0-4feb-90f6-8594c7ca7c96","resolution":{"observed_at":"2026-05-21T08:14:52.643152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-07T21:54:08.989071Z","title":"Recipe for a general, powerful, scalable graph transformer.Advances in Neural Information Processing Systems, 35:14501–14515","venue":null,"work_id":"0b3915c1-2c68-4649-b6a6-6651a7b3261c","year":2022},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:6c2d4e98bb4d91641f5d98c3405c0bf7147e0f9626c43980e3eed4fdc3cd335d","observation_id":"1fb30700-4d97-4572-b450-ad0dbd2ea3be","resolution":{"observed_at":"2026-05-21T08:14:52.634340Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Sentence-bert: Sentence embeddings using siamese bert- networks","venue":null,"work_id":"e39dd368-2b4d-4dbe-a5f5-bebce273fd75","year":2019},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:49bf1c8702b7b1b2025c17eabe3d5304bb5ddb13900a44a64a3e3d57880202b6","observation_id":"cb72eff1-821b-4f1c-a093-bba36dcd1ece","resolution":{"observed_at":"2026-05-21T08:14:52.636465Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"A survey of large lan- guage models for graphs","venue":null,"work_id":"d4e0ec56-6251-4960-b6bb-446d0ddcec73","year":2024},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:d56b31054a155ad4db058ecb9b5895a55b0ff7c380d5e3cf59dab18aad4bc705","observation_id":"287a1f99-f056-4764-b84a-f155b43937f8","resolution":{"observed_at":"2026-05-21T08:14:52.629608Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1911.08731","last_updated":"2020-04-02T05:40:29Z","snapshot_observed_at":"2026-08-02T19:28:48.954133Z","submitted_at":"2019-11-20T06:43:41Z","title":"Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalization","version":2},"cited_work":{"arxiv_id":"1911.08731","doi":"10.48550/arxiv.1911.08731","metadata_source":"pith","pith_arxiv_id":"1911.08731","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalization","venue":"cs.LG","work_id":"b9385d0d-bafd-43d3-8948-4d2da8ee27a0","year":2019},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"cited_paper":"/paper/1911.08731","citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:a1abe3ec40c152317804bc315db6f24066bb01038083d8fed023a95573ec6d5e","observation_id":"a19e9d06-6fff-47be-9c4f-56d697da6904","resolution":{"observed_at":"2026-05-21T07:59:50.874427Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Collective classification in network data.AI magazine, 29(3):93–93","venue":null,"work_id":"0c24e801-b51d-4081-9621-8871bc355e5e","year":2008},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:b43ad7f74953fd7e19983aeb9402b2d45feb7fff2f2d195200096f02bc635e91","observation_id":"376ea167-374a-4df2-b519-7f43293c2f03","resolution":{"observed_at":"2026-05-21T08:14:52.631832Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Deep coral: Correlation alignment for deep domain adaptation","venue":null,"work_id":"cce69adf-c07e-46ca-af9f-58813744d556","year":2016},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:1b6425edbeb821e676f5d917569202ef1a81e25697d08694a61706d57c4d4262","observation_id":"04095eae-9718-46b1-81ea-be69f490b3db","resolution":{"observed_at":"2026-05-21T08:14:52.638634Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Graphgpt: Graph instruction tuning for large language models","venue":null,"work_id":"bd3196ae-f4cd-4351-8006-c57f2add0593","year":2024},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:354aa50653d277824fea67247002acf5c32c4a71a2939f62ee1640b0a3fb21e8","observation_id":"93764f37-eb3e-4dee-9892-4d602786edaf","resolution":{"observed_at":"2026-05-21T08:14:52.645211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Bootstrapped representation learning on graphs","venue":null,"work_id":"ad17b28f-513d-43da-8666-0162edffbaa2","year":2021},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:b8e5dd984ae88a3c31e4412c35ded72eae73ec8f91ae828258f95ab4936455aa","observation_id":"3f5ec97a-adbc-43b7-9287-80c3ff848a2a","resolution":{"observed_at":"2026-05-21T08:14:52.649432Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Visualizing data using t-sne.Journal of Machine Learning Research, 9(86):2579–2605","venue":null,"work_id":"6eb55d9e-3ef0-411d-ba4c-7e668ec62f1c","year":2008},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:d17923f5feb8bbacc494548511b68913b8c9938129db68a2b4af92ee219988df","observation_id":"8dd0c77b-b55a-4fef-be56-8186592cf3b0","resolution":{"observed_at":"2026-05-21T08:14:52.619008Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Deep graph infomax.stat, 1050:21","venue":null,"work_id":"a312287c-24ef-4424-9262-c38da9a75c01","year":2018},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:4754414b57c0b6ed46dad5261a1418aedc0ea7ff0869befe2ea4d4253f5738da","observation_id":"0d9c889e-ea86-4307-8cd1-db619572c61d","resolution":{"observed_at":"2026-05-21T08:14:52.621073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2212.03533","last_updated":"2024-02-22T06:21:51Z","snapshot_observed_at":"2026-07-06T14:27:46.217000Z","submitted_at":"2022-12-07T09:25:54Z","title":"Text Embeddings by Weakly-Supervised Contrastive Pre-training","version":2},"cited_work":{"arxiv_id":"2212.03533","doi":"10.48550/arxiv.2212.03533","metadata_source":"pith","pith_arxiv_id":"2212.03533","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Text Embeddings by Weakly-Supervised Contrastive Pre-training","venue":"cs.CL","work_id":"789cc674-467e-4f23-bb50-05c79fe8c4c2","year":2022},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"cited_paper":"/paper/2212.03533","citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:48db51506569b280adcf99e9de89c4b0158f4299f64cd238c0f0d5e0da3e6b3b","observation_id":"851d97e5-21c5-4d7e-909a-4ac826bfa4be","resolution":{"observed_at":"2026-05-21T07:59:50.851240Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-01T10:08:09.486841+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-01T10:08:09.486841+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-07T06:34:11.927384+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-07-07T18:14:03.899492Z","title":"Minilm: Deep self-attention distillation for task-agnostic compression of pre-trained transformers.Advances in neural information processing systems, 33:5776–5788","venue":null,"work_id":"a2b11cbe-8682-47ed-bd0b-b99fe25dcf54","year":2020},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:1b5b7332e7cc0755c8aa75d6329f959f9a7e1117a71026e20a9089aa7f3a9f9d","observation_id":"0678c8d2-9f6a-402b-88e6-0ecea0dc9f63","resolution":{"observed_at":"2026-05-21T08:14:52.623265Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Augmenting low-resource text classification with graph-grounded pre-training and prompting","venue":null,"work_id":"0e34adc6-6618-4160-bbbd-6cdf7b4427a6","year":2023},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:a0cd252ccfb6da9d6e4a93b6554d8170e34909b2f7dbad4a45d5f739e03677c7","observation_id":"9ca140a1-de69-45fd-8e91-966a7960c74d","resolution":{"observed_at":"2026-05-21T08:14:52.616790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18428","last_updated":"2024-07-25T23:27:10Z","snapshot_observed_at":"2026-07-06T18:52:12.362493Z","submitted_at":"2024-07-25T23:27:10Z","title":"Weighted Risk Invariance: Domain Generalization under Invariant Feature Shift","version":1},"cited_work":{"arxiv_id":"2407.18428","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.18428","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Weighted risk invari- ance: Domain generalization under invariant feature shift","venue":null,"work_id":"1a429a23-7909-4efe-9e5f-dc6f351a9959","year":2024},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"cited_paper":"/paper/2407.18428","citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:7aca26d5aaf42c7fca68f9eb2f050dbee44db8e0bbe8b012b6efa1a4b778a64a","observation_id":"cd7ac4d5-8954-44c0-a99a-d34b62251318","resolution":{"observed_at":"2026-06-03T13:05:35.993102Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.02466","last_updated":"2024-08-16T08:25:42Z","snapshot_observed_at":"2026-07-06T12:34:43.094722Z","submitted_at":"2022-02-05T02:31:01Z","title":"Handling Distribution Shifts on Graphs: An Invariance Perspective","version":5},"cited_work":{"arxiv_id":"2202.02466","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2202.02466","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Handling distribution shifts on graphs: An invariance perspective","venue":null,"work_id":"abd3a800-0d82-4073-8619-f5fc679a9c35","year":2022},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"cited_paper":"/paper/2202.02466","citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:ef49b617e3a016b188764f9ffb59d138740088187a153121388519ddad4b2f2b","observation_id":"6a7f2240-a5a5-4884-9118-48dfadde1646","resolution":{"observed_at":"2026-05-21T07:59:50.841053Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"A comprehensive study on text-attributed graphs: Benchmarking and rethinking.Advances in Neural Information Processing Systems, 36:17238– 17264","venue":null,"work_id":"3c1743e6-e49e-472f-858e-7eec645ba0ed","year":2023},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:1513307cedc91b3af9d8fdb95c241ccb396300bdfd2ff2acde6584f509bedf7d","observation_id":"3af10843-14ae-4f1d-a0ee-19b209b5599f","resolution":{"observed_at":"2026-05-21T08:14:52.612229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:7cd23a3fb77fcff087ff4e3bcf82348134a645e176d35d67b37aa2d8e0746919","observation_id":"e7df14c8-f387-4628-b6fa-ffbfc574540b","resolution":{"observed_at":"2026-05-21T07:59:50.834273Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2006.04131","last_updated":"2020-07-13T16:32:20Z","snapshot_observed_at":"2026-08-05T13:22:44.473317Z","submitted_at":"2020-06-07T11:50:45Z","title":"Deep Graph Contrastive Representation Learning","version":2},"cited_work":{"arxiv_id":"2006.04131","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2006.04131","snapshot_observed_at":"2026-07-03T20:08:56.312991Z","title":"Deep graph contrastive representation learning.arXiv preprint arXiv:2006.04131","venue":null,"work_id":"cb5de7fe-f75b-451e-a2ef-3758a044c358","year":2020},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"cited_paper":"/paper/2006.04131","citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:5d55f744b59f644fc5122d1ce56f1e3bf66ed50d718522d0b4823027457d9e25","observation_id":"5c6fff83-7ce7-4425-8eb4-e332c84c74da","resolution":{"observed_at":"2026-05-21T07:59:50.847596Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Graphclip: Enhancing transferability in graph foundation models for text-attributed graphs","venue":null,"work_id":"c27cff79-e156-4660-8a54-e867ac92f72b","year":2025},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:cb41a7316071cfaa189fb178b14631548332ff22088e29c949ac6d4094c49c28","observation_id":"a6a52561-3b6a-41f6-b1a8-83280823c6eb","resolution":{"observed_at":"2026-05-21T08:14:52.614411Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"fb914462-205f-4871-9f2d-3e3b307abf85","year":null},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:a698b3401017b33dc81b94e9a7027cce84e452d24132fa484232a80d9c663f18","observation_id":"514d337c-107b-42a5-bb92-8139ca80fc39","resolution":{"observed_at":"2026-05-21T08:14:52.625350Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"205773f0-d36c-4d03-a07e-9ab86538f071","year":null},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:e2109b5f2ef90418c8ca6c6459613a76d09a4d0606dd1f4870c1676415cf51a8","observation_id":"04720d24-c953-446a-8639-9ff99d33b58e","resolution":{"observed_at":"2026-05-21T08:14:52.607931Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"ea1cf974-4ec3-42b6-b00e-3bc002471bc6","year":null},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:ff1cc950316b28ff9b232a096147933860e68badd6178ef223cae34eaca1b466","observation_id":"668f3364-3398-46db-8465-00180f60f217","resolution":{"observed_at":"2026-05-21T08:14:52.605911Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"Proposition 1If the assumptions hold and the predictor f depends only on Z, then the weighted risks are equal across all domains","venue":null,"work_id":"1b99eba4-c30f-4c4c-b355-8a40c03c97a4","year":2023},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:f250acbc01eeae20e3c7120c466badac51eb393890a2877434d14fd711de53b3","observation_id":"fe5791f8-daba-4e57-a7c6-d1188cb71706","resolution":{"observed_at":"2026-05-21T08:14:52.610084Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"4bf75fbe-bcec-4bb4-87a2-bb02698856b1","year":null},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:6f1e9e5bf9ac3314297a7b7169206e5ec601ab1016aa9735f3a55e42474d618f","observation_id":"c4d2ac32-3181-4a00-bcd8-9a4b4400c7cf","resolution":{"observed_at":"2026-05-21T08:14:52.627394Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"82d18fdb-f7ca-43e0-8466-44c501315d49","year":null},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:343215cae0e0a661b3c249a4820dbeaea42463ae7d45c7614d4fe741f3c93d79","observation_id":"78fbbb47-fecd-4db5-8710-89c2525b6569","resolution":{"observed_at":"2026-05-21T08:14:52.647219Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"6808454c-1401-4eb9-b01f-51a9d4362532","year":null},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:40208f914feee597a8ea862cb4238f68e44c5b7b08308a2eda862b04a311bf86","observation_id":"5f7de84f-b31d-4ce5-98bb-9b52b8f9dae4","resolution":{"observed_at":"2026-05-21T08:14:52.666763Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-06-05T21:23:00.469572Z","title":"• GraphCLIP[ 43]: This framework relies heavily on contrastive alignment objectives","venue":null,"work_id":"17b529c6-9c3b-4bde-9008-b0c10b810f9d","year":null},"citing_paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-21T07:55:11.088587Z"},"links":{"citing_paper":"/paper/2605.18579"},"observation_digest":"sha256:0c5fde5967bc279d45727b9b6e816a114933ba7c328ea404ee0603444f1f7a17","observation_id":"901bbd44-b909-48f3-a2ee-e516aef0b54f","resolution":{"observed_at":"2026-05-21T08:14:52.671544Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.18579","last_updated":"2026-05-20T03:15:37Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T23:11:13.880944Z","submitted_at":"2026-05-18T15:56:19Z","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs"},"reference_resolution":{"displayed":51,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":7,"verified_exact":14,"verified_fuzzy":29},"total_outbound_references":51},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 51 of 51 outbound references and 0 inbound Pith citation observations for arXiv:2605.18579."}