{"as_of":"2026-08-23T03:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b04fd1271fa9f969376dd49105e871ab641f80f39046b41a2884c1fedd70b6e3","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T10:45:48.287527Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"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/1908.10550/citation-record","integrity":"/paper/1908.10550/integrity","json":"/paper/1908.10550/citation-record.json","paper":"/paper/1908.10550"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:48.193920Z","title":"Community detection in graphs,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.193920Z"},"links":{"citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:297e6e4884bfef1e856b2fbe8f1d9ab138efcebdc87cfd87859a692247c64768","observation_id":"328d1e17-accf-4468-999e-d0a0ba6b1b19","resolution":{"observed_at":"2026-08-14T10:45:48.193920Z","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-14T10:45:48.585350Z","title":"A graph-theoretic algorithm for comparative modeling of protein structure,","venue":null,"work_id":"87da97f4-94ac-4d54-9a33-48a74fccbd99","year":1998},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.199735Z"},"links":{"citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:6d27e533610b0ceeb9990eb3b5a1d3252ddf843822e42e6b5fb2c8669a14d06d","observation_id":"d0b0fa99-1caf-486e-93fa-e244f6242595","resolution":{"observed_at":"2026-08-14T10:45:48.590200Z","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-14T10:45:48.570802Z","title":"Trusses: Cohesive subgraphs for social network analysis,","venue":null,"work_id":"b2e4d30c-8200-489b-b650-968000e29d86","year":2008},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.204631Z"},"links":{"citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:9777ca5eabda04914dcbd610b3b5c9baebe6acf3ba06e9c80ea78873628dacb3","observation_id":"696ee986-e477-46ee-921c-948de5d1f752","resolution":{"observed_at":"2026-08-14T10:45:48.575538Z","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-14T10:45:48.555852Z","title":"Extracting communities from complex networks by the k-dense method,","venue":null,"work_id":"4e9ee2d7-caa2-49d2-abe5-be5b461686f9","year":2008},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.209515Z"},"links":{"citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:2886d810494fe7fac398b065d94ab1acc6436157097ce5f100b19c482f66b0f2","observation_id":"bbea1fbf-55d2-4f92-9c5b-483f9b4ebaee","resolution":{"observed_at":"2026-08-14T10:45:48.560697Z","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-14T10:45:48.540208Z","title":"Network clustering via clique relaxations: A community based,","venue":null,"work_id":"08008a67-2033-4cb7-9cf3-223aea31461d","year":2013},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.214423Z"},"links":{"citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:54502b5e6e41d5014a13af283f8f380ac90a67a711cd915c85fd2ef6083c0752","observation_id":"55f6a3be-b854-4113-937a-fbdbd00e82e4","resolution":{"observed_at":"2026-08-14T10:45:48.545365Z","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-14T10:45:48.524879Z","title":"Approximate closest community search in networks,","venue":null,"work_id":"bc297578-4088-41b9-b7a6-34386e57d006","year":2015},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.220627Z"},"links":{"citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:ac223c87314e785722431887b49e06327d7b15a45b13cfb298454e084c110608","observation_id":"e45cd145-8f7a-405f-aa84-00d2c2f91582","resolution":{"observed_at":"2026-08-14T10:45:48.529676Z","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-14T10:45:48.509988Z","title":"Large scale networks fingerprinting and visualization using the k-core decomposition,","venue":null,"work_id":"e065c3d3-01fc-4400-809a-fd88dcdfad2a","year":2006},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.225807Z"},"links":{"citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:88f8ef77c8c10531a3d6a6551722595635ccb0af76b7e5ce9fb8a5d229b1c046","observation_id":"1f3d094a-af3c-4c45-8f2b-36c9023431b5","resolution":{"observed_at":"2026-08-14T10:45:48.514851Z","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-14T10:45:48.493155Z","title":"Truss decomposition in massive networks,","venue":null,"work_id":"85f99cf1-0561-44e5-bdf5-5eabb76e5e6d","year":2012},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.230581Z"},"links":{"citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:83dcbb705b6eee17e4acf0c391d7115ded6270ca2eb840155db2a369ed68f594","observation_id":"c8c99f2a-13ce-4a59-ae95-31d6a0a52843","resolution":{"observed_at":"2026-08-14T10:45:48.498522Z","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-14T10:45:48.477119Z","title":"Distributed algorithms for k-truss decomposition,","venue":null,"work_id":"90b83fa2-5e0c-499a-b76c-d60f9e63dde5","year":2014},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.235401Z"},"links":{"citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:a549d43194d4113bd581c4a9931d219ff2fffa238f989542ad73bc49e3d045ed","observation_id":"130c32a9-9aa4-4615-a21b-51ce423037ac","resolution":{"observed_at":"2026-08-14T10:45:48.482020Z","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-14T10:45:48.461601Z","title":"Truss decomposition on shared-memory parallel systems,","venue":null,"work_id":"f06a6251-bcbf-4c0a-bf0b-f700a289661d","year":2017},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.240241Z"},"links":{"citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:36bcd8f5b0a3fccac80d3d6d1387b2bee6f9eff7a2a511f8c0a8fbc0bdf9c53b","observation_id":"5a3179d1-f282-4abd-a1a9-839944a48022","resolution":{"observed_at":"2026-08-14T10:45:48.466638Z","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-14T10:45:48.446138Z","title":"Parallel k-truss decomposition on multicore systems,","venue":null,"work_id":"ecfd81ea-668d-4ca3-8831-2aae33fe86c2","year":2017},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.244990Z"},"links":{"citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:3d82528d9a11653398eb99abb4e0a4993a2bcd1d210abd0d1825d57a35d4022f","observation_id":"b8414fa1-2588-4749-8a4e-d430b4e0409c","resolution":{"observed_at":"2026-08-14T10:45:48.450986Z","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-14T10:45:48.430642Z","title":"Querying k- truss community in large and dynamic graphs,","venue":null,"work_id":"239d2239-0515-49b6-a0e2-56eee1add6b2","year":2014},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.249733Z"},"links":{"citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:116ee8355f7113dce6ea12f9521364c820531dc5c6b7b6028132b96bf38af732","observation_id":"8f15ef7f-074e-4046-aee1-ed8c4101af09","resolution":{"observed_at":"2026-08-14T10:45:48.435664Z","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-14T10:45:48.414799Z","title":"Algorithm 457: finding all cliques of an undirected graph,","venue":null,"work_id":"f99b1e0d-b876-415b-a831-79dc9de7aef6","year":1973},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.254529Z"},"links":{"citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:d5a5dcd649cbe84770e75079ace9d9cdd263ac47de463e2973325c6e6a76a33e","observation_id":"c8a5d02b-5500-4e3a-b6f2-a12055cfb84a","resolution":{"observed_at":"2026-08-14T10:45:48.419824Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T10:45:48.259540Z","title":"Connectivity and generalized cliques in sociometric group structure,","venue":null,"work_id":null,"year":1950},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.259540Z"},"links":{"citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:23325892d36b8a93c75965690a3d40a061121fc885bd2a6090528352fbb588db","observation_id":"bb15d89e-9919-4e11-af71-5cf2f251aa07","resolution":{"observed_at":"2026-08-14T10:45:48.259540Z","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-14T10:45:48.264476Z","title":"Cliques, clubs and clans,","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.264476Z"},"links":{"citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:f59a425aa1474306a2675def84019679b6ae11d6aae0608329a9acae91b5a5b4","observation_id":"40404b56-be9b-4266-bb48-e4cc8ff946f9","resolution":{"observed_at":"2026-08-14T10:45:48.264476Z","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-14T10:45:48.380989Z","title":"Extracting analyzing and visualizing triangle k-core motifs within networks,","venue":null,"work_id":"97eae15e-b5a6-45e5-95da-10f573d51849","year":2012},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.268918Z"},"links":{"citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:f7b9f098c2373c1107dc7905472bd0ace0222b5db491827b0dc50c8d44fc4c33","observation_id":"ba1de2d8-21a4-4385-a072-35861da803b6","resolution":{"observed_at":"2026-08-14T10:45:48.385948Z","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-14T10:45:48.273503Z","title":"An o (m) algorithm for cores decompo- sition of networks,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.273503Z"},"links":{"cited_paper":"/paper/cs/0310049","citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:0d7e65563ee8fa00a47ebbb1aa590593ff267cbce09754638829f2c3b197c23f","observation_id":"6f982a8c-f5ef-4cc1-be81-fa8a6f0c9f37","resolution":{"observed_at":"2026-08-14T10:45:48.273503Z","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-14T10:45:48.365811Z","title":"Graph twiddling in a mapreduce world,","venue":null,"work_id":"33264d92-2d37-42cd-8c04-028d04411c64","year":2009},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.278411Z"},"links":{"citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:3ae8b9d63f3a83800f2b7b844164404202bbe90eaf111336c4e726e92fe5e84d","observation_id":"c8116d92-6f6f-4c4c-9067-bd258cd67b4f","resolution":{"observed_at":"2026-08-14T10:45:48.370794Z","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-14T10:45:48.350505Z","title":"Streaming algorithms for k-core decomposition,","venue":null,"work_id":"3b3feb1b-de6b-4e15-96d3-e15c52730898","year":2013},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.283025Z"},"links":{"citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:6c17666f417f0fbfff9ffeff9de77b7afb562a7492ed61d933f2270a9a6cf9ab","observation_id":"bf41c0c4-f766-4872-8977-ebd30bd99052","resolution":{"observed_at":"2026-08-14T10:45:48.355369Z","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-14T10:45:48.333376Z","title":"Snap: A general-purpose network analysis and graph-mining library,","venue":null,"work_id":"e1277c36-dca8-4886-8afa-5decf0c0cd0d","year":2016},"citing_paper":{"arxiv_id":"1908.10550","last_updated":"2019-08-28T05:02:18Z","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T10:45:48.287527Z"},"links":{"citing_paper":"/paper/1908.10550"},"observation_digest":"sha256:c40be540acb1c09dcb1bd21edaac1f0f01697d05071301390f3b18ec494ddc92","observation_id":"4e4fbed8-75de-4ccb-941f-66fa7128446b","resolution":{"observed_at":"2026-08-14T10:45:48.339872Z","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":"1908.10550","last_updated":"2019-08-28T05:02:18Z","latest_version":1,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-16T07:52:31.157039Z","submitted_at":"2019-08-28T05:02:18Z","title":"Streaming and Batch Algorithms for Truss Decomposition"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":0,"verified_fuzzy":16},"total_outbound_references":20},"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 23 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 0 inbound Pith citation observations for arXiv:1908.10550."}