{"as_of":"2026-08-12T04:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ff20442b36e2bafdbfbf43e669c489bc0c2bc9527fa1e3da41e95f44553a8382","coverage":[{"denominator":21,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T00:16:04.591477Z","state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+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/2607.27861/citation-record","integrity":"/paper/2607.27861/integrity","json":"/paper/2607.27861/citation-record.json","paper":"/paper/2607.27861"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2006.10637","last_updated":"2020-10-09T11:39:32Z","snapshot_observed_at":"2026-08-07T10:11:23.671536Z","submitted_at":"2020-06-18T16:06:18Z","title":"Temporal Graph Networks for Deep Learning on Dynamic Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.10637","snapshot_observed_at":"2026-08-01T00:16:02.931322Z","title":"Temporal graph networks for deep learning on dynamic graphs,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:02.931322Z"},"links":{"cited_paper":"/paper/2006.10637","citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:613360990c62fe7c822920e40ea5b00ee234ceab058e350eb855591b489b0a8d","observation_id":"2cf969f8-18f7-40ea-9c49-8163b6b7550a","resolution":{"observed_at":"2026-08-01T00:16:02.931322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:16:03.040886Z","title":"Towards better evaluation for dynamic link prediction,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:03.040886Z"},"links":{"citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:64853ffb13d51a34870e7b6d755e734236497ff084323a5bf98e6a8bd93c69f3","observation_id":"211a9911-ebec-48df-9a41-10582f502772","resolution":{"observed_at":"2026-08-01T00:16:03.040886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:16:03.104362Z","title":"Temporal graph benchmark for machine learning on temporal graphs,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:03.104362Z"},"links":{"citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:491a2175cf3dd4ab4f21fbb25df656de5b8fa580a55a613cdd7c178ba5137010","observation_id":"0009393d-4769-45f7-9d14-c86ac0f47eca","resolution":{"observed_at":"2026-08-01T00:16:03.104362Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.18486","last_updated":"2023-11-30T11:57:07Z","snapshot_observed_at":"2026-08-04T03:43:41.080004Z","submitted_at":"2023-11-30T11:57:07Z","title":"New Perspectives on the Evaluation of Link Prediction Algorithms for Dynamic Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.18486","snapshot_observed_at":"2026-08-01T00:16:03.176039Z","title":"New perspectives on the evaluation of link prediction algorithms for dynamic graphs,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:03.176039Z"},"links":{"cited_paper":"/paper/2311.18486","citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:6b3016b87ef1ac3cbe8a3d65ff1168129be672d7492600e2778dc05848b593d3","observation_id":"d6a6e014-f013-493c-9c28-c4eb2460ac8f","resolution":{"observed_at":"2026-08-01T00:16:03.176039Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:16:03.244030Z","title":"TGB 2.0: A benchmark for learning on temporal knowledge graphs and heterogeneous graphs,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:03.244030Z"},"links":{"citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:0fc902a807d187b3f83d88f6f92aa0e5cd57ce93fe5885a2cae89714474706b7","observation_id":"b11a4d1c-7168-4877-ab65-6d79482c1fd4","resolution":{"observed_at":"2026-08-01T00:16:03.244030Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:16:03.339926Z","title":"On sampled metrics for item recom- mendation,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:03.339926Z"},"links":{"citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:d0411f5dd84ebbe1dfe81e579759a9e71fbebbee2a9b035ca0b1e60cda220e55","observation_id":"c4d8f79a-1b63-49b0-ba64-bf7e8e50b7f4","resolution":{"observed_at":"2026-08-01T00:16:03.339926Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:16:03.406701Z","title":"A case study on sampling strate- gies for evaluating neural sequential item recommendation models,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:03.406701Z"},"links":{"citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:9685762916d83486fd79c3396d36f98a525ca0870f0e89540995a7e3061dcc85","observation_id":"d09dc8bc-ea1d-4ca7-8fa8-010ce10b2e67","resolution":{"observed_at":"2026-08-01T00:16:03.406701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:16:03.479855Z","title":"Towards better dynamic graph learning: New architecture and unified library,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:03.479855Z"},"links":{"citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:458e7652719f2bbc0b19554d7a4b5a47978736e31ecdbda72b7b8ead2585322a","observation_id":"026b0efa-30b7-4000-bf7f-17eb413adfe8","resolution":{"observed_at":"2026-08-01T00:16:03.479855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:16:03.545465Z","title":"Efficient neural com- mon neighbor for temporal graph link prediction,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:03.545465Z"},"links":{"citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:112f93ede209d71ada109f65ecfca07ebe73476a3f2c619a1061d4f560a88bd7","observation_id":"271d6e64-200d-47df-b562-fe6ddc1851a9","resolution":{"observed_at":"2026-08-01T00:16:03.545465Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:16:03.590279Z","title":"Future link prediction without memory or aggregation,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:03.590279Z"},"links":{"citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:f6d6104996525fb97b5fffa07a17136540d7f29a4a008d6028100e7febda69ad","observation_id":"5efdddb8-e83c-4933-be60-00f731ae07f9","resolution":{"observed_at":"2026-08-01T00:16:03.590279Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:16:03.651870Z","title":"TAMI: Taming heterogeneity in temporal interactions for temporal graph link prediction,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:03.651870Z"},"links":{"citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:697cb2ba487f48773ae8599f3b7b191d9cbcd11c28fe16a4443fe8902cdddc7f","observation_id":"1923ef83-ca18-44b8-9b83-d4b8839ad4f6","resolution":{"observed_at":"2026-08-01T00:16:03.651870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:16:03.723706Z","title":"Predicting dynamic embedding trajectory in temporal interaction networks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:03.723706Z"},"links":{"citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:c6b41385ca5275a5bc3de0b0089e1ddcdaadd7e95a52f3ce5ca453a606af082e","observation_id":"414ca9bb-349f-4034-9af3-7bd152019710","resolution":{"observed_at":"2026-08-01T00:16:03.723706Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:16:03.809100Z","title":"Repeat-aware neighbor sampling for dynamic graph learning,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:03.809100Z"},"links":{"citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:95eaf201dcdf058641bab4445a1499a575002f1a49af83b2c121d74ce1c1cc12","observation_id":"f806c860-82e6-445c-bc7a-3269917fe614","resolution":{"observed_at":"2026-08-01T00:16:03.809100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:16:03.933297Z","title":"Improving temporal link prediction via temporal walk matrix projection,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:03.933297Z"},"links":{"citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:02af52056a52641357032a4d39ce5a45ee4c8d1f07f02107ab71b36828c2150b","observation_id":"13b710a6-4952-430d-bee7-bcae03c9ccd1","resolution":{"observed_at":"2026-08-01T00:16:03.933297Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:16:04.026310Z","title":"Towards ideal temporal graph neural networks: Evaluations and conclusions after 10,000 gpu hours,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:04.026310Z"},"links":{"citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:19c40700fa547d0d1025e75542cf0764bf0a62ba55e11251b1894f88d6e68864","observation_id":"f40c6a16-7ba7-498b-859f-4f6b6ba9a05c","resolution":{"observed_at":"2026-08-01T00:16:04.026310Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:16:04.076966Z","title":"Ranking on dynamic graphs: An effective and robust band-pass disentangled approach,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:04.076966Z"},"links":{"citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:5aa820443b28237cef7e7d377376fdc1d93720e9094decceefec2f8e830789f2","observation_id":"5d7f5571-1a8c-44b0-a6d6-b7f33890ea2f","resolution":{"observed_at":"2026-08-01T00:16:04.076966Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:16:04.144059Z","title":"Dyrep: Learning representations over dynamic graphs,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:04.144059Z"},"links":{"citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:822d3125dd386528cd466d59d399bd4bc9d5683bc53e61a51448f436c439dd8f","observation_id":"8541bf21-99bf-4805-a0fb-7620f89ce4ca","resolution":{"observed_at":"2026-08-01T00:16:04.144059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:16:04.234652Z","title":"Do we really need complicated model architectures for temporal networks?","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:04.234652Z"},"links":{"citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:85f084840879322801383997c835b50e62b83ced212c9310ec4e3f27462d7520","observation_id":"1408438b-efb2-4c07-b69e-9e6f7971fff4","resolution":{"observed_at":"2026-08-01T00:16:04.234652Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:16:04.385180Z","title":"Neighborhood-aware scalable temporal network representation learning,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:04.385180Z"},"links":{"citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:cf1b060c8491a6c95d89864f010f0a3c4b28a2b4994c53e6b52e2dc9145107b0","observation_id":"cdba590e-5a5e-4e23-8f1c-16199fb82b04","resolution":{"observed_at":"2026-08-01T00:16:04.385180Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:16:04.457647Z","title":"Noise-contrastive estimation: A new estimation principle for unnormalized statistical models,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:04.457647Z"},"links":{"citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:a638e28422e49d3efc178379585f53aba506c6099394b94baebee18c5cb1ab09","observation_id":"793f097d-d522-4f81-9bd6-ff5bc18ed96a","resolution":{"observed_at":"2026-08-01T00:16:04.457647Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:16:04.591477Z","title":"Strictly proper scoring rules, prediction, and estimation,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T00:16:04.591477Z"},"links":{"citing_paper":"/paper/2607.27861"},"observation_digest":"sha256:6d26e0a47484dfb08bbf25a594fc1d3fad83108b26bdd89fa48d2a428c1e0ee5","observation_id":"f8f292b9-eaf3-445a-89e5-536ff90582ad","resolution":{"observed_at":"2026-08-01T00:16:04.591477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.27861","last_updated":"2026-07-30T08:37:43Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-02T23:45:11.546717Z","submitted_at":"2026-07-30T08:37:43Z","title":"Back to All-Entity Ranking: Sampler-Dependent Evaluation in Continuous-Time Dynamic Graphs"},"reference_resolution":{"displayed":21,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":21},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 21 of 21 outbound references and 0 inbound Pith citation observations for arXiv:2607.27861."}