{"as_of":"2026-08-10T03:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d5e2b965946c191a96af26cd8a29dc83db64d1fc58f4e62145abd129812e77fa","coverage":[{"denominator":63,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":63,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T12:27:04.674452Z","state":"measured"},{"denominator":64,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":64,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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-07T13:33:19.023739Z","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-07T13:33:20.352666Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"cited_work":{"arxiv_id":"2502.02386","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.02386","snapshot_observed_at":"2026-08-07T13:33:20.352666Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","venue":"cs.SI","work_id":"152633eb-c4fe-4e8e-8fcb-13ca016393c0","year":2025},"citing_paper":{"arxiv_id":"2505.21748","last_updated":"2025-05-27T20:34:58Z","snapshot_observed_at":"2026-08-07T13:21:34.514509Z","submitted_at":"2025-05-27T20:34:58Z","title":"Broad Spectrum Structure Discovery in Large-Scale Higher-Order Networks","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T13:33:19.023739Z"},"links":{"cited_paper":"/paper/2502.02386","citing_paper":"/paper/2505.21748"},"observation_digest":"sha256:0685d6e8428c1c8316c0532cf622b06cbf609c40c04031246a2d9278899c133d","observation_id":"2c3b75d1-55dc-42c5-809b-e81f8d504cec","resolution":{"observed_at":"2026-08-07T13:33:20.401197Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2502.02386/citation-record","integrity":"/paper/2502.02386/integrity","json":"/paper/2502.02386/citation-record.json","paper":"/paper/2502.02386"},"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-09T12:27:05.588430Z","title":"The end of theory: The data del- uge makes the scientific method obsolete","venue":null,"work_id":"7b6b75a8-4689-4fda-a13d-3541efbe332d","year":2008},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.458053Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:f7c87112104eb5ad23ada43976a8f5ffc0420665f9cabf56660b41262b6ed78d","observation_id":"c7e8e5d1-5082-4f0f-82fb-e225d5193835","resolution":{"observed_at":"2026-08-09T12:27:05.613197Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.552855Z","title":"Random preferential attachment hypergraph","venue":null,"work_id":"52443b0e-ce48-4ee3-9b73-2b37ed52b406","year":2019},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.462590Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:c1a498e15374d34025cebf83cd7771a5bf2e0ab382577ecd9b1af9a43e68ba49","observation_id":"a8bd7375-42b7-4ea5-8eca-f15a9f24eb7b","resolution":{"observed_at":"2026-08-09T12:27:05.559760Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.543123Z","title":"Weighted simplicial complexes and their representation power of higher-order network data and topology","venue":null,"work_id":"c53fa147-963e-4ba7-be1f-9f1259cc653a","year":2022},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.466377Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:d88ec36d611f12f4392cd8cffba40dc06e8dbb9cad192b6095e945baf795a0ce","observation_id":"fe95ea3d-4195-4613-ae06-7d435d239940","resolution":{"observed_at":"2026-08-09T12:27:05.546407Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.532686Z","title":"Hypergraphs with node attributes: Structure and inference, 2023","venue":null,"work_id":"42600b2f-a315-4023-b44f-4870640d87f1","year":2023},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.470519Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:1a506668390a0d26cc2f65eeb1dd382076be74a3cfc5e090e9fdba726e5b655c","observation_id":"7c4fb6ae-4264-4b71-8d55-4596f4880cde","resolution":{"observed_at":"2026-08-09T12:27:05.536231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.521676Z","title":"Emer- gence of Scaling in Random Networks","venue":null,"work_id":"ccd7ed67-39b9-4a58-96a7-6a37c939f7db","year":1999},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.474444Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:dea3835e19bf12eebda3f7ac94c36894f434448f7a8295b57b78d0595f5f2852","observation_id":"09f8da34-2cf2-484b-a2c4-d9c0c0828a1b","resolution":{"observed_at":"2026-08-09T12:27:05.525451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.509930Z","title":"The physics of higher-order interactions in complex systems","venue":null,"work_id":"fc694f86-3abd-4ee6-a00f-987575e9a35f","year":2021},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.478176Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:dbe75d8ee8fe2804e4ee79f6a91666ecb1e127cb4aeb507f4501358beac5cc00","observation_id":"7a282343-70f9-4257-904c-474fe6f3ff25","resolution":{"observed_at":"2026-08-09T12:27:05.514007Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.498840Z","title":"Networks be- yond pairwise interactions: Structure and dynamics","venue":null,"work_id":"bf29f468-71a0-4a2c-a2e4-94bb37217fdd","year":2020},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.482454Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:d2e989520e6fda0161704b7a924cdee9534a81bc96263e8664a6177777b1d642","observation_id":"293a6a8d-c7dc-4e43-9dd1-02689ba190e1","resolution":{"observed_at":"2026-08-09T12:27:05.502460Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.487983Z","title":"Benson, Rediet Abebe, Michael T","venue":null,"work_id":"7135e3d6-a207-4e45-8d12-cf1238db6d47","year":2018},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.486157Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:d0175de3ece422b0049bdadad1d856a676901ac7ec45818aedc7ef3b283ee4f3","observation_id":"fe5751d2-bff8-4ebe-8c37-67e15de4c32d","resolution":{"observed_at":"2026-08-09T12:27:05.491793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.478556Z","title":"Benson, Ravi Kumar, and Andrew Tomkins","venue":null,"work_id":"51d29f93-f752-479b-978a-1ca729bce965","year":2018},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.489670Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:42a020d737476f73a2b9c0a743cad9d9aa3cd56c2ebdcab7a09cb37c98bd460f","observation_id":"1d6654fc-9c70-41c6-b747-bf5805f1dcf3","resolution":{"observed_at":"2026-08-09T12:27:05.481646Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.468678Z","title":"Har- rington, and Michael T","venue":null,"work_id":"698dfd1a-ddd8-4f1f-b103-bfdc5f088d7b","year":2023},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.492960Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:97479b57c7fc42fcad57a1947f258615a320007c4838e55cbfddacffe24591f5","observation_id":"76919531-8587-4fce-b20a-5800bbc26672","resolution":{"observed_at":"2026-08-09T12:27:05.472405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.458552Z","title":"On-Line Expectation–Maximization Algorithm for latent Data Models","venue":null,"work_id":"5918c569-c589-4dd8-931e-7efbae178841","year":2009},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.496275Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:5be41ff6f10135d0ff4658c0708978981b893acae0247a7d9dc180ca3f3bdd9e","observation_id":"7f2f7c7d-e117-4442-b2c3-2b9299fc36dd","resolution":{"observed_at":"2026-08-09T12:27:05.462428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.448934Z","title":"Temporal properties of higher- order interactions in social networks","venue":null,"work_id":"31900418-f26c-48ad-ace2-093bee5c745a","year":2021},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.499741Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:a489bf05c82654186af2ee086f88c59d567aba0770beb10aa4a64ffb8cb6177e","observation_id":"58bf9ec4-0281-4456-b1ff-f9ac92b35bed","resolution":{"observed_at":"2026-08-09T12:27:05.452246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.430855Z","title":"A survey on hyperlink prediction","venue":null,"work_id":"91241f30-4fa7-4e51-93e3-c7d1c290a6ce","year":2023},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.503490Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:27a4d5a1cad9966eb9355cd8eac9b9b231abe1c865a65720f956e6ab8a170d66","observation_id":"8facd29b-08b6-4926-ad94-554717e59614","resolution":{"observed_at":"2026-08-09T12:27:05.441879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.380769Z","title":"Explainable link prediction in knowledge hyper- graphs","venue":null,"work_id":"e907db11-90a8-40ab-997e-69b0146e35db","year":2022},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.506603Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:c1e0949e11e2c85fb2063646630617c6be44b905d5af42d1af2ad2431ca24097","observation_id":"799a3b52-e813-42ab-b3e3-e86e52348538","resolution":{"observed_at":"2026-08-09T12:27:05.400127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.313309Z","title":"Random walks on hypergraphs with edge-dependent ver- tex weights","venue":null,"work_id":"08643cef-228f-4663-af9e-8bc713f76fca","year":2019},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.510002Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:9e1422e28c1363ffa94831d4034636a6b1a6036b509b1d253a47f0aa53fb72fb","observation_id":"fd33742f-5dd4-4c44-813d-0c8de859df31","resolution":{"observed_at":"2026-08-09T12:27:05.352500Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.267782Z","title":null,"venue":null,"work_id":"a728334a-86ed-403e-b950-99b211dd6e9a","year":2020},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.513342Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:a0cba878e651340aedb2b6e3fa70bc93b72f4ae92bec8235bf1f054947ed33c6","observation_id":"e3be6890-984d-490e-931d-28fbc03b1e08","resolution":{"observed_at":"2026-08-09T12:27:05.270895Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.257327Z","title":"Chodrow and Andrew Mellor","venue":null,"work_id":"750bc274-12fb-4f52-8046-70d3d350c075","year":2020},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.516622Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:274b6f01f388abe945c6edbf5474e62cb26732ea4c10af29808c51fc30bb2cb7","observation_id":"ef4eee1a-5be2-45ed-9295-7153f71504d3","resolution":{"observed_at":"2026-08-09T12:27:05.260994Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.247112Z","title":"Dempster, Nan M","venue":null,"work_id":"d118fee6-1718-4f23-aeda-5fa9b6aac826","year":1977},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.519827Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:ba97838fd7bffc3db089870018267df2e592111685b2a32e5acdabfbe79fb669","observation_id":"32b6cc3e-bcbb-4a87-82be-c7d519cc8c79","resolution":{"observed_at":"2026-08-09T12:27:05.250818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.236839Z","title":"Goldberg","venue":null,"work_id":"0da24af4-422f-4787-b8fd-b351ba67da83","year":2013},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.523298Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:3d5fbef57b7c0df5e76e2759fd89ccff763dbcbdb0b5ef15c37fd97ebf4d874c","observation_id":"f47ca438-80b7-4bbc-b039-643fce18ee79","resolution":{"observed_at":"2026-08-09T12:27:05.240331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.225206Z","title":"Directed hypergraphs and appli- cations","venue":null,"work_id":"b83d8158-d151-4ff7-bf45-28fc4a19f4a1","year":1993},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.526793Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:0b3ed15f36a4b890bf90672126098e2e58d58d70e737566c2e8660bdd462ec9b","observation_id":"13c1710b-9ae3-4941-802e-839eb01652ef","resolution":{"observed_at":"2026-08-09T12:27:05.229514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.214621Z","title":"Preferential attachment hypergraph with vertex deactivation, April 2022","venue":null,"work_id":"91efb5f8-fb7e-4c10-87df-3ba4f131ffa9","year":2022},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.530851Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:575d832daf05bacc287c6a2fbabe96ab264326b19547b781889cc719585644d8","observation_id":"da2fc7dd-263e-4d4f-9a20-07ef6d019cf0","resolution":{"observed_at":"2026-08-09T12:27:05.218789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.203456Z","title":"Preferential attachment hypergraph with high modularity","venue":null,"work_id":"76752cc4-6181-4df0-910e-58b03a247642","year":2022},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.534632Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:9a016d638f6f536652341c64234b2d2cd44848ab7631b419137cd5868fbc2f78","observation_id":"b23376c7-9a1e-41f2-8616-4f7dcd25dc3c","resolution":{"observed_at":"2026-08-09T12:27:05.207384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.192269Z","title":"Kleinberg, Ravi Kumar, Prabhakar Ragha- van, Sridhar Rajagopalan, and Andrew S","venue":null,"work_id":"f4a241d8-8965-4bdf-ab2c-6846b2a0c3fc","year":1999},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.537997Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:fc796c4a7db29cf0eda8c163b1665f10401e1ba07b87bc1d9a94bb0c956d285b","observation_id":"57ae5510-d501-4030-946f-eee8c8554553","resolution":{"observed_at":"2026-08-09T12:27:05.196257Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.180834Z","title":"Landry, Maxime Lucas, Iacopo Ia- copini, Giovanni Petri, Alice Schwarze, Alice Pata- nia, and Leo Torres","venue":null,"work_id":"5e7b473a-0bde-40eb-a328-b1787595388d","year":2023},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.541283Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:d5d195000a7c329efbc2c9bc337934d3ec1181c7979761f6dd8e5148ab5d5180","observation_id":"50be0aa7-a768-4adf-80f7-374e5c91ac84","resolution":{"observed_at":"2026-08-09T12:27:05.184745Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.168496Z","title":"Landry, Jean-Gabriel Young, and Nicole Eikmeier","venue":null,"work_id":"f1f735bd-0b97-4dfb-9cc2-a0e164a01e44","year":2024},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.544696Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:797c3436d09060b7b3dcadd36423ba32f3c65fb585786293cf87bdaaa0fcd145","observation_id":"bde43351-7676-4a86-9d37-6f628f3b5a2b","resolution":{"observed_at":"2026-08-09T12:27:05.173226Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.157798Z","title":"A Survey on Hypergraph Mining: Pat- terns, Tools, and Generators, January 2024","venue":null,"work_id":"b665c409-e059-470f-b027-3654da9594db","year":2024},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.548099Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:38278c7c2593c8ce571f8e82efe0d13f41333f51846013e4c70b35dbe354f457","observation_id":"0610d3ec-dcad-4997-af97-59bf70b1b992","resolution":{"observed_at":"2026-08-09T12:27:05.161582Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.145952Z","title":"How Do Hyperedges Overlap in Real-World Hy- pergraphs? - Patterns, Measures, and Generators","venue":null,"work_id":"dfee8630-5fff-45a8-b365-5994fc5df1a8","year":2021},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.551363Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:6c168e90df83264fedefb6f25e5a5e3ac84238f10da388d726f4f8216a20fbcb","observation_id":"d8bbf0f0-515a-45e6-b613-0ff64fe43023","resolution":{"observed_at":"2026-08-09T12:27:05.150621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.134448Z","title":"Hypergraph motifs: Concepts, algorithms, and discoveries","venue":null,"work_id":"fb701c79-b451-46b9-8557-1bdf6e417b58","year":2020},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.554755Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:56b3f317c03e428accf67769da13314261dda520f162d2ca70a5822a4dcc89f2","observation_id":"f63f6e5d-af99-46bf-a8cf-12b809c8ac90","resolution":{"observed_at":"2026-08-09T12:27:05.138406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.123348Z","title":"THyMe+: Temporal Hypergraph Motifs and Fast Algorithms for Exact Counting","venue":null,"work_id":"3d4dde83-60a3-4fba-8416-88351f3521c3","year":2021},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.558706Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:f942c928a0456eb6d15f1673b47100ecbcdef7db5aa095f38bb1f5d5f08fab71","observation_id":"0837c7b9-308e-4b65-a030-c62973f08357","resolution":{"observed_at":"2026-08-09T12:27:05.127147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.082830Z","title":"The link- prediction problem for social networks","venue":null,"work_id":"28a36966-2645-4014-9848-9d5387c538d7","year":2007},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.562237Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:456c846b12e0701d5d71fb7e138fa59d198e1f01872e1e65ffd229cc879ee371","observation_id":"5301cbbe-b641-4e5e-9256-bbde348b7e12","resolution":{"observed_at":"2026-08-09T12:27:05.106115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.054731Z","title":"Hypergraph reconstruction from uncer- tain pairwise observations","venue":null,"work_id":"35f49841-0653-4a7e-bab8-a94139965ce7","year":2023},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.565573Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:5e2cee2d5fcae60cb4e68799bd96c4511cedc0dce4fdc752816b0fdfa5ac90cb","observation_id":"d8fa1523-e7c8-4646-9738-9204a5e42c7b","resolution":{"observed_at":"2026-08-09T12:27:05.062686Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.039938Z","title":"Higher- order motif analysis in hypergraphs","venue":null,"work_id":"ff8be5f5-f682-4edc-afa8-4891f969adef","year":2022},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.569053Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:d2337fd15f2e39cb6bda99ebad7d54ca0dfc3c195c43ff4984efa0034c1f9f3b","observation_id":"4ce71919-1b75-4674-8f14-861b9ba5bee1","resolution":{"observed_at":"2026-08-09T12:27:05.045122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.026648Z","title":"Link predic- tion using low-dimensional node embeddings: The measurement problem","venue":null,"work_id":"d61ad1b3-46dd-4161-8585-9d41888d379d","year":2024},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.572357Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:4c4f79cd2ef8be8014bb785928e981525870aac27e3b745869a49654d2f732ff","observation_id":"3c78b116-1c4d-49ae-a690-fe5971370a01","resolution":{"observed_at":"2026-08-09T12:27:05.031183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.014114Z","title":"Link pre- diction in social networks using hyper-motif rep- resentation on hypergraph","venue":null,"work_id":"e4218f6f-2be7-495f-b680-5299642348b7","year":2024},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.575559Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:3d3380d071d32c400773c08a77200a5141d9991d3ad00b69422444178bab30c7","observation_id":"7687f03a-57d5-4148-904b-933a9683be0c","resolution":{"observed_at":"2026-08-09T12:27:05.018548Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:05.003398Z","title":null,"venue":null,"work_id":"5dbc2907-22b9-4728-b161-3c3c86ae4f4e","year":2002},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.578822Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:73b79ab093bc656b45d78a6a36f6f2dcbceb7ff130b4d3333c2c112fb4e2e5b4","observation_id":"7a3db480-7812-47ea-8036-f7e53489d255","resolution":{"observed_at":"2026-08-09T12:27:05.006891Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.993440Z","title":"A Brief History of Genera- tive Models for Power Law and Lognormal Distribu- tions","venue":null,"work_id":"9a916ac4-cb51-42e9-928d-a3f68cf8b0da","year":2004},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.582164Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:5c36b406da6bf2c99b32374ede88bdd7084627ebc0daea73315eae43fef186ea","observation_id":"d4e95e2f-e2bc-4eb0-bdd7-4e7621ff7d75","resolution":{"observed_at":"2026-08-09T12:27:04.996694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.984014Z","title":"Topological Analysis of Temporal Hypergraphs","venue":null,"work_id":"b878e162-d9a9-4711-8f42-b301ad449903","year":2023},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.585469Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:80a01fed1ea0b768646cc863ab12fc1f268105eadb0db5a0cdea59b163d2a9b6","observation_id":"79feeae6-8534-4633-ae38-a5da00ae611c","resolution":{"observed_at":"2026-08-09T12:27:04.987428Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.972370Z","title":null,"venue":null,"work_id":"11b1dd37-1eb8-433d-b01b-56d75ad4cef8","year":2021},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.588832Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:6554df18157643fe32f0e9972e054863c53e83ecd56316faa8c6ae9fd7f83551","observation_id":"37fbbbcd-fd46-4f59-8a6b-f94c9b53d9fd","resolution":{"observed_at":"2026-08-09T12:27:04.976717Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.962731Z","title":null,"venue":null,"work_id":"ef52b369-2954-49a9-90f5-78521f26450f","year":2018},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.592509Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:a9de15d79aea31000d64128a4c357fa6a29b515e8e5d8954e5ca43bdd2b19fac","observation_id":"37debfe7-3b6a-46b4-bb3a-1f338ca7205f","resolution":{"observed_at":"2026-08-09T12:27:04.966057Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.952166Z","title":null,"venue":null,"work_id":"764a0b9a-4a91-483a-bffe-e92013426186","year":2023},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.596075Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:25fc198ddbe23e1fe0be587ec80e35c17ea60df6f33dca3787820ad49d28eda1","observation_id":"89d60a53-80ac-4465-8c37-9de9453df971","resolution":{"observed_at":"2026-08-09T12:27:04.955591Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.941988Z","title":"Community de- tection in large hypergraphs","venue":null,"work_id":"49f37491-a916-432f-8f61-cfc0d9e37111","year":2023},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.599180Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:b87246bc942d4d636c576f3bc021ad9a9100e83040d282083069ce676e097bbf","observation_id":"35121375-5fce-433d-9a25-e76a751bbde3","resolution":{"observed_at":"2026-08-09T12:27:04.945590Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.930716Z","title":"Modelling non-linear consensus dynamics on hypergraphs","venue":null,"work_id":"3f5b4892-9c21-447b-a2d7-8fbda445d5b6","year":2021},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.602132Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:813f1b25dffe53bf5901371c41e06280f55a84550d5e5f47f4d8abccdac80d52","observation_id":"e9e93239-f950-40be-a51d-7be47dbbf2da","resolution":{"observed_at":"2026-08-09T12:27:04.934620Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.919130Z","title":"Sol´ e, Romualdo Pastor-Satorras, Eric Smith, and Thomas B","venue":null,"work_id":"17877a7a-795e-4542-8450-72d135a3c883","year":2002},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.605805Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:dee4eb99d08285804238bdf0fdfc801d4b3d373b6452a09173bebcf457971fad","observation_id":"eb121cbd-3c86-4fbb-8130-802f1c1f8012","resolution":{"observed_at":"2026-08-09T12:27:04.923175Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.908022Z","title":null,"venue":null,"work_id":"5d7acc8d-0e3b-422d-8160-6504b16853ad","year":2018},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.609427Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:c18a8376f0211c9189c309a610392a5022721d72153445b7b58ac25f79072960","observation_id":"69c21052-7b68-46ac-a221-0c25402bfa85","resolution":{"observed_at":"2026-08-09T12:27:04.911924Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.896532Z","title":"Rxn Hyper- graph: A Hypergraph Attention Model for Chemical Reaction Representation, 2022","venue":null,"work_id":"e304925b-3309-4fe6-9564-1de6b5acd95a","year":2022},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.612965Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:aa996f6f5ac2a4a607415fcd50a7664990804d0582372fac26b890440d08024e","observation_id":"d923e069-030a-4593-8326-97ff6f4ce900","resolution":{"observed_at":"2026-08-09T12:27:04.901077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.886022Z","title":"Blevins, Danielle Bassett, and Tina Eliassi-Rad","venue":null,"work_id":"3cf1b95e-bdef-4678-b79d-cd390794eace","year":2021},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.616520Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:792e8c5f33110a5210122f7ff5b3398f295ce44b5aa078dc1f013b806f0e2f30","observation_id":"cf71ac7a-474a-431d-9497-39a31f92b331","resolution":{"observed_at":"2026-08-09T12:27:04.889830Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.876009Z","title":"Modeling of Pro- tein Interaction Networks","venue":null,"work_id":"009759f9-6d02-41a7-a852-c6787f06a5ec","year":2003},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.620392Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:b205f0c82fe5227dd44a57a619216e96cd900ab5cc98d78adda1bb51f9d100ed","observation_id":"cd06e7a3-0ba3-468a-8f6d-731991562676","resolution":{"observed_at":"2026-08-09T12:27:04.879728Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.865551Z","title":"NHP: Neural Hypergraph Link Prediction","venue":null,"work_id":"0cf52689-cee3-41ac-9724-b08164edc49d","year":2020},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.623551Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:c9677388664dc8c78cfb4fb20f20f1db586ee107cdbda6f6ed667ae10cbd9c96","observation_id":"37132035-8c8d-4448-8607-807a9361f0f1","resolution":{"observed_at":"2026-08-09T12:27:04.869100Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.855669Z","title":"LHP: Logical hyper- graph link prediction","venue":null,"work_id":"4ef46ebe-5eff-4af9-af25-799d76464ffc","year":2023},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.626811Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:987bdf7c4761a90d1b8508ec4408ba03092173b4e2c135896d396049fe807bb6","observation_id":"5a2f9ef1-c3dc-434d-b16d-7aa5b2fa3928","resolution":{"observed_at":"2026-08-09T12:27:04.859146Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.846165Z","title":null,"venue":null,"work_id":"b7ad7bff-ef22-4211-ac34-1d4e946d5629","year":2021},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.630293Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:e0dc403390889da43a46c8de273ec0eb7c1ed48938ce73e994094d5a54ba4eb9","observation_id":"bc75ac5e-46a5-49be-9c1d-d7acf06690e6","resolution":{"observed_at":"2026-08-09T12:27:04.849448Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.835107Z","title":"A hypergraph model of social tagging networks","venue":null,"work_id":"7b6121ed-c9af-45d4-8832-c60ebb6f1c46","year":2010},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.633355Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:0028b7b9a733980393edf9b42bc49301503146b5edef9b5c60857a971f78692f","observation_id":"8276ccf3-7f36-4623-80d3-6277568fe30f","resolution":{"observed_at":"2026-08-09T12:27:04.838810Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.823232Z","title":"Our argument is based on rate equations, generalizing an argument by Mitzen- macher [36] in the context of preferential attachment dyadic graphs","venue":null,"work_id":"5a437371-e138-4b95-8628-39e04336d2da","year":1927},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.636921Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:b07b0042adfc20475b7b973f356e9c1eabcc96656cfe6953435f14b0ffaad093","observation_id":"b8121771-127d-472f-91d2-104dda265ba3","resolution":{"observed_at":"2026-08-09T12:27:04.827254Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.812016Z","title":null,"venue":null,"work_id":"172386c6-3cb7-4fa1-a39a-9834b4093a4b","year":null},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.641169Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:9115bb929af39eb5ad60880d79fe107a37fc06b661673c9ca00662a82844c9e1","observation_id":"01871bf9-722f-4765-86c7-045d9402da6f","resolution":{"observed_at":"2026-08-09T12:27:04.815914Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.802164Z","title":"successful","venue":null,"work_id":"eda54a55-d445-4472-a5e3-dd472f61f8b4","year":null},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.644848Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:75c325da4e1358ecbfaec1041e5ef469f8ee7d07c785a5cd6919bb4f1318627c","observation_id":"9c404d1b-c819-42e5-a103-16f422611aaf","resolution":{"observed_at":"2026-08-09T12:27:04.805577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.791898Z","title":"So far, we have shown that, for anyk such that the first two terms of eq","venue":null,"work_id":"94c33c0e-d6d8-4965-87a2-e089bcb8865a","year":null},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.648767Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:bc617703e7905b0171769651e6f37b93fc35a68ad542c54cd75a9eefae140083","observation_id":"0bd16fda-06ca-40da-8eb3-77a0bb06c3cd","resolution":{"observed_at":"2026-08-09T12:27:04.795158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.780734Z","title":null,"venue":null,"work_id":"cb736f9d-07c1-4cd0-9d07-2f0812db0a66","year":null},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.652299Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:fa5c5e5b9d8627cc56ce071f00181aa08137d115f54bc2fa9412c177191928fb","observation_id":"18357046-c15b-409b-b180-f20d7f251dbd","resolution":{"observed_at":"2026-08-09T12:27:04.784397Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.770745Z","title":null,"venue":null,"work_id":"793599df-5770-4ec8-8b1c-55b53ea56aef","year":null},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.655690Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:3b1cbfcb27df0b5808666d0410768b4a2806cf202e092aac22af7528d9c01c14","observation_id":"b209f70d-d06d-40e0-85a1-e51d1b37571f","resolution":{"observed_at":"2026-08-09T12:27:04.774201Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.760020Z","title":null,"venue":null,"work_id":"aa150160-63bf-4704-b6ae-5b795c1a6683","year":null},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.658821Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:e992efa50f74e3ccc21935e7d8837542cc621dbf57dcd0d580119c7df508c1d7","observation_id":"ec44ec9b-0630-42e7-b86d-41e639e11ede","resolution":{"observed_at":"2026-08-09T12:27:04.763595Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.748747Z","title":"After forming e(t+1), we have an Erd˝ os-R´ enyi update H(t+1) = (N (t) ∪ e(t+1) , E (t) ∪ e(t+1))","venue":null,"work_id":"c5eedf54-d61a-4926-bd3d-22be4342ad89","year":null},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.661921Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:2e35c1c285a8828dd2d914f22029cac8feb6de7a5457302fa9bcd359f338f755","observation_id":"9e5fe5c1-89a2-4bf1-aa8d-133e9861632d","resolution":{"observed_at":"2026-08-09T12:27:04.752382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.737701Z","title":null,"venue":null,"work_id":"4d53d35c-d13f-40a7-b5f5-9c7b2ad0bf51","year":null},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.664582Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:80749b9d2a8460d3d36fafa23d72d264fa23070ab6928aa883a56535487ae4d1","observation_id":"4e44fd41-b12a-4680-bf2d-f7b749ba1410","resolution":{"observed_at":"2026-08-09T12:27:04.741305Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.726566Z","title":null,"venue":null,"work_id":"803c198f-cb05-48c6-9b47-2ee068e63eb5","year":null},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.668185Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:1a753c71d30ba8c280bbce78a6144cf0e870a032a5a00ec667591023304d25a9","observation_id":"4f2a4bbe-58b5-4fb7-883e-6e6816bcb1dd","resolution":{"observed_at":"2026-08-09T12:27:04.730316Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.715705Z","title":null,"venue":null,"work_id":"0f59b397-c051-4b75-8f63-372c484df228","year":null},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.671763Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:fdfb50b3c3a204faa5e791e138588374f7bfa961d302245a28dbeb229007c42b","observation_id":"ddaaf960-293e-40f3-be75-8219ec39253a","resolution":{"observed_at":"2026-08-09T12:27:04.719570Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-09T12:27:04.701962Z","title":"After forming e(t+1), we have a Preferential Attach- ment update H(t+1) = (N (t)∪ e(t+1) , E (t)∪e(t+1))","venue":null,"work_id":"eafdd4d0-571c-4313-8b3e-d242d14251f2","year":null},"citing_paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-09T12:27:04.674452Z"},"links":{"citing_paper":"/paper/2502.02386"},"observation_digest":"sha256:2487e1d6896435c1d79a94043ab8c8f044f62fded8e44b4ef8d9f41edda2af69","observation_id":"c6c54e96-588a-4c55-8f5a-67a615f3104c","resolution":{"observed_at":"2026-08-09T12:27:04.707708Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.02386","last_updated":"2025-08-18T19:04:56Z","latest_version":3,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-09T12:17:47.764628Z","submitted_at":"2025-02-04T15:04:01Z","title":"Edge Correlations and Link Prediction in Growing Hypergraphs"},"reference_resolution":{"displayed":63,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":0,"verified_fuzzy":49},"total_outbound_references":63},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 63 of 63 outbound references and 1 inbound Pith citation observation for arXiv:2502.02386."}