{"as_of":"2026-08-09T02:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2387c57a4ae9217462f52b8371c4a1e04efdce74389f9938085262d200715d8e","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T05:10:55.620829Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2502.08432/citation-record","integrity":"/paper/2502.08432/integrity","json":"/paper/2502.08432/citation-record.json","paper":"/paper/2502.08432"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:56.087564Z","title":"Uci machine learning repository,","venue":null,"work_id":"88643bdf-86c6-4d71-9c66-ceb50c5ee41f","year":2007},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.477521Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:2b93ab74603b8145924b85939abae7785b2753184b70d499e01421eb6b2eddd6","observation_id":"6a81f0b9-37be-43a6-9ae0-63d8f77cd16b","resolution":{"observed_at":"2026-08-08T05:10:56.091228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:56.076732Z","title":"Hypergraph convolution and hyper- graph attention,","venue":null,"work_id":"eab8dbc1-3a09-45cb-9159-be8eb7a69aa5","year":2021},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.481313Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:2644237cdcf2a66d86a8fb2884592545563dcaad0d5478963c0b65aa36baff58","observation_id":"b8759802-dc2f-4da8-9b9a-44b43bb9ac01","resolution":{"observed_at":"2026-08-08T05:10:56.080765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:56.064582Z","title":"On visual similarity based 3d model retrieval,","venue":null,"work_id":"46290721-504a-4933-82bb-4037310a26e3","year":2003},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.484942Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:b4628d08f7dedf0799f0162b16fd3ac36a9c5f7edf9cf7728e8ca8029c952b6f","observation_id":"db02e569-6c05-4add-959d-d5eb329dc93b","resolution":{"observed_at":"2026-08-08T05:10:56.068771Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:56.052694Z","title":"You are allset: A multiset function framework for hypergraph neural networks,","venue":null,"work_id":"a519fc9c-9359-42c9-a578-1a370446b6e3","year":2021},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.488137Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:3f5c0b26dae312c8817e14ea90bc5c1d809be2bd9fd6244320651c3b42597b85","observation_id":"3ecac13b-3550-4d87-9650-f84aaaaf5a38","resolution":{"observed_at":"2026-08-08T05:10:56.056898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:56.041161Z","title":"Fast and accurate deep network learning by exponential linear units (elus),","venue":null,"work_id":"5535d726-01d0-4864-9020-6211b52726e3","year":2015},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.491741Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:66de77b5e6df840dbda4800680c3a6fb4369bdc1351146c7fea399aef4fd66dc","observation_id":"bf78befa-21b5-4e1d-88db-3a8b58469c9e","resolution":{"observed_at":"2026-08-08T05:10:56.045429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:56.028575Z","title":"Hnhn: Hypergraph networks with hyperedge neurons,","venue":null,"work_id":"c251d7ad-4dd1-4177-b779-ecf3829a2aaa","year":2020},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.495102Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:e3b3582a673d68af2db81784fd73a682c9cf902be3ed893c16046fe0b61b7f53","observation_id":"b3611491-a3e2-41fe-8dea-e71d3d32a53d","resolution":{"observed_at":"2026-08-08T05:10:56.033171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:56.015872Z","title":"Hypergraph neural net- works,","venue":null,"work_id":"fac32678-cae6-471d-bcbb-bc68d2de53e2","year":2019},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.498674Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:19d98aff4ae9931b0347150f533ccec0f5a9ec87cd0f60577db4507b277cad56","observation_id":"e14d7ef4-3e35-4f98-a854-7c72af76fa8f","resolution":{"observed_at":"2026-08-08T05:10:56.020280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:56.001865Z","title":"Quantum experiments and hypergraphs: Multiphoton sources for quantum interference, quantum computation, and quantum entanglement,","venue":null,"work_id":"dd1e5efc-36f0-4489-b763-f9b7b892635a","year":2020},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.501687Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:5ea182c1b3ad696ca933a7e46741576f13de58359e0c7bd8b037bf7172ee3ff8","observation_id":"30ace370-5e47-4bf5-9c5e-03a887bda487","resolution":{"observed_at":"2026-08-08T05:10:56.008303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.987190Z","title":"Contrastive multi-view represen- tation learning on graphs,","venue":null,"work_id":"1ee36d48-6552-4c67-a34a-cee090b04ed6","year":2020},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.505160Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:703b22713cd2e0d3c91b5d3dffb9baec62bc193b27fb5a22388df18b9052cb7c","observation_id":"79c8f2ec-5edf-4425-8d41-0b9617a5225d","resolution":{"observed_at":"2026-08-08T05:10:55.991790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.973310Z","title":"Robust basket recommendation via noise- tolerated graph contrastive learning,","venue":null,"work_id":"15453ebd-ba2e-420d-b2c0-e6dc92b05694","year":2023},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.508235Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:f3754e44566e56dc24a8834209c9422a4bbe47e9ddb4b58cb8ac6011699af522","observation_id":"ed512672-a7af-420b-92f3-2ea568146406","resolution":{"observed_at":"2026-08-08T05:10:55.977749Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.960627Z","title":"Unignn: a unified framework for graph and hypergraph neural networks,","venue":null,"work_id":"a85c9e3e-9edd-4290-837a-acbd6a3c993b","year":2021},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.511555Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:cb2cf201f42786fe0248fa6d31eb915f2edc8df7562b44d05d540c8acc0935f9","observation_id":"e2198d34-d45a-48ab-8f53-a6594be615e6","resolution":{"observed_at":"2026-08-08T05:10:55.964886Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.947321Z","title":"I’m me, we’re us, and i’m us: Tri-directional contrastive learning on hypergraphs,","venue":null,"work_id":"734a6f4d-f3f1-4d3d-b231-1df3950847be","year":2023},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.514763Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:3236d9968fe8c44c64581e3007a845331643a8bf0e8c8ba75301a64d979755d2","observation_id":"bcb2ad1a-57c3-40de-89ae-3fff67ff193d","resolution":{"observed_at":"2026-08-08T05:10:55.952587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.926562Z","title":"Coclep: Contrastive learning-based semi-supervised community search,","venue":null,"work_id":"44ca6f9b-0491-4c30-baff-0ea9bb69f652","year":2023},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.518089Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:25fc554f4fa6c7630e098bcb36e4c533339f36319eb74b772b31749245327ecd","observation_id":"2f906f1e-80a1-4a9a-883a-13406554589f","resolution":{"observed_at":"2026-08-08T05:10:55.930731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.917022Z","title":"Hyperbolic hypergraphs for sequential recommendation,","venue":null,"work_id":"4d04363e-2f9f-43ec-8f0f-400d2e0cc5ac","year":2021},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.521288Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:3df82673b5dcc7762034994bf8d405527007b2774881dde94ca963f7dce79ee5","observation_id":"566892dd-3bc6-4b2d-a098-0bbf1d24bacc","resolution":{"observed_at":"2026-08-08T05:10:55.920455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2204.09410","last_updated":"2022-05-30T16:06:26Z","snapshot_observed_at":"2026-07-06T13:01:59.141782Z","submitted_at":"2022-04-19T17:30:08Z","title":"Generating 3D Molecules for Target Protein Binding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2204.09410","snapshot_observed_at":"2026-08-08T05:10:55.524314Z","title":"Generating 3d molecules for target protein binding,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.524314Z"},"links":{"cited_paper":"/paper/2204.09410","citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:0983e39ecb8f819d01b13a7aa4ea0cbb051704d56d1b92b90c61d9e40497b0eb","observation_id":"3cc1775d-167a-430b-b23b-454a52e4d83c","resolution":{"observed_at":"2026-08-08T05:10:55.524314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.527830Z","title":"Self-supervised dynamic hypergraph recommendation based on hyper-relational knowl- edge graph,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.527830Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:3cd1d909bc1dcf6f126161d910d7d831ce6833595be2858f8b89257a2c564c5b","observation_id":"c59ab67d-df23-46aa-921f-ee2d71d13183","resolution":{"observed_at":"2026-08-08T05:10:55.527830Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.530870Z","title":"Decoupled weight decay regularization,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.530870Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:2d1fcd9a9af738feec596a9dc26830d7caad379a10ee0c8069d63b82872925fe","observation_id":"6fd4435d-24b3-47a4-95b2-175de1ecd3d8","resolution":{"observed_at":"2026-08-08T05:10:55.530870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.895276Z","title":"Dualgraph: Improving semi-supervised graph classification via dual contrastive learning,","venue":null,"work_id":"282f778c-7115-4c34-8031-1cdc4a53b20a","year":2022},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.534001Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:b3b2a435d9dfa7ed0b9780974ed5018173c46a196453bcc32580bda7c10aea03","observation_id":"9445e44a-45ec-43b9-aa83-62cb6cffa5ac","resolution":{"observed_at":"2026-08-08T05:10:55.898976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.885556Z","title":"Graph representation learning via graphical mutual information maxi- mization,","venue":null,"work_id":"171a9803-b2a2-4cc2-9307-49822a6744bc","year":2020},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.537230Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:2f743b09c355a2a9c68b4555ca3b8e8718415bc9a839e6e30c296afd6bea707f","observation_id":"50db0c62-ec33-4f34-86a1-a01bd2184aeb","resolution":{"observed_at":"2026-08-08T05:10:55.889227Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.874307Z","title":"The network data repository with interactive graph analytics and visualization,","venue":null,"work_id":"ecb6ee3f-5bd2-423b-94d4-3c75c4cf653e","year":2015},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.540765Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:d4b4b108479eff04d4f345dd69c53ed7032ea72d3fbaa888b1c37429ddf8b4bf","observation_id":"1011e946-b75a-4778-a260-c3e53220ce29","resolution":{"observed_at":"2026-08-08T05:10:55.878129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.863000Z","title":"Hygnn: Drug-drug interaction prediction via hypergraph neural network,","venue":null,"work_id":"6bc132ca-acec-4e50-baa2-486c52a95464","year":2023},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.544332Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:eebc8d5c19a386882b8d321111b8bda0b1210a680753cae54c54ccdce138fd3d","observation_id":"b30970ff-1a1b-4569-a17d-b52338085571","resolution":{"observed_at":"2026-08-08T05:10:55.867324Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.852765Z","title":"Seq- hygan: Sequence classification via hypergraph attention network,","venue":null,"work_id":"b647d3d0-053c-4252-84fd-5c0804c6d251","year":2023},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.547561Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:9fd6c23ecb70b0f6877e2191bbc23ed64840896264ca9d4a05b794b9adfbbab1","observation_id":"a1616c7f-4ddd-4c9b-95db-517cca09adb6","resolution":{"observed_at":"2026-08-08T05:10:55.856389Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.550690Z","title":"Collective classification in network data,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.550690Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:d1b3d00b5671a59ddf58a55ee56b27bf175e9b3a24064f3c1a7e8e9bcf25ef2b","observation_id":"44c2d43d-4008-4f4d-bb10-ac7413616f00","resolution":{"observed_at":"2026-08-08T05:10:55.550690Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.01000","last_updated":"2020-01-17T16:20:00Z","snapshot_observed_at":"2026-08-07T15:39:37.124800Z","submitted_at":"2019-07-31T06:28:43Z","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.01000","snapshot_observed_at":"2026-08-08T05:10:55.553832Z","title":"Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization,","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.553832Z"},"links":{"cited_paper":"/paper/1908.01000","citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:1a44b8061de28353dbdb41950ee4a720293c223e4c4e1eaf8c1e4bca4733e59b","observation_id":"8fc05fb4-f853-4b35-b8c3-e0078bbc4243","resolution":{"observed_at":"2026-08-08T05:10:55.553832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.557716Z","title":"Ms-hgat: memory- enhanced sequential hypergraph attention network for information dif- fusion prediction,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.557716Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:d13933085948d40dbafcd95db7cfc4263de03d8cef954b3434e5da4265fc848c","observation_id":"9e537612-7c7f-4fb1-a60b-6d47f5cd6cf7","resolution":{"observed_at":"2026-08-08T05:10:55.557716Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.830406Z","title":"Self- supervised hypergraph representation learning for sociological analysis,","venue":null,"work_id":"80351355-8293-4636-a74a-5477ced468aa","year":2023},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.560845Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:b6cf9f0e7cce9467447dbae421766da51110be6b9889de3e7aa34bc8f9027e97","observation_id":"2ad9bc6b-cced-4bd1-9c58-f242f48c8877","resolution":{"observed_at":"2026-08-08T05:10:55.834515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.820854Z","title":"Large-scale representation learning on graphs via bootstrapping,","venue":null,"work_id":"9f16b729-5071-4ea3-a49a-8d7551b0d663","year":2022},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.563973Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:c0d41e077f4d0f8d91b6aa1288cb5ea13f143feb601aceadc974e1abc0c84749","observation_id":"84ddefef-d6c7-4f29-9bb1-b2997ac1cb84","resolution":{"observed_at":"2026-08-08T05:10:55.824413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.811713Z","title":"Deep graph infomax,","venue":null,"work_id":"cc7305f4-5363-4244-9573-da11b6846c2e","year":2018},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.567044Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:6f815974c0f8e1a663a78cc337cf1fb8da7d4eae4af481cbef4765d174e39ae1","observation_id":"37aaf020-f858-4143-860c-9ab1307da5e0","resolution":{"observed_at":"2026-08-08T05:10:55.814970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.801989Z","title":"Hypertenet: Hypergraph and transformer-based neural network for personalized list continuation,","venue":null,"work_id":"8ab86501-f595-4fdc-8079-b79c35704e1a","year":2021},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.570509Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:d2e477c98b1dc9f27c3f2923392838a446e77207b65fc6246367db029e73bfe1","observation_id":"570a4880-1974-4705-8efe-f35bfbfe41b5","resolution":{"observed_at":"2026-08-08T05:10:55.805650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.573675Z","title":"3d shapenets: A deep representation for volumetric shapes,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.573675Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:4a30546869b66984ce7be464726b18cd1a893928306173b25bdf6cb3cad56a82","observation_id":"f3437e5f-ca0d-433e-b3c0-d8fefdd2607d","resolution":{"observed_at":"2026-08-08T05:10:55.573675Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.787806Z","title":"Self-supervised hypergraph convolutional networks for session-based recommendation,","venue":null,"work_id":"b9c930d5-08d9-4c74-af02-7319df850970","year":2021},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.576703Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:819ec164b8f0176efb68e9d89affb5331eb65efc3b0b316ead3a083d1b91e73c","observation_id":"d3943add-a607-4238-9831-a427cd2ed46a","resolution":{"observed_at":"2026-08-08T05:10:55.791045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.579655Z","title":"Contrastive learning for sequential recommendation,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.579655Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:5ff432180f890bfdde901c1675d24471341f7bb84ae9103aec8c74dfb823adf7","observation_id":"4ae626d0-c208-4c9a-b050-455c947d0c73","resolution":{"observed_at":"2026-08-08T05:10:55.579655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.772447Z","title":"Hypergcn: A new method for training graph convolutional networks on hypergraphs,","venue":null,"work_id":"209444c7-774a-4617-b40c-1e8b58b32380","year":2019},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.582519Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:043451371fb9e8df8f2d088ae5bc6a947f6dc14464f0cf38ba323cba1eda0e2b","observation_id":"0ec3877a-ee49-47e0-ba8e-dcc836e7436c","resolution":{"observed_at":"2026-08-08T05:10:55.775994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.762190Z","title":"Semi-supervised hyper- graph node classification on hypergraph line expansion,","venue":null,"work_id":"897a8ba5-9fa3-4a3a-842b-49fabaecee61","year":2022},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.585648Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:b79580641691af2a60563773ae37501ff8eccd8ef120c3aee68669ee52917922","observation_id":"19acea5d-6e83-4cb8-a7be-dead99f97dff","resolution":{"observed_at":"2026-08-08T05:10:55.766526Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.588637Z","title":"Revisiting user mobility and social relationships in lbsns: a hypergraph embedding approach,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.588637Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:76e3cd1329cb9752fe9e94a56bd1db907980df361ba2154ddc4d3bd870ebd3b2","observation_id":"3c37ba8d-a1bf-42fd-8f1a-81db3f0d36a1","resolution":{"observed_at":"2026-08-08T05:10:55.588637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.746572Z","title":"Group identification via transitional hypergraph convolution with cross-view self-supervised learning,","venue":null,"work_id":"778a12d7-2270-47d6-a67f-c84fcf57d2c6","year":2023},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.591621Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:fdfd1217f58c8aa7ea4244fa43456817f133fb0c682cf0a8570bd19f5b2e81ac","observation_id":"0f2784fc-0d82-4b9b-bdbb-d68c47671cae","resolution":{"observed_at":"2026-08-08T05:10:55.750306Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.736611Z","title":"Dynamic hypergraph convolutional network,","venue":null,"work_id":"1a40b7fa-ce65-408c-91e9-f53e4bbe4800","year":2022},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.595114Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:11f55212fe6bfb63f0058e968d8c67d7727f0f7fc0fa06d541074db84aa7a3bc","observation_id":"52508147-3f67-4b7b-b05c-1cdc063e9e23","resolution":{"observed_at":"2026-08-08T05:10:55.739812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.598272Z","title":"Graph con- trastive learning with augmentations,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.598272Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:b5f543a447f1163dd744a4f7b6b08e23afa855ed2636992ef7a65209a4023f69","observation_id":"08ecd316-d759-4c9f-9887-70b8f693a2b9","resolution":{"observed_at":"2026-08-08T05:10:55.598272Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.601316Z","title":"Cross-modality and self-supervised protein em- bedding for compound–protein affinity and contact prediction,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.601316Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:e6339757ee825298af59ac77f8d621e869d1328aaf2c3b31b4c622c55c05eb82","observation_id":"1a9dcf69-9600-480c-9499-b6efaf22c092","resolution":{"observed_at":"2026-08-08T05:10:55.601316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.715811Z","title":"Double-scale self-supervised hypergraph learning for group recommendation,","venue":null,"work_id":"a5617b45-0d0a-4b64-a11a-353b1c2e2c4e","year":2021},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.604431Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:e2ecc3c71909f8662c23b2c9327ad74e70803a8d69f16d1d729c54549b36b867","observation_id":"a1e51f85-7818-4570-b566-eca9b6b92971","resolution":{"observed_at":"2026-08-08T05:10:55.719455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.706079Z","title":"Multiscale and integrative single-cell hi-c analysis with higashi,","venue":null,"work_id":"ed7032f7-09c7-4cc5-9875-17554c4fe019","year":2022},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.607645Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:c0768131d16adc7493f5879c25ecd311bc9945006373d80ee157f30b5d02d501","observation_id":"85dc4972-925b-4668-b942-f13eee17d000","resolution":{"observed_at":"2026-08-08T05:10:55.709466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.696098Z","title":"Graph debiased contrastive learning with joint representation clustering","venue":null,"work_id":"baa6d196-437e-426f-8a56-a2f0ae65bc6c","year":2021},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.611765Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:0e167f42ec9169866cbb80828519bf19aa437f7ef244264cab7f08116a124e09","observation_id":"5dde3cfe-a704-4a24-b314-e5fa17f5d87f","resolution":{"observed_at":"2026-08-08T05:10:55.699816Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.686100Z","title":"Deep graph con- trastive representation learning,","venue":null,"work_id":"1024814f-508b-4350-8c2c-8a9c03dac58b","year":2020},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.614633Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:a81141b540d8c893949033fa9098464aaa146dcee2eed8a73fe095e6b9c31d37","observation_id":"3447fb37-ae8f-4b05-bc74-d5afb0dc6636","resolution":{"observed_at":"2026-08-08T05:10:55.689513Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.675793Z","title":"Graph contrastive learning with adaptive augmentation,","venue":null,"work_id":"e0115afa-c4aa-49c4-8f76-f56418fdc928","year":2021},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.617605Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:a2522cdc5b129d6dcef5423ba52173fc99c939f66bad25cbdcf5a25351839a8b","observation_id":"39e9538a-803f-4b32-8ebc-2594c0c7e5da","resolution":{"observed_at":"2026-08-08T05:10:55.679586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T05:10:55.663354Z","title":"Inhomogeneous social recommendation with hypergraph convolutional networks,","venue":null,"work_id":"48031e56-05c6-4f59-8b47-3a73466a15c1","year":2022},"citing_paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-08T05:10:55.620829Z"},"links":{"citing_paper":"/paper/2502.08432"},"observation_digest":"sha256:7c11fdf99ef0316ec9b6385af6eaa170489405a94374597d161f907891411e32","observation_id":"29ef3011-a450-4ef0-8c2f-b96cb15cb7b7","resolution":{"observed_at":"2026-08-08T05:10:55.668810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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"}}],"paper":{"arxiv_id":"2502.08432","last_updated":"2025-02-12T14:16:45Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T05:04:27.222792Z","submitted_at":"2025-02-12T14:16:45Z","title":"Closer through commonality: Enhancing hypergraph contrastive learning with shared groups"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":0,"verified_fuzzy":34},"total_outbound_references":45},"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 9 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2502.08432."}