{"as_of":"2026-08-10T15:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9d8ff2fe1b09c8b80d7663dc5384b4de21fce0fce235c654bb362f5c7a27022e","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-10T06:31:04.303077+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-07T11:47:10.357296Z","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:ec48c252c72ab2e69c592b694f789d7cb5908afd04251c1f74dcd8e27b3b3a10","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:ca9bc38ce5303d7d98c826472a1606aa603467f0a85df02ff2c39b93d5f7fb35","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:65c48209369867f89092096095569fa0f410613551d0c5faec2ad874bfb14be8","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:bded04c3e4c57f30a82e99fedc9cddcf11526fa8d7ec0cb79049d33285b8e4c9","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:b12844576348359c35dceda0315d5eb31ee2e5021230de9974fc8b323c6ea7e4","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:686796026739eecd9806f3736012c1eb3fbed74907373f76f2d3cc41e886b1ae","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:4a42eb6acb197eb20a6a2aa0ab415c6318caa09b91b2468c6007055547d48b56","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:7b41fc9f656c144044b4ff7e2e4347d793ff5c8ac0649968410fee40a93d9086","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:7148b05574b6fbc4d557fb85d113e96eb9be50386800d8f68bc47bfad3cf86ec","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:643f010e0534eb76abe9b7018159d8b2c2a772480a907859cd58aa816cb6f9bb","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:1260f51aa9bbcc406afa2317b845eb0d8ac9b5016a5e03491de7f97535256814","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:80ab00ed72dd81b5101c83c2544c11d1842f30ad6e1336db2f58ffaf774ca738","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:9cd551ab8c13f7ab9477afd6cf97a861458bde87d0cea028bb8c30d59d7ffd83","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:5261fa239c55aaa3c5acecdb7f85ffd9bac48c3fcf40a6664738de13cc447cd2","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:b020538ace357c86a836c4cfe96c4fd7bafdd2ceb442d0637314cc15de8e3fcc","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:d394d6984497cd0daa4572ed3af1345458205e41adc8d1b0c8d755ba74f8c3f4","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:279284f8ca78cacd17b055d9cfe3a3254396f8971bc0738556165efb63370be6","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:d0e269cbeb8a7a46844dde393bfe804b4fb24b5facf111650e745ec623e306f7","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:b8eb5f19c4bfee562517d4b04da398a955a3c84013effb1b8e825c291bc613ae","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07-06T18:23:44.289062Z","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-07T11:47:10.357296Z","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:26c77e7d256a4842536bc9d11beabdacd7da7495386ea8171119c0256a8d5d52","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:665fdd091e1b41c50832034e3378ae4bb5bb1156e0bedb32d01322842cb9fb0a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:51ff26857ca1f3d4e850e3624b0bef3ae6d0912ba37e38742cd229da16d2eeaf","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:af3a7e1ef81421b91f2bda4ffba02abfb34eef631cd75f70a8d382b4149cd2c9","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:b8f97d39bbdf4cca494972985fb36cea767819e0933c66cba9a5f76983eee275","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:9f6b317e237818b12fd2b43e21bc67d914f8d6c91f874e2761e08f39a6d3dcc3","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:4722eb01dd0f26384019a97022eb768c49e98a8f07027b4477368c383705e81b","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:1653ef5405b5bd387c2b9ad150aa54746b9073b0239dc96ca4c046dd24275f46","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:82a5e1e9f37ed1bf90931afb5a35813f4e835e582b82af76d4ced71b9d840b65","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:7fbde5ab3d258ae1e1721c408949c8d0aa975ce750629a123d14cf29c5f0acfd","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:6009244232f0d04d0c62155073f47be617d8ec60ae6d403d6d4f88dba0b51868","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:42ea496dec6e2a85337f4414114ba7e122c434c5e24609e3890ee7aa9945ef7c","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:51a5f4ba64ce8d2cf9ab9ea60361f262ed367714e420b33333dcd30e888bb26f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:9b15c2d24bd12a87b2c5d5d128e26b14fb5f037d868d321d46755d890190cb90","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:93cea84877e1ef5f92fdeb9b354a11ef4e85af96f254549316adb18b20071718","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:977cc732fd6e0c465033585e6d09440499cd472d1952daa918c9791d80ed595a","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:08982de5ae638cb72e1ae389bd1d1605c4894dd44b21cbbb1980d13b5cfd39a0","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:ac4cedd87d29255a4d3a8f51ae022f03f3c80cbe6447185ab0e8526eb0722aa3","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:2bbdfe2dbe27eb9dd38a00fc9ed973225693066c99a214c2c3a11434d2151c75","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:8a5cc416c8f1fa38316ead582d7f6faaf7ee211951cc3cfb4ccac3ee9622870f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:b6d9e8cc91246c45c9ab53c4212a2e98a3067f5b03220b2ca1d42db8025bdefd","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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:fc6532ff06d5cdfe20fbd82c21ad3c2277062374f6aa800aefd0bb4e70a4eb42","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T11:47:10.357296Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2508.15238."}