Pith. sign in

Paper Citation Record · LEDGER

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2506.01479 v2

Coverage vector

measured 28 of 28 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T11:47:50.917967Z

measured 31 of 31 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-04T07:03:44.791222Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-11T08:00:59.710103Z

Reference resolution

28 of 28 outbound references displayed

  • verified exact7
  • verified fuzzy13
  • unresolved3
  • parse uncertain0
  • malformed identifier4
  • metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 2cb2538e-287b-4c9a-9576-598911ed911e · outbound

This paper cites Higher-Order Dissimilar- ity Measures for Hypergraph Comparison.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Higher-Order Dissimilar- ity Measures for Hypergraph Comparison

Reference 1

Resolution
verified exact
doi, observed 2026-08-07T11:47:52.122948Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:02.434378Z digest=sha256:13fdbc036ce725a6e589f6edd8bbb75173ccc11bbe655a16bb360594d2f46113

Observation 53aaa876-da64-4723-8836-95c95daf85e6 · outbound

This paper cites Scalable Tensor Methods for Nonuniform Hypergraphs.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Scalable Tensor Methods for Nonuniform Hypergraphs

Reference 2

Resolution
verified exact
doi, observed 2026-08-07T11:47:51.860594Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:49.552871Z digest=sha256:99eba775681fdcf75c39a2f29a6687a5473b08986baac1172576e398eae476cb

Observation 64217eb6-0d79-4fb1-8bb0-01ddbc2569c6 · outbound

This paper cites Hypernetwork Sci- ence via High-Order Hypergraph Walks.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Hypernetwork Sci- ence via High-Order Hypergraph Walks

Reference 3

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:48:05.156959Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:49.642425Z digest=sha256:e7579d987617e6e83eea2a8da2e70ce2618921d60b0d8dce15fe410f56a5d500

Observation f2f05946-cff2-4ade-b1ed-d0eb0ef4f7cc · outbound

This paper cites An Information-Theoretic, All-Scales Approach to Comparing Networks.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs An Information-Theoretic, All-Scales Approach to Comparing Networks

Reference 4

Resolution
malformed identifier
raw_fallback, observed 2026-08-07T11:48:05.088776Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:49.691069Z digest=sha256:a36e7c89287e1abf4195da133867c5a06b5c2482b7b7b859fe1779c7cf1b3e82

Observation 56016352-b1f9-44e4-9670-e3c878c17d73 · outbound

This paper cites On the Spectrum of Hypergraphs.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs On the Spectrum of Hypergraphs

Reference 5

Resolution
verified exact
doi, observed 2026-08-07T11:47:51.798802Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:49.753733Z digest=sha256:f71cda865f42311f99de6acea7eb74bb55689c5fb7c45589196253cea149435c

Observation 976cd77b-88fb-4d38-9d23-b696e09e1993 · outbound

This paper cites Networks beyond Pairwise Interactions: Structure and Dy- namics.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Networks beyond Pairwise Interactions: Structure and Dy- namics

Reference 6

Resolution
verified exact
doi, observed 2026-08-07T11:47:51.660583Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:49.811406Z digest=sha256:b714d61350ec1a24b0cc44f13b31738d46dd9936e77781004d01ce20f653facb

Observation 77b86a4f-d794-404d-bce9-eff2f894f1e4 · outbound

This paper cites Network Sim- ilarity via Multiple Social Theories.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Network Sim- ilarity via Multiple Social Theories

Reference 7

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:48:05.009221Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:49.886584Z digest=sha256:3a6ac5369cafd495dd736b483e2f5d03ef92cac0e614b503c707994bea1cde46

Observation 72cb708b-a8e9-4ab9-934f-f785b1f6769a · outbound

This paper cites Random Walks and Com- munity Detection in Hypergraphs.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Random Walks and Com- munity Detection in Hypergraphs

Reference 8

Resolution
malformed identifier
no resolver link, observed 2026-08-07T11:47:50.012058Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T11:47:50.012058Z digest=sha256:f874eca4db91d57a3ece1a0d6215157b061bbbb6c100b819cc0ba5b4b7ae4f60

Observation bbfee5c9-0bae-4978-98ae-8e00c011b3df · outbound

This paper cites Random Walks on Hypergraphs.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Random Walks on Hypergraphs

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:48:04.938234Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:50.071685Z digest=sha256:6add9a9b1f0327322622b72e2ccceb280eba6c6b68576b4dbf8570bdc77a65ab

Observation ea0ca32c-db01-44b6-b870-e8646ab99d37 · outbound

This paper cites The Dual- Projection Approach for Two-Mode Net- works.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs The Dual- Projection Approach for Two-Mode Net- works

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:48:04.876909Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:50.104641Z digest=sha256:1546cc3c16fa0bb881d3b996784bdcb7f419677bd8e57517ca9741062869c259

Observation 4839308e-b763-4a68-8e14-2c01c30e5115 · outbound

This paper cites Phase Transitions and Stability of Dynamical Processes on Hypergraphs.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Phase Transitions and Stability of Dynamical Processes on Hypergraphs

Reference 11

Resolution
verified exact
doi, observed 2026-08-07T11:47:51.431931Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:50.175664Z digest=sha256:7f47d35a1d51c962645fa1aa28827f1ac41a90492e14c03141a0a4123563356f

Observation c6d22c72-5899-43e6-b6c4-7f7090569ea3 · outbound

This paper cites Higher-Order Correla- tions Reveal Complex Memory in Temporal Hypergraphs.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Higher-Order Correla- tions Reveal Complex Memory in Temporal Hypergraphs

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-07T11:47:50.238529Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T11:47:50.238529Z digest=sha256:def50d4839086319fa6ff44520cab6bdef0bbc2ecf63d51c198b050f8d59acf2

Observation 95abae2d-e736-4c32-9a3a-20709ea5fa76 · outbound

This paper cites Exploring Network Struc- ture, Dynamics, and Function using Net- workX.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Exploring Network Struc- ture, Dynamics, and Function using Net- workX

Reference 13

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:48:04.847985Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:50.297715Z digest=sha256:18cb21a956d6118c0d5efac325d208e01d6f020f9eb164ef55c6204eba47df19

Observation abe4c288-68f8-493f-b9cc-e30773049a75 · outbound

This paper cites Array program- ming with NumPy.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Array program- ming with NumPy

Reference 14

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:48:04.816555Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:50.328258Z digest=sha256:bccf9347a3e52ae1254171eb6edd15ccf7746066030452987a472609c585483d

Observation f1473d3c-3919-4b45-8d27-921c3b137107 · outbound

This paper cites Network Compari- son and the Within-Ensemble Graph Dis- tance.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Network Compari- son and the Within-Ensemble Graph Dis- tance

Reference 15

Resolution
verified exact
raw_fallback, observed 2026-08-07T11:48:04.446145Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:50.387057Z digest=sha256:c9147d707c5530511696bf17eef0b18dc1e2673b48521cf835125a1f82585c27

Observation e0ca5fc6-8902-4c80-a920-89d1f4ddb84b · outbound

This paper cites Matplotlib: A 2D graphics environment.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Matplotlib: A 2D graphics environment

Reference 16

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:48:04.787122Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:50.430783Z digest=sha256:c0644ed8b9378204c28fe85ce012f27b09d439ad82a6ade70201b712831efab2

Observation 28ae10cd-7635-4de1-9553-83297dafc3a8 · outbound

This paper cites Gram Mates, Sign Changes in Singular Values, and Isomorphism.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Gram Mates, Sign Changes in Singular Values, and Isomorphism

Reference 17

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:48:04.756729Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:50.478182Z digest=sha256:d816c0383da801fb3ea79afb9e1bbf25614a6f2971985d3de6b15d05ed24c76a

Observation ace45d35-bee7-4d9a-a9c7-bece479394af · outbound

This paper cites Two-Mode Networks Ex- hibiting Data Loss.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Two-Mode Networks Ex- hibiting Data Loss

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:48:04.732133Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:50.526054Z digest=sha256:dad71d109393cf75ecec5c507c59e2102ae6688b0094bc429fb4246a756fed0c

Observation 27fc2755-99fd-4e93-9c45-d334a020497f · outbound

This paper cites XGI: A Python package for higher-order interaction net- works.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs XGI: A Python package for higher-order interaction net- works

Reference 19

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:48:04.703284Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:50.573453Z digest=sha256:a280f05e5d618b7dc7805adf06796825de18ef6eb19980fdb76f9bc6b1da084e

Observation 91bea9f6-ee7e-4ae4-acb9-c82ae7699b8f · outbound

This paper cites TwinSearch GitHub Repository.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs TwinSearch GitHub Repository

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:48:04.671141Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:50.610245Z digest=sha256:1f4906979f3b343f4fd3825458c5ee805137a0091763f0ace5e2ffdd2e8397a8

Observation eeaac66a-c922-49b4-aa3d-15470e4c913d · outbound

This paper cites May 2018.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs May 2018

Reference 21

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:48:04.629851Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:50.646604Z digest=sha256:baafc2b5f94fc2f886af8d7a87a568cbc25affb86418e94a121c7952734a7d81

Observation f423db6a-79da-4abc-8c89-30a1a1240fc1 · outbound

This paper cites Explainable Hyperlink Prediction: A Hypergraph Edit Distance- Based Approach.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Explainable Hyperlink Prediction: A Hypergraph Edit Distance- Based Approach

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-07T11:47:50.695740Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T11:47:50.695740Z digest=sha256:2e157f7c930f2c9c105d301a9da8210ef307450b642288ee41740ec829e5569c

Observation 6729a86e-35f3-49f8-958e-3439b51325d6 · outbound

This paper cites Analyzing states beyond full synchronization on hypergraphs requires methods beyond projected networks.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Analyzing states beyond full synchronization on hypergraphs requires methods beyond projected networks

Reference 23

Resolution
verified exact
local_arxiv, observed 2026-08-07T11:48:03.973697Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:50.737374Z digest=sha256:d8125290109fe3ab19e9467dc504d7621445be002b9d1564a4435a5d88c677f7

Observation 037e2a34-a4ea-4693-9aca-11a073a86506 · outbound

This paper cites Distances in Higher-Order Networks and the Metric Structure of Hypergraphs.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Distances in Higher-Order Networks and the Metric Structure of Hypergraphs

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-07T11:48:04.598451Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:50.768869Z digest=sha256:d9eaa9c79404493f3e75c88da2f16a71e2ce4eefe9b1c00fad104dc097ab4be5

Observation 1fdca5e5-847f-4114-bb6b-1039fe8692ac · outbound

This paper cites SciPy 1.0: Funda- mental Algorithms for Scientific Computing in Python.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs SciPy 1.0: Funda- mental Algorithms for Scientific Computing in Python

Reference 25

Resolution
malformed identifier
doi_truncated, observed 2026-08-07T11:47:51.215906Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:50.848240Z digest=sha256:d3253b1c9555170a47c01805a37eb086693561f6ce78fc5d38b7dfbef41f6de3

Observation a341c22c-b035-409b-a763-f4dfc2596c68 · outbound

This paper cites From Graphs to Hypergraphs: Hypergraph Projection and its Remediation.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs From Graphs to Hypergraphs: Hypergraph Projection and its Remediation

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-07T11:47:50.880272Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T11:47:50.880272Z digest=sha256:5dddb3d27fee4992121fab342ec346104a229b04be9da91ee378a4f8dbca5e26

Observation 9f4add13-1803-4c6a-9fed-da550cc98aff · outbound

This paper cites Hypergraph Reconstruc- tion from Network Data.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Hypergraph Reconstruc- tion from Network Data

Reference 27

Resolution
malformed identifier
doi_truncated, observed 2026-08-07T11:47:51.044737Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:50.917967Z digest=sha256:1ae1abe62f4d641f84aeec60dbafd988336edfa1f50108bbec53578b28bb39c0

Observation 14f0d52a-e484-4467-9c5c-a26dd9da21dc · outbound

This paper cites an unresolved cited work.

Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs Unresolved cited work

Reference 1440

Resolution
metadata mismatch
raw_fallback, observed 2026-08-07T11:48:04.549261Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-08-07T11:47:49.941100Z digest=sha256:b00e0231df577aaa35a29eb159e19b9c96f73c6ad8e2abd8f0e8d819d5257e7e

Pith citing papers

Observation 5d898aec-4a3c-4e7f-8009-89e36f3f08ca · inbound

Information theory for hypergraph similarity cites this paper.

Information theory for hypergraph similarity Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs

Reference 57

Resolution
unresolved
no resolver link, observed 2026-08-04T07:03:44.791222Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T07:03:44.791222Z digest=sha256:899524869fc99b97fc396df5cb4e413efa6eb1ba5cbbf7ffcedccca9c7c2760e

Observation 2e32d145-c5cd-4311-9e41-29979b60293c · inbound

Planted clique detection and recovery from the hypergraph adjacency matrix cites this paper.

Planted clique detection and recovery from the hypergraph adjacency matrix Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs

Reference 24

Resolution
verified exact
arxiv_id, observed 2026-05-11T08:00:59.712725Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

source=pdf_text observed=2026-05-10T16:51:29.047099Z digest=sha256:350529ab37b816aa04407284d81fa8d45e6f14b924e55ce615cbb1e8ca5a074b

Observation 2ecaf426-8331-4064-b2e1-292cafe78a8b · inbound

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems cites this paper.

The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs

Reference 22

Resolution
unresolved
no resolver link, observed 2026-07-12T01:14:12.466888Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-12T01:14:12.466888Z digest=sha256:b2fd1a82f7e819708aa80e46135550977a8f9d9cfbc16d9bbd59564d1f83dd4c