{"as_of":"2026-08-09T22:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3c1c8ee71df2ce4b142fbabb42b41ab8cf79e2f465c304f3bbbec640cdee564e","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T21:05:08.099495Z","state":"measured"},{"denominator":33,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":33,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:09:39.803775Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.04910","snapshot_observed_at":"2026-08-07T11:09:39.803775Z","title":"Cornell, O","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.05393","last_updated":"2025-06-03T19:34:24Z","snapshot_observed_at":"2026-08-09T07:02:29.094639Z","submitted_at":"2025-06-03T19:34:24Z","title":"Are Large Language Models Good Temporal Graph Learners?","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:09:39.803775Z"},"links":{"cited_paper":"/paper/2502.04910","citing_paper":"/paper/2506.05393"},"observation_digest":"sha256:f346cf0a8db7274fc8970553b68ee305fb53d698ee21577d7bf0209e8d75e9c1","observation_id":"a4d652d7-08e9-4c29-9808-ca0de76e3597","resolution":{"observed_at":"2026-08-07T11:09:39.803775Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"cited_work":{"arxiv_id":"2502.04910","doi":"10.48550/arxiv.2502.04910","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.04910","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"ArXiv.org","work_id":"a8815afc-5431-422c-bd64-f2aaf55b92a8","year":2025},"citing_paper":{"arxiv_id":"2605.11873","last_updated":"2026-05-12T09:51:59Z","snapshot_observed_at":"2026-07-06T23:23:39.723268Z","submitted_at":"2026-05-12T09:51:59Z","title":"Maximizing Reachability via Shifting of Temporal Paths","version":1},"reference_index":231,"source":"arxiv_source","source_observed_at":"2026-05-13T05:00:02.957536Z"},"links":{"cited_paper":"/paper/2502.04910","citing_paper":"/paper/2605.11873"},"observation_digest":"sha256:3993cc417ba4dffb12f838f6e93bcf91daf2ac69f65ca38d52f45826ee93e670","observation_id":"101f2cf1-93f7-4720-94bb-d02f43ef4fd6","resolution":{"observed_at":"2026-05-13T05:02:17.264771Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.04910/citation-record","integrity":"/paper/2502.04910/integrity","json":"/paper/2502.04910/citation-record.json","paper":"/paper/2502.04910"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T21:05:07.995940Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:07.995940Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:326e8867a5d0a0b931bffbe690f6a470cc677ec2a3703a3d90cbf314c0211ee3","observation_id":"c49efd29-b3f9-4c24-87d6-824250fc358f","resolution":{"observed_at":"2026-08-08T21:05:07.995940Z","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-08T21:05:08.773196Z","title":"Bringing light into the dark: A large-scale evaluation of knowledge graph embedding models under a unified framework","venue":null,"work_id":"54a125ec-622a-4322-991c-4f49e3bfd26c","year":2021},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.000714Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:34492322f87e2c793cd61e3024c2122e232d71d6022b6e3f3e15d9002265bb00","observation_id":"559be85f-746a-4d57-9068-0c356fc9cb69","resolution":{"observed_at":"2026-08-08T21:05:08.776876Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.004468Z","title":"Bias and debias in recommender system: A survey and future directions","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.004468Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:ae2ae9bb9dd38e6231c436cba46e62d5b7cfaec53ef6a8f9b842eb00bac35dad","observation_id":"c7eca132-26a4-444d-99fb-2e47ede171a0","resolution":{"observed_at":"2026-08-08T21:05:08.004468Z","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-08T21:05:08.755278Z","title":"Do we really need complicated model architectures for temporal networks? In The Eleventh International Conference on Learning Representations, 2023","venue":null,"work_id":"e75c59ba-75cc-4d0b-a4c4-4c72e48cffe8","year":2023},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.008301Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:a2820540950c78c1fdeeb28902e8b451cbed10e22d4205c88ac1586b880e5ea9","observation_id":"3defc9ca-9973-4c08-88f0-24a26704c041","resolution":{"observed_at":"2026-08-08T21:05:08.759183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.745139Z","title":"A new data structure for cumulative frequency tables","venue":null,"work_id":"e9859ae8-2f0e-4c79-bbef-0bb442700edb","year":1994},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.016250Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:2bb8b3382c04c8e2833728bd45cb8599838276d64f7d3f599ee2d0ea0163133c","observation_id":"a167497a-2678-4dbd-a2a0-a44c1010c468","resolution":{"observed_at":"2026-08-08T21:05:08.748672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.735444Z","title":"Long range propagation on continuous-time dynamic graphs","venue":null,"work_id":"419b455f-37b3-49e6-9600-bb8e45538895","year":2024},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.020319Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:1547bb1f04506da921ff19cb2d266802374ed5d92519f1e7781a01330aef1d32","observation_id":"857345e4-0b44-4f73-a4d4-fc90a0e36feb","resolution":{"observed_at":"2026-08-08T21:05:08.738817Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.725378Z","title":"Benchtemp: A general benchmark for evaluating temporal graph neural networks","venue":null,"work_id":"dfef9e5b-1827-4337-9826-5f039773b8f7","year":2024},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.024366Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:df50120b7b407757fa328a58fa47e33c952f99a40916ca9ce729e337206c14e7","observation_id":"73fe9920-b5a2-4445-b0bb-dc90275aceee","resolution":{"observed_at":"2026-08-08T21:05:08.728839Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.716044Z","title":"Temporal graph benchmark for machine learning on temporal graphs","venue":null,"work_id":"4fc9875b-cb4d-4b73-9b01-dd16d2687efc","year":2024},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.028139Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:d1ee7e1853651442dcd7277ec596bf5dfeff841969af59792ef4415e6d74c135","observation_id":"38ffa7d7-5ef5-4ead-8a02-5afa1ab61153","resolution":{"observed_at":"2026-08-08T21:05:08.719485Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.706131Z","title":"Neural temporal walks: Motif-aware representation learning on continuous-time dynamic graphs","venue":null,"work_id":"ee6fa4bd-2c03-4839-af65-66a4092111b4","year":2022},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.031836Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:9fb9048a1bdef7b45180077f071806aee817a083bbb2baade311d49033d7390a","observation_id":"29f2d414-9152-4f84-a138-64c6787a1934","resolution":{"observed_at":"2026-08-08T21:05:08.709968Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.696660Z","title":"A survey on popularity bias in recommender systems","venue":null,"work_id":"d929aed6-cdcb-4e39-9553-f0fabee435a6","year":2024},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.035012Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:d57f4172ed73754708db9f41558bd936e7f031fb8b4764423827e41908054ce8","observation_id":"a3fb8079-6c7b-49c8-affb-e20eb7a4bc93","resolution":{"observed_at":"2026-08-08T21:05:08.699918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.687059Z","title":"On sampled metrics for item recommendation","venue":null,"work_id":"9d1f24f8-fd0b-4a20-923a-5024da0b1c5f","year":2020},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.038391Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:0932ff4c1ec934405656d15ba6145f4549718a15b9b86bae724d8333380f85c1","observation_id":"b24b10bb-c68a-43e4-8c91-f1d942c2ec6b","resolution":{"observed_at":"2026-08-08T21:05:08.690656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.041630Z","title":"Predicting dynamic embedding trajectory in temporal interaction networks","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.041630Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:094e553d583f0a0c05e38cdc51655d686462795c8eb219946c57f3dd41f14317","observation_id":"3e3c188c-1a49-4fcc-a4a9-b29b032afe8f","resolution":{"observed_at":"2026-08-08T21:05:08.041630Z","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-08T21:05:08.677382Z","title":"Predicting dynamic embedding trajectory in temporal interaction networks","venue":null,"work_id":"073ea4f7-a495-4301-b368-e02ebaa94466","year":2019},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.044803Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:5936cd8a8aae1b20eb384ca1d14a0335568c9fcbeb3192e532cdff78d8265901","observation_id":"837b85c2-68ce-4b3e-858c-28b3a85198df","resolution":{"observed_at":"2026-08-08T21:05:08.680811Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.668222Z","title":"Neighborhood-aware scalable temporal network representation learning","venue":null,"work_id":"cee0e2d9-21fd-447f-8774-06a18f1b253f","year":2022},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.047996Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:d2b0485aa6ecaf0f10c7f2b7862cd8118c2bd46c1aeb2bbb052ef15ec07b1395","observation_id":"af1a5177-2ad4-4ef0-850a-e0895bb20a59","resolution":{"observed_at":"2026-08-08T21:05:08.671286Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.659348Z","title":"Mixture of link predictors on graphs","venue":null,"work_id":"652a1ca9-1d2b-4b63-85ad-d5e41c3994d3","year":2024},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.051057Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:6abbf121fb293de2538c93af7e382df67249cf2331259d3cc64367e33a839974","observation_id":"f9b92182-6bb4-4f63-86fc-b43631ed91a7","resolution":{"observed_at":"2026-08-08T21:05:08.662195Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.650390Z","title":"Towards better evaluation for dynamic link prediction","venue":null,"work_id":"0b340aa6-6627-4f6d-9eef-54b28f2fc145","year":2022},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.054460Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:3667dd6763a569c52940c3a18c1913ff1e13a4716278df64ccbe3f021c2db982","observation_id":"eac65dcc-c0ca-4e89-8f75-55e9e0e40b82","resolution":{"observed_at":"2026-08-08T21:05:08.653362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.641784Z","title":"A strong node classification baseline for temporal graphs","venue":null,"work_id":"c0625383-59eb-4ff7-870a-4fe2287a7475","year":2022},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.057524Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:1974427f93b049d70d6e97b0aaa3fa3ea998c33fd896ec1dd6c8d7a3b5647c7c","observation_id":"2d8670b8-4258-4d56-94a9-d7c8107146d7","resolution":{"observed_at":"2026-08-08T21:05:08.644754Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-08T21:05:08.060637Z","title":"Temporal graph networks for deep learning on dynamic graphs","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.060637Z"},"links":{"cited_paper":"/paper/2006.10637","citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:bf3424ce935089bc935e34d634bc5f497000d4f417bf6fb538829cabc30a5656","observation_id":"a36e1893-917d-45af-9550-a5c101ee1c91","resolution":{"observed_at":"2026-08-08T21:05:08.060637Z","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-08T21:05:08.631941Z","title":"Temporal graph networks for deep learning on dynamic graphs","venue":null,"work_id":"e4a55089-ad3c-41af-a507-1a5f76899d8e","year":2020},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.064557Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:2158e0604fb260807672771da3fc00bd42cde6e370f0fe8c44115b433179d8d9","observation_id":"5bc12c2d-5f26-4afb-8eaf-bf5b1f70f1a5","resolution":{"observed_at":"2026-08-08T21:05:08.635310Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.622155Z","title":"Temporal graph analysis with tgx","venue":null,"work_id":"ac418933-f789-4440-ac8f-98c6650ea2dc","year":2024},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.067187Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:dac0c689a7c1f600ba242731d6cc68a4f58ad2d0cf7f70aab9b90a34e50373b2","observation_id":"e62ae758-d8bb-4404-9500-8743aee3e651","resolution":{"observed_at":"2026-08-08T21:05:08.625619Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.611393Z","title":"Dyrep: Learning representations over dynamic graphs","venue":null,"work_id":"7258d192-9ca8-43be-97ee-deb9880ab188","year":2019},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.069986Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:ea1f3d50746567e9e7e109318bd67903ef9d40e892d3c0ee1dd23bbc54a51a9f","observation_id":"a3d4ef85-163e-474b-927e-5f6540faf81c","resolution":{"observed_at":"2026-08-08T21:05:08.615406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2105.07944","last_updated":"2021-05-17T15:33:25Z","snapshot_observed_at":"2026-08-07T20:17:21.322116Z","submitted_at":"2021-05-17T15:33:25Z","title":"TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.07944","snapshot_observed_at":"2026-08-08T21:05:08.072813Z","title":"Tcl: Transformer-based dynamic graph modelling via contrastive learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.072813Z"},"links":{"cited_paper":"/paper/2105.07944","citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:d4effabf67f2ec90fed7a830a7eb42ae0ccda0c496c5d088c6357df7e372d362","observation_id":"1c2f9501-203c-4d64-b81a-fa9638f64c2c","resolution":{"observed_at":"2026-08-08T21:05:08.072813Z","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-08T21:05:08.600190Z","title":"Inductive representation learning in temporal networks via causal anonymous walks","venue":null,"work_id":"e4c3016d-2212-47ab-a537-fe897f0173c5","year":2021},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.075764Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:6f4aee0534f52d4a3d51f84e05cbe989bd07e1864529443d286dd26e3b2d93ed","observation_id":"5e8e0747-5d2a-430f-ba4d-2ef29782f8e9","resolution":{"observed_at":"2026-08-08T21:05:08.603988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.589727Z","title":"A survey on the fairness of recommender systems","venue":null,"work_id":"daa04ff7-ddc1-49a3-9a30-2cb55c7e0b2f","year":2023},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.078584Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:d66e349abba9ee0fb24046faf0e8c43c04716aaa71cc2e49e63dbca19e07b43a","observation_id":"742df5ec-fb76-42be-8e48-5191b7c74786","resolution":{"observed_at":"2026-08-08T21:05:08.593307Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.578996Z","title":"On the feasibility of simple transformer for dynamic graph modeling","venue":null,"work_id":"6a7919ab-b455-41ba-820f-96fadcb4bab4","year":2024},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.081297Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:1a47d86410c7e8ead577b9a30b1649fb9d10422f10830c6756fdb573cdb75ecf","observation_id":"1ec4e6cd-eaa6-4c63-9a15-13a89362f681","resolution":{"observed_at":"2026-08-08T21:05:08.582698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.568714Z","title":"Inductive representation learning on temporal graphs","venue":null,"work_id":"005b572c-5d7b-416f-89b3-989854cea6b8","year":2020},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.084048Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:713c54d6cd0665aaf3afa412af5162f2a15e617129c230ecc816de3edcc42f52","observation_id":"203e8a82-fe58-4e0c-ac62-558a43c79dd8","resolution":{"observed_at":"2026-08-08T21:05:08.572357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.557968Z","title":"Towards better dynamic graph learning: New architecture and unified library","venue":null,"work_id":"994833c9-319c-4af4-8d55-cac3c5e8140f","year":2023},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.086802Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:5aa19aefeef4d3a00d2c6b02038d8adfa206e5d0fea6e4f0a08d187c16dca222","observation_id":"a34700b2-d9b3-4a61-aed7-322c6b391571","resolution":{"observed_at":"2026-08-08T21:05:08.561781Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T21:05:08.089339Z","title":"Efficient neural common neighbor for temporal graph link prediction","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.089339Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:ba996f1a75341b9660b8e1dad24f4efc45fa78677dc8ff02e39068f0700463bc","observation_id":"6bec8e8d-5c41-41bc-8594-e9576e92a491","resolution":{"observed_at":"2026-08-08T21:05:08.089339Z","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-08T21:05:08.092458Z","title":"@esa (Ref","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.092458Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:533dcbc31280f5c896776f35acafc28d53c72631c3818b356a3cb294b3030b02","observation_id":"7687732e-8d48-4ae7-af00-b05a6fbda75e","resolution":{"observed_at":"2026-08-08T21:05:08.092458Z","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-08T21:05:08.096128Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.096128Z"},"links":{"citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:1f821c0702c16b7931675eae9e0a2cf09846fd2fc65bd256820cc1ddfd37d187","observation_id":"179a0c0c-4ea3-4e3c-ad8f-a9a656c435bb","resolution":{"observed_at":"2026-08-08T21:05:08.096128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15730","last_updated":"2023-12-08T13:54:55Z","snapshot_observed_at":"2026-07-06T16:24:26.535120Z","submitted_at":"2023-09-27T15:36:45Z","title":"Temporal graph models fail to capture global temporal dynamics","version":3},"cited_work":{"arxiv_id":"2309.15730","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15730","snapshot_observed_at":"2026-08-08T21:05:08.530328Z","title":"Temporal graph models fail to capture global temporal dynamics","venue":"cs.IR","work_id":"f2f4841e-81fe-4003-a3f5-9cc67fe7d4fa","year":2023},"citing_paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-08T21:05:08.099495Z"},"links":{"cited_paper":"/paper/2309.15730","citing_paper":"/paper/2502.04910"},"observation_digest":"sha256:1ca1280295266d2cbaa9cb29fda02d51fd84b12d3b9001b0df8e3a7cc330e7f7","observation_id":"c9eab355-7db4-4500-a19d-73e6b0833f7c","resolution":{"observed_at":"2026-08-08T21:05:08.536168Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.04910","last_updated":"2025-02-07T13:28:31Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T20:58:15.065874Z","submitted_at":"2025-02-07T13:28:31Z","title":"On the Power of Heuristics in Temporal Graphs"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":22},"total_outbound_references":31},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 2 inbound Pith citation observations for arXiv:2502.04910."}