{"as_of":"2026-08-08T07:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aab638b18da05c90ea689812bc0be2145dad4596c34d1fdf2d7f726f98114d9a","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:47:50.917967Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T07:03:44.791222Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-11T08:00:59.710103Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.01479","snapshot_observed_at":"2026-08-04T07:03:44.791222Z","title":"LaRock and R","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.27411","last_updated":"2026-06-11T15:02:10Z","snapshot_observed_at":"2026-08-04T07:03:37.783281Z","submitted_at":"2025-10-31T12:00:27Z","title":"Information theory for hypergraph similarity","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-04T07:03:44.791222Z"},"links":{"cited_paper":"/paper/2506.01479","citing_paper":"/paper/2510.27411"},"observation_digest":"sha256:899524869fc99b97fc396df5cb4e413efa6eb1ba5cbbf7ffcedccca9c7c2760e","observation_id":"5d898aec-4a3c-4e7f-8009-89e36f3f08ca","resolution":{"observed_at":"2026-08-04T07:03:44.791222Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"cited_work":{"arxiv_id":"2506.01479","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.01479","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"LaRock and R","venue":null,"work_id":"61bc6b18-f90b-4b3f-9e26-6a84f471d266","year":2025},"citing_paper":{"arxiv_id":"2604.08691","last_updated":"2026-04-17T13:44:55Z","snapshot_observed_at":"2026-07-06T22:57:45.084987Z","submitted_at":"2026-04-09T18:22:52Z","title":"Planted clique detection and recovery from the hypergraph adjacency matrix","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-10T16:51:29.047099Z"},"links":{"cited_paper":"/paper/2506.01479","citing_paper":"/paper/2604.08691"},"observation_digest":"sha256:3f77e311c375dd6e1c17b05fb66fa9c61a98fa5e5f3df37a003959d0789b4fd2","observation_id":"2e32d145-c5cd-4311-9e41-29979b60293c","resolution":{"observed_at":"2026-05-11T08:00:59.712725Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.01479","snapshot_observed_at":"2026-07-12T01:14:12.466888Z","title":"Exploring the non-uniqueness of node co-occurrence matrices of hypergraphs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03608","last_updated":"2026-07-03T21:41:30Z","snapshot_observed_at":"2026-08-06T18:34:05.165725Z","submitted_at":"2026-07-03T21:41:30Z","title":"The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-12T01:14:12.466888Z"},"links":{"cited_paper":"/paper/2506.01479","citing_paper":"/paper/2607.03608"},"observation_digest":"sha256:b2fd1a82f7e819708aa80e46135550977a8f9d9cfbc16d9bbd59564d1f83dd4c","observation_id":"2ecaf426-8331-4064-b2e1-292cafe78a8b","resolution":{"observed_at":"2026-07-12T01:14:12.466888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.01479/citation-record","integrity":"/paper/2506.01479/integrity","json":"/paper/2506.01479/citation-record.json","paper":"/paper/2506.01479"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48550/arxiv.2503.16959","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:47:52.062984Z","title":"Higher-Order Dissimilar- ity Measures for Hypergraph Comparison","venue":null,"work_id":"65628828-74dd-4635-b8af-17509a53ce81","year":2025},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:02.434378Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:d0b7708b8ad8a6facb1758f66bc1eb125523e0630cb9fa3954737a8103df2ce8","observation_id":"2cb2538e-287b-4c9a-9576-598911ed911e","resolution":{"observed_at":"2026-08-07T11:47:52.122948Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/23m1584472","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:47:51.830951Z","title":"Scalable Tensor Methods for Nonuniform Hypergraphs","venue":null,"work_id":"2893537c-d68d-4297-b54e-3e3ff0170e9d","year":2024},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:49.552871Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:df6e564fce80249d8dc490eef83a91401cf2ffd11d0dce0ba0396a56c6a4be5c","observation_id":"53aaa876-da64-4723-8836-95c95daf85e6","resolution":{"observed_at":"2026-08-07T11:47:51.860594Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:48:05.129612Z","title":"Hypernetwork Sci- ence via High-Order Hypergraph Walks","venue":null,"work_id":"5c60dc6a-9f83-4d55-9fc9-a0c32d288a73","year":2020},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:49.642425Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:75e889fa66e33e89b8fe68dcea090b0394a25517d9ad02d723af95ac8c645014","observation_id":"64217eb6-0d79-4fb1-8bb0-01ddbc2569c6","resolution":{"observed_at":"2026-08-07T11:48:05.156959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:48:05.051728Z","title":"An Information-Theoretic, All-Scales Approach to Comparing Networks","venue":null,"work_id":"cd90ef4c-dec4-48d9-bd2f-06e77d3116fa","year":2019},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:49.691069Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:ce1be9d52a4b47f2c5f14fb2c33691d7221cc14fef788d3dba3a5f3a1e024362","observation_id":"f2f05946-cff2-4ade-b1ed-d0eb0ef4f7cc","resolution":{"observed_at":"2026-08-07T11:48:05.088776Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.laa.2020.01","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:47:51.775021Z","title":"On the Spectrum of Hypergraphs","venue":null,"work_id":"919f2cfc-ce8d-4338-96a2-f9038d371c43","year":2021},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:49.753733Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:b7a5feea8195094e82b57e5421ca06dc6c6553f495b3a2b420f172c397a1282d","observation_id":"56016352-b1f9-44e4-9670-e3c878c17d73","resolution":{"observed_at":"2026-08-07T11:47:51.798802Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.physrep.2020.05","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:47:51.570760Z","title":"Networks beyond Pairwise Interactions: Structure and Dy- namics","venue":null,"work_id":"c625f71c-2bce-46a5-94dc-446efb054324","year":2020},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:49.811406Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:7b4a14f3662840d4620c10111411b7c7fc10ff1b6122e7c4f6c052854023bf1f","observation_id":"976cd77b-88fb-4d38-9d23-b696e09e1993","resolution":{"observed_at":"2026-08-07T11:47:51.660583Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:48:04.980165Z","title":"Network Sim- ilarity via Multiple Social Theories","venue":null,"work_id":"3460d5a0-38a4-4828-bee3-0af5f57e803a","year":2013},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:49.886584Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:c636b9e81cc32528969e605a2038c4edd22424647836fba5c538d0c29385407a","observation_id":"77b86a4f-d794-404d-bce9-eff2f894f1e4","resolution":{"observed_at":"2026-08-07T11:48:05.009221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:47:50.012058Z","title":"Random Walks and Com- munity Detection in Hypergraphs","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.012058Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:f874eca4db91d57a3ece1a0d6215157b061bbbb6c100b819cc0ba5b4b7ae4f60","observation_id":"72cb708b-a8e9-4ab9-934f-f785b1f6769a","resolution":{"observed_at":"2026-08-07T11:47:50.012058Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:48:04.910265Z","title":"Random Walks on Hypergraphs","venue":null,"work_id":"35e44797-a1e1-4e0d-ac59-43174a5c3399","year":2020},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.071685Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:1c544f941c4d71dc35f8bfb0919363b46bcf943c35d2988675955b83721792ef","observation_id":"bbfee5c9-0bae-4978-98ae-8e00c011b3df","resolution":{"observed_at":"2026-08-07T11:48:04.938234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:48:04.868435Z","title":"The Dual- Projection Approach for Two-Mode Net- works","venue":null,"work_id":"d9c1a8e9-841a-486b-b0fd-0044d99e8df3","year":2013},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.104641Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:b0f1e3789fdcb1ce1d40799e4cf4126121974314ac6b28025f3d561569ffd8a2","observation_id":"ea0ca32c-db01-44b6-b870-e8646ab99d37","resolution":{"observed_at":"2026-08-07T11:48:04.876909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s42005-021-00525-3","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:47:51.341936Z","title":"Phase Transitions and Stability of Dynamical Processes on Hypergraphs","venue":null,"work_id":"3f9f1b9a-0c6b-4c91-b65b-19a7701e1180","year":2021},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.175664Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:6a1e3cfb9a071a3d1c590dcd5fdcd15422d09f2f2e3260a6e4647fa35a937b49","observation_id":"4839308e-b763-4a68-8e14-2c01c30e5115","resolution":{"observed_at":"2026-08-07T11:47:51.431931Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:47:50.238529Z","title":"Higher-Order Correla- tions Reveal Complex Memory in Temporal Hypergraphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.238529Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:def50d4839086319fa6ff44520cab6bdef0bbc2ecf63d51c198b050f8d59acf2","observation_id":"c6d22c72-5899-43e6-b6c4-7f7090569ea3","resolution":{"observed_at":"2026-08-07T11:47:50.238529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:48:04.837864Z","title":"Exploring Network Struc- ture, Dynamics, and Function using Net- workX","venue":null,"work_id":"e55bea10-452f-4da6-a8b4-d6ccd7288a19","year":2008},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.297715Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:3dd68cc205e29295b1c0c15a281a950d78619040e1b660e2726cd67d74a361f6","observation_id":"95abae2d-e736-4c32-9a3a-20709ea5fa76","resolution":{"observed_at":"2026-08-07T11:48:04.847985Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:48:04.804989Z","title":"Array program- ming with NumPy","venue":null,"work_id":"18ba66ff-1014-48d6-a637-15ab4eb43e32","year":2020},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.328258Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:57facd2bf974c7877a9abf50af169ca12a6bf8d34e07b27078f2e8fad3e65325","observation_id":"abe4c288-68f8-493f-b9cc-e30773049a75","resolution":{"observed_at":"2026-08-07T11:48:04.816555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2019.0744","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:48:04.428485Z","title":"Network Compari- son and the Within-Ensemble Graph Dis- tance","venue":null,"work_id":"76b302db-e7ee-454d-b73d-babee3bcb014","year":2020},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.387057Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:999066b562c2943aeda93c639a4dd8111c393bcc917cd8c1c2282326c13fcd96","observation_id":"f1473d3c-3919-4b45-8d27-921c3b137107","resolution":{"observed_at":"2026-08-07T11:48:04.446145Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:48:04.777224Z","title":"Matplotlib: A 2D graphics environment","venue":null,"work_id":"d69746d6-5d67-4561-bf62-352a84b81518","year":2007},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.430783Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:adbab71b2cb598c81027d0070c0b7c82ec68ffb0ad0c6f423472c7a661f43c54","observation_id":"e0ca5fc6-8902-4c80-a920-89d1f4ddb84b","resolution":{"observed_at":"2026-08-07T11:48:04.787122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:48:04.745324Z","title":"Gram Mates, Sign Changes in Singular Values, and Isomorphism","venue":null,"work_id":"5753b5ee-b325-4f0a-99ea-aeacc3f14f99","year":2023},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.478182Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:e9002805ad010e9bbbf7ecfe54f41cc61bc4154efb7bde49939baa190de78bfb","observation_id":"28ae10cd-7635-4de1-9553-83297dafc3a8","resolution":{"observed_at":"2026-08-07T11:48:04.756729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:48:04.720153Z","title":"Two-Mode Networks Ex- hibiting Data Loss","venue":null,"work_id":"ae2e63af-ead3-4386-b2d7-f88c40aaee38","year":2018},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.526054Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:b1f6b814dd084597e45cc7175d5e2fcafcbeaf293a2fd793b1722aa6404b31db","observation_id":"ace45d35-bee7-4d9a-a9c7-bece479394af","resolution":{"observed_at":"2026-08-07T11:48:04.732133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:48:04.693439Z","title":"XGI: A Python package for higher-order interaction net- works","venue":null,"work_id":"0b5ef6c8-0019-42d8-b347-196af821bab5","year":2023},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.573453Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:6b302e74425462d10b9b7f6b5f2f36a612fd91317b9befde185037db246060bd","observation_id":"27fc2755-99fd-4e93-9c45-d334a020497f","resolution":{"observed_at":"2026-08-07T11:48:04.703284Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:48:04.655825Z","title":"TwinSearch GitHub Repository","venue":null,"work_id":"5eaeb920-5296-4608-927d-436667dc9d74","year":2025},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.610245Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:247257a160638409f11bc3e03b716decc6d4e3023a0b9ed225e26f2232c2128c","observation_id":"91bea9f6-ee7e-4ae4-acb9-c82ae7699b8f","resolution":{"observed_at":"2026-08-07T11:48:04.671141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:48:04.623289Z","title":"May 2018","venue":null,"work_id":"243574ce-1269-4f9f-a580-64f1cc704f69","year":2018},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.646604Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:ed95a1b9392ccb61cae98e4159ef8d591ba10e7cccb19f960b1048e76ce2c2ca","observation_id":"eeaac66a-c922-49b4-aa3d-15470e4c913d","resolution":{"observed_at":"2026-08-07T11:48:04.629851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:47:50.695740Z","title":"Explainable Hyperlink Prediction: A Hypergraph Edit Distance- Based Approach","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.695740Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:2e157f7c930f2c9c105d301a9da8210ef307450b642288ee41740ec829e5569c","observation_id":"f423db6a-79da-4abc-8c89-30a1a1240fc1","resolution":{"observed_at":"2026-08-07T11:47:50.695740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.13712","last_updated":"2021-07-29T02:32:43Z","snapshot_observed_at":"2026-07-06T11:33:33.002637Z","submitted_at":"2021-07-29T02:32:43Z","title":"Analyzing states beyond full synchronization on hypergraphs requires methods beyond projected networks","version":1},"cited_work":{"arxiv_id":"2107.13712","doi":null,"metadata_source":"pith","pith_arxiv_id":"2107.13712","snapshot_observed_at":"2026-08-07T11:47:52.223179Z","title":"Analyzing states beyond full synchronization on hypergraphs requires methods beyond projected networks","venue":"nlin.AO","work_id":"f8585b08-e839-4d5c-b218-8011ebffe855","year":2021},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.737374Z"},"links":{"cited_paper":"/paper/2107.13712","citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:ea3aaa984b15e39ba0a7fb1139c9a0de0e806b04073289940a45cd1c64bc80dd","observation_id":"6729a86e-35f3-49f8-958e-3439b51325d6","resolution":{"observed_at":"2026-08-07T11:48:03.973697Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+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-07T11:48:04.579526Z","title":"Distances in Higher-Order Networks and the Metric Structure of Hypergraphs","venue":null,"work_id":"4cfa4fcb-dece-4576-9aa4-4a5f58e4f668","year":2023},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.768869Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:97f9e44f706b42d23718a43ea1f3095d6c5f467874da5e19162f42cc6ccdcd48","observation_id":"037e2a34-a4ea-4693-9aca-11a073a86506","resolution":{"observed_at":"2026-08-07T11:48:04.598451Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41592-019-0686-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:47:51.139448Z","title":"SciPy 1.0: Funda- mental Algorithms for Scientific Computing in Python","venue":null,"work_id":"250203b5-6516-4df7-ae20-0e456c96e1c5","year":2020},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.848240Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:496ab02703b5dfd481b9a60382ebd0e82979d3baf4edd68061654597829ac16a","observation_id":"1fdca5e5-847f-4114-bb6b-1039fe8692ac","resolution":{"observed_at":"2026-08-07T11:47:51.215906Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.08519","last_updated":"2024-01-16T17:31:54Z","snapshot_observed_at":"2026-08-05T09:30:46.681048Z","submitted_at":"2024-01-16T17:31:54Z","title":"From Graphs to Hypergraphs: Hypergraph Projection and its Remediation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.08519","snapshot_observed_at":"2026-08-07T11:47:50.880272Z","title":"From Graphs to Hypergraphs: Hypergraph Projec- tion and Its Remediation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.880272Z"},"links":{"cited_paper":"/paper/2401.08519","citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:5dddb3d27fee4992121fab342ec346104a229b04be9da91ee378a4f8dbca5e26","observation_id":"a341c22c-b035-409b-a763-f4dfc2596c68","resolution":{"observed_at":"2026-08-07T11:47:50.880272Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s42005-021-00637-","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:47:50.989370Z","title":"Hypergraph Reconstruc- tion from Network Data","venue":null,"work_id":"49f2ceaa-2d3f-4166-b1a2-a9e54ede11f8","year":2021},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:50.917967Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:2d35b2a1a3085a142a7620cabe624cff51bdcc513a09a5752c78c1051edcac9a","observation_id":"9f4add13-1803-4c6a-9fed-da550cc98aff","resolution":{"observed_at":"2026-08-07T11:47:51.044737Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2517.24925","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T11:48:04.534612Z","title":null,"venue":null,"work_id":"f9f9c601-8997-4898-ab56-7ef74771fa30","year":null},"citing_paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","version":2},"reference_index":1440,"source":"pdf_text","source_observed_at":"2026-08-07T11:47:49.941100Z"},"links":{"citing_paper":"/paper/2506.01479"},"observation_digest":"sha256:352393babc77f63d4db261769e4a93e6ccd573197c7875dfe66f186d4c58009c","observation_id":"14f0d52a-e484-4467-9c5c-a26dd9da21dc","resolution":{"observed_at":"2026-08-07T11:48:04.549261Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.01479","last_updated":"2025-06-20T13:30:47Z","latest_version":2,"primary_category":"cs.SI","snapshot_observed_at":"2026-08-07T11:37:52.351538Z","submitted_at":"2025-06-02T09:37:43Z","title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":4,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":3,"verified_exact":7,"verified_fuzzy":13},"total_outbound_references":28},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 3 inbound Pith citation observations for arXiv:2506.01479."}