{"as_of":"2026-08-20T01:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c1c8311136f06993aef2dd63acac9e5d72c49fcdffdd768555f07908a114e768","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T04:36:34.692065Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+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/2412.18720/citation-record","integrity":"/paper/2412.18720/integrity","json":"/paper/2412.18720/citation-record.json","paper":"/paper/2412.18720"},"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-11T04:36:35.289526Z","title":"Accessed: September 20, 2024","venue":null,"work_id":"0d0a6006-0061-4fa1-a0f8-3e9b70d31b63","year":2024},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.517664Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:f360e69ff3dc22f9298b4f0967c08bc54357a3a76f107a9b01acef3732d4f03b","observation_id":"ddcc8fd1-b6e3-4166-8a08-7a59b305eca0","resolution":{"observed_at":"2026-08-11T04:36:35.295429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:34.523648Z","title":"Lightgcl: Simple yet effective graph contrastive learning for recommendation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.523648Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:bf8cb1b4293cfae4e625e203fb697c25ec1820addc33c90d7124c7c7d3ccab3b","observation_id":"4f42c6ee-0f16-4021-8d4b-c93e1374a7c2","resolution":{"observed_at":"2026-08-11T04:36:34.523648Z","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-11T04:36:35.264810Z","title":"Structural balance: a generalization of heider’s theory.Psychological review, 63(5):277, 1956","venue":null,"work_id":"b23fa745-f326-402b-867f-b6d08d1b9da4","year":1956},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.528918Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:160a3b696226b5003981bd8ccfd3aadc65e8a32bd85af97b54d35ea4f27c097d","observation_id":"54a86d8e-ead2-4254-9a35-a67ec56a8cef","resolution":{"observed_at":"2026-08-11T04:36:35.269971Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:35.251421Z","title":"Random walk with restart on hypergraphs: fast computation and an application to anomaly detection.Data Min","venue":null,"work_id":"cb8b216e-716c-4b21-b2f4-8e338f0befc0","year":2024},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.533429Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:a54a3cc7c0eae898eadb6afcc85890b364796c9d7feb12719eb3380474e3df28","observation_id":"396ec514-2c56-47ed-917b-4e304ee1d160","resolution":{"observed_at":"2026-08-11T04:36:35.256521Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:35.235908Z","title":"Balance in signed bipartite networks","venue":null,"work_id":"ae2f6515-6e41-4b61-910e-8ffb94c75ba8","year":2019},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.538341Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:87d7d1da9dfce90bb9719a34af24f843a0eb0997184c515d3cc2998945435de9","observation_id":"b63688f8-f4f6-40f4-8745-0e5a4e3129c9","resolution":{"observed_at":"2026-08-11T04:36:35.241001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:35.223760Z","title":"Signed graph convolutional networks","venue":null,"work_id":"93a9ae6b-07b7-40a8-a06e-7b472e1b475c","year":2018},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.543132Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:843cd762acb97881cf889b99a268f83c41eaf95320a2fcf2ec7d37bac7310ed8","observation_id":"a1bdaa25-9838-4ebd-806b-db5e0257176a","resolution":{"observed_at":"2026-08-11T04:36:35.227800Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:35.211823Z","title":"node2vec: Scalable feature learning for networks","venue":null,"work_id":"68b8d50b-eb69-4ec1-adbe-d777376f8247","year":2016},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.547893Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:96f40dc2ef882563dfe7c2f8e4b3cb9f399c160b66fe3fe49179c68ba3e88b80","observation_id":"88f5f242-812f-4f59-837b-8a81f9dccb88","resolution":{"observed_at":"2026-08-11T04:36:35.215865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:35.198207Z","title":null,"venue":null,"work_id":"5af65f7a-2572-4e5e-bfa9-fe9fb903cf3c","year":2011},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.552380Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:4a9a197d15d9abb98e76e8cb0ee8a5f4d47bb912d3dacc3f4287d2f9331ee0e5","observation_id":"8f9f9f78-5025-4b71-85a7-846a50031b69","resolution":{"observed_at":"2026-08-11T04:36:35.202570Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:35.185789Z","title":"Maxwell Harper and Joseph A","venue":null,"work_id":"614d956c-8dac-4978-a635-fe3dacba0132","year":2016},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.556812Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:5cf4280dfda3836140f90e4b1df740aaff6ccb04f2bf83c919f77a4ec810713b","observation_id":"876f41e1-9f49-46c8-8b48-25b30637af1c","resolution":{"observed_at":"2026-08-11T04:36:35.189924Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:35.174276Z","title":null,"venue":null,"work_id":"64e99a18-7e0b-41ee-b275-602d7e2c0cd7","year":2016},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.560741Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:a5378183a3070e1cb185092916b8c2db4b20d553ae83109977258327edd17106","observation_id":"0e124c2a-a102-4c0f-a581-3b0d060fd899","resolution":{"observed_at":"2026-08-11T04:36:35.177987Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:35.161544Z","title":"Lightgcn: Simplifying and powering graph convolution network for recommendation","venue":null,"work_id":"0635eb6b-f3c5-4d7c-9585-83d3ea37ed2f","year":2020},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.564794Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:a964045724eb8044114b18498e824bfcb87393cd1809fa325a81c01bd5e9beb2","observation_id":"63960de4-e662-4cab-abef-9c48240a6c9a","resolution":{"observed_at":"2026-08-11T04:36:35.165896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:35.149408Z","title":"Signed bipartite graph neural networks","venue":null,"work_id":"d8637771-7d6d-41f4-a19a-735539f77c6d","year":2021},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.568802Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:983bcce351449577943992f67e57146668181a09038cb627305458903fe6d384","observation_id":"358dbc9b-7594-4759-bcc8-764fcdef624c","resolution":{"observed_at":"2026-08-11T04:36:35.153833Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:35.135194Z","title":"Signed graph attention networks","venue":null,"work_id":"cf7d43f3-e1e9-4ee4-97ac-5647e2b7889b","year":2019},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.573435Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:1fc3a3556e4b721d281e29c6ee71a450f87af30d2905a7830c59f62a3e162926","observation_id":"e5cac171-a6de-4a98-8d90-cc1b761d9aa9","resolution":{"observed_at":"2026-08-11T04:36:35.140412Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:35.120391Z","title":"SDGNN: learning node representation for signed directed networks","venue":null,"work_id":"24a3c9d9-f24e-4d42-8be9-79adde33edc5","year":2021},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.581286Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:292c88778e2ab07c0774a5d86c66aa0d632e65983a2c02aca9122dbe0b3ac150","observation_id":"9e51bab2-36ac-4d55-a0c9-e2c980e05209","resolution":{"observed_at":"2026-08-11T04:36:35.125823Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:35.106961Z","title":"Zoom-svd: Fast and memory efficient method for extracting key patterns in an arbitrary time range","venue":null,"work_id":"76342a5b-38b8-4836-bf62-933d90554f78","year":2018},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.585864Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:e8817e60b6071ab9094952128010f987ff19cfe57a5048581aa229c12daa7bcd","observation_id":"4862e9ac-779c-49cf-94b0-dd483ee22d2a","resolution":{"observed_at":"2026-08-11T04:36:35.111830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:35.093373Z","title":"Random walk-based ranking in signed social networks: model and algorithms","venue":null,"work_id":"ee43312c-4d56-42b3-b810-80c62284c821","year":2020},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.591119Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:716994b619cbecc14a906ab44e77d7a7a1ece67dbf15f69b3ef43012b801e293","observation_id":"02401463-b193-4a09-971f-9616a04b4534","resolution":{"observed_at":"2026-08-11T04:36:35.097658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:35.080535Z","title":"Personalized ranking in signed networks using signed random walk with restart","venue":null,"work_id":"b6eab8a2-6153-402c-b8f8-35fc845cc446","year":2016},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.595953Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:cb0d706e17988dc927f8e69853a34066067d86a381359bb6352db9b691ee8a9d","observation_id":"877ceb4f-b124-4653-af38-cabe9addd107","resolution":{"observed_at":"2026-08-11T04:36:35.084753Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:35.068299Z","title":"Bepi: Fast and memory-efficient method for billion-scale random walk with restart","venue":null,"work_id":"94236b3a-e532-43b1-a4c6-b0ad64e26d76","year":2017},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.600723Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:5e18466869dead52babe168b44f1c8146793ab1117673bcb59e38e34dc6703d3","observation_id":"eea392d4-3252-480a-a876-450f65a0a8e6","resolution":{"observed_at":"2026-08-11T04:36:35.072730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:35.055166Z","title":"Fast and accurate pseudoinverse with sparse matrix reordering and incremental approach","venue":null,"work_id":"8ffbc476-048e-4918-9bf6-870f95ee3b0f","year":2020},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.606094Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:1e11373b74113b26a4ad7464d77cca8d6fd0956b0772beb0571380e8ba9cdd81","observation_id":"c42785d8-5593-46b3-a559-738999954bf5","resolution":{"observed_at":"2026-08-11T04:36:35.059723Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2012.14191","last_updated":"2020-12-28T11:08:30Z","snapshot_observed_at":"2026-08-16T18:55:42.926785Z","submitted_at":"2020-12-28T11:08:30Z","title":"Signed Graph Diffusion Network","version":1},"cited_work":{"arxiv_id":"2012.14191","doi":null,"metadata_source":"pith","pith_arxiv_id":"2012.14191","snapshot_observed_at":"2026-08-11T04:36:34.736471Z","title":"Signed Graph Diffusion Network","venue":"cs.LG","work_id":"de75f40e-b044-48a5-9c07-bd6f80025acd","year":2020},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.611851Z"},"links":{"cited_paper":"/paper/2012.14191","citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:9dd62e4a2bb696aec78427fef1863d9a45d4770876bf80903e68a5477c0fb113","observation_id":"c9db7c59-ae93-4501-8c21-d9c7d6fef511","resolution":{"observed_at":"2026-08-11T04:36:34.743386Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:35.043047Z","title":"SIDE: representation learning in signed directed networks","venue":null,"work_id":"d85d2cb7-e0c9-4580-bcf2-bc16f7a71fa3","year":2018},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.616522Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:4b88a7021933771a3f1eedd441630658fadcad392041453f067e49ea3202f068","observation_id":"eaffe717-18d7-4916-b6a5-749fb6300797","resolution":{"observed_at":"2026-08-11T04:36:35.047297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:35.027337Z","title":"Learning disentangled representations in signed directed graphs without social assumptions","venue":null,"work_id":"96c22ec7-554b-4332-9e7c-1f37b5bc0800","year":2024},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.621789Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:cd5c7db7f94dbb4bcda32af186f3b695717312ce26179eec6ce39491ffed1676","observation_id":"0acaf2d4-d045-47a8-b049-a193b50aa420","resolution":{"observed_at":"2026-08-11T04:36:35.033197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:35.011200Z","title":"Universal graph contrastive learning with a novel laplacian perturbation","venue":null,"work_id":"76394745-a064-4bde-9a5f-8d0f00381553","year":2023},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.626459Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:de7cc354fee5974526d34c719ac1d79bf1d7f785a82bb6ab67b45103886ae60f","observation_id":"bcf1611d-91a6-453e-a47f-d2df2b360abe","resolution":{"observed_at":"2026-08-11T04:36:35.016515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:34.994248Z","title":"Time-aware random walk diffusion to improve dynamic graph learning","venue":null,"work_id":"742376a7-6f8f-44b0-9b91-c71ce19b67c3","year":2023},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.630685Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:0b8ba4f893fe912f47a5bc4b844cab99291440f67ccff02ad74bdc068de0de0e","observation_id":"4065cd8b-cbf8-4fde-9a50-4f14afdc3c16","resolution":{"observed_at":"2026-08-11T04:36:35.000155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:34.978677Z","title":"Mule: Multi-grained graph learning for multi- behavior recommendation","venue":null,"work_id":"3e8795b2-e01e-4976-8c23-ae915e5cedff","year":2024},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.634946Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:b432d02e37ef3f628838561fd4f09359c4bc1156d0b0d71fdc3b7d38458ac7b1","observation_id":"ab937719-c6dc-4b59-a8f8-64c83b62da5c","resolution":{"observed_at":"2026-08-11T04:36:34.983719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:34.962511Z","title":"Deeper insights into graph convolutional networks for semi-supervised learning","venue":null,"work_id":"c75ae241-e42e-4534-8df2-6b1b8df9b921","year":2018},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.639356Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:cb7208601c4bd2ac9aa4a823ce1c8b93d3996cec9c0ba3044ade88dd1f7ed0f0","observation_id":"cab6e729-ce9a-404e-9385-6a75b16ebcfd","resolution":{"observed_at":"2026-08-11T04:36:34.967003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:34.947708Z","title":"Learning signed network embedding via graph attention","venue":null,"work_id":"05ad4a72-0cfb-4df5-ab53-ac58db3ccba0","year":2020},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.643070Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:c177913c858d6ebcc42670894541ce51c4ddbb53f83e6d8b696efd6c2314f2c8","observation_id":"91f4de8d-468f-4b0d-90d1-4b12ac3c9529","resolution":{"observed_at":"2026-08-11T04:36:34.952708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:34.933861Z","title":"McAuley, Christopher Targett, Qinfeng Shi, and Anton van den Hengel","venue":null,"work_id":"a8c21735-9d1d-4f0e-b1ef-5dfb7e9c7008","year":2015},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.647303Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:524013fb058c771a0037e154f74042a1057b302bbe2d5a5bc9e6a6afa91b30b4","observation_id":"97a35a7c-f82c-4b2d-9448-7ebf8b5b94a2","resolution":{"observed_at":"2026-08-11T04:36:34.939147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:34.912608Z","title":"A noise-filtering method for link prediction in complex networks","venue":null,"work_id":"44e7ca6a-10ad-48c5-b1ee-50e4333b1ecc","year":2016},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.651192Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:f22497d916a5bf48de16aaa2cb9e68e67b11e2a579706509c09c490442ed7a31","observation_id":"9def8b85-344b-4fbf-8493-dbcf8ca40c2f","resolution":{"observed_at":"2026-08-11T04:36:34.920459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:34.655240Z","title":"The pagerank citation ranking: Bringing order to the web","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.655240Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:1889d27db293c8f94c339ad60f9bd96700f0adcb1c2da9215f3fa33fcb2ec97f","observation_id":"e1d41d5a-01e8-4c98-9c09-bc5e02d17c25","resolution":{"observed_at":"2026-08-11T04:36:34.655240Z","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-11T04:36:34.885170Z","title":"A comparative study of matrix factorization and random walk with restart in recommender systems","venue":null,"work_id":"1c0a7a6a-95c8-4806-a044-904ad38ec381","year":2017},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.659190Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:d00d1b656cd63f64cd44ba4e387a99e0d7d3136fccd2c58de7e30d48db7f4168","observation_id":"ba834791-d75d-4ed1-83fb-75461f13afca","resolution":{"observed_at":"2026-08-11T04:36:34.890358Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:34.861784Z","title":"Clustered low rank approximation of graphs in information science applications","venue":null,"work_id":"9061b950-3403-4d16-8a70-9d211ae5a2d6","year":2011},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.663129Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:3aecd19c8c8c2218fe220753cd38ae84d2d0784abd848c754af30509a2aa410e","observation_id":"a9113c18-8551-4e6e-954e-635908e0d607","resolution":{"observed_at":"2026-08-11T04:36:34.866989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:34.847954Z","title":"The graph neural network model","venue":null,"work_id":"a85a5a59-a7e4-41af-8c11-9ded664e05e2","year":2009},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.667171Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:61955291fdcfe6dccb01d0d2d8180cbdf44835c8cdd921b73f64db3b37ff5bd3","observation_id":"3207f16e-43c1-4694-bd6a-f987c73dd1cc","resolution":{"observed_at":"2026-08-11T04:36:34.852557Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:34.833414Z","title":"BEAR: block elimination approach for random walk with restart on large graphs","venue":null,"work_id":"6af38e43-0cba-43f2-99df-cf13484bbea4","year":2015},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.671043Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:6f28b94af89f577c7b641861aa03b86339a959c40944ac24fcecd1e539ce520f","observation_id":"0f7304a6-26b1-42c8-be4c-296ea046b124","resolution":{"observed_at":"2026-08-11T04:36:34.839483Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:34.816937Z","title":"SGCL: contrastive representation learning for signed graphs","venue":null,"work_id":"37fa4f8d-5fd6-4fa5-9d98-9eb3b76d2605","year":2021},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.675184Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:449a661e85c0238beda82307f72c25c95a9efa45bf747f1cc1b5cb47626bf7eb","observation_id":"2a48ce4e-3fd8-45c2-b255-91aba069988d","resolution":{"observed_at":"2026-08-11T04:36:34.823448Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:34.795763Z","title":"Link prediction with signed latent factors in signed social networks","venue":null,"work_id":"3c96675d-b1cb-4890-aaec-0e6adde6d708","year":2019},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.679795Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:afedbd99c83a4a98d5a670a552088fe98a3c2a84e64b9ba02f2c4c5c6581090d","observation_id":"ddb835e7-c68d-40a9-9572-12517f6a7839","resolution":{"observed_at":"2026-08-11T04:36:34.800303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:34.780287Z","title":"Dual-branch density ratio estimation for signed network embedding","venue":null,"work_id":"2e1ebe03-6f09-4eaf-9f69-312a70c34097","year":2022},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.683906Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:dff85237715022bcc680dde84a46f61976afac9794a27d0a271c02e31687456c","observation_id":"e6062cd1-af49-40b4-8310-d757c9ec3766","resolution":{"observed_at":"2026-08-11T04:36:34.784983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:34.764922Z","title":"Graph contrastive learning with augmentations","venue":null,"work_id":"561c72de-4e35-4063-9d4e-c4e0fd738c24","year":2020},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.687744Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:4079c2ecb581a2f32e71acee3b75808fe0bba38c1d4c4a7a754df4a84b64f25b","observation_id":"f65b5480-24dd-4d04-a6c8-1f9aebf89200","resolution":{"observed_at":"2026-08-11T04:36:34.769633Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+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-11T04:36:34.751902Z","title":"Contrastive learning for signed bipartite graphs","venue":null,"work_id":"9f2c991e-4b0b-48e3-882f-83513f1d2783","year":2023},"citing_paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T04:36:34.692065Z"},"links":{"citing_paper":"/paper/2412.18720"},"observation_digest":"sha256:056b4e45cbea5fc8435384f56160fe3bc606d449d0ed8fb0bb3f30e227fd323d","observation_id":"2a4279cb-e139-46f0-833b-d90bcc31ba93","resolution":{"observed_at":"2026-08-11T04:36:34.756429Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.18720","last_updated":"2024-12-25T00:39:38Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-20T01:13:44.466447Z","submitted_at":"2024-12-25T00:39:38Z","title":"Effective and Lightweight Representation Learning for Link Sign Prediction in Signed Bipartite Graphs"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":34},"total_outbound_references":39},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2412.18720."}