{"as_of":"2026-08-17T22:56:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:39e27147daca7c99a1017c116f6bffdf657ec79dac384ca5ee498e87d098e968","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:33:40.521517Z","state":"measured"},{"denominator":45,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":45,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2507.08328/citation-record","integrity":"/paper/2507.08328/integrity","json":"/paper/2507.08328/citation-record.json","paper":"/paper/2507.08328"},"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-06T18:33:48.560459Z","title":null,"venue":null,"work_id":"6e279497-2f5c-49d7-954c-bb8ce921ed00","year":1994},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:32.735005Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:2a5f31e3c6ee10433613143d91f00330f3a5fb1b72727cbe0bd4c0ed4f228e96","observation_id":"91537167-2fef-4e66-9341-55d7e04f21ff","resolution":{"observed_at":"2026-08-06T18:33:48.595351Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:48.262284Z","title":null,"venue":null,"work_id":"d776827e-d6fb-4718-a390-83149fb8f5ef","year":2020},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:33.268120Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:4eb146dca9c1446874de2f0f6edd08fdb53dc477dcc121c7a96f4ed9319db556","observation_id":"ed7268f2-084c-4a4e-9c98-dfe1d7d1bded","resolution":{"observed_at":"2026-08-06T18:33:48.415168Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:34.503463Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:34.503463Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:bed20f57561fb7ef78360e08c98d7fd05e87e0c517c464c02b78ea5d850f00ce","observation_id":"55eaac22-591b-4302-bbe2-3a6039ff0abc","resolution":{"observed_at":"2026-08-06T18:33:34.503463Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-06T18:33:34.806693Z","title":null,"venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:34.806693Z"},"links":{"cited_paper":"/paper/cs/0310049","citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:23baa7c1deb4798a33001ebd18088969a07218fb58854757330f8c1cb180beb5","observation_id":"67426b43-9abf-4e62-b38b-ca49deb62b95","resolution":{"observed_at":"2026-08-06T18:33:34.806693Z","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-06T18:33:47.871223Z","title":null,"venue":null,"work_id":"ccaa0891-b687-456e-ba83-4a50221a4427","year":2011},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:34.925516Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:bb673836a58a0cb5adb30ef7bb24aeccdb97c6879ffa9ef66b416519ac712aa7","observation_id":"29db5061-b6ad-45d0-becf-e578ff360ed2","resolution":{"observed_at":"2026-08-06T18:33:47.977038Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:47.594689Z","title":null,"venue":null,"work_id":"b0d4e9f4-6995-47f5-8fe8-6a7e9337d111","year":2018},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:35.070372Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:f68821e4d3e4c36dd251d85cd81f0af0aa85b1f2caf030d88ef2b2a47309ce4e","observation_id":"25d8b47b-cf29-496d-8a27-e9bd6cb79c72","resolution":{"observed_at":"2026-08-06T18:33:47.698367Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:47.313895Z","title":null,"venue":null,"work_id":"ececa8e6-c704-4e9c-b366-a179a886b631","year":2018},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:35.159038Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:b3f0b5a4807141f93a7959ab7b55e64de730ecc14e87c3e6d6b72ccdf54d6de4","observation_id":"a64744d0-074e-4889-b0e7-a393a7afc35c","resolution":{"observed_at":"2026-08-06T18:33:47.401123Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:47.006309Z","title":null,"venue":null,"work_id":"2a24cbda-ddc0-485a-8e5b-6980500538c9","year":1984},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:35.299272Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:47202671483c3e0999b9f026c8c007865c22783408527692319ff6886ac218cb","observation_id":"d8b410e2-f271-491b-80d5-2ba643fa9150","resolution":{"observed_at":"2026-08-06T18:33:47.142049Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:46.750878Z","title":null,"venue":null,"work_id":"62cf00f5-6aaf-4ab1-9226-097185d4baf9","year":2023},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:35.437207Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:fd7c34142af58a811cbb31a52e55cecef3bba58fd142e5474c4b5e12698f4c43","observation_id":"15447156-2185-4a9d-b37a-67bc67a6b223","resolution":{"observed_at":"2026-08-06T18:33:46.827021Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:46.461869Z","title":null,"venue":null,"work_id":"7af7f74b-fa7c-4462-a447-d4d27fe9bf49","year":2011},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:35.541952Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:6dc94a1b5afecab6e94531a1c9a4a6f5e8c7cf9280875f96ae0057f4d9abe471","observation_id":"1417f928-cdcc-4da6-8f68-707b0b09ca28","resolution":{"observed_at":"2026-08-06T18:33:46.543724Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:46.239107Z","title":null,"venue":null,"work_id":"3767b149-a822-4469-84f0-7a6cfdeabd0c","year":2020},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:35.702572Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:22a516ab47aae11b1ec1f8ae0656303d0516397076ab67412080e3260a5b78c0","observation_id":"4560dd22-7711-4b3d-b905-b57ef970bd42","resolution":{"observed_at":"2026-08-06T18:33:46.326134Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:45.975318Z","title":null,"venue":null,"work_id":"3894ba73-81b9-4ab5-a648-d226ff71ade0","year":2021},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:35.872658Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:d3f832dad802de3c9c36f04d3dcc18d415ec33aae50deaa1d87eb03c67e41861","observation_id":"2e9cda3d-198d-4989-b54f-551e5ebf5523","resolution":{"observed_at":"2026-08-06T18:33:46.108511Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:36.017281Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:36.017281Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:d922b122466c7cce5ce67cffcdeff193ab263f384c871eea6ccf52bfff3072fd","observation_id":"fdd9639a-743b-4f92-b907-3c99dca05545","resolution":{"observed_at":"2026-08-06T18:33:36.017281Z","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-06T18:33:45.802504Z","title":null,"venue":null,"work_id":"26b11254-68cb-42b6-b553-24c5706a2a3d","year":2017},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:36.172439Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:709d24c000e64f117a5feb1ee962cf71fa574c78cb71ffc7ce6c2e8ed29a9bea","observation_id":"492f4aea-ad4b-4d81-9e5c-346f078b5431","resolution":{"observed_at":"2026-08-06T18:33:45.854838Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:45.566564Z","title":null,"venue":null,"work_id":"ecfc1530-32e6-4908-85e9-c8feb758ce99","year":2022},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:36.313836Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:23e94cba2abecbc89994c9238ce830738e29d4092dfad18709583894040fb9df","observation_id":"ef7493bf-54d3-4e82-b32c-07392ad19839","resolution":{"observed_at":"2026-08-06T18:33:45.686738Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:36.497335Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:36.497335Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:d6618dc50c6b0b2ae0bee5805c662966298226b0a38736523f98812d946e81b4","observation_id":"5dcf0268-a0e5-4395-bcf6-e64458a6079b","resolution":{"observed_at":"2026-08-06T18:33:36.497335Z","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-06T18:33:45.366386Z","title":null,"venue":null,"work_id":"c92c7959-ef2d-4922-acc7-33badd2c4a3c","year":2017},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:36.654956Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:71fe35e256866ea0a52a528d812d76eba631930b28582604ad0263f75d8d6b81","observation_id":"e8dbe7b6-a13f-482b-b310-1632e95bbdc4","resolution":{"observed_at":"2026-08-06T18:33:45.430482Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:45.208132Z","title":null,"venue":null,"work_id":"a289cf0c-451a-4254-bf8e-770c73fb6d8f","year":2013},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:36.813326Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:a52c66635bf20778e4482f66ee4934f15da52b67220d618f0f8823f11094fb5f","observation_id":"c980e269-724c-402c-9604-6402734f640b","resolution":{"observed_at":"2026-08-06T18:33:45.287163Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:45.065255Z","title":null,"venue":null,"work_id":"0ba47150-9373-4869-bc66-5077f7083f05","year":1953},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:36.920575Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:03975081198ff401d3e293581aa8b008bb527c9ad989235e548e546a420f50a1","observation_id":"7275c213-fb80-40d5-8bac-adf66b40ffda","resolution":{"observed_at":"2026-08-06T18:33:45.125206Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:44.935164Z","title":null,"venue":null,"work_id":"60c9203c-b213-4eb0-80f6-d948d7a2d910","year":2015},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:37.066687Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:37f75b1a1947f9ef0b97eed5e4d21a05ce11b79f43966ee563224147721dbf6a","observation_id":"d5997a1d-8d85-4e90-8ad8-a562b5f2950e","resolution":{"observed_at":"2026-08-06T18:33:44.963428Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:44.787620Z","title":null,"venue":null,"work_id":"8ba17ed0-08f0-4b2b-b372-1856010178b9","year":2013},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:37.165374Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:48820018a8c58b0cbe13739667799b39c16bdf8ce574d70d9b0f1693de4bcb92","observation_id":"b3dd6623-b91e-4283-a6ad-464db2e89f6e","resolution":{"observed_at":"2026-08-06T18:33:44.850535Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:44.659429Z","title":null,"venue":null,"work_id":"e1bd48f2-d2d3-467d-8be8-97cb1673371f","year":2023},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:37.356477Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:f3e607ad6a74d9a0c256989072582e938268b1c0a78119858d6391cf71a96586","observation_id":"ffc04412-a0ff-4de7-ad88-4fdada882775","resolution":{"observed_at":"2026-08-06T18:33:44.728310Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:44.374747Z","title":null,"venue":null,"work_id":"19fd5845-51d1-461b-940a-bcd1072c9704","year":2023},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:37.494487Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:a0b4027a9f2ac1ecf027c8a45193c172558feba766c4b8e2d15cc58d71aacc71","observation_id":"2e92ae4c-24ca-449d-af4c-736ce8418e93","resolution":{"observed_at":"2026-08-06T18:33:44.553684Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:44.206036Z","title":null,"venue":null,"work_id":"98995534-4d6f-4e43-8108-04783a3d8c61","year":2024},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:37.621188Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:9a261ff7751bf44b28b438bbd0bb20d6dc939dd30ef028af268215f6e29ce43a","observation_id":"689586f8-e64a-4d72-a4e7-c054f7c0abe5","resolution":{"observed_at":"2026-08-06T18:33:44.249542Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:43.997293Z","title":null,"venue":null,"work_id":"212f27a8-4b98-4671-8bc8-8b08f8b94a7c","year":2024},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:37.765613Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:0bfda84d7b9ce68a78c76c514019deffbbf5b4c98b789afc86cd999e2b5b96b6","observation_id":"73490268-4655-4507-ae6f-dd6d85b8f44b","resolution":{"observed_at":"2026-08-06T18:33:44.084779Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:43.777735Z","title":null,"venue":null,"work_id":"fa7dc379-49dd-4063-8298-a60d0e8deb66","year":2013},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:37.915419Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:74380eac364d6d1ec315ca250bf5acc0766f052771f887157824e0d81600a2e4","observation_id":"f269b189-abb3-4de0-83a0-8f40a34d4fe4","resolution":{"observed_at":"2026-08-06T18:33:43.890308Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:43.483601Z","title":null,"venue":null,"work_id":"7f01592e-d20d-48c9-a915-c7054d0ad48a","year":2010},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:38.050031Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:e8f94aef5bf00be5c4ed2d5b9478a8dd6fb50e7bb183332b7e08cf0ad62522ee","observation_id":"6fc4b6f6-24a4-435f-9c50-bdd87f543fe3","resolution":{"observed_at":"2026-08-06T18:33:43.628527Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:43.264486Z","title":null,"venue":null,"work_id":"317e512f-b6fa-4ae0-b611-c746181086a6","year":2023},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:38.246954Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:0ec69afac2a6ba0d3378042e826354f224aa23d2209e3db36d79499bb3913068","observation_id":"a6922e75-37df-4379-9d12-d7d3926d7782","resolution":{"observed_at":"2026-08-06T18:33:43.351584Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:43.012212Z","title":null,"venue":null,"work_id":"e62164f4-b5dc-4377-8039-dd8df0470fe3","year":2020},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:38.396630Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:d0790c6d6f3029f79052c7f3e551cc3495208bcfe9c1d89a157ee419b85bd3b9","observation_id":"ee9e0915-8cef-469e-9a06-838f3726d276","resolution":{"observed_at":"2026-08-06T18:33:43.102135Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:42.731410Z","title":null,"venue":null,"work_id":"cc2c1585-7efc-4363-9460-890f63332180","year":2020},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:38.578371Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:6e0432c31a47c099fc5c441b87b37f9cc322586af4a01aab58f5d48072a653db","observation_id":"e123baad-7b0a-4375-8dbf-30eb0f4150aa","resolution":{"observed_at":"2026-08-06T18:33:42.867137Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:42.487967Z","title":null,"venue":null,"work_id":"11ab9120-eaae-4190-a446-63d1224f51f3","year":2007},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:38.792811Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:b5a3bbbdb8087260452a20a189ae920e9727a85fbd86661a4ea2ce9f0cf8baa5","observation_id":"c24c2a5d-0b50-4738-8e86-c35b4f90f297","resolution":{"observed_at":"2026-08-06T18:33:42.570855Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:38.981524Z","title":null,"venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:38.981524Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:da6fc3216808aef816cd0b04e0d92af433512676a37a7dbeec5e6b686d5be364","observation_id":"3b0fd083-365b-481d-a76e-31cc07ed6878","resolution":{"observed_at":"2026-08-06T18:33:38.981524Z","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-06T18:33:39.202869Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:39.202869Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:d7497b76d3d95f1fac4132ddcfd2e8445dd577d33577e53625c7435a36d755c0","observation_id":"183b2e85-d5a5-4fdd-87c7-a20b14f9dcca","resolution":{"observed_at":"2026-08-06T18:33:39.202869Z","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-06T18:33:42.190484Z","title":null,"venue":null,"work_id":"34a64bf4-d632-497f-be39-f4647d347eed","year":2019},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:39.356855Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:e00a0bf05f866075610b74f0be9f7b23251e2c946b7ce64e45c5dea54851be73","observation_id":"4159c4c8-5f9f-4388-8648-cbb91cc38f95","resolution":{"observed_at":"2026-08-06T18:33:42.283436Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:41.995804Z","title":null,"venue":null,"work_id":"99c0ad2b-98e4-4289-bb95-0be076c8152e","year":2012},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:39.490950Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:40323b39c72944a8279742e32dab5b3a66b50989b7187c737942271ce1e72b3f","observation_id":"043be28b-f262-4732-a18f-3700d3432a06","resolution":{"observed_at":"2026-08-06T18:33:42.053370Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:41.820643Z","title":null,"venue":null,"work_id":"8e6d82c5-8824-46b1-bd7c-902baa8ad658","year":null},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:39.584279Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:6cdf68a55b70249254b92b6a84445c611427101803ff674977bb46348e85482f","observation_id":"85727540-9edb-4383-9b72-755a78e21b0d","resolution":{"observed_at":"2026-08-06T18:33:41.875947Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:39.869418Z","title":null,"venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:39.869418Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:f5372ef55c40d2c5188a852eaae753bb739465b26418270d278a98c6f3c32daf","observation_id":"26b7ae23-5de0-41e3-b6b1-a9623793d487","resolution":{"observed_at":"2026-08-06T18:33:39.869418Z","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-06T18:33:41.651748Z","title":"Journal of Applied Data Sciences 4, 1 (2023), 38–49","venue":null,"work_id":"54aca3f6-06fa-47ae-aa03-2417fcbbb073","year":2023},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:39.718532Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:184647f5fdbac34fe41815bbdb7de59d368f650523b245e617625b2a869f31ca","observation_id":"6d17af53-dae5-41d4-a6cf-e3b72abc37a5","resolution":{"observed_at":"2026-08-06T18:33:41.720577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:40.125688Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:40.125688Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:fda60ef0450e6350f2b6673dda9861ffe0792bdeaa3ee0b6058475cafe2f2684","observation_id":"dec733f0-2659-466a-aa8c-f573330834b9","resolution":{"observed_at":"2026-08-06T18:33:40.125688Z","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-06T18:33:41.450438Z","title":null,"venue":null,"work_id":"54f5acdf-a06d-46c7-9c54-3cad1f5fe9c6","year":2021},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:39.967015Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:1f711925d33f346afabd3eaa62f2fe36be1d33609721b360e261fabaa1c0f574","observation_id":"94b72733-2d80-47a2-862a-2897f16d18be","resolution":{"observed_at":"2026-08-06T18:33:41.527992Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:41.226904Z","title":null,"venue":null,"work_id":"9f88af6d-b74a-4435-9086-d691de68263b","year":1983},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:40.350586Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:aea5d13c6420c1c80057e1f9de24d2c17801ea429f817d73379e68826cc5ef34","observation_id":"3ed775b7-514c-449e-9a35-1a6cf406a9df","resolution":{"observed_at":"2026-08-06T18:33:41.302707Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:40.243657Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:40.243657Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:aadcc8c553461fb4a56c758ba4262c3c6e370480d88ae6857e068b6d7dadd720","observation_id":"9e924c43-1656-4521-b2f6-bea4f23478ce","resolution":{"observed_at":"2026-08-06T18:33:40.243657Z","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-06T18:33:40.810437Z","title":null,"venue":null,"work_id":"52c2e6d7-ac35-4cd6-a0ef-4241fd99acc9","year":2023},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:40.521517Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:b356758f78b805e6b3a2cfd8354849828bf2cffa1a737e25623bde440a093e5a","observation_id":"4799c004-18fd-4e72-b079-9e0d0647ba43","resolution":{"observed_at":"2026-08-06T18:33:40.862045Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:41.026351Z","title":null,"venue":null,"work_id":"7597a0f0-28cc-4196-a214-d98e796de104","year":2021},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:40.416252Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:fd32ad243cf56e04f5bf8f1170663f3c9c7a08a679dab01e407aeef1caed1b55","observation_id":"94a60db0-16df-483f-a5ea-8cd949870b11","resolution":{"observed_at":"2026-08-06T18:33:41.100615Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-06T18:33:48.065434Z","title":"Proceedings of the VLDB Endowment 16, 9 (2023), 2061–2074","venue":null,"work_id":"23c99938-006f-4125-8ec6-e75f769a688a","year":2023},"citing_paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T18:33:34.710121Z"},"links":{"citing_paper":"/paper/2507.08328"},"observation_digest":"sha256:b251726f3cb91a053b85abdaf7a918fde1a4a43434bf30dea71ebd2ad9ecb1a4","observation_id":"1c995a6a-3ec1-4dc4-9b1e-8e8c66ed616f","resolution":{"observed_at":"2026-08-06T18:33:48.144596Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.08328","last_updated":"2025-07-11T05:39:05Z","latest_version":1,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-14T08:23:58.524340Z","submitted_at":"2025-07-11T05:39:05Z","title":"Uncovering High-Order Cohesive Structures: Efficient (k,g)-Core Computation and Decomposition for Large Hypergraphs"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":43,"verified_exact":0,"verified_fuzzy":2},"total_outbound_references":45},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2507.08328."}