{"as_of":"2026-08-22T01:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:00fd9f21f0056099e63933026023187bd0701cf673df1b2b228f6ef7f1fd798b","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T17:04:53.691963Z","state":"measured"},{"denominator":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"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/2508.18151/citation-record","integrity":"/paper/2508.18151/integrity","json":"/paper/2508.18151/citation-record.json","paper":"/paper/2508.18151"},"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-15T17:04:55.014183Z","title":null,"venue":null,"work_id":"d1422c25-1e79-4f04-a639-1aef57892d09","year":2014},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.489794Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:2c1266fdc7cacd7304af8ed2a4e85c85d4ece4c19ebe2bc9cdc591c79972eb0c","observation_id":"a404f4d8-7082-42a4-b78b-4ec3a1574f8d","resolution":{"observed_at":"2026-08-15T17:04:55.019644Z","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-15T17:04:54.996820Z","title":null,"venue":null,"work_id":"e83a1d36-a342-488c-b63e-aa9e4cf7b8a2","year":2003},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.496532Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:74fe35351c8a809029578abac7c36782141ed6282bc044b0d5ee74e5d065f0f7","observation_id":"d015180b-b339-4838-92ee-4b308620b6e8","resolution":{"observed_at":"2026-08-15T17:04:55.001981Z","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":"10.1016/j.ins.2019.11.003","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:04:53.858405Z","title":null,"venue":null,"work_id":"2bfe8f1e-dd3e-46c1-8e9b-99de653f454b","year":2020},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.501844Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:b72bad0c370c91d8a39a9d2a3daba4b1c3fbbe765595ee543831e1c6986ed318","observation_id":"12a8ff0f-a4ee-472e-9e9c-abaf2d88c8fa","resolution":{"observed_at":"2026-08-15T17:04:53.863636Z","resolver_source":"doi","status":"verified_exact"},"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-15T17:04:53.507476Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.507476Z"},"links":{"cited_paper":"/paper/cs/0310049","citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:78678210c096736d8c80b8539c6ed56bced1f9ff0b6b37cb1cab95fb4a0bf2dc","observation_id":"37131248-45f2-465c-a2bc-f35fbb6b79ab","resolution":{"observed_at":"2026-08-15T17:04:53.507476Z","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":"2011.5767","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:04:54.707817Z","title":"Tamer Ozsu","venue":null,"work_id":"f6d7c115-f397-4c12-8a7c-0b81f61909e7","year":2011},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.513056Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:a8544f3eb7026b4cb77671b5e95c2809553bff12c2c3d8c7ecddb57a995ba3a6","observation_id":"44723683-c2c3-4c14-8e00-eb56fb4c5d6d","resolution":{"observed_at":"2026-08-15T17:04:54.716569Z","resolver_source":"raw_fallback","status":"verified_exact"},"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-15T17:04:54.980142Z","title":null,"venue":null,"work_id":"8964fdf9-b932-47a3-99b0-6c8535dfd746","year":null},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.518487Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:da0501b757915971073a19d271f3d448352c7102e3cadaedbaad18afabce7b2e","observation_id":"d465e8ca-c3f9-4e49-b353-4b80a7e7e3d6","resolution":{"observed_at":"2026-08-15T17:04:54.985080Z","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":"8555.26121","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:04:54.570779Z","title":null,"venue":null,"work_id":"35ae5092-c70b-48e6-aead-cf03ce6410ab","year":2014},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.529814Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:31a8d41e9d951cb09eefd3d9ecb3435645db5161fbc4f84140530e86d90fbf43","observation_id":"90f8079e-264e-4fa3-bf74-78506c5a3265","resolution":{"observed_at":"2026-08-15T17:04:54.579121Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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-15T17:04:54.963288Z","title":null,"venue":null,"work_id":"2bd6a291-d366-4986-a019-535acaee9d34","year":2017},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.534941Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:2fae561f93c9ac640878d1e22438c66d5514d9bb83a3604d717f3314e78bfdaf","observation_id":"b6f668df-5cbd-407b-bfa4-3e617ea94a38","resolution":{"observed_at":"2026-08-15T17:04:54.968407Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:04:53.539934Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.539934Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:7a0aa6049721769919acdc2b0bf872536420dea4ee3e4bae12096ce08a11c5b7","observation_id":"dab878f4-c491-48c7-99ce-3edca7adc5e4","resolution":{"observed_at":"2026-08-15T17:04:53.539934Z","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-15T17:04:54.945836Z","title":null,"venue":null,"work_id":"327627b4-684e-44fa-aa47-91ef2be55a20","year":2012},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.545040Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:ea1a779a9ef96ba9016801f0d676bc727a65faa49834a3e3edc719dc20a1b98a","observation_id":"b4b20720-0e1d-4360-b442-8843d6b4b3e1","resolution":{"observed_at":"2026-08-15T17:04:54.950929Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:04:53.550180Z","title":null,"venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.550180Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:f2d41b95958f25e30f2e01a1c6b3d5e31299cead14187a2e92a84e3ed5f4b1ec","observation_id":"bd8cf409-4e16-4273-859d-161c126acd23","resolution":{"observed_at":"2026-08-15T17:04:53.550180Z","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-15T17:04:53.555045Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.555045Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:d8bdb4ae12ccab4eaf2219ce649af6fd4703650756e5823f35f9b7feda05adf4","observation_id":"686ce3b0-107a-4c96-8d49-0bf952c59911","resolution":{"observed_at":"2026-08-15T17:04:53.555045Z","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-15T17:04:54.916799Z","title":null,"venue":null,"work_id":"67c87ec7-98cc-4b78-9c21-d145c7173bcd","year":2014},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.559869Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:f63456375b5417ce0adb2fede22cec0c9d5eceefa6d0fb7135e41495c79f0f06","observation_id":"47cfa76d-9450-4315-830f-01714c13f4f1","resolution":{"observed_at":"2026-08-15T17:04:54.922124Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:04:53.565783Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.565783Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:74f65768220bf6419037b25d51b5983008b7c80a0dd119c7915a81639b024a91","observation_id":"e65ebdd5-a17e-4dd0-a1be-a88b0876b32b","resolution":{"observed_at":"2026-08-15T17:04:53.565783Z","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-15T17:04:53.570851Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.570851Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:7314307247cead59e6dc4a81b462dea07c3da29e174e6565fae1c78711a955d4","observation_id":"bdffa77b-c91c-4208-96b3-72ad2a9ce8dc","resolution":{"observed_at":"2026-08-15T17:04:53.570851Z","resolver_source":null,"status":"malformed_identifier"},"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-15T17:04:54.900403Z","title":null,"venue":null,"work_id":"0960fef7-23b9-4641-8433-13c8152f132b","year":null},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.575960Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:665092f863aa18e399a1a4804c46655030d927ddcc2f874c40a72887c0a4eb6c","observation_id":"24b5ac48-a0b3-4f83-861b-f90b634d7bed","resolution":{"observed_at":"2026-08-15T17:04:54.905644Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:04:53.591093Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.591093Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:72a041f17b6d6b3d30923efc47dc118b39ee4b08dd02b3b72a80aa38cbd6a122","observation_id":"93b85e1f-2efe-4bf1-a01b-45ab038514ed","resolution":{"observed_at":"2026-08-15T17:04:53.591093Z","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-15T17:04:53.596926Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.596926Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:010c1e1c7be4af2ed64aeee076ae9c3adbea53841db3eb7c9e0658d751284961","observation_id":"47d88479-d649-4216-936d-da807999e965","resolution":{"observed_at":"2026-08-15T17:04:53.596926Z","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-15T17:04:54.865917Z","title":null,"venue":null,"work_id":"1387fd7a-efd6-4a4f-8945-0d6d2383072c","year":2021},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.602062Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:bf158cb1b88e3843eaac26640e02eed54036a90ce220f66838847a77b4ccb8c8","observation_id":"d632e2f5-d9ac-4644-b8e7-4e3ea2d906ab","resolution":{"observed_at":"2026-08-15T17:04:54.871550Z","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":"10.48786/edbt.2023.17","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:04:53.791640Z","title":null,"venue":null,"work_id":"0eed8c97-0a4a-4d0c-a540-af047b97545b","year":2023},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.607759Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:4d77615055d61f979369c7b3d550fe68f7ce31d0705c5741822e3191684fbb12","observation_id":"b08f3733-4239-47b5-acb0-0adddd3f555d","resolution":{"observed_at":"2026-08-15T17:04:53.796942Z","resolver_source":"doi","status":"verified_exact"},"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-15T17:04:54.848184Z","title":null,"venue":null,"work_id":"7496a3e4-6e80-4b63-9efb-1f0b3dbfc63d","year":2011},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.612988Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:d4d57f4532c15a2b3ae22d739d10593f4f1fda3502249bbff3f3ede67a98a6b3","observation_id":"8faad5a4-ea28-4f8d-86d8-753c32c450d4","resolution":{"observed_at":"2026-08-15T17:04:54.853611Z","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-15T17:04:54.828732Z","title":null,"venue":null,"work_id":"316e5c8b-5b64-4d33-915d-d43c713c7dfa","year":2014},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.618811Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:de95c6a6a4945d00550a280d3946310368ed2bb3271a0c75c13ffe9f988d0ea2","observation_id":"a09fd6a1-7c5a-41aa-baf4-225c153701ab","resolution":{"observed_at":"2026-08-15T17:04:54.834408Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:04:53.623802Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.623802Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:81da4619f0a1e264ddee82bba026e54fc91d419c98207525eecd913a84f7d178","observation_id":"eb87f699-ee5d-4520-9137-2672647e6686","resolution":{"observed_at":"2026-08-15T17:04:53.623802Z","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":"10.1109/tkde.2020.3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:04:53.774497Z","title":null,"venue":null,"work_id":"5083e6fe-5be5-4e08-b396-c0a45ce74b3c","year":2022},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.629377Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:53c210f66810ceff04699f21b9e69e1a8ebd2dc828ba7de6a4aca4e72e56a6db","observation_id":"91683daf-07dc-4063-af2f-b425fdebe046","resolution":{"observed_at":"2026-08-15T17:04:53.779679Z","resolver_source":"doi","status":"verified_exact"},"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":"6336.25363","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:04:54.243057Z","title":"Çatalyürek","venue":null,"work_id":"2e950ab2-1f59-4688-b053-542bd3435946","year":2013},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.634873Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:6832b69dda59a7f536fa670c71821e70552344b867bb77e2de0bd9f6c7af6c0c","observation_id":"854fae51-f859-40c8-a987-3d3aa3b118ed","resolution":{"observed_at":"2026-08-15T17:04:54.251398Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:04:53.640056Z","title":null,"venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.640056Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:d3eb1ce0885a324e2891ea719bb21029247a10cf37616beb658e94332263c5df","observation_id":"9b8f24ab-edc7-479e-97c2-af6dafd5f91a","resolution":{"observed_at":"2026-08-15T17:04:53.640056Z","resolver_source":null,"status":"malformed_identifier"},"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-15T17:04:54.808517Z","title":null,"venue":null,"work_id":"26c475c8-4f79-4589-b6fe-451c3b11ca6c","year":2008},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.645006Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:6e0340c7449e656787834af477cc0a056503417a8222598cfd7d7a62f54d28d4","observation_id":"6b1f6fe2-ce33-47cd-af96-cc7c97175d02","resolution":{"observed_at":"2026-08-15T17:04:54.814075Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:04:53.650852Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.650852Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:b884933c1ddc889e71fba60e634070906d973c78beee0d44f1fed7c6e5c94f26","observation_id":"40b9d812-3ff2-4a31-9ee6-744357f58fc7","resolution":{"observed_at":"2026-08-15T17:04:53.650852Z","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":"2015.73638","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:04:54.095496Z","title":null,"venue":null,"work_id":"d480db03-7176-4022-8a30-418fddf4e1a7","year":2015},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.656006Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:6e0578a788456ce873d232f6de9784747563654ed11e9e0f0cdbfdd045b84db9","observation_id":"ff82cb23-ca5c-460a-a9a1-531fd21e051b","resolution":{"observed_at":"2026-08-15T17:04:54.103742Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"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-15T17:04:54.790716Z","title":null,"venue":null,"work_id":"f7e9d035-e365-4fb9-bd8c-f4aeb2bb1ffd","year":2023},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.661307Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:465bf62afea3f91e0bf5b6625fd2aaf0202d3e1ff45e4ffc32957d41d81fd2a5","observation_id":"42de4a65-4361-41b9-9110-13d7402dfcf3","resolution":{"observed_at":"2026-08-15T17:04:54.796330Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:04:53.666365Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.666365Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:295a35ee01fc2d126bda114a5699f19818a1740fb0492ef9fa37794a3edc79c9","observation_id":"c4012786-6d89-48e5-871d-f8629f2100a3","resolution":{"observed_at":"2026-08-15T17:04:53.666365Z","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-15T17:04:53.671879Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.671879Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:254324703fb4311d33b4e30cd603d245b502226d54e084589d8d919be21e884d","observation_id":"5fb6b354-a0e3-453d-9d79-e6227f6830e4","resolution":{"observed_at":"2026-08-15T17:04:53.671879Z","resolver_source":null,"status":"malformed_identifier"},"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-15T17:04:54.772236Z","title":null,"venue":null,"work_id":"e5ab06e4-49b6-40fc-bc82-88d8eda8698d","year":null},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.677095Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:d3cd9fb5437e2745a248a4706a6469e65591c7c437be4a5703d449b3c1216816","observation_id":"d62af3a5-3a8a-41dc-aea4-7aff26fc3bd0","resolution":{"observed_at":"2026-08-15T17:04:54.777761Z","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":"10.1007/s11227-009-0299-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-19T11:03:45.297681Z","title":null,"venue":"The Journal of Supercomputing","work_id":"13d40e6c-a4ec-45a0-ba2e-39f0a6e98eab","year":2010},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.686927Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:691ca7076b587518595518757e2437219bc8770c5ed4712da92f6c9e5d8d8fe8","observation_id":"e96b555b-c0a9-40d0-b294-275e91517f37","resolution":{"observed_at":"2026-08-15T17:04:53.750406Z","resolver_source":"doi","status":"verified_exact"},"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":"10.1109/icde.20","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:04:53.726016Z","title":null,"venue":null,"work_id":"04e5773e-aab9-4b5e-bff6-483310842576","year":2016},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.691963Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:5bbb6310cd3a24380c4d916c0417dabeb36420490b1fd73a599e55a21150ca96","observation_id":"8aaa8b98-7d09-435d-b4a5-3b06a6e25f6b","resolution":{"observed_at":"2026-08-15T17:04:53.732496Z","resolver_source":"doi","status":"verified_exact"},"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-15T17:04:54.753617Z","title":null,"venue":null,"work_id":"7ee028ec-0525-4673-922a-7cab2d0bba1f","year":2021},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.682029Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:e1bdb9ca2757bb5fe4baec0c46db3a6cdc9319b261745826653b2cbe93f324b6","observation_id":"2e372d02-ef71-465a-9e25-60f367a7b4c3","resolution":{"observed_at":"2026-08-15T17:04:54.759104Z","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":"10.1007/s11280-021-00917-z/met","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:04:53.808875Z","title":null,"venue":null,"work_id":"fdcf9dd2-267a-46df-9d94-f9eff7027057","year":null},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":1509,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.586006Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:61135e051cb443e2ea45b31e2c40da48a6853ca0b3a80b81aed81cd7cef36eb8","observation_id":"c5731057-21a2-4c06-b1c7-8a29493a839a","resolution":{"observed_at":"2026-08-15T17:04:53.813985Z","resolver_source":"doi","status":"verified_exact"},"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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T17:04:53.523668Z","title":"Proceedings of the VLDB Endowment 12, 13 (Sept","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.523668Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:742bb9bfb664f61b15f24c0fdcf03754a7ec0bc0af3e171eb538eda7cd418be3","observation_id":"1538de22-bb99-4d07-9271-56d029505ec3","resolution":{"observed_at":"2026-08-15T17:04:53.523668Z","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-15T17:04:54.883170Z","title":"World Wide Web-internet and Web Information Systems 24, 5 (Sept","venue":null,"work_id":"61d77b82-b13f-4b78-ac59-468001f2d483","year":2021},"citing_paper":{"arxiv_id":"2508.18151","last_updated":"2025-08-25T15:57:28Z","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-15T17:04:53.581203Z"},"links":{"citing_paper":"/paper/2508.18151"},"observation_digest":"sha256:724f14f8392da7e9fe3d138ee825aff19c30fd74f330fccee7f65db5e6a6d607","observation_id":"e6a25e7a-c6b8-44c8-8b9f-02ec84e307be","resolution":{"observed_at":"2026-08-15T17:04:54.889216Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2508.18151","last_updated":"2025-08-25T15:57:28Z","latest_version":1,"primary_category":"cs.DB","snapshot_observed_at":"2026-08-19T22:55:28.945594Z","submitted_at":"2025-08-25T15:57:28Z","title":"Accelerating Historical K-Core Search in Temporal Graphs"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":3,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":25,"verified_exact":7,"verified_fuzzy":1},"total_outbound_references":39},"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 39 of 39 outbound references and 0 inbound Pith citation observations for arXiv:2508.18151."}