{"as_of":"2026-08-11T05:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4ffeda97189812ba9ce8cc018bff24f0fcbabdf80382140c78baf9964f01dc75","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-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/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-11T00:25:06.718843Z","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:6fb0e7851a000fd8d22638b7c2173c747903f57157045fbf526ebdf8911b7ffe","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-11T00:25:06.718843Z","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:65e55e3543f40f9eaf88971c48f3eb79d43bc49036843f863908b6017b611163","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-11T00:25:06.718843Z","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:791b8f534ba4a7ff7cf1fb2bfee0f401d560e4002bc97812066ef914d69f2188","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-11T00:25:06.718843Z","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:3eb70d830304e1ad1a7e7643873c0303effe5f2984078176203d07931484a9df","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-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-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-11T00:25:06.718843Z","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:b3040fb6246249714272cd6df60ae32e72125839febe919a1b1ca160702a3633","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-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-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-11T00:25:06.718843Z","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:8918438e478e4a26e8c0dd5156c7002495699bf7a576d8e09c52caf392d99c55","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-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-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-11T00:25:06.718843Z","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:fabf9ef52da85bfe66d21a85e8ae3978a9930b8a0be1c4085c7ff91539a58805","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-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-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-11T00:25:06.718843Z","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:0095f4214c012818a1bedcfe91a0a088845e9aa3090e761ae4c691db63d3dfa7","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-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":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-11T00:25:06.718843Z","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:ab528669ddd7912e06dfb77f7371f8342e00ad0a1c76f15e9dc8d011b58059e2","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-11T00:25:06.718843Z","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:bd322093e0c5c2019259c5e4dbe83d9ad91c8f749bb9c1a12d9f4a0c886e9812","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-11T00:25:06.718843Z","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:7689b5b6d7be818e55de5063b74408b689f431c001620d213bcd3bf945c1fb6d","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-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-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-11T00:25:06.718843Z","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:95c661bafb04b13d543741dfad697e1e66019a7381a80b15f323e6cf2f4547a8","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-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-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-11T00:25:06.718843Z","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:fc43a6a6a61086c191a556deda6be12516e568eee054c1a0b6f282d16ca68172","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-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-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-11T00:25:06.718843Z","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:c7b633375d523cd51f15d3ecd8a4a6b6f4e12fb0bba0330739f005c34cd35207","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-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-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-11T00:25:06.718843Z","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:b36f15d74e7006620227ec435ddcf9146f6395d2c47e5a139abe5eaf099187cf","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-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-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-11T00:25:06.718843Z","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:eb0e33060ef3e8762bb21d41cf0d55865e969218eacf5ab4ec46234f5fa7adc0","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-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-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-11T00:25:06.718843Z","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:d651b91d164639aadb213a8ba3aea8e0131ac6a1007ded9604d033db8241fee8","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-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":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-11T00:25:06.718843Z","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:e5e7d881f3e33657e695d63c74e520e19e7d7cd19f6024c62696874a83128e1d","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-11T00:25:06.718843Z","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:5e9cee2fa8e7579c598b7a21c80229f0a9f4bc562a3b4a4deda99a7ef64a3aa0","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-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-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-11T00:25:06.718843Z","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:7fab7d90a53eea9dcf6c97b2e54dfe664c89c8e11fe8b4ff591066c974a8f116","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-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":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-11T00:25:06.718843Z","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:a22c4e84b91d056edb65a30bfee37e87c2b1677d8cea7b94df971c070c8a14ae","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-11T00:25:06.718843Z","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:ff6fa089421ff798550c7ef40faca6fa26d34d7969d3c59468d262a5c05d8bb6","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-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":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-11T00:25:06.718843Z","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:ba06bb712f892ad946fa4060929aa0936b3c1ddc05d97975ea895f8965cfb924","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-11T00:25:06.718843Z","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:108165b19027a19f661ff9b7f54059ef1a088df2c686b9d7fad9fb77f7de77c4","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-11T00:25:25.328369Z","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-11T00:25:06.718843Z","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:7ba11f2e45572de8fb32ba7325a885b26ea50a15abe5f553d0cfdb4601d5bfe0","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-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":"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-11T00:25:06.718843Z","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:62c7387e7a54e7a17ce96392ccee53669f41b7b03b5757136896ac681898e98c","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-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-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-11T00:25:06.718843Z","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:100f2b7b6dd8173edf9e1991dea1a1a2aa5712e7ab62888fd69b5b79d5cb9bba","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-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-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-11T00:25:06.718843Z","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:585d54cda456c362071d81df91b17e5091458b45884c92763481109c33abb437","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-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-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-11T00:25:06.718843Z","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:c6e6b9ea779309f94ca21a89418f3ab26d8d416966e4ac0c233896fe862429cb","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-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-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-11T00:25:06.718843Z","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:cdbfa1ec6dc9729969c655ed3a8b47f3716d404cd11cb31a004fa906b4cfc579","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-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-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-11T00:25:06.718843Z","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:c49aeea4b44af924e11f9c9c60c46c782337308adbbcb9ae5c2e025b6e03c66a","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-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":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-11T00:25:06.718843Z","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:0b82a62a6380301955ac3924ae8243da5a6677c96d9794940b13603e0d9f3919","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-11T00:25:06.718843Z","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:1911556a96a5406c096c00315200f5d146232e50c648072c627bb043a707b85a","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-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-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-11T00:25:06.718843Z","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:fdf0d105dbd465bb68df060a6e895d8952aa4ab31213f3bfad3861525667f120","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-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-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-11T00:25:06.718843Z","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:894908c41b7ad0440974ada150a84578dbba6eac1f472fd76fe457b5c99df506","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-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-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-11T00:25:06.718843Z","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:808493fd761dd2c7b1fcc7a74aa53cd898175e6f78441ef4f77daeee7505485b","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-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-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-11T00:25:06.718843Z","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:9cd64fba36252d0f92ad57a8401da8b61dd8a716edc821cd1f1c7d6be3618e60","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-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-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-11T00:25:06.718843Z","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:95be5928f407df063986a29899149ac25d3ccaedc78608d1914de245202a59fd","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-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":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-11T00:25:06.718843Z","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:b5233bac49655dd976011d80e61b1e134489aae14aa73160cb539269dc355f37","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-11T00:25:06.718843Z","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:fa51bf682aff5f5d073cb64ef246608d8a78bd617c78e1bbd9272eff198e6409","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-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-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-11T00:25:06.718843Z","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:25b4405cb0afa3e72af43b04612990fc00e83ad9d07549b8da4d42a0de15538a","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-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":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-11T00:25:06.718843Z","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:db82dedf2b7e282618669985b827280e22e6157cae563ec4f0fd439dfe5ca4c3","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-11T00:25:06.718843Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 42 of 42 outbound references and 0 inbound Pith citation observations for arXiv:2507.06334."}