{"as_of":"2026-08-05T23:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c84b54fd3f45c01cb2273790ffbd128f070377a47e7932c7453cda22ff076753","coverage":[{"denominator":37,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":37,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-25T12:15:30.965059Z","state":"measured"},{"denominator":37,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":37,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+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/1907.00544/citation-record","integrity":"/paper/1907.00544/integrity","json":"/paper/1907.00544/citation-record.json","paper":"/paper/1907.00544"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Link prediction and recommendation across heterogeneous social net- works","venue":null,"work_id":"d375126a-7585-480e-98c2-b383b362b979","year":2012},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:a251753fd4e08d9477f45b0ba56e73df3084179d824b96778e10847ba5d4315a","observation_id":"83826b03-bb80-4ecb-8ae7-ad52275aec15","resolution":{"observed_at":"2026-05-25T12:15:47.353948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Meta-path based multi-network collective link prediction","venue":null,"work_id":"fb358ab5-689b-4124-a916-ea100a8c65be","year":2014},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:81eb12635251961e0ad12a858cea6bfc75cf72426203adc2d10913cae2e8de7b","observation_id":"bbd6bb89-9fb5-46c3-9313-a40f8d8abf03","resolution":{"observed_at":"2026-05-25T12:15:47.406160Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Personalized recommendation via cross-domain triadic factorization","venue":null,"work_id":"1468763d-d82b-4f8b-bc38-c036995c2132","year":2013},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:60b5c1c18f375b0b542913bba2b399c7d9f3298de9754896ff86aac0306511ea","observation_id":"345b7e7d-0cdd-4ebb-bf39-fdcff7103c5c","resolution":{"observed_at":"2026-05-25T12:15:47.326277Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Matching users and items across domains to improve the recommendation quality","venue":null,"work_id":"5ca759e3-7d79-49ca-b5dc-3b083672f490","year":2014},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:aa36708e17890db1f0dc86bc224fb49e8bedce604e588b10ca0f8cf7bf0d4ee1","observation_id":"f1e9e658-ac9e-4375-8146-539f9f6d2b01","resolution":{"observed_at":"2026-05-25T12:15:47.399942Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"An iterative global structure-assisted labeled network aligner","venue":null,"work_id":"0f319546-109f-4961-bcce-707252f8f310","year":2018},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:fa3cfc581c660a0e83810861e69c4ec001b8a82b80dfec1d7340179c4c6240fc","observation_id":"2ff04f97-44db-4eec-93d0-b298d47fdd5b","resolution":{"observed_at":"2026-05-25T12:15:47.373098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Adaptive sampling towards fast graph representation learning","venue":null,"work_id":"266fa135-5592-4423-896b-f9cb1e2d1ff0","year":2018},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:60bb5d7aff3e238b0e36f3ac1cdd7d7d840ff506fdb712285e9c0d61b1807369","observation_id":"d4904c5b-db5b-42e0-a304-3f36715814d7","resolution":{"observed_at":"2026-05-25T12:15:47.351445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Semi- supervised graph classification: A hierarchical graph perspective","venue":null,"work_id":"245833e7-f4a2-4612-aa4e-41419c7d28ec","year":2019},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:74fa991ea13d5d52941a313371f51130074021785ca67535776b6f97bc8bdbf1","observation_id":"b25fe26c-7f73-44e6-9e8f-086ffb2f3261","resolution":{"observed_at":"2026-05-25T12:15:47.329706Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Global alignment of multiple protein interaction networks with application to functional orthology detection","venue":null,"work_id":"77232258-1db2-4113-aeee-9f07ca93cb28","year":2008},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:e1434c33786bf1c32026e6d9afcd0ff8b99f097b6b854628404d63524c3f124a","observation_id":"0d328ba0-6d76-4812-a46a-a60548f4773e","resolution":{"observed_at":"2026-05-25T12:15:47.323497Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Algo- rithms for large, sparse network alignment problems","venue":null,"work_id":"21f53c82-332c-4ed1-89a0-f4f5a0586977","year":null},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:6b1a069313d3e1b6866d6487f137ea6468fbfbebb05cf6ccf2c7c16fde63465a","observation_id":"cf25ba3c-34b2-484e-ab14-221683633a9e","resolution":{"observed_at":"2026-05-25T12:15:47.379164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Ninth IEEE International Conference on , pp","venue":null,"work_id":"48ff9f04-5b5f-4824-86bb-a1b4f90ca9e7","year":2009},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:3398ee19052754bc8c69b3c7d6189e50db7c439fb575ca6abc3fb58a64a70da8","observation_id":"4d75b265-71d1-462d-9800-fb2e635f9147","resolution":{"observed_at":"2026-05-25T12:15:47.393512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Big-align: Fast bipartite graph alignment","venue":null,"work_id":"40a8576a-70eb-4044-b847-144e4d01b59a","year":2013},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:2ecd45cb2d413c930801518315448eeb6ef2448f7ba570fe9e3e4c1342e4e685","observation_id":"d4545eee-d368-498f-8d8d-d9c639654e6e","resolution":{"observed_at":"2026-05-25T12:15:47.314720Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Final: Fast attributed network alignment","venue":null,"work_id":"83558d2e-c7e1-46b2-ac59-6bc6283da810","year":2016},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:a4dac49572ef4352fe8f2501de70883befef4da3fa37a2147da930c7edd55b80","observation_id":"800f0345-1bde-4527-b291-6473ecc9444b","resolution":{"observed_at":"2026-05-25T12:15:47.387427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Inferring anchor links across multiple heterogeneous social networks","venue":null,"work_id":"0fc59ba0-f038-43e2-b81e-82cbb88aabda","year":2013},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:23e7fc4a040db926f8f14dda10b26885f972be03e3139f873785014950930ac4","observation_id":"dfd7db04-b547-4484-ab92-dbcf3522cce1","resolution":{"observed_at":"2026-05-25T12:15:47.357031Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Connecting users across social media sites: a behavioral-modeling approach","venue":null,"work_id":"79faaa3e-3c82-462e-9f29-cafefc2830d7","year":2013},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:7590c2425f1d211aa22e9458747c7eb346dc4ced056498b15924e3b41cb8f3a8","observation_id":"ea9f3f52-99bc-408d-9618-d11694775361","resolution":{"observed_at":"2026-05-25T12:15:47.376047Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Mapping users across networks by manifold alignment on hypergraph","venue":null,"work_id":"c13d56df-a7dd-4185-bdb6-50f95b073d9e","year":2014},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:55ca927ed7981be8a725d71235c6ca5626feefb8a92eec81e6557c46575d4b7a","observation_id":"af9262ec-225f-416e-b914-35e14b84ce81","resolution":{"observed_at":"2026-05-25T12:15:47.340246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Aligning users across social networks using network embedding","venue":null,"work_id":"e0bb125f-5d2c-436b-bcfe-b4e35577f19c","year":2016},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:4c1c8a27aade6323270ac721516d14fef666d0c32f46893345fee9b6b41f6899","observation_id":"e972f72f-59fc-4170-a446-19fed0167626","resolution":{"observed_at":"2026-05-25T12:15:47.345804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Predict anchor links across social networks via an embedding approach","venue":null,"work_id":"698f4f07-2002-4756-8055-79ed540bb4cb","year":2016},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:f92bf4909b970667af8d65dc267ec27037ba8ff846b442632c1373f3084927ce","observation_id":"770d7335-77fb-4316-a6ed-6b0313edb643","resolution":{"observed_at":"2026-05-25T12:15:47.364572Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A generalized solution of the orthogonal procrustes problem","venue":null,"work_id":"39827926-8e8e-4873-84e7-6d949bf5910d","year":1966},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:7526eadc08a90c381e949b37495f2312ed84df57c4cdc25ff7e69239cd95122d","observation_id":"9ac242e7-c4cc-4836-8d7c-c23ee7eeab43","resolution":{"observed_at":"2026-05-25T12:15:47.360268Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A new graph-based method for pairwise global network alignment","venue":null,"work_id":"6e453cdd-d02d-4108-ba02-0b1c682d6ae5","year":2009},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:23cd2b06a26208a9a2ac5150ffe2a2ecf312b4588f64a442738923ed2d0ef407","observation_id":"271400c3-df7e-421f-9f19-a084aa863ac9","resolution":{"observed_at":"2026-05-25T12:15:47.335193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hydra: Large- scale social identity linkage via heterogeneous behavior modeling","venue":null,"work_id":"41af796c-66a3-4fa3-ad9a-9d1a19afc200","year":2014},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:adda088c1c6e8c79af074aa1068c60d833664943fe9fd2373ba601788ed421ba","observation_id":"a475a872-df30-4c04-8402-12181e08283f","resolution":{"observed_at":"2026-05-25T12:15:47.409373Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Comsoc: adaptive transfer of user behaviors over composite social network","venue":null,"work_id":"33899f38-9447-4926-8a1b-648c07ba45df","year":2012},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:27fa667f146231c3b32f50a2f94b20d831c49b78441ddfeed892ac7dbf3283e3","observation_id":"9321c502-919a-4085-b928-4332e6614feb","resolution":{"observed_at":"2026-05-25T12:15:47.337747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Multiple anonymized social networks align- ment","venue":null,"work_id":"70e150d6-c923-4024-9a03-a84d9a50807e","year":2015},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:f9b3c6ab2ca18cfb05fa54d254f3cdf9accaba75592ed666a2d54d0cacf1608b","observation_id":"20b40eea-3c1c-46a6-a544-ab6fd8596f59","resolution":{"observed_at":"2026-05-25T12:15:47.403409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Structural deep network embedding","venue":null,"work_id":"84fb7ce3-b8aa-4b05-a688-9d6b7e885e7c","year":2016},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:8c43ea6ef71e14535be846c3e4d37f5c910752784fa3b677dd042e27e779a1d2","observation_id":"5c53bac8-a7b0-4e9d-abbc-8dcbf9e8ca6c","resolution":{"observed_at":"2026-05-25T12:15:47.342953Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Network embedding as matrix factorization: Unifying deepwalk, line, pte, and node2vec","venue":null,"work_id":"d02d86f4-d1e0-415f-ac7d-abaa75059e37","year":2018},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:44701831f02e8c4747c6fb8f037d22b1395395c9e9e11079216483a81b553a62","observation_id":"82a33a55-8e5e-4330-9333-e5c578002871","resolution":{"observed_at":"2026-05-25T12:15:47.396757Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1802.04868","last_updated":"2018-10-26T03:38:08Z","snapshot_observed_at":"2026-07-06T06:23:16.798440Z","submitted_at":"2018-02-13T21:41:32Z","title":"SimplE Embedding for Link Prediction in Knowledge Graphs","version":2},"cited_work":{"arxiv_id":"1802.04868","doi":null,"metadata_source":"pith","pith_arxiv_id":"1802.04868","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"SimplE Embedding for Link Prediction in Knowledge Graphs","venue":"stat.ML","work_id":"67d4d56c-2926-4728-b769-87d76e4277cb","year":2018},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"cited_paper":"/paper/1802.04868","citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:8da9de17bf86dd8a09d8e689d42d29c77927ddf02a2c0541fff4b957beeadb94","observation_id":"dd47b747-e9fa-4aab-88cb-e23206acda24","resolution":{"observed_at":"2026-05-25T12:15:47.041473Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Deepwalk: Online learning of social representations","venue":null,"work_id":"e96d0a9e-a169-4716-9349-97b5ca84d2e4","year":2014},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:45d21c5cad52d0ab50e039d527f9734265e605ab8915ce5ecae389f81f44e9e2","observation_id":"2c8fe619-df33-448e-b5df-6dd86b2d9582","resolution":{"observed_at":"2026-05-25T12:15:47.390672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Line: Large-scale information network embedding","venue":null,"work_id":"4bc87525-e77c-4047-910e-9f19e967c3c2","year":2015},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:09b4f30c7302983ad69c8402df819ad832ad402840ee2b102c0ada00226e2df2","observation_id":"d362bbd6-db6f-4268-b958-641cce74fe52","resolution":{"observed_at":"2026-05-25T12:15:47.384535Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"node2vec: Scalable feature learning for networks","venue":null,"work_id":"d9541ab8-a958-465a-8ee6-e577adebafc9","year":2016},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:0d3534ba3c6eac63ff63a559bb21a0d3b4f2c8a6356c366261e61618cfbbe450","observation_id":"c02ecf81-ce9b-4596-887d-9b4e013ab7bb","resolution":{"observed_at":"2026-05-25T12:15:47.332224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Distributed representations of words and phrases and their composition- ality","venue":null,"work_id":"11d07220-8186-48b0-a90e-f6d7f6970d15","year":2013},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:5c37c84a7c6a21877528fb8ebd6dd15b4e2377f7c595b24a7284fda926af8ad0","observation_id":"6b17943e-0d4a-4292-8dc9-981fbcd74200","resolution":{"observed_at":"2026-05-25T12:15:47.317714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1301.3781","last_updated":"2013-09-07T00:30:40Z","snapshot_observed_at":"2026-07-06T03:04:11.148340Z","submitted_at":"2013-01-16T18:24:43Z","title":"Efficient Estimation of Word Representations in Vector Space","version":3},"cited_work":{"arxiv_id":"1301.3781","doi":"10.48550/arxiv.1301.3781","metadata_source":"pith","pith_arxiv_id":"1301.3781","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Efficient Estimation of Word Representations in Vector Space","venue":"cs.CL","work_id":"59edaa01-a696-45b3-9a08-5eae777a799e","year":2013},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"cited_paper":"/paper/1301.3781","citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:c1b9b030b4fb17460445581b47d0a10617bdc35175a2b7f4cff1ca21114b8c44","observation_id":"437b3995-c3ae-47ed-9135-e31d337363da","resolution":{"observed_at":"2026-05-25T12:15:47.055556Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-07-14T06:20:53.853167+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-14T06:20:53.853167+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Generative adversarial nets","venue":null,"work_id":"bc4fff3c-2534-4cd0-9961-000096591af7","year":2014},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:21ab2228c7d835e14c3ef952946ae3a9a8227a31f926743fa1e7d93ba11b485a","observation_id":"efdfdd8e-eefd-4f5a-a499-a3817e8c2fdb","resolution":{"observed_at":"2026-05-25T12:15:47.320820Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6568","last_updated":"2015-04-15T13:10:07Z","snapshot_observed_at":"2026-08-05T10:03:33.891179Z","submitted_at":"2014-12-20T01:03:46Z","title":"Improving zero-shot learning by mitigating the hubness problem","version":3},"cited_work":{"arxiv_id":"1412.6568","doi":null,"metadata_source":"pith","pith_arxiv_id":"1412.6568","snapshot_observed_at":"2026-06-29T18:43:50.565504Z","title":"Improving zero-shot learning by mitigating the hubness problem","venue":"cs.CL","work_id":"29044245-9665-4e81-9688-a3fbba46618d","year":2014},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"cited_paper":"/paper/1412.6568","citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:3b2130c3758d312b4dc27c5ab890f61bc8d21ad9f9283e752f8421a4499a5bb7","observation_id":"2273af88-549e-4e0e-8031-36b1270e34dd","resolution":{"observed_at":"2026-05-25T12:15:47.051088Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1702.08734","last_updated":"2017-02-28T10:42:31Z","snapshot_observed_at":"2026-07-06T05:31:42.551086Z","submitted_at":"2017-02-28T10:42:31Z","title":"Billion-scale similarity search with GPUs","version":1},"cited_work":{"arxiv_id":"1702.08734","doi":"10.48550/arxiv.1702.08734","metadata_source":"pith","pith_arxiv_id":"1702.08734","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Billion-scale similarity search with GPUs","venue":"cs.CV","work_id":"53d778be-7bb9-4afb-bed9-2bd47f141488","year":2017},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"cited_paper":"/paper/1702.08734","citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:0b447c2fff885b546868cda3ddb7b86c19c08c4a3f7ef05b34b664f60ddf91a2","observation_id":"31b385f7-e270-45c9-82b0-8a5469cb149d","resolution":{"observed_at":"2026-05-25T12:15:47.045924Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-01T10:08:09.582925+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-01T10:08:09.582925+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1702.03859","last_updated":"2017-02-13T16:31:06Z","snapshot_observed_at":"2026-07-06T05:29:49.720370Z","submitted_at":"2017-02-13T16:31:06Z","title":"Offline bilingual word vectors, orthogonal transformations and the inverted softmax","version":1},"cited_work":{"arxiv_id":"1702.03859","doi":null,"metadata_source":"pith","pith_arxiv_id":"1702.03859","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Offline bilingual word vectors, orthogonal transformations and the inverted softmax","venue":"cs.CL","work_id":"75b6a7c8-6b03-401e-b0f8-bfcceb47709b","year":2017},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"cited_paper":"/paper/1702.03859","citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:c59d7d6616764f27dc274f8ea1f314cc38c0c2f0699a0137b1b4a5a6fefc9e7f","observation_id":"8527bfb2-483d-4f02-9016-425ba834f3b8","resolution":{"observed_at":"2026-05-25T12:15:47.060182Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Parseval networks: Improving robustness to adversarial examples","venue":null,"work_id":"98258d27-c6d8-4382-9d44-d29296fdc9ef","year":2017},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:ab3d0f5681dc84d10dd2c05514c164a6548ca650d64ff8c2985bedacdd791c0e","observation_id":"fbdbe34e-f840-48fa-b558-04b6380f8ba4","resolution":{"observed_at":"2026-05-25T12:15:47.348674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"The link-prediction problem for social networks","venue":null,"work_id":"bf460b16-7753-46e1-af45-3388fa2621ca","year":2007},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:936059343530c38e3093fc9b04146efb2383af19fa48bc9127677cd478ceeeda","observation_id":"2e9b9265-551a-4262-89be-728550b6e25b","resolution":{"observed_at":"2026-05-25T12:15:47.382012Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Decaf: A deep convolutional activation feature for generic visual recognition","venue":null,"work_id":"57c3db78-2958-47b9-8992-5a95e0d25ad7","year":2014},"citing_paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-25T12:15:30.965059Z"},"links":{"citing_paper":"/paper/1907.00544"},"observation_digest":"sha256:6ba34fa2faffd43fbe99660ca64ee42e0fb1c9abdaca4f8d9458818e063cded5","observation_id":"1bf06cf5-76f0-4c19-a01a-6e97ac511ea4","resolution":{"observed_at":"2026-05-25T12:15:47.367486Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1907.00544","last_updated":"2019-07-01T04:48:48Z","latest_version":1,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-02T12:17:26.519303Z","submitted_at":"2019-07-01T04:48:48Z","title":"Unsupervised Adversarial Graph Alignment with Graph Embedding"},"reference_resolution":{"displayed":37,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":5,"verified_fuzzy":32},"total_outbound_references":37},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 5 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:1907.00544."}