{"as_of":"2026-08-22T05:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8073aa1e91aafcce0135a0d94cc40103f52824ba4cc9b8290401b1556076b2de","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T10:12:56.067752Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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.11788/citation-record","integrity":"/paper/1908.11788/integrity","json":"/paper/1908.11788/citation-record.json","paper":"/paper/1908.11788"},"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-14T10:12:56.530388Z","title":null,"venue":null,"work_id":"d9246c35-2ea1-4134-805c-8a4eec8c8855","year":2015},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:55.925865Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:da8973b6a14586377a0be2096d1160847deff0599e8e76d66997894fb902856f","observation_id":"b5193adb-d154-44c8-a97b-5c292b3fcb90","resolution":{"observed_at":"2026-08-14T10:12:56.534426Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:55.930872Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:55.930872Z"},"links":{"cited_paper":"/paper/cs/0310049","citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:f16bd0660fa2d50ea556183b2ad41cc7fe7ae91646b208a2e25262a6af9f3c07","observation_id":"5728a481-b996-4c66-aa6d-1bd8e1f12ce9","resolution":{"observed_at":"2026-08-14T10:12:55.930872Z","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:12:56.516355Z","title":null,"venue":null,"work_id":"349458db-2362-4225-8504-ffbe1c20ebe6","year":2015},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:55.936704Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:76315037a7518cce27ae4483985b527e40dbe4d4604fb6f1cfcb757c879cbad5","observation_id":"7678b91f-a454-48f6-a7b9-29556886ac10","resolution":{"observed_at":"2026-08-14T10:12:56.521449Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.502175Z","title":null,"venue":null,"work_id":"84685803-e6a3-471e-bed1-f54f6b894aa0","year":2018},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:55.941472Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:91fd717d61f9f5c387a5ae58edd37382c329d3df0c0df90e365c5ab9351ca7cd","observation_id":"b3be7ae0-d33f-4f1e-8189-59ae98d320ce","resolution":{"observed_at":"2026-08-14T10:12:56.506921Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.487661Z","title":null,"venue":null,"work_id":"75153bef-1c1c-4719-bfa9-f5bc512db93c","year":2009},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:55.946568Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:62894c2c23dd3d6414e552c0b9697fc34377e8e33cb81f08f86a42596a600ce7","observation_id":"ad220e61-d283-406b-8b4e-abcb1a39f8e3","resolution":{"observed_at":"2026-08-14T10:12:56.492565Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.473355Z","title":null,"venue":null,"work_id":"9979eb6d-38e5-4b8a-a8fb-d8e9c6e7f5cf","year":2014},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:55.951118Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:597ba4ac3fc8406c51f7520c0ef87b7107f6773c8df83453d1074db7740cc796","observation_id":"d232caac-15b7-4839-9869-8c1e492035c6","resolution":{"observed_at":"2026-08-14T10:12:56.478149Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.459927Z","title":null,"venue":null,"work_id":"8a661ec0-7566-459f-8042-7dec6f319895","year":2009},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:55.957500Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:49ffcf88b26e1f3a598af009027a497f5d9140cef9122c11c1550cfeb254e1e8","observation_id":"85efcb3d-feff-4a04-9f52-b2f462525375","resolution":{"observed_at":"2026-08-14T10:12:56.464155Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.446029Z","title":null,"venue":null,"work_id":"b6a1a498-b7b5-42b9-b229-763ffcec5c92","year":2017},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:55.961945Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:f948baef6ec96d9a1b250336be37338b5a82f1a930e7a874f97be03f981590ae","observation_id":"85f13d3f-f505-4ab1-ba5b-a9b0c555fc0c","resolution":{"observed_at":"2026-08-14T10:12:56.450704Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.432520Z","title":null,"venue":null,"work_id":"add5d0bd-26d9-4810-b505-93ad677b5f04","year":2016},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:55.966465Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:59ba52a7e400cfe26f7175d935c97d31f7ef580512108196402a380279cfe25d","observation_id":"4838264f-9153-4359-89c5-e182b01a1ea4","resolution":{"observed_at":"2026-08-14T10:12:56.436773Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.12539","last_updated":"2019-08-13T08:03:39Z","snapshot_observed_at":"2026-08-17T18:37:30.407836Z","submitted_at":"2019-04-29T09:46:09Z","title":"A Survey of Community Search Over Big Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.12539","snapshot_observed_at":"2026-08-14T10:12:55.970971Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:55.970971Z"},"links":{"cited_paper":"/paper/1904.12539","citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:c8e9314f4117f10f3dd7eb7f582ca9ca1781f1bd8854c2463d50d972a30bbc10","observation_id":"152ce39b-5673-4b97-ae43-95a11b80613b","resolution":{"observed_at":"2026-08-14T10:12:55.970971Z","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:12:56.418981Z","title":null,"venue":null,"work_id":"b17f3a8b-62c5-4430-ad74-41ce5e31db9d","year":2014},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:55.975867Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:8d102e02bac2afbe6203c0a427b18778075e426d0f9c48c33603fd2630127c4c","observation_id":"c8c14d9e-4b1a-4f16-af58-f22e3475fffe","resolution":{"observed_at":"2026-08-14T10:12:56.423586Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.405807Z","title":null,"venue":null,"work_id":"51a2fcf1-0b58-46b0-b322-8e7aa0ccc66d","year":2017},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:55.980428Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:9d7a41be7f0a24b15265164a49cf557a1f8ab40b70237e4a571fa5d94b1b7ca6","observation_id":"c452c8ff-2a65-46f7-8c12-535e46c522c9","resolution":{"observed_at":"2026-08-14T10:12:56.410016Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.392677Z","title":null,"venue":null,"work_id":"d4c42960-e058-4574-8591-4b9fe10a0faf","year":2019},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:55.984803Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:3423828b062393ac72afd7312e78cec1049437096135707bbe7363cfbedd76e7","observation_id":"06845b1f-c41e-466c-b9c6-afb8face13e8","resolution":{"observed_at":"2026-08-14T10:12:56.396760Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.378995Z","title":null,"venue":null,"work_id":"8b84542b-3e39-428c-98e4-fa7b7054504b","year":2015},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:55.989751Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:0d0f6135f2e72c263f6d1a3dce1c30e4c014cc51a99560f4b23491c535f1d821","observation_id":"158a07a2-a11b-415b-9e6e-10dd2d52050a","resolution":{"observed_at":"2026-08-14T10:12:56.383431Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.364446Z","title":null,"venue":null,"work_id":"6068d86b-2c9e-4b91-b3e5-2d875234838b","year":2016},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:55.994273Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:ce9a3999e9783c9c43cb2d54126cb180bec1763ba84197943b26a2b2ce97c4af","observation_id":"3bbefdf5-f906-464e-b519-d7e3f6f097e5","resolution":{"observed_at":"2026-08-14T10:12:56.369901Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.350514Z","title":null,"venue":null,"work_id":"8aeaf3e4-2575-4833-b830-b174e6158cb3","year":2015},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:55.998680Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:4fcb3603b1f440c3f81a579c7e4fb78db407bad60f541351a707c8825e022902","observation_id":"84d734f2-2d70-42c6-97e6-70424ba9290e","resolution":{"observed_at":"2026-08-14T10:12:56.355194Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1901.02166","last_updated":"2020-04-20T20:52:11Z","snapshot_observed_at":"2026-08-19T00:39:21.785023Z","submitted_at":"2019-01-08T05:33:56Z","title":"K-Core Minimization: A Game Theoretic Approach","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.02166","snapshot_observed_at":"2026-08-14T10:12:56.003168Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:56.003168Z"},"links":{"cited_paper":"/paper/1901.02166","citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:2adf522396015ead3e6503a9bcddfe12c16e4b413a3acdadf7855d91cafb183b","observation_id":"5372a1ad-8f4f-4c98-a556-2223a2984919","resolution":{"observed_at":"2026-08-14T10:12:56.003168Z","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:12:56.336059Z","title":null,"venue":null,"work_id":"47e2413b-ba92-4412-a0d7-337121c5c5f0","year":2001},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:56.007831Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:494b31dfd7fa7cb58e21a852bccb4fc88fb8b428e5e87d7f1afeb6d2916d3945","observation_id":"90b2572a-e7e5-458e-a988-3fb5a3644815","resolution":{"observed_at":"2026-08-14T10:12:56.340745Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.321827Z","title":null,"venue":null,"work_id":"32047d57-92dd-4d6b-adc4-16026855dbc2","year":2004},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:56.012288Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:bcb8700b29d80a3b31f6c4437e89d7707960fb18c4a6fe28afcaea67cb36d683","observation_id":"4cbad510-fba5-4e65-98fa-2224676706e3","resolution":{"observed_at":"2026-08-14T10:12:56.326460Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.306883Z","title":null,"venue":null,"work_id":"670aeab2-03f2-423c-b899-cffd5e723830","year":2010},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:56.016828Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:e4b4e464b7dc5715b455911bd9ae7c979fa1fd56f1f494d6008bc13aa4778453","observation_id":"9a6c004d-3ff9-45cb-8671-f433960a3336","resolution":{"observed_at":"2026-08-14T10:12:56.311351Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.292271Z","title":null,"venue":null,"work_id":"0fdb3f55-b3d3-4ad2-b470-aaccd9796c1d","year":2015},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:56.021390Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:4b189764859958d7b6981e5ceb27e56b4ad3d035d568967f5aba90f8ad2f7c3b","observation_id":"09e524a4-7db3-4951-9027-b22612bed266","resolution":{"observed_at":"2026-08-14T10:12:56.296822Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.277037Z","title":null,"venue":null,"work_id":"882b27f1-b0a0-4d57-99a7-e928d1d9b69e","year":2013},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:56.025827Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:45281978279bf21e05cd285bf7b232858fff2410d0048456588f65cd22ddb1c5","observation_id":"03a212bb-3371-4cdc-a761-3e9f1e3dad59","resolution":{"observed_at":"2026-08-14T10:12:56.281850Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.262888Z","title":null,"venue":null,"work_id":"9013e37d-286d-4aab-88f3-31b9b8a690fd","year":2010},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:56.030833Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:838e79a02332b981fdba8ba88e5b945ffe2ce59bddcc8baad3d52b4ab83c8cf7","observation_id":"f19d6f9d-dd14-47e8-9b4e-1d7c9047da85","resolution":{"observed_at":"2026-08-14T10:12:56.267230Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.248079Z","title":null,"venue":null,"work_id":"eb79a8c7-40ce-4e1e-819a-642f4d1c5b35","year":2012},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:56.035154Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:2a619a75eefcd33d4ee2afe9989465c2a7399b8035da32aa00e3f302d028efaa","observation_id":"1d88ff04-7124-4753-adf9-7f6a4748399c","resolution":{"observed_at":"2026-08-14T10:12:56.252770Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.233435Z","title":null,"venue":null,"work_id":"2795b3e9-de3b-4ff3-b8e7-b2d87569684d","year":2016},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:56.039640Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:4e1acf761f32172673ed5158c1309917311603c82490b97c22783be0e9dc8a05","observation_id":"9bd8decf-977f-471f-b84c-bba91f34e174","resolution":{"observed_at":"2026-08-14T10:12:56.237989Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.217862Z","title":null,"venue":null,"work_id":"acbc4051-a40f-49ed-8d37-1d21dc374d5b","year":2017},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:56.044968Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:58a3c9dd0a03cafa39c43d8be83a1ab0df5b9cbe365afa64d49c4854a3aa2e2b","observation_id":"fa55291e-1059-430c-adc5-5756aa6ada6b","resolution":{"observed_at":"2026-08-14T10:12:56.222844Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.201124Z","title":null,"venue":null,"work_id":"8e22aff4-a124-48c0-9d34-5f3e547ab1d9","year":2017},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:56.049395Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:d5ebeb4ca0aa31b2fb855bcaea754bcc0e42d21d280855c2daf72f57fc7434f4","observation_id":"cd2c2c06-82c3-4372-97a4-8713862f1267","resolution":{"observed_at":"2026-08-14T10:12:56.205825Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.186999Z","title":null,"venue":null,"work_id":"b8b4da10-65a4-4944-bef8-d390c74fe130","year":2017},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:56.054991Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:7da5110b3e02f3d6cc485a680827041bdcb99399ce200b5d86fe0ce8227086d4","observation_id":"81f5c930-4e99-4c6e-ae84-b886303db9e2","resolution":{"observed_at":"2026-08-14T10:12:56.191499Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.172536Z","title":null,"venue":null,"work_id":"b9d93b02-8c5f-4fe0-a471-baba55ac1130","year":2017},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:56.059422Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:121257d73f39f094a042609ba709bf8e565e4c02b7dd767ad81b69d6d74ddb3e","observation_id":"8c7abc1e-4f94-4137-82a3-fc62a5210004","resolution":{"observed_at":"2026-08-14T10:12:56.177146Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.157937Z","title":null,"venue":null,"work_id":"ea62341e-c62c-40f7-9671-d6e3b571d473","year":2017},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:56.063365Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:df53878ee2d85879a700454e374b0d2fd56e1a5115a762f7edb17cad3fec0b50","observation_id":"cdcac5f3-74a7-47bd-bcf1-d040f413d38b","resolution":{"observed_at":"2026-08-14T10:12:56.162253Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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:12:56.142065Z","title":null,"venue":null,"work_id":"3509f3fe-4025-4ecb-abe0-ce19b9d77480","year":2018},"citing_paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T10:12:56.067752Z"},"links":{"citing_paper":"/paper/1908.11788"},"observation_digest":"sha256:c15a4a571682341d2eae888f05730c5438bd4245b5ea1bf6dbf25b28839f844c","observation_id":"1f647fb4-9569-4dc8-81d7-6a2e80a00eee","resolution":{"observed_at":"2026-08-14T10:12:56.147716Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"1908.11788","last_updated":"2019-08-30T15:28:54Z","latest_version":1,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-22T00:49:25.407809Z","submitted_at":"2019-08-30T15:28:54Z","title":"Fast Algorithms for Intimate-Core Group Search in Weighted Graphs"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":31,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":31},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:1908.11788."}