{"as_of":"2026-08-18T06:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:18b956adcbb1c168949af06c394b7a93632df5fba3544d86a3640ad7adb148a6","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T18:07:24.657375Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2508.15238/citation-record","integrity":"/paper/2508.15238/integrity","json":"/paper/2508.15238/citation-record.json","paper":"/paper/2508.15238"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T18:07:25.026497Z","title":"Efficient temporal core maintenance of massive graphs,","venue":null,"work_id":"ec3f5fa2-1e3c-4722-a6a8-0f76169e9f64","year":2020},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.554250Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:bdc9d1a03db7c8a1b62d65f346e76b5d8a7c1b56efb82c11eb82d2552bd25dc7","observation_id":"6b724a35-1482-4ffe-a992-b9ddf5bec6bd","resolution":{"observed_at":"2026-08-05T18:07:25.029326Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:25.018534Z","title":"Fast algorithms for determining (gener- alized) core groups in social networks,","venue":null,"work_id":"bba5b55e-54a5-48d1-80f2-db646a0b8e08","year":2011},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.557727Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:a6470537b9ee889e44dc0ca95100fe7c888cea7a818da62f0cdd9e1b55066f11","observation_id":"94ce2012-4fb2-492c-aea0-0972cb0f31c5","resolution":{"observed_at":"2026-08-05T18:07:25.021547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:25.010899Z","title":"Financial network communities and methodological insights: A case study for borsa istanbul sustainability index,","venue":null,"work_id":"53b43579-15de-45ce-b7bb-0c8876d016d2","year":2024},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.560707Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:9f4cff5c9cb59aa6a0eb3178f452fe102d48c3125c42ed68f9b28cdb00004181","observation_id":"2129d4d9-0180-44d2-b169-14350711a3a2","resolution":{"observed_at":"2026-08-05T18:07:25.013598Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:25.000884Z","title":"Listing all maximal k-plexes in temporal graphs,","venue":null,"work_id":"c7e28920-adda-45e7-a8d5-29a2add653c6","year":2019},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.563456Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:8bb885c1b57e27896298f55eb1086f3d481e708d23bcba8e82de917175fb34c5","observation_id":"b1e30678-e451-44ba-96a7-293a276246f2","resolution":{"observed_at":"2026-08-05T18:07:25.003545Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.993298Z","title":"Brandes, Network Analysis: Methodological Foundations","venue":null,"work_id":"4a970621-db68-4d8e-bd04-dc5546da19bc","year":2005},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.567507Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:47c6b185547117d982a500bfb65687a62c52718c45dba3e57ef7e33acbb8a21c","observation_id":"42a4aedc-5d06-4d1e-93d7-405f5e0a9c76","resolution":{"observed_at":"2026-08-05T18:07:24.995946Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.985484Z","title":"Output-sensitive enumeration of maximal cliques in temporal graphs,","venue":null,"work_id":"a222c38c-9084-4b20-a3cd-b18506676229","year":2025},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.570197Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:2c2ac49bb2ee325aa0ed976507bb58a4d4ce2e95ae181f2bdfadca092a396daf","observation_id":"317250a2-09fc-404c-a968-4e83a5a6d88a","resolution":{"observed_at":"2026-08-05T18:07:24.988124Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.978022Z","title":"Evaluation of customer behavior with temporal centrality metrics for churn prediction of prepaid contracts,","venue":null,"work_id":"d66f2bdf-0bb3-4cc1-b178-5f9bccb30c81","year":2020},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.573086Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:28000ba42211dd567314d2be1ca8a9bb4e25b3a263c974b25f4bf0cd55b48539","observation_id":"bd3ed989-5d62-4e8d-985b-493e73b518d6","resolution":{"observed_at":"2026-08-05T18:07:24.980663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.969757Z","title":"Querying structural diversity in streaming graphs,","venue":null,"work_id":"d3811e85-00d3-46f8-b5d8-9df0e1ad9486","year":2024},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.575489Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:d92848c53ec079051e588ede5f52bfa5d1705ec755607b865c2f6d8fc968b5ab","observation_id":"382eeedb-4b41-44e4-9f87-41f9d65d2489","resolution":{"observed_at":"2026-08-05T18:07:24.972812Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.961785Z","title":"Relevance of temporal cores for epidemic spread in temporal networks,","venue":null,"work_id":"b88ddc80-fc15-431e-bb51-57247b446ebd","year":2020},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.577903Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:93c3d159662fc1786282f38f72d8b6c068aead40bc725fcaaa842859ee4f109b","observation_id":"3c566896-a57b-449d-8af1-1f8d212bd5d5","resolution":{"observed_at":"2026-08-05T18:07:24.964797Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.953453Z","title":"Are k-cores meaningful for temporal graph analysis?","venue":null,"work_id":"1c56a2e8-1583-46f0-adef-74fd25f79fdf","year":2024},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.580466Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:f1e14796d82fe6d1d9bba49b4e760df6f4ce9dfade6911b52296519d0fd4982e","observation_id":"6c552be0-3a54-4985-8fc9-7884f1b97fa5","resolution":{"observed_at":"2026-08-05T18:07:24.956896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.945673Z","title":"Mining (maximal) span-cores from temporal networks,","venue":null,"work_id":"d081698d-3bf7-4e7a-956e-fda483834047","year":2018},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.582813Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:0dea48a609bdb2433d7eb9046f68d5b27115c95d763cd769ee67964c811b3857","observation_id":"6d297486-7b1f-4668-b737-d7ed52124730","resolution":{"observed_at":"2026-08-05T18:07:24.948299Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.937183Z","title":"Enumerating maximal cliques in temporal graphs,","venue":null,"work_id":"4b71b6b2-f8c1-4d49-8078-eb25f8db6e6a","year":2016},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.585254Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:aa76b666749b752cb138c48a9ba5b2a13a4d008e0f1be04752a87906509bf116","observation_id":"1d414a1b-acef-4afc-bea9-0050fb500d20","resolution":{"observed_at":"2026-08-05T18:07:24.940083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.928207Z","title":"Modern temporal network theory: A colloquium,","venue":null,"work_id":"61dcb222-88d6-4388-adfb-1dad563a9495","year":2015},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.587801Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:bee45f516b0671607cf14f51811ba27372e2dafca713180c85b1cf5a541a4a41","observation_id":"4035c674-166e-4842-bba0-1dc195660acc","resolution":{"observed_at":"2026-08-05T18:07:24.931083Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.919383Z","title":"Maximum(l, k)-lasting cores in temporal social networks,","venue":null,"work_id":"f5da670b-9086-4139-9ec4-93164fd7db2d","year":2021},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.590521Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:e24fa30e09793c796a53ba1d0a651a07486a018ff939bf28334d466cc6247b0b","observation_id":"7162c3b5-bfb8-4740-a831-3d1f2f08cc03","resolution":{"observed_at":"2026-08-05T18:07:24.922161Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.910128Z","title":"Efficient snapshot retrieval over histor- ical graph data,","venue":null,"work_id":"477b3fb4-e3b2-4396-b34f-e3ba9a2b4cae","year":2013},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.592947Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:f4e4fe04f2b568f7fe63da208fc3d478b4d5b9b50ce1d60cf7b0b6f8fb65d080","observation_id":"ab480688-6160-4d70-9037-65046e55ae68","resolution":{"observed_at":"2026-08-05T18:07:24.913410Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.901223Z","title":"k-core: Theories and applications,","venue":null,"work_id":"4c906fa4-fb2b-4533-9bd3-a9c758b409f2","year":2019},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.595322Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:19b6d3462d9af2e1f6a71bd34bf1feb94657df0d091db88c9163810c0d7dd81f","observation_id":"cfefbde3-b063-458b-a118-3716846806ea","resolution":{"observed_at":"2026-08-05T18:07:24.904336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.892567Z","title":"Persistent community search in temporal networks,","venue":null,"work_id":"401c6b72-cb71-43b3-b681-b997008560c1","year":2018},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.597649Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:f2b70a63642d4ab1dfd48257f3cd2a8a164f676bd21a831f402fdba4aa62f4ba","observation_id":"8fee7186-8726-41b0-86ce-ad74ceb0388f","resolution":{"observed_at":"2026-08-05T18:07:24.895508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.883942Z","title":"Efficient continual cohesive subgraph search in large temporal graphs,","venue":null,"work_id":"8871fa8e-f40e-4578-ad72-46ba01840c73","year":2021},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.599974Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:d25931d570974fd18930d925805e47c223eb5e2577f7c8f7c652825df995a527","observation_id":"e3368d8d-2570-4abf-a2fb-10a7e12284ce","resolution":{"observed_at":"2026-08-05T18:07:24.886990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.876147Z","title":"The core decomposition of networks: Theory, algorithms and applica- tions,","venue":null,"work_id":"ce07ff06-8b9e-494c-9098-6379ff35653e","year":2020},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.602318Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:3c211275f1f58a9f83d8ef992c44087e084805f034741dd12c0b4572d530526f","observation_id":"032971e7-446b-46f5-a057-4a61e9c5a15d","resolution":{"observed_at":"2026-08-05T18:07:24.878936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.00344","last_updated":"2025-01-13T15:50:17Z","snapshot_observed_at":"2026-08-16T13:47:12.106571Z","submitted_at":"2024-06-01T07:42:34Z","title":"Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index","version":2},"cited_work":{"arxiv_id":"2406.00344","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.00344","snapshot_observed_at":"2026-08-05T18:07:24.684660Z","title":"Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index","venue":"cs.SI","work_id":"48a657c0-093c-4e6f-adb8-248a10877c0c","year":2024},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.604757Z"},"links":{"cited_paper":"/paper/2406.00344","citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:0f06886c7dea462a26c95d3b94f62082ab4f17cc731a86e1853a330407ca5028","observation_id":"ff7d19f1-baa8-4cc4-9ae0-b1456cbef216","resolution":{"observed_at":"2026-08-05T18:07:24.689936Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.863717Z","title":"Masuda and R","venue":null,"work_id":"c44b5f78-4763-4454-9461-8ebe934f6f75","year":2016},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.607660Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:2c89dcee345c49713cb3aaa12920e50ac885be9533a6fc7904fbf252da1f2bcc","observation_id":"f1482577-3a1d-4d6f-b46e-bdaec756f06d","resolution":{"observed_at":"2026-08-05T18:07:24.868914Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.855880Z","title":"Kwiq: Answer- ing k-core window queries in temporal networks,","venue":null,"work_id":"8e8675de-4a9e-4674-8413-716008c8dbed","year":2023},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.610050Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:0b357da5a711ef86e301e754a78abe001f2a4c1583a1a68b1d2572297d5c2a22","observation_id":"8bbf7a9d-08de-4567-a3d1-4b486b37312b","resolution":{"observed_at":"2026-08-05T18:07:24.858647Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.848251Z","title":"Newman, Networks: An Introduction","venue":null,"work_id":"1968d7fa-98bc-4f83-b50f-d8acf98f9581","year":2010},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.612355Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:e9f7721bb1df50eb651157ab6adf062b18453d67cb4eed42999444cd836139f7","observation_id":"fb29d162-c811-4544-9449-47dc49a13c87","resolution":{"observed_at":"2026-08-05T18:07:24.850882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.840334Z","title":"An edge- based decomposition framework for temporal networks,","venue":null,"work_id":"c715c17b-1100-4e2e-be7e-9a8d4618b42a","year":2025},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.614811Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:f4a3e15adbf6e71329a84467fb7837672366553f054de2404a10f269106c2c28","observation_id":"f965e315-e9b1-4de8-8234-090ccc4d8529","resolution":{"observed_at":"2026-08-05T18:07:24.843185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.831771Z","title":"Mining bursting core in large temporal graphs,","venue":null,"work_id":"fdf90025-78ac-4468-9a15-0db420564207","year":2022},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.617335Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:b7e9ae284eafb10063a1f4f6ba758eb69f9797fd343869c9fa10ed33b58637f7","observation_id":"a5193915-87d7-463d-a105-929395bf415b","resolution":{"observed_at":"2026-08-05T18:07:24.834511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.823763Z","title":"Periodic communities mining in temporal networks: Concepts and algorithms,","venue":null,"work_id":"a78baa30-3840-48a2-a7ba-6d37bfa07ff6","year":2020},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.619809Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:23fd390b1751bb72e3f22b91b5ce93c79b7088a9f67e132267e76c342f4bb478","observation_id":"f15ebf22-a3f5-4bf0-a364-8e73f6a89175","resolution":{"observed_at":"2026-08-05T18:07:24.826577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.815204Z","title":"Network structure and minimum degree,","venue":null,"work_id":"b41cb7db-94de-44a7-be70-5870d20657ac","year":1983},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.622190Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:d7e16f071fe0d0170f4943656889a63f8fc2d18dc3c1e5d955fe166d78fb9917","observation_id":"846e23fd-98cd-41eb-bfae-02307d2c154e","resolution":{"observed_at":"2026-08-05T18:07:24.817997Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.807284Z","title":"Durable graph pattern queries on historical graphs,","venue":null,"work_id":"32770afc-82be-4155-bae6-d04a5b6bf926","year":2016},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.624670Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:3379685cc92cb6fa0548c4883c7668e8858e659505c5479ee02450bfdb873b73","observation_id":"d855fb8a-c873-4351-94ba-369d1ca1ff6e","resolution":{"observed_at":"2026-08-05T18:07:24.810015Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.799580Z","title":"Timereach: Historical reach- ability queries on evolving graphs,","venue":null,"work_id":"da023715-f4fa-477a-a93c-0dd4051eb5cc","year":2015},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.627229Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:8374ba2bc24036c6b3ef2a83bcff4da93b756fee9b481b930f0ea141c0aaf7ec","observation_id":"3f878ecc-c575-41ba-af81-7837e05f87a4","resolution":{"observed_at":"2026-08-05T18:07:24.802280Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.791617Z","title":"Efficient querying k-trusses on temporal graphs,","venue":null,"work_id":"b8886e41-2826-405a-8974-cf7ac988318f","year":2024},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.629545Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:879299fd60ef5d4454f6d7b6e9f22d6aa4152ca00c7bb8a5e68bf797fe4ec097","observation_id":"92196117-b76d-4905-89e2-70a9696e44f8","resolution":{"observed_at":"2026-08-05T18:07:24.794481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.783382Z","title":"Reliable community search in dynamic networks,","venue":null,"work_id":"991f4ed4-0a5c-4c3a-9d50-910eb3ec6da5","year":2022},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.631789Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:bfc44233910f1f283ae4c58602496bd902bb13d8f4b6002388ff44fe65bbd5ee","observation_id":"152d549e-fb29-4f5e-9e72-f022167c7d9d","resolution":{"observed_at":"2026-08-05T18:07:24.786602Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.774687Z","title":"Efficient scalable temporal Web graph store,","venue":null,"work_id":"af6cfaea-51c3-4314-a2d9-1ac98eef4d28","year":2021},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.634126Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:fed4d802919d91ef99db526dfe842e85a93479b9f77b27bc6d0dff6a012fff6b","observation_id":"8609da57-6a81-4362-adb2-72ab4a698176","resolution":{"observed_at":"2026-08-05T18:07:24.777994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.766064Z","title":"Time-dependent graphs: Def- initions, applications, and algorithms,","venue":null,"work_id":"18e0fe0e-2c9e-432a-8556-9846367f23e1","year":2019},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.636564Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:4a271af9e074422b8281199ecbdc5ca0f7d4944f80564e9ad7095cd417a5ac3f","observation_id":"c247c0fc-9ce4-4d01-96f6-5537cd47c171","resolution":{"observed_at":"2026-08-05T18:07:24.769295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.757785Z","title":"On more efficiently and versatilely querying historical k-cores,","venue":null,"work_id":"036b6e8d-a65c-4992-88d8-c111ad6b6d67","year":2025},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.639099Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:ad1377c118fdaba5caba270170904228319be0eba68669402b64d81dc14cbf26","observation_id":"6ae1543f-88ad-4178-8cd5-b5bdc721fd10","resolution":{"observed_at":"2026-08-05T18:07:24.760675Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.749622Z","title":"Efficiently answering span-reachability queries in large temporal graphs,","venue":null,"work_id":"eb5c80cd-af0a-4c6d-b777-f062af41d094","year":2020},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.641530Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:9bd144ed00ec73eca58372f9133d77910aa9cde3fb415abb963bf1fdba75540b","observation_id":"e4213a64-0065-45ad-9802-55dd10556814","resolution":{"observed_at":"2026-08-05T18:07:24.752500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.741478Z","title":"Core decomposition in large temporal graphs,","venue":null,"work_id":"df279978-37fd-45d6-8f82-5a73aa1ead09","year":2015},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.643968Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:1d0fd29bd3c6c5ea247cbadbb189f236921f574dab110100f129536fd5093bfc","observation_id":"ef0b711c-3802-4381-a514-664084a53984","resolution":{"observed_at":"2026-08-05T18:07:24.744459Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.732091Z","title":"Contemporary recommendation systems on big data and their applications: A survey,","venue":null,"work_id":"230d0fe3-1925-4e8b-b1b0-d19399032809","year":2022},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.646617Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:cd28d49b8d9ce8892702b4f567da911f12035fff9bce36af5e9e033685d7494c","observation_id":"ffcc0fc3-173f-47a8-bf2c-fe0cedc561ce","resolution":{"observed_at":"2026-08-05T18:07:24.735224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.723523Z","title":"On querying connected components in large temporal graphs,","venue":null,"work_id":"c25ac47d-b460-4b12-a524-7d5639188bbb","year":2023},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.649322Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:544b1101610c88ae37983d820a87da8f9b2373c0c7c3b0a5f4e1d4fd13d66dc7","observation_id":"8b405a01-c035-44a4-b265-c204f8c4f3df","resolution":{"observed_at":"2026-08-05T18:07:24.726379Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.714630Z","title":"Scalable time-range k-core query on temporal graphs,","venue":null,"work_id":"e7bfad3d-b822-4a57-a2ac-7d7dc93b239d","year":2023},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.652211Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:74492d5be1b6ac71fa630dc408d02a92464bc2f97ab45c12d071f6029eb1d3c9","observation_id":"2525635b-8b58-478d-b1f8-c30c3d9a5bda","resolution":{"observed_at":"2026-08-05T18:07:24.717842Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.705362Z","title":"Evolution forest index: Towards optimal temporal k-core com- ponent search via time-topology isomorphic computation,","venue":null,"work_id":"7de6b59d-8a02-4fea-aec8-a7ba1039579a","year":2024},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.654809Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:fca4ff81691caff66a3b32d15b643e88f417ba1fd2f015d0b9517f45764593bc","observation_id":"7496c963-03a7-432e-80ff-61fd98578288","resolution":{"observed_at":"2026-08-05T18:07:24.708679Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-05T18:07:24.696863Z","title":"On querying historical k-cores,","venue":null,"work_id":"4abd8245-3831-422d-a993-3974060fd53b","year":2033},"citing_paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-05T18:07:24.657375Z"},"links":{"citing_paper":"/paper/2508.15238"},"observation_digest":"sha256:3cf6daa3568699681b20935557776d18822173f99b6badabeff9ecfe8d69e96f","observation_id":"0cb38aab-1d45-4f12-b903-03596b8cc47f","resolution":{"observed_at":"2026-08-05T18:07:24.699742Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2508.15238","last_updated":"2025-08-21T04:53:00Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-12T19:30:50.779158Z","submitted_at":"2025-08-21T04:53:00Z","title":"Temporal $k$-Core Query, Revisited"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":1,"verified_fuzzy":40},"total_outbound_references":41},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2508.15238."}