{"as_of":"2026-08-13T10:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:64be05720dd673c7956c2af080690af779b1b164d822240a94846d0f251a9a0a","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T16:18:49.875091Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+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/2411.13817/citation-record","integrity":"/paper/2411.13817/integrity","json":"/paper/2411.13817/citation-record.json","paper":"/paper/2411.13817"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T16:18:50.280063Z","title":null,"venue":null,"work_id":"dd0c3a7f-5876-4700-865c-c74a66a003b6","year":2004},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.758177Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:aa6d7e0a89e507d245c75886804a2dcbfa727c9b7fd9d27b56105d4d14def6be","observation_id":"0966d544-8e2d-41f8-aab9-9662e1ccc99c","resolution":{"observed_at":"2026-08-12T16:18:50.284992Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:50.266930Z","title":"A spectral clustering approach to finding communities in graphs","venue":null,"work_id":"a00f944c-7a55-451d-8e8c-bdc2a45781fa","year":2005},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.763065Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:1619ddfce3af81ca0d1f165d3aee27276ade6a9d1b8b0bf454782f1eca7e0fe9","observation_id":"9569b611-7887-4a6c-adc9-616aa03b16f3","resolution":{"observed_at":"2026-08-12T16:18:50.271181Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:50.252560Z","title":null,"venue":null,"work_id":"858bb996-87fe-4a23-8bc8-06ac29a39f74","year":2007},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.767287Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:f1893d880be211fa484433ebd8c24f63b74c01ffa890e0711d1f562af2efc731","observation_id":"d4bf6157-47f3-4c06-915c-2db001abe78e","resolution":{"observed_at":"2026-08-12T16:18:50.257076Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:50.238282Z","title":"Effective indexing for dynamic structural graph clustering","venue":null,"work_id":"3a4e0af8-41d0-492b-a9d8-588e46983bdc","year":2022},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.773021Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:a0dcf98ce1c93b5d1b3128e5ec8d4d1c9a53e5123d6a656f742f8325febdf50f","observation_id":"afad6cba-938f-4bc6-b4d1-69f2fee7ba70","resolution":{"observed_at":"2026-08-12T16:18:50.243947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:50.221853Z","title":"Dynamic structural clustering on graphs","venue":null,"work_id":"ba1876a4-bb9a-4f69-8565-6f0aac50325e","year":2021},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.777532Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:ef17b6eec4900b2dc3da4c66c8a32339434e3c8910e5c7445342ec242ef43e33","observation_id":"6320ec2b-715f-450c-945a-ed372085813f","resolution":{"observed_at":"2026-08-12T16:18:50.226046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:50.206728Z","title":"Efficient structural graph clustering: An index-based approach","venue":null,"work_id":"3bf07830-facb-4f1a-ae62-0518023e458a","year":2017},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.783034Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:c6230cde3aaadd2e5384b4e9e18e982b0a4dc04ad1b7b99df1d47809f310bfda","observation_id":"04e44cba-0215-4b8a-ad3e-6a3721106c70","resolution":{"observed_at":"2026-08-12T16:18:50.211808Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:50.192916Z","title":"Harris, Feng Qian, Weigong Ge, Hong Fang, Xiaowei Xu, and Weida Tong","venue":null,"work_id":"c486f560-70a8-4d2e-8ff7-a2141176d652","year":2012},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.787477Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:08adbeeaf45b4f15c5f340b1eac8fd89beb7274d434efaf42e2160657ad513bb","observation_id":"937f314a-e0f6-4a8e-beb7-adc5fd2ea407","resolution":{"observed_at":"2026-08-12T16:18:50.197213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:50.178546Z","title":"Translating clinical findings into knowledge in drug safety evaluation-drug induced liver injury prediction system (dilips)","venue":null,"work_id":"11b60db5-14bc-4ea2-b2ba-de8c066e5f45","year":2011},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.792385Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:d8154fbb59b626865bb95e18bdbf83c4e61862ec5d61faaf17673bb11b91b70b","observation_id":"0eb1c59f-197f-4b0b-a732-709a3627ea5c","resolution":{"observed_at":"2026-08-12T16:18:50.183275Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:50.164510Z","title":"Constructing a robust protein-protein interaction network by integrating multiple public databases","venue":null,"work_id":"09adb2a0-b7e8-428f-97f3-69ad3b568c59","year":2011},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.797602Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:6130e8ad5c18565d65a756dbafe336f676bff986a539b76e43feb0b52d5f6696","observation_id":"1fbc0fa5-6207-4a7d-bde1-c1abffcc7142","resolution":{"observed_at":"2026-08-12T16:18:50.170253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:50.151077Z","title":"Linkscan: Overlapping community detection using the link-space transformation","venue":null,"work_id":"c6855014-b3e9-4205-854e-57c6b7ca78ee","year":2014},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.801893Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:fc043cc16db1bf851015ba41eaf5d3e66057f71daed2ef0be8b8f42e028ec49a","observation_id":"b6771b04-18d9-46a2-845c-7d945a13233e","resolution":{"observed_at":"2026-08-12T16:18:50.155512Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:50.135040Z","title":"Community detection in social media: Performance and application considerations","venue":null,"work_id":"9786aba2-7b65-415d-8ee1-8c986f912d06","year":2012},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.805640Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:f4742189f4a16fc882974c2ef6a7caac5dd323ed6f4a1a6513b87ea69a891049","observation_id":"2d341a67-85a5-42e7-9777-3492ad39df85","resolution":{"observed_at":"2026-08-12T16:18:50.141117Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:49.809800Z","title":"Community detection in graphs","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.809800Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:2038f13cde85a54570279c1c8dcd591dc47023d75a432da044fbbc79eebf5eb9","observation_id":"351cb042-904a-45f4-8154-96a4ba72ae94","resolution":{"observed_at":"2026-08-12T16:18:49.809800Z","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-12T16:18:50.106817Z","title":"Leveraging collective intelligence through community detection in tag networks","venue":null,"work_id":"7436f303-f2fa-4fb4-b77b-1a02b6761b6c","year":2009},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.813693Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:6f3bd2c408c74dc113bcef6730f7f7fcd65b0b7790d72c76911436bf02f4591f","observation_id":"9f542c70-93be-4908-8c94-d38080f3191c","resolution":{"observed_at":"2026-08-12T16:18:50.111129Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:50.092746Z","title":"A graph-based clustering scheme for identifying related tags in folksonomies","venue":null,"work_id":"e10e2600-997d-431e-b010-d1a992059165","year":2010},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.817520Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:c5b6b7c01f0c692f3d2de872323dc7bd2fc71db45cfccacf83618e1796cb63a0","observation_id":"569ac6ba-c5cf-4729-a5c3-ad8a1f91bbd8","resolution":{"observed_at":"2026-08-12T16:18:50.097419Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:50.079973Z","title":"Clustering blockchain data","venue":null,"work_id":"96069b63-331d-4090-a386-11d66105b180","year":2019},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.822001Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:7181685087d3e61fc61e1a3be0f0652d3cd507e20db303292305436d144ab303","observation_id":"0b94c1d4-ad89-4a45-8428-b60a71f2df47","resolution":{"observed_at":"2026-08-12T16:18:50.083731Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:50.067490Z","title":"Ctb-pki: Clustering and trust enabled blockchain based pki system for efficient communication in p2p network","venue":null,"work_id":"0c5a420e-7831-4689-95e1-d1b8b64861f8","year":2022},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.825836Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:0957fbf85d49637a3f71dd6419ada7ed5da6e15e848a4b0f58fec1f04b01bec8","observation_id":"b179c993-94c2-42d6-98c5-596f6fc417bf","resolution":{"observed_at":"2026-08-12T16:18:50.072036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:50.053071Z","title":"A structural-clustering based active learning for graph neural networks","venue":null,"work_id":"a10af109-8597-4076-afd5-bb50252af538","year":2024},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.829805Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:16346b7b4e086c83edc418bc7e3d79faf2a58fdc584dc1573c012e4843431cd9","observation_id":"348b3d72-d681-4cd9-9875-d19d00cda694","resolution":{"observed_at":"2026-08-12T16:18:50.058851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:50.036490Z","title":"Self-supervised heterogeneous graph pre-training based on structural clustering","venue":null,"work_id":"4fbb6137-d81a-4819-9420-e2d7b1eeb128","year":2022},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.834137Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:7538e34528f26889a1c51ab4faac166fb634a4c7f70aedb5d33112fa24c6d84d","observation_id":"cf5f2f7c-5a09-49b3-831b-e4f341a3e249","resolution":{"observed_at":"2026-08-12T16:18:50.041335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:50.021036Z","title":"pscan: Fast and exact structural graph clustering","venue":null,"work_id":"45c4b3ae-a715-42ff-96b1-7d5d2c20b5ab","year":2017},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.837599Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:e3ac0e99c0691bab7a07e71f75ba3b1261b27e1200e09078123030bc910d1cbf","observation_id":"d56a769f-b151-434e-99de-91aa5d860ed2","resolution":{"observed_at":"2026-08-12T16:18:50.027405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:50.004317Z","title":"Algorithms for distributed functional monitoring","venue":null,"work_id":"8521da44-34d4-428e-b812-2498b583185e","year":2011},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.842589Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:589c74ccf6dfc4b86fe20ea72a1a205bae75894fa9a67970e0b1e7650202c0ee","observation_id":"f3a45f2b-cf42-48d0-a503-3ec249987ff4","resolution":{"observed_at":"2026-08-12T16:18:50.008936Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:49.992755Z","title":"Randomized algorithms for tracking distributed count, frequencies, and ranks","venue":null,"work_id":"f3ca38c9-1606-484d-a828-a6eb95cddfaa","year":2012},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.846185Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:1cab55d3ec5e3ae968c66523425bfd3e62b272cb3311fe25636df6c487c9f03a","observation_id":"04b5420c-637c-49cd-a77d-e418b910f0be","resolution":{"observed_at":"2026-08-12T16:18:49.996554Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:49.981216Z","title":"Communication-efficient distributed monitoring of thresholded counts","venue":null,"work_id":"32f9cb90-3b3e-4f42-8691-44767fd78483","year":2006},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.850267Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:1122f83f9c9416ab652ae9b4caf5e2e57c0d483f5fd7bd0a7cfff6d44c353ef6","observation_id":"e4522f18-5df6-4b7e-8cd8-ae3f8ebdf061","resolution":{"observed_at":"2026-08-12T16:18:49.984960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:49.854775Z","title":"Probability inequalities for sums of bounded random variables","venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.854775Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:7321264e0d8d1ffd7ba2cccba1d3b4b08281dd97864551a00b7c318354504885","observation_id":"147e6d29-7f68-4ed8-9006-2689f1c04919","resolution":{"observed_at":"2026-08-12T16:18:49.854775Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.18036","last_updated":"2024-09-26T16:42:10Z","snapshot_observed_at":"2026-08-12T22:36:44.383077Z","submitted_at":"2024-09-26T16:42:10Z","title":"Optimal Dynamic Parameterized Subset Sampling","version":1},"cited_work":{"arxiv_id":"2409.18036","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.18036","snapshot_observed_at":"2026-08-12T16:18:49.906953Z","title":"Optimal Dynamic Parameterized Subset Sampling","venue":"cs.DS","work_id":"8dbc2849-d676-42ee-a9d6-606c80db680c","year":2024},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.858819Z"},"links":{"cited_paper":"/paper/2409.18036","citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:0936f85cf25aa4666b1d37f71871c94c0f55034188ed2c7bb6bfc9f4908460bb","observation_id":"59522b19-e34a-4776-adcd-070338417454","resolution":{"observed_at":"2026-08-12T16:18:49.913208Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:49.960426Z","title":"SNAP Datasets: Stanford large network dataset collection","venue":null,"work_id":"43364d73-743a-4b6b-952f-49ae00e15082","year":2014},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.863203Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:7625b95f7f768d395550a21644cfb32fcf44c4b1fb309c4ab2e9ca9bf3b14e47","observation_id":"efa07f5b-cc91-46cb-895b-b595f411b5f4","resolution":{"observed_at":"2026-08-12T16:18:49.965656Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:49.866933Z","title":"Rossi and Nesreen K","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.866933Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:09c7ff93f9d0dcf5688b33cfce4a43cee6146eead38c890c454d688a97211c2e","observation_id":"def51a89-60c9-4b93-accf-00e693c1cffc","resolution":{"observed_at":"2026-08-12T16:18:49.866933Z","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-12T16:18:49.936479Z","title":"Source code and technical report, 2024","venue":null,"work_id":"e836c6c6-9ea7-40af-ab2b-f1a91bee9cc5","year":2024},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.870878Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:9c7192b7bb77518dfc89ae4f303739bbd989a6097bc2233bbe5c78b9b196f840","observation_id":"8802f747-79a2-4680-b837-544353f0e12e","resolution":{"observed_at":"2026-08-12T16:18:49.940700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+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-12T16:18:49.922356Z","title":"Comparing partitions","venue":null,"work_id":"bd9b09a5-5c5a-486a-aa6f-90298126c98b","year":1985},"citing_paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-12T16:18:49.875091Z"},"links":{"citing_paper":"/paper/2411.13817"},"observation_digest":"sha256:02220d261ddd14637bbdcab6c1ccd5db5325d2d2923cc9bfea2f715c93288440","observation_id":"3a51fd8d-1849-4469-bdd0-5b4fe0eb499b","resolution":{"observed_at":"2026-08-12T16:18:49.927067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2411.13817","last_updated":"2024-11-21T03:48:03Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-12T15:48:29.107073Z","submitted_at":"2024-11-21T03:48:03Z","title":"Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":5,"verified_exact":1,"verified_fuzzy":22},"total_outbound_references":28},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2411.13817."}