{"as_of":"2026-08-08T18:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fc850ed5a5a4936f138db643e499455b71321b00dc82ad7551676b318b79473a","coverage":[{"denominator":42,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":42,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:23:36.027330Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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/2507.06334/citation-record","integrity":"/paper/2507.06334/integrity","json":"/paper/2507.06334/citation-record.json","paper":"/paper/2507.06334"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:23:32.249196Z","title":"Parallel batch-dynamic trees via change propagation","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:32.249196Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:8cb353b41f7fa92f4ef55b00cc872d146e4223c2a49deb1cee35f2169b6418d8","observation_id":"3c1b7c42-74de-4f95-b8d9-7c30ba03f292","resolution":{"observed_at":"2026-08-06T19:23:32.249196Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:23:32.314468Z","title":"Parallel batch-dynamic graph connectivity","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:32.314468Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:2d9a2eb8f7f6e0cfe66b41a2bf322f833e5a2423989f59dfca0fa94dda2165b6","observation_id":"99e8487b-8bd7-432b-9f8f-c8e18696698f","resolution":{"observed_at":"2026-08-06T19:23:32.314468Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:23:32.371195Z","title":"Deterministic and low-span work-efficient parallel batch-dynamic trees","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:32.371195Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:c6d3232ae5a7e98bc4c7897fa478b1dc0eaebc60f6331077c8c113efe5920bc7","observation_id":"d15894b3-9ef1-4f18-aecd-e3ffcb12c94a","resolution":{"observed_at":"2026-08-06T19:23:32.371195Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:23:43.291663Z","title":"Large scale networks fingerprinting and visualization using the k-core decomposition","venue":null,"work_id":"279dbca2-4cca-4622-920d-c6cb685779e5","year":2005},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:32.484051Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:36bd85d4da5342560499e65b4264ae96fa488391178db312288f24d9aa4a4a20","observation_id":"bf42161b-f460-4c04-85db-d7ab91f79257","resolution":{"observed_at":"2026-08-06T19:23:43.387690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:43.064230Z","title":"Dynamic representations of sparse graphs","venue":null,"work_id":"64c65416-135b-4810-b7a7-8f4919ce75e6","year":1999},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:32.589636Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:270d883ad8378741caa0fb2dafdb7deb7e75e17ae8343895bcfd4f21180233ce","observation_id":"2d62cffb-9e97-44a8-95b5-5552bc77e583","resolution":{"observed_at":"2026-08-06T19:23:43.170668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:42.813909Z","title":"Core decomposition of uncertain graphs","venue":null,"work_id":"cf9e7130-93fe-4e11-9716-9768b5911b80","year":2014},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:32.681045Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:76533eeb639b6a71fad9d759e5b3b6970f20319584e1fd4011888cd890864a73","observation_id":"5046b04c-4625-4e94-8fb1-41963dbd1d49","resolution":{"observed_at":"2026-08-06T19:23:42.908504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:42.563652Z","title":"Space-and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams","venue":null,"work_id":"004d71fe-5d08-43af-a193-7a97e474873b","year":2015},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:32.754969Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:b815bb7cb4b2b92e431676206dd62867d49c57d95dc04f21112d2670b4a3bf58","observation_id":"032e5e44-f1f1-44fe-849c-5b8a2f090ebd","resolution":{"observed_at":"2026-08-06T19:23:42.696158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:42.377150Z","title":"Efficient load-balancing through distributed token dropping","venue":null,"work_id":"9706fecd-82b9-461c-8d78-3bfcce9110ff","year":2021},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:32.887394Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:f5bcf2a60c6a91b452bd03b2b21221342cefd017af46e55f04c727148c86d1c0","observation_id":"0d13cb0d-73d3-4245-b9aa-5be55c59329c","resolution":{"observed_at":"2026-08-06T19:23:42.438596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:23:33.001072Z","title":"Programming parallel algorithms","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:33.001072Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:5f7027d1196aac547b0b55f87ab17c25e7b324fc78d85b82266525a2a718e563","observation_id":"4c3b6a90-3c76-4713-b12b-1a96fdc58c8a","resolution":{"observed_at":"2026-08-06T19:23:33.001072Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:23:33.059212Z","title":"The parallel evaluation of general arithmetic expressions","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:33.059212Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:c4a74639498a624cc3e09541c808ddabe9de453c9a52ca709739a2bbe03038e2","observation_id":"e836a893-acc8-4fd7-ae40-907897978790","resolution":{"observed_at":"2026-08-06T19:23:33.059212Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:23:42.070403Z","title":"Adaptive out-orientations with applications","venue":null,"work_id":"a54d09b4-2bc1-4e56-a758-93445abe67a9","year":2024},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:33.115924Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:ecd5cb00cc1abc8054180b688d698bcec033d0110c71ba2419a49ac1adc70e92","observation_id":"5540824a-4fa9-49e7-981e-c6ebdf71d013","resolution":{"observed_at":"2026-08-06T19:23:42.209658Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:41.800761Z","title":"Relevance of temporal cores for epidemic spread in temporal networks","venue":null,"work_id":"b2df636e-77aa-4abd-9829-e8c9e9c3a332","year":2020},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:33.188530Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:eea8e3b08dd62891f0f80abc0964f22fa5fd7160bb27edccb6c7a0a97e81f7e8","observation_id":"cae7b823-293d-45fa-a4f7-411a59f23af2","resolution":{"observed_at":"2026-08-06T19:23:41.931519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:41.559882Z","title":"Improved dynamic colouring of sparse graphs","venue":null,"work_id":"18c8c072-7586-46a6-8b6d-739f014eba71","year":2023},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:33.258634Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:c0163c870ffdb598649b9adfac1035faf2532e79cd34c0ff198c64a11713160b","observation_id":"7c0d8529-857c-403b-8f6f-cdf0b8dbc667","resolution":{"observed_at":"2026-08-06T19:23:41.677190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:41.306509Z","title":"Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms","venue":null,"work_id":"25e66b4f-5b54-4d32-9345-b79f089b0e30","year":1986},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:33.386615Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:4ed2934d92303c70fdfb9e4ff1bcdbbe2ca68659f5a5d276ba0a9aba4a8e68f0","observation_id":"d368813b-e3e0-40da-82f7-c40485e3afbd","resolution":{"observed_at":"2026-08-06T19:23:41.424945Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:41.037212Z","title":"Finding the best k in core decomposition: A time and space optimal solution","venue":null,"work_id":"3b8c7d4f-844c-4901-8603-1847c6319248","year":2020},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:33.526059Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:74f084305d33415c5a6ac7b9f004de66571b904bd571e1a271c05d3c2e16b35d","observation_id":"3e33b51d-f00a-448b-b4a4-8d2f2912daa0","resolution":{"observed_at":"2026-08-06T19:23:41.203270Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:40.816371Z","title":"Julienne: A framework for parallel graph algorithms using work-efficient bucketing","venue":null,"work_id":"2b1f42f0-6c1d-439c-a4e6-08a721d5df6f","year":2017},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:33.608311Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:541509a6cd898ca326eae82c65f4aca12e45d3ed3202139174694f158f8c9b0f","observation_id":"38ac823a-fff9-4c6b-a551-fb5f60dbe11a","resolution":{"observed_at":"2026-08-06T19:23:40.938329Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:40.595117Z","title":"Theoretically efficient parallel graph algorithms can be fast and scalable","venue":null,"work_id":"24a5fee1-fe86-477c-ac78-585f5e0d9731","year":2021},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:33.734401Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:9983e63368e25f1e743f78f5b4071ee32f284ae693be1a1982e49baf0d400328","observation_id":"50050149-29d1-4416-b2fe-497b62923022","resolution":{"observed_at":"2026-08-06T19:23:40.662882Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:23:33.838679Z","title":"Parallel batch-dynamic k-clique counting","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:33.838679Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:704bb42e207eeb351f59641298069a02063a0e2a3c5f9778ea3179a85ce9588e","observation_id":"53dd59c1-47f6-4f4e-adfb-0f8602585658","resolution":{"observed_at":"2026-08-06T19:23:33.838679Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:23:40.347883Z","title":"Parallel and streaming algorithms for k-core decomposition","venue":null,"work_id":"a1066f97-06e9-4fc3-8df7-a3acea1ec4a3","year":2018},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:33.946103Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:1cfb45c07bff2ad55fa8f4d5edfc3b09b3067f48239196122dd8b58fcd4df66d","observation_id":"e13a267c-65f7-44ed-810c-ed59c6a33b5c","resolution":{"observed_at":"2026-08-06T19:23:40.447907Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:40.083470Z","title":"Efficient computation of probabilistic core decomposition at web-scale","venue":null,"work_id":"edf629f5-80de-49c8-85ab-cdd61bf7d0bd","year":2019},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:34.012953Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:d9f462fe906fbd14a4cb4364e43cabf3b30ec6624fe7456b90b22d882fbc8102","observation_id":"9580ae9b-fde8-4eb5-9765-33cc2d112022","resolution":{"observed_at":"2026-08-06T19:23:40.223271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:23:34.119237Z","title":"Nearly work-efficient parallel dfs in undirected graphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:34.119237Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:501dd362193fd68c82639137d579d75459dde2aa21bc6f78a590f013e9877f60","observation_id":"8b3c2f0d-82d4-480c-b185-12411ed53c9d","resolution":{"observed_at":"2026-08-06T19:23:34.119237Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:23:39.780433Z","title":"Improved parallel algorithms for density-based network clustering","venue":null,"work_id":"c76020b7-e78d-419f-9a15-4d8848db8381","year":2019},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:34.210250Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:a15bd66abf6337fe085caaf37723c67b2fa2c089cf62df6b41fc134f738166d8","observation_id":"cf8ae8b2-1439-4872-8e31-9e9ac737d47d","resolution":{"observed_at":"2026-08-06T19:23:39.907136Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:23:34.308595Z","title":"Towards a theory of nearly constant time parallel algorithms","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:34.308595Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:36b8cef2acb29e80bb7f14c4b3a4632cb7536750ce92da5063c0b5bbaa7397ad","observation_id":"532aa894-889e-4eaa-b76e-3b53a502a25c","resolution":{"observed_at":"2026-08-06T19:23:34.308595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:23:34.399266Z","title":"Parallel dynamic maximal matching","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:34.399266Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:97f955df307d30d0b450b00d973d07bf1ee762e9263fe863111c52e4fac38157","observation_id":"a69d86ea-5204-4d27-841c-40bbcc9766f1","resolution":{"observed_at":"2026-08-06T19:23:34.399266Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10142","last_updated":"2020-02-24T10:18:44Z","snapshot_observed_at":"2026-08-04T00:40:41.644799Z","submitted_at":"2020-02-24T10:18:44Z","title":"Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity","version":1},"cited_work":{"arxiv_id":"2002.10142","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.10142","snapshot_observed_at":"2026-08-06T19:23:36.447036Z","title":"Explicit and Implicit Dynamic Coloring of Graphs with Bounded Arboricity","venue":"cs.DS","work_id":"bdda3de7-38cf-4693-b868-5feb8f8bb2d6","year":2020},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:34.476170Z"},"links":{"cited_paper":"/paper/2002.10142","citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:959fdbb0853129426e4ff26447f1ec11f9016d543a4e920e39ba2c7d65a55123","observation_id":"51e0c308-f012-4a54-816c-6075fd6e49d6","resolution":{"observed_at":"2026-08-06T19:23:36.540971Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.06033","last_updated":"2025-04-08T13:35:38Z","snapshot_observed_at":"2026-08-07T16:07:31.533925Z","submitted_at":"2025-04-08T13:35:38Z","title":"Parallel Small Vertex Connectivity in Near-Linear Work and Polylogarithmic Depth","version":1},"cited_work":{"arxiv_id":"2504.06033","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.06033","snapshot_observed_at":"2026-08-06T19:23:36.200195Z","title":"Parallel Small Vertex Connectivity in Near-Linear Work and Polylogarithmic Depth","venue":"cs.DS","work_id":"9b928416-64e3-45f5-a9e4-3f459539ce22","year":2025},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:34.572628Z"},"links":{"cited_paper":"/paper/2504.06033","citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:906e2892249d5993253529dd39867955229b58635d363bc85471496302aed55e","observation_id":"2b84a18e-ab84-4623-a874-1eb826a6ea92","resolution":{"observed_at":"2026-08-06T19:23:36.294522Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:39.532159Z","title":"K-core decomposition of large networks on a single pc","venue":null,"work_id":"09436389-d8d4-4a05-b1d2-544c26c23250","year":2015},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:34.649199Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:2039ab3e0b4c1fdec80817bc7eb81f9cb658e8699b1d2076d14dc5fb69b98298","observation_id":"ab07ff74-afc6-4a9b-8b8d-767a51d41b33","resolution":{"observed_at":"2026-08-06T19:23:39.618976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:39.278445Z","title":"Identification of influential spreaders in complex networks","venue":null,"work_id":"d0eeec45-79ab-456f-aa2c-c99e030ce686","year":2010},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:34.724404Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:ad39d6ce7b33e02eb506daf7bb1772d6b945fcdc6c1755911ab1ecca35073b96","observation_id":"9ada176d-8731-48ce-8036-cd22bbde8671","resolution":{"observed_at":"2026-08-06T19:23:39.385030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:39.025054Z","title":"Orienting fully dynamic graphs with worst-case time bounds","venue":null,"work_id":"36d39a82-2e06-4f4f-b189-55876b87df9c","year":2014},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:34.805677Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:6e17d025286e4082e7d17678efcc5d75e2ab36b5c7b7d347d0c26a90df7bf33d","observation_id":"1316179c-7267-4364-9407-6c1c178bf0b8","resolution":{"observed_at":"2026-08-06T19:23:39.149600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:38.770545Z","title":"Parallel k-core decomposition on multicore platforms","venue":null,"work_id":"e9f22fcf-8f26-4f59-bc46-22e1eaa08177","year":2017},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:34.870811Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:487a53e76c32fa360691c8ba8a264838b1f9dc31cc4be64952aabf31106fe427","observation_id":"b787c13d-b7d9-4891-b6e8-d5ba58126f04","resolution":{"observed_at":"2026-08-06T19:23:38.887795Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:38.579983Z","title":"Locality in distributed graph algorithms","venue":null,"work_id":"4cb25ac6-4165-41ab-a656-c24343a354c0","year":1992},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:34.964259Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:b9e7a0723be0256afa89f7ccc31d8e7a939a9a5af657983253951e54ad6ac29b","observation_id":"4cafecb9-4ccd-4eeb-8d53-7acce9f1a0da","resolution":{"observed_at":"2026-08-06T19:23:38.657852Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:23:35.041130Z","title":"Parallel batch-dynamic algorithms for k-core decomposition and related graph problems","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:35.041130Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:0004a11b49ae5e710f1c44e8d1aca4f06001262eef7205ef33556ab2756bf4bb","observation_id":"439d2383-b491-424a-bb72-bdd97f22ec17","resolution":{"observed_at":"2026-08-06T19:23:35.041130Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:23:38.238098Z","title":"Liu, Jessica Shi, Shangdi Yu, Laxman Dhulipala, and Julian Shun","venue":null,"work_id":"f2ea9bea-ead1-477b-97b5-590ad1071342","year":2022},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:35.145085Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:c7856298cf9b1cd2144671037becba7c2be0e2935277a932d5a2a96719a63b8f","observation_id":"c0f05cce-ccd1-4557-9da9-4f63d72b0d58","resolution":{"observed_at":"2026-08-06T19:23:38.369089Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:38.005263Z","title":"Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition","venue":null,"work_id":"08698f74-b4d3-48cb-85ac-0f9ccefa6f81","year":2015},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:35.238425Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:00a4c59f9769d9e86ece8e15dc689a299b7f4fd37a9970c718f6296d14f2051c","observation_id":"cb6e42bb-0d84-4417-9ce3-497983dfd9f5","resolution":{"observed_at":"2026-08-06T19:23:38.077615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:37.780815Z","title":"Efficient progressive minimum k-core search","venue":null,"work_id":"0cba5d2e-f6eb-475d-9b34-f9b21aec6645","year":2020},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:35.311868Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:9fd903a501a1b4dc370bf273ddc385826f095a374b940fdfaa91c8673014cb26","observation_id":"0362f112-ff8c-419a-9455-df91ed84badf","resolution":{"observed_at":"2026-08-06T19:23:37.890740Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:37.556806Z","title":"A game theoretic approach for k-core minimization","venue":null,"work_id":"37613f83-83ff-44f2-8425-ccf43c570a96","year":2020},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:35.369325Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:605739ef70eaf2041a0994a2c36bf207e64ad882273ff5c5b18f141f3c14be1f","observation_id":"2e6a7170-5b43-4abf-bb64-8265c9929b86","resolution":{"observed_at":"2026-08-06T19:23:37.647449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:37.337029Z","title":"Locating influential nodes in complex networks","venue":null,"work_id":"3ed514b1-6256-4947-845f-2278d00340c1","year":2016},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:35.431896Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:b6eaccd07dd01b4875dae04d154e968f5d99e482720cd2c44816b0b7b7f1eb4c","observation_id":"2a903763-1002-4b73-b3b2-a3abe2890b9c","resolution":{"observed_at":"2026-08-06T19:23:37.445087Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:37.142840Z","title":"Decomposition of finite graphs into forests","venue":null,"work_id":"4fe53fe7-3d2d-4a31-97a2-55d22bfe7108","year":1964},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:35.539710Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:6c16ff5fc03d5f30eadb0f65ebe51f95ca56623ac3029c90a0543de3d651dacd","observation_id":"75f35053-8a69-40a4-ab73-f001ac51c70a","resolution":{"observed_at":"2026-08-06T19:23:37.195904Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:23:35.641928Z","title":"Parallel algorithms for red–black trees","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:35.641928Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:6736c8b387dabbbe07c03590ea34f0bd53cb8ab1b30ec695cc59c44c4ea8aab3","observation_id":"5c1c13c4-0b52-4d7c-93f6-8d3b2afa070a","resolution":{"observed_at":"2026-08-06T19:23:35.641928Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:23:36.894884Z","title":"Fully dynamic approximate k-core decomposition in hypergraphs","venue":null,"work_id":"2d6cc824-44a4-4a4e-ae54-13ae3523a5d6","year":2020},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:35.771191Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:69721735d997a34a95ab34444606c098882a0149b8f4f2c8dd64957a64c2c32c","observation_id":"0906f807-183a-492b-b2d8-851e5c39adf5","resolution":{"observed_at":"2026-08-06T19:23:36.970449Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-06T19:23:36.703407Z","title":"Near-optimal fully dynamic densest subgraph","venue":null,"work_id":"c8f73ff0-68fa-4216-b4fc-c0ae2e48e33e","year":2020},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:35.900252Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:3cacd0affddec4b68e3c10c8d6c70ec3d5eed6042fcfc0c14fa1e06bf3870819","observation_id":"e9dffbc1-8e44-41a6-ac27-c0422a71e96d","resolution":{"observed_at":"2026-08-06T19:23:36.776354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T19:23:36.027330Z","title":"Parallel batch-dynamic minimum spanning forest and the efficiency of dynamic agglomerative graph clustering","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T19:23:36.027330Z"},"links":{"citing_paper":"/paper/2507.06334"},"observation_digest":"sha256:4fffca82ca2d6406563ee0e20b2207325800057bbe1e861d0b3731d037595161","observation_id":"ec9e009f-62dc-4303-9633-31aa20c8d0f8","resolution":{"observed_at":"2026-08-06T19:23:36.027330Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.06334","last_updated":"2025-07-08T18:44:08Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-06T19:05:01.901138Z","submitted_at":"2025-07-08T18:44:08Z","title":"Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees"},"reference_resolution":{"displayed":42,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":12,"verified_exact":2,"verified_fuzzy":28},"total_outbound_references":42},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2507.06334."}