{"as_of":"2026-08-23T13:29:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bd962ef02894dd7a2405f8544aacfcc43eee765d7b464b0f1ee06d93cfec564d","coverage":[{"denominator":60,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":60,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-26T06:04:14.440654Z","state":"measured"},{"denominator":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T00:53:42.401046Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-12T00:53:43.526293Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"cited_work":{"arxiv_id":"2606.23289","doi":null,"metadata_source":"pith","pith_arxiv_id":"2606.23289","snapshot_observed_at":"2026-08-12T00:53:43.526293Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","venue":"physics.soc-ph","work_id":"bb040f89-4e21-4e5a-bcb4-b8e62e05029e","year":2026},"citing_paper":{"arxiv_id":"2608.07874","last_updated":"2026-08-08T02:59:04Z","snapshot_observed_at":"2026-08-13T23:21:46.586777Z","submitted_at":"2026-08-08T02:59:04Z","title":"Adaptive higher-order contagion of harmful information with platform-induced group dissolution and individual rewiring","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T00:53:42.401046Z"},"links":{"cited_paper":"/paper/2606.23289","citing_paper":"/paper/2608.07874"},"observation_digest":"sha256:4fef07a17efbb74e6ffa08af0154e49d4c82eb7c523a6c04ae1d3d458182bec8","observation_id":"b7b7b49c-df83-4bc5-b0d8-68a9b47dddca","resolution":{"observed_at":"2026-08-12T00:53:43.531151Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2606.23289/citation-record","integrity":"/paper/2606.23289/integrity","json":"/paper/2606.23289/citation-record.json","paper":"/paper/2606.23289"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-26T06:04:14.440654Z","title":"The structure and function of complex networks.SIAM review, 45(2):167–256, 2003","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:a3a67088c461aa09b450976c67639e7feabc1922e46c5163e6ab4d15c3b24e65","observation_id":"75802ce4-6d54-4076-adbb-9007b4443687","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Complex networks: Structure and dynamics.Physics reports, 424(4-5):175–308, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:7620247b81bce7c3ffde1470d67e441fedd78acd60a4296a2655b57d68d1ab77","observation_id":"6f7a2f42-2b47-451c-bbcf-35986f9f721b","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Public discourse and social network echo chambers driven by socio-cognitive biases.Physical Review X, 10(4):041042, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:f1b5c4e8942d7faa276cc531dac3340fcf036d975bd01f7eea206d5002ad205d","observation_id":"f898696b-99e9-4535-afad-a4a25a24eea6","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Error and attack tolerance of complex networks","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:07603ca4b3d19e2e00fcbe96aded9327110d8d8e81e5fea6baef1535c52cec9c","observation_id":"1b32a95a-3ef5-4114-ac33-8339cb8a3535","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Network dismantling.Pro- ceedings of the National Academy of Sciences, 113(44):12368–12373, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:f548630f0c4d3d46021e6118be9e3a014798f2565eefee4456ef4f1a0f88080e","observation_id":"2b1388c1-a131-40f6-b596-c8d8569a20f6","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"A comparative analysis of approaches to network-dismantling.Scientific reports, 8(1):13513, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:ad85b26441f5693c71d30e9d637b9749025f189c4dfc68a79a63a667185f238b","observation_id":"4f0bf57b-5b8c-45aa-a2c1-6ed842d75427","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Recent advances in network dismantling: A comprehensive review and list of recommendations for future work.Chaos, Solitons & Fractals, 199:116673, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:1b94e6d66572b6b4182405997cfbd50bfd2444cd36628030a046b70db724c7f8","observation_id":"958a4398-178e-42f0-bf1f-3df9f2f3c52f","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Centrality in social networks conceptual clarification.Social networks, 1(3):215–239, 1978","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:6bd6e1311087bbb2431cabd1e30d7a4070f276cd28d82df727c68466ae651e23","observation_id":"624eef76-520f-4b88-bdb9-540276b88fdd","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Power and centrality: A family of measures.American journal of sociology, 92(5):1170–1182, 1987","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:6152463ed38ddf6fa68d40792ae1445d75d218e43f6dd19e0765f20c4d36fd37","observation_id":"901501c7-6eca-4a42-a69a-1eb70f25c9bf","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Vital nodes identification in complex networks.Physics reports, 650:1–63, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:2df10f93352fdc6f7465879021218a4dcc58fe3ab3014686b20e6b31b85adece","observation_id":"026d9855-a292-4170-a48c-0852b5b2a7e6","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Identification of influential spreaders in complex networks.Nature physics, 6(11):888–893, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:0d359599f54037ee9dc7b5fdf8a06718df5f1f85a827239a1b7c0069cb8f1146","observation_id":"69314c03-23f2-4bef-8696-a6e3a3a963db","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Searching for superspreaders of information in real-world social media.Scientific reports, 4(1):5547, 2014","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:5a384867a374791d5477379ead7b62d1edfb9e7628183e0b662974b81f3fb607","observation_id":"059d9b35-622f-4c51-8ebc-a0de254f7f82","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Local-forest method for superspreaders identification in online social networks.Entropy, 24(9):1279, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:605934b03f704e9d480125c0c6af0ae4ec10e5033be2ac1d40f0c4fc7c50be47","observation_id":"1a48b848-3172-47aa-b2cb-1545e207ab4c","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Influence maximization in complex networks through optimal perco- lation.Nature, 524(7563):65–68, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:727d0b817cbb36f249996f80d52b31bfc5d4a2f606fd506258fedd4bd2e9b4b3","observation_id":"00569733-3b9b-4e0c-b70f-affc01266c9d","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Immunization and targeted destruction of networks using explosive percolation.Physical review letters, 117(20):208301, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:ca6bb866aee0b4938e41bb1bdfb1a3c58f5032a06bc01102ba74949d05bd6890","observation_id":"87956738-7a0e-46c5-afb9-f3b5b8cdb519","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Domirank cen- trality reveals structural fragility of complex networks via node dominance.Nature communications, 15(1):56, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:cbbc204fece71eaaa377ad41213c6bfdb7005f2e607579714c6d61e2e542c83a","observation_id":"c2552e94-496c-4cf3-aed6-9f68a53a16d1","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Finding key players in complex networks through deep reinforcement learning.Nature machine intelligence, 2(6):317–324, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:fd8d3f025c9d9de75a638b830dab676e3c76077bd07433bdfb3f69460965f442","observation_id":"b9c9ad4e-c967-4527-a8bf-e3bf6e4eaf95","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Machine learning dismantling and early-warning signals of disintegration in complex systems.Nature communications, 12(1):5190, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:3ec52cc1d08acd0ad4b4dcb3a8947ceaad1359f3a242819a61c9d33a7aa8756c","observation_id":"a71c274d-70cd-48ed-b0e8-193f2fb1e15b","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Encoding node diffusion competence and role significance for network dis- mantling","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:6929e50bb6cffdfdeb298ef20054538ad982fb62269d64c84927a7206651eff0","observation_id":"6eab7113-c9f8-4495-8797-2d1c2bd5c7de","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"The structure and dynamics of networks with higher order interactions.Physics Reports, 1018:1–64, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:94ff8647f961a4bab7e3335e9ac385a57f8f283ac008a3aa8b3e5216b44e63a4","observation_id":"fce96b1e-c38a-4bfa-8623-caf7279f3a02","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Multistability, intermittency, and hybrid transitions in social contagion models on hypergraphs.Nature communications, 14(1):1375, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:e97c315ccdd3caa344777ee587f3a7781fcf7446da90a55307ee940bb5f300b2","observation_id":"95ca9a66-82d1-4f99-8b8c-3be609c63b91","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.15445","last_updated":"2025-08-21T11:08:19Z","snapshot_observed_at":"2026-08-14T02:33:22.871811Z","submitted_at":"2025-08-21T11:08:19Z","title":"Higher-order network adaptivity: co-evolution of higher-order structure and spreading dynamics","version":1},"cited_work":{"arxiv_id":"2508.15445","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.15445","snapshot_observed_at":"2026-07-08T01:19:06.298599Z","title":"Higher-order network adaptivity: co-evolution of higher-order structure and spreading dynamics.arXiv preprint arXiv:2508.15445, 2025","venue":null,"work_id":"dc0a8e4c-39e5-4e4a-a723-0dc679c0fa64","year":2025},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"cited_paper":"/paper/2508.15445","citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:deaf5e111e3f7b0b3e7f95a8c326a44a112e9a245e342baaaa11dfb18dd6f37f","observation_id":"01b2c11d-8d08-4f3e-9080-3149938c9535","resolution":{"observed_at":"2026-07-08T01:19:06.298599Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-26T06:04:14.440654Z","title":"Simplicial models of social contagion.Nature communications, 10(1):2485, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:df95650ba0ee2a0ba6d0d66f09aef7c763b74969d2f7c645dbd2cc6e6847736b","observation_id":"874b0897-ab3f-4482-82f2-4199cac7c065","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Influential groups for seeding and sustaining nonlinear contagion in heterogeneous hyper- graphs.Communications Physics, 5(1):25, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:f120c3cc1e128326c2bd1eb5ec3f3bd34872e34735e0f087757a2affff547b74","observation_id":"13b22312-dae6-49f3-acc5-c735adcda0ac","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Connectivity in hypergraphs.Canadian Mathematical Bulletin, 61(2):252–271, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:92e576fb5fb45aee6bd71180a2d039942a7bfdf784544ecc72bcb8326afcc26a","observation_id":"c373f12c-c8ba-47b1-a64d-c70b52c064fc","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Higher-order interdependent percolation on hypergraphs","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:6ff35e735acca0685ac62ec09b2b94df4f76b2c0849de34af6d76fec03b84593","observation_id":"5fbba640-c29d-49d9-8271-b7b5e0b6c62d","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Theory of percolation on hypergraphs.Physical Review E, 109(1):014306, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:0d9dc1bd485eb74e289f5a1e9f82bfcdf4d29d14f0b6fc57efde5bbf922f0f9b","observation_id":"599c3544-f032-4fcc-abe5-3ff0d0f91c1e","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Geometry of nonequilibrium reaction networks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:dbc9954de6793323fc9d31b1d54c41b9e3f7a0ba4ac44cd1b3fbb5d96b907665","observation_id":"bbca9b31-8357-4545-9c59-5701b2928ef3","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Nature of hypergraph k-core percolation problems.Physical Review E, 109(1):014307, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:481ad3e603b172a311ced8ffc6032302713350b8a4008300475fb49af8f579ca","observation_id":"afa6aa2e-c16f-476f-8b78-c25aab27d168","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Hyperci: a higher order collective influence measure for hypernetwork disman- tling","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:382c54afc3b3f376556992a0112fac0a2757604a9002fcb7207563e39ffe441f","observation_id":"3c0f81e1-128b-4c93-9892-aed9f611bd27","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Influence maximization based on threshold models in hypergraphs.Chaos: An Interdisciplinary Journal of Nonlinear Science, 34(2), 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:c6b9a3b17a2b4c45f83afdfef013ae7182d82d53291fdfd53236d18e9bcd16e2","observation_id":"52dd5b26-3a30-446e-ab00-8071d7a918c4","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Hypernetwork dismantling via deep reinforcement learning.IEEE Transactions on Network Science and Engineering, 9(5):3302–3315, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:f3cf33d349d655e5aa40354ae28e0382dc7cb07bf11a825a9419e1d130a5b41c","observation_id":"4ffccb2b-640f-43d9-8171-8420874450fd","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Deep learning-based hypernetwork dismantling for effectively hindering structural recovery.Information Processing & Management, 63(3):104551, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:186ebea4e693ab146472184b93e601a406beeed768d99f84101a21cd6cb642eb","observation_id":"0bc89f0e-7661-402b-b165-3887a7e312ee","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Betweenness approximation for edge computing with hypergraph neural networks.Tsinghua Science and Technology, 30(1):331–344, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:a7de698d465dbd4f32e2ac4e8c3aa0a006ebe097ce16588d14656555d55e4631","observation_id":"92b8f8af-7253-4ddd-9d27-c1a3d5728876","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Hyper-cores promote localization and efficient seeding in higher-order processes.Nature communications, 14(1):6223, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:eb6a6863ee0607839172452b60fee61c00216ef0f7946efa24dd10ed163873cc","observation_id":"b0f63aa1-14e8-4f3f-891d-7b811adc3c21","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Node and edge nonlinear eigenvector centrality for hypergraphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:7a6eea338305c2c01be733e06cf66c3332712a3822cbf3a368b39b6c9bc7d51f","observation_id":"eccd425b-82fd-402e-8ef5-521fea9b785b","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Locating influential nodes in hypergraphs via fuzzy collective influence.Communications in Nonlinear Science and Numerical Simulation, 142:108574, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:86ceb40e29e94dd2d04c777bd0137ecdb70295aea175870bfb629e0622754314","observation_id":"bab87a60-2e66-4475-8c56-1bd171e38420","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.07686","last_updated":"2018-03-13T19:10:46Z","snapshot_observed_at":"2026-08-14T21:10:33.188513Z","submitted_at":"2017-03-22T14:47:37Z","title":"Subhypergraphs in non-uniform random hypergraphs","version":2},"cited_work":{"arxiv_id":"1703.07686","doi":null,"metadata_source":"pith","pith_arxiv_id":"1703.07686","snapshot_observed_at":"2026-07-04T12:49:52.069071Z","title":"Subhypergraphs in non-uniform random hypergraphs","venue":"math.CO","work_id":"5baeec3a-d3e6-40d8-9a17-b012c98ccec2","year":2017},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"cited_paper":"/paper/1703.07686","citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:000ec86b4241adb3d5cb43ddc42bb1788f36e17ebf049fb0e11e922b96666fde","observation_id":"6affa742-b20d-4645-b966-7bfe1ac5d4b1","resolution":{"observed_at":"2026-07-04T12:49:52.070283Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-06-26T06:04:14.440654Z","title":"Smallworldness in hypergraphs.Journal of Physics: Complexity, 4(3):035007, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:1574da9ef5fce7bc0d8bca45250c1529d9859143ad45f95d22c8b26be865a968","observation_id":"846b2e12-5b61-4772-a8e6-3bee2f5e6586","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Xgi: A python package for higher-order interaction networks.Journal of Open Source Software, 8(85):5162, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:f39bd2a4d067a88918ce621cc247829bf75957ab1bc92e6b1740abdc9bed41d9","observation_id":"b51ae0b6-5260-4706-91cb-230f6e8f9071","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Hypergraphx: a library for higher- order network analysis.Journal of Complex Networks, 11(3):cnad019, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:53f3a7f0e4018711644cd4ae55a902a41b5c588c83a7eaef32ae9121ac5d5f57","observation_id":"5bd79e8d-5a94-4ba8-a0d9-045cc41e03fb","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Prob- abilistic activity driven model of temporal simplicial networks and its application on higher-order dynamics","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:c431e1779d2fd752322c95bc9312c2838ea8bab997937478de7939892c105065","observation_id":"5b749aa9-781d-4ed2-a358-ef4fb1b33a59","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys.PloS one, 10(9):e0136497, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:ff4a49f05a9e9fec9479a69db5017eb000ac362aeba3e949237298f4f3db05d7","observation_id":"285ab2ca-ffd9-4b55-afc0-6c4015283e90","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Can co-location be used as a proxy for face-to-face contacts?EPJ Data Science, 7(1):1–18, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:46cde19ebf5a9979f08799d72af8002f7a326f0ba61c00f8b542a880f7f10ced","observation_id":"6d285545-6214-47ff-b202-74db9c6a544f","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"High-resolution measurements of face-to-face contact patterns in a primary school.PloS one, 6(8):e23176, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:025de113d39b9efae38ea8297c08a47f54a8ad4daccf2b3e6ad1d871b81fd3d0","observation_id":"a184c4cc-32f4-4fba-9319-64ee50ea504c","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Simplicial closure and higher-order link prediction.Proceedings of the National Academy of Sciences, 115(48):E11221–E11230, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:488f10e52a2256241a12e2ccfbd63471acf977373ad7b6cc6973e82fdfd43ad5","observation_id":"bc2ecd39-5d7a-4e49-9ea5-709db3179179","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Estimating potential infection transmission routes in hospital wards using wearable proximity sensors.PloS one, 8(9):e73970, 2013","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:7bae9a01e08a198ad83c3a256352ab4f0a2376d461fe39cabbab215896d375d6","observation_id":"8e383dd2-e32c-4fd9-99a2-d2ac7562fb72","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Data on face-to-face contacts in an office building suggest a low-cost vaccination strategy based on community linkers.Network Science, 3(3):326–347, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:b7d36b79a6d34f9b133e64f9102d28459ca74927d68871708486dbda0cc398e2","observation_id":"8a61d904-6799-482d-a26c-c6f36fe69944","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"The role of heterogeneity in contact timing and duration in network models of influenza spread in schools.Journal of The Royal Society Interface, 12(108):20150279, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:27349592f6637a7f7c3e29546cbcc56e9d8f44f760479809ed5c955f5d7f27ec","observation_id":"109a4d97-3300-475a-ba03-310de5886797","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Motifs in temporal networks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:ab7f9b80de0d4d14b20bcfe52b84c3a3046348570c5463ade4b1875eab1c6554","observation_id":"376ae91a-3112-405e-a2b5-06e24bfd10e5","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"The enron corpus: A new dataset for email classification research","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:dd42f93dfed0bc615f9e7badd5ff70c3d3d1e96567ce6bc6330455f52454c086","observation_id":"21dcc22b-4c2f-4f25-8863-4d71e70784ba","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"A network analysis of commit- tees in the US House of Representatives.Proceedings of the National Academy of Sciences, 102(20):7057–7062, 2005","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:3230af56b6d6ed673f5fff9ff24db46342b3ff10b6c63592e4f5fb8fb9749ca6","observation_id":"33bd866c-ef0c-4245-9bfe-91069ba32154","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Legislative cosponsorship networks in the US House and Senate.Social networks, 28(4):454– 465, 2006","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:b8f37f07f506986aa87b6959a49fd74802fec276188d81526e105a95180e506f","observation_id":"303adcd5-f7f3-4dee-a496-322559db84da","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Generative hypergraph clustering: From blockmodels to modularity.Science Advances, 7(28):eabh1303, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:3f45a2178f57ba134ee0a19b6319dcf1c54c8fbfb427f7a13402c93b985b886a","observation_id":"c74ec394-3c0f-41e7-8ce0-72c6f4168395","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Justifying recommendations using distantly-labeled reviews and fine-grained aspects","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:00d84c8d5b189e9d37451530abf5b02f1f5e55dfd886fca4cbbc46e6efc381e9","observation_id":"827c07f1-dfef-452b-8ab4-3879a9314c02","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Diverse and experienced group discovery via hypergraph clustering","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:3383fa5f8ba361e9ff058bc16818646c1588f25c7f30f31ce5d998b4e5ea6793","observation_id":"7baca10f-82c1-4b91-9b20-70a0ad6c9a11","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Generalized network dismantling","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:0e364d9bd38c5dab46655c7a8f345b637002e5f78c12e72f5396174b3164a203","observation_id":"5a7765f7-e551-4c6e-a2dd-77d9b0c94010","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Effective approach to epidemic containment using link equations in complex networks.Science advances, 4(12):eaau4212, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:0c4520aa635ea09704b6ec391226236c8bd8adea824b0d36b65cc5cc7737e771","observation_id":"7d451103-b189-4212-86b4-54c28d1cebf7","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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-06-26T06:04:14.440654Z","title":"Effective epidemic containment strategy in hypergraphs.Physical Review Research, 3(3):033282, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:7835f693aa321c289203abdcff654151d4af4de57457ebb4e6a248238785156e","observation_id":"ade2b953-6a87-4d56-b83c-53c8948d579a","resolution":{"observed_at":"2026-06-26T06:04:14.440654Z","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":"2512.09606","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-04T12:49:52.066568Z","title":"A unified framework for identifying influential nodes in hypergraphs.arXiv preprint arXiv:2512.09606, 2025","venue":null,"work_id":"2f1676c3-f3cb-4823-b54a-2d9c13d15e4b","year":2025},"citing_paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-26T06:04:14.440654Z"},"links":{"citing_paper":"/paper/2606.23289"},"observation_digest":"sha256:8d3bc96e67b4c3d9b2652ab17639939328f1d5c10df5a821ca5f278877bf8a5e","observation_id":"9b748a96-b72a-4998-84fe-f5630dd12a79","resolution":{"observed_at":"2026-07-04T12:49:52.067996Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2606.23289","last_updated":"2026-06-22T13:04:05Z","latest_version":1,"primary_category":"physics.soc-ph","snapshot_observed_at":"2026-07-06T23:58:02.040198Z","submitted_at":"2026-06-22T13:04:05Z","title":"Identifying vulnerable nodes for hypergraph dismantling via higher-order competition dynamics"},"reference_resolution":{"displayed":60,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":57,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":60},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 60 of 60 outbound references and 1 inbound Pith citation observation for arXiv:2606.23289."}