{"as_of":"2026-08-22T10:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3b222434947a52e16b90f88e58fbe55aad042bdfaae26c13da5b8f5dacc78443","coverage":[{"denominator":23,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":23,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T05:29:07.653649Z","state":"measured"},{"denominator":23,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":23,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+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/2504.20795/citation-record","integrity":"/paper/2504.20795/integrity","json":"/paper/2504.20795/citation-record.json","paper":"/paper/2504.20795"},"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-16T05:29:08.091231Z","title":"Managing uncertainty in social networks","venue":null,"work_id":"97a55508-2b68-4624-9efb-1b6a7fb8ae0f","year":2007},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.535820Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:f0dac3f25f0f94ef57b9741d4d3d51d559dbae2cd6012f66f282cc49db2d0625","observation_id":"cdf93e20-0083-42ab-b1bd-30ed0c794568","resolution":{"observed_at":"2026-08-16T05:29:08.096276Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:08.075185Z","title":"Managing and mining graph data, volume 40","venue":null,"work_id":"2364d346-8af9-4a92-861a-29730808aedf","year":2010},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.541781Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:69587b930af99c5f6fba012eaddba19445069fdc86931785340650947d5f3591","observation_id":"f9efe0e9-3fa4-4d55-9932-cd772f751dcc","resolution":{"observed_at":"2026-08-16T05:29:08.080547Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"cs/0310049","last_updated":"2003-10-25T16:03:58Z","snapshot_observed_at":"2026-08-07T03:52:13.153712Z","submitted_at":"2003-10-25T16:03:58Z","title":"An O(m) Algorithm for Cores Decomposition of Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"cs/0310049","snapshot_observed_at":"2026-08-16T05:29:07.546979Z","title":"An o (m) al- gorithm for cores decomposition of networks","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.546979Z"},"links":{"cited_paper":"/paper/cs/0310049","citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:6359056964e3179d15cb55ff4d8dc313f1909587bf2e1d208cf7f937b5a02bc0","observation_id":"46456326-3f63-4fd3-a0ad-9a3ebc772546","resolution":{"observed_at":"2026-08-16T05:29:07.546979Z","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-16T05:29:08.058889Z","title":"Core decom- position of uncertain graphs","venue":null,"work_id":"35e035f8-a702-4594-af39-cc2bba13d6db","year":2014},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.555013Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:c29b68400a2d6d592a8d01217f799b2316e02b6c6c61a12741395f1347c4d915","observation_id":"c04d44a1-459a-437c-b28e-d224cbb0e7ca","resolution":{"observed_at":"2026-08-16T05:29:08.064259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:08.041825Z","title":"Cores matter? an analysis of graph decomposition ef- fects on influence maximization problems","venue":null,"work_id":"a1cda135-f51e-4378-bda0-bceb2b624882","year":2020},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.560847Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:53b09ab4408c4309872ecc494debfb7b5825bb96d65d106309d816466be4e632","observation_id":"53aab301-2e84-4c97-8f5a-1b1eae3f0a74","resolution":{"observed_at":"2026-08-16T05:29:08.047184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:08.023190Z","title":"Efficient top-k vulnerable nodes detection in un- certain graphs","venue":null,"work_id":"bcc5e6c9-5861-492f-8910-b9b7138c1d93","year":2021},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.566918Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:a8fb690002136b5e5bae0187cb1b784ed6da58166cebac028a8d93b8a9ace981","observation_id":"2b35ab9f-ec50-46e3-a721-fb8d474fa698","resolution":{"observed_at":"2026-08-16T05:29:08.029489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:08.004369Z","title":"Fast maximal clique enu- meration on uncertain graphs: A pivot-based approach","venue":null,"work_id":"641ee7cf-d7e1-4ca5-a83c-7e55101dcc71","year":2022},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.572800Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:7a294d733463ed271ba8686ac8126d22cb145fdb4a294c65fbee84e6555cdfc6","observation_id":"8709d281-c88b-4630-a998-669d875fd177","resolution":{"observed_at":"2026-08-16T05:29:08.011158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:07.986235Z","title":"Core decomposition on un- certain graphs revisited","venue":null,"work_id":"902de3cc-6a9e-4cee-a622-f56e7525e622","year":2021},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.577815Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:a449ce44fe7f1e98e9c3adcb9799cdfbd147e6cff41196ec01a26adf270f22e3","observation_id":"35641a04-dd78-4306-bc4f-af676fa4cecd","resolution":{"observed_at":"2026-08-16T05:29:07.992314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:07.967678Z","title":"Efficient computation of probabilistic core decomposition at web-scale","venue":null,"work_id":"003458fa-205b-4ca9-aa71-d47c209917eb","year":2019},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.582993Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:6e66680e9bf94000ff20d5a7e41634cb54476813209528f57ea4e100c9fe11a5","observation_id":"4f70b588-f534-4616-8c90-2fd7d8ef79d1","resolution":{"observed_at":"2026-08-16T05:29:07.973786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:07.948362Z","title":"Distance-constraint reachability computation in uncer- tain graphs","venue":null,"work_id":"2bb0ed10-975c-492f-aaff-b0ca2f08e755","year":2011},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.588359Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:926d6267b24286e49223066e5f9044f24a5b15be183393d16dedc5ff4b5695af","observation_id":"4c10a8c4-6a80-4f71-b83e-9bc45d620a36","resolution":{"observed_at":"2026-08-16T05:29:07.955228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:07.930163Z","title":"SNAP Datasets: Stanford large network dataset collection","venue":null,"work_id":"e0afbf71-7e90-43bc-a050-ccee30fe3364","year":2014},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.594048Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:e77cb56205626966f7dd4a7d13e61e0af9bfb61596140978686e632e3ef550cc","observation_id":"03df650b-2e8b-490b-8c20-02595785a4f3","resolution":{"observed_at":"2026-08-16T05:29:07.936495Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:07.912551Z","title":"Improved algorithms for maximal clique search in uncertain networks","venue":null,"work_id":"47df87c8-654c-41f7-b2e9-00aa092a3775","year":2019},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.599275Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:a96fd8f7ea56f867a2700ecca3715fb484991ee649d54ec2bb114ce347de26ff","observation_id":"653717f7-0494-42a5-83ed-2579318f1257","resolution":{"observed_at":"2026-08-16T05:29:07.918357Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:07.894174Z","title":"Efficient and accurate query evaluation on uncertain graphs via recursive stratified sampling","venue":null,"work_id":"23941f8f-9469-482b-9caf-d70ee254b3fa","year":2014},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.604755Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:a38fcde3c34d559d34d85c3baac4cc96f4598cdab792392d19a81001eb2df315","observation_id":"92886291-c451-453c-b772-d882bf564106","resolution":{"observed_at":"2026-08-16T05:29:07.900751Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:07.875098Z","title":"Efficient influential community search in large uncertain graphs","venue":null,"work_id":"4b91a76a-9941-464f-affb-8261ac1129cd","year":2021},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.609744Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:274390c19e3a69447d598386e601cbab471c75f756df7ed2ce5199b0059dac2f","observation_id":"81ac36c8-b0f6-45d5-b945-e6e3d6ac432d","resolution":{"observed_at":"2026-08-16T05:29:07.881180Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:07.856498Z","title":"Tables of the incomplete beta function, 1968","venue":null,"work_id":"aeed89cd-0883-4f17-aa48-14fc0cc75597","year":1968},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.614665Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:d13fed067ecce721f1ad21cf310601f826806ec860b9afb2314ff6b54639f7ce","observation_id":"42560d85-a6b3-4bb3-b221-f7433b3cca89","resolution":{"observed_at":"2026-08-16T05:29:07.862702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:07.837301Z","title":"Reliable community search on uncertain graphs","venue":null,"work_id":"01be8986-0c2b-46b4-8a52-45db05c3a1c1","year":2022},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.619640Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:2ff5aff48b80fa1e4f1806c1c11748f9e8728510e8870b974733af5d2180b7bc","observation_id":"e92f53cc-e753-48fd-b3d5-7bede455e18d","resolution":{"observed_at":"2026-08-16T05:29:07.843668Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:07.817659Z","title":"K-nearest neighbors in un- certain graphs","venue":null,"work_id":"ff5c382c-0ff0-491b-ada9-9390324731b2","year":2010},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.624296Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:e9d42d6eece8a75857586f927d1a60159299e7d094a10fc2fce625ace7d82df8","observation_id":"6e2d8778-92e8-4353-a631-d0eb31159932","resolution":{"observed_at":"2026-08-16T05:29:07.823815Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:07.797307Z","title":"Maximal quasi- cliques mining in uncertain graphs","venue":null,"work_id":"ee9122f9-490c-441e-95a5-5962c50734a5","year":2021},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.629237Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:848ae1533a271686979e5fdf62a916109446cba8f7af4d269fb3c42274c849fd","observation_id":"7f30fa36-0857-437f-991b-5dce76b63af6","resolution":{"observed_at":"2026-08-16T05:29:07.803303Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:07.777960Z","title":"Efficient probabilistic truss indexing on un- certain graphs","venue":null,"work_id":"720d1a03-9b1d-437c-9a1b-c775f43490d0","year":2021},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.634142Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:911aa8ac24720a778d2b2cd3955da76db0f8e90c35f6feb1ff3106d16a6260a6","observation_id":"5457eda4-00b0-462f-9146-8b4e82c4539e","resolution":{"observed_at":"2026-08-16T05:29:07.783794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:07.760079Z","title":"Containment of rumor spread by selecting immune nodes in social net- works","venue":null,"work_id":"e4cdac3d-3bf8-4a97-ace7-709c2c036959","year":2021},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.639046Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:e0eab66ceea5ed91e2d76956eeec6aeccde5fe2bf99883ed7c79b1625b8c9f7f","observation_id":"9c9f097b-19d0-46ee-936b-ba4acb33ba30","resolution":{"observed_at":"2026-08-16T05:29:07.765891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:07.742425Z","title":"Truss community search in uncertain graphs","venue":null,"work_id":"610a1eb8-8076-48a5-8d29-9bd2a6420ca6","year":2024},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.644161Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:a0dc7931d2a00a58a19131f5733d00b69b32096ca27ae2c1bf0755146694cc4a","observation_id":"f05ea520-4bc6-4d49-9b04-4c859cd7f13c","resolution":{"observed_at":"2026-08-16T05:29:07.747673Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:07.724441Z","title":"Index-based optimal algo- rithm for computing k-cores in large uncertain graphs","venue":null,"work_id":"a8c2e37d-fa53-4776-812b-6a2f041bc1fc","year":2019},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.648811Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:8229853995d9227135d34c0f035573b3e01676767b91bf0fab08bee48ca8ae10","observation_id":"225243d1-043b-4028-9265-100cff4bb86d","resolution":{"observed_at":"2026-08-16T05:29:07.730065Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+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-16T05:29:07.705161Z","title":"Finding antagonistic communities in signed uncertain graphs","venue":null,"work_id":"7bafcf4d-beba-45af-84ee-747f895cc199","year":2024},"citing_paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T05:29:07.653649Z"},"links":{"citing_paper":"/paper/2504.20795"},"observation_digest":"sha256:3d065fe59fd4620f5f8c639bcd30363ed635c5f456dec24b17b9e3a00d90abc5","observation_id":"ea0bb3ef-4db3-4ec7-bded-b80aefc4b6c1","resolution":{"observed_at":"2026-08-16T05:29:07.712274Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2504.20795","last_updated":"2025-04-29T14:10:39Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-20T04:33:39.140334Z","submitted_at":"2025-04-29T14:10:39Z","title":"Effective Index Construction Algorithm for Optimal $(k,\\eta)$-cores Computation"},"reference_resolution":{"displayed":23,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":1,"verified_exact":0,"verified_fuzzy":22},"total_outbound_references":23},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2504.20795."}