{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:UQMIML6P6UK2YEZSWPOXJVNRGR","short_pith_number":"pith:UQMIML6P","schema_version":"1.0","canonical_sha256":"a418862fcff515ac1332b3dd74d5b13451764e7db399c020ed6042cb1d1c24c1","source":{"kind":"arxiv","id":"2107.13712","version":1},"attestation_state":"computed","paper":{"title":"Analyzing states beyond full synchronization on hypergraphs requires methods beyond projected networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","nlin.CD"],"primary_cat":"nlin.AO","authors_text":"Anastasiya Salova, Raissa M. D'Souza","submitted_at":"2021-07-29T02:32:43Z","abstract_excerpt":"A common approach for analyzing hypergraphs is to consider the projected adjacency or Laplacian matrices for each order of interactions (e.g., dyadic, triadic, etc.). However, this method can lose information about the hypergraph structure and is not universally applicable for studying dynamical processes on hypergraphs, which we demonstrate through the framework of cluster synchronization. Specifically, we show that the projected network does not always correspond to a unique hypergraph structure. This means the projection does not always properly predict the true dynamics unfolding on the hy"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2107.13712","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"nlin.AO","submitted_at":"2021-07-29T02:32:43Z","cross_cats_sorted":["cond-mat.dis-nn","nlin.CD"],"title_canon_sha256":"f93f10e973b930eea15fe1efd5c32336d53b9ea9d148c99b06f0538093e29dcb","abstract_canon_sha256":"d76724370b02c36d7f1d80c50e484bb13a8c654072b462d1adbe32aae5ffb732"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:01:39.571018Z","signature_b64":"tNRgLzaNroHDgA1OF/G8oYfUfe8pXWFyxbwg1qXEnMQfK86LpJR0qjb4GocVnEN8oiu6iutsxTHH6oIuQNWKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a418862fcff515ac1332b3dd74d5b13451764e7db399c020ed6042cb1d1c24c1","last_reissued_at":"2026-07-05T03:01:39.570513Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:01:39.570513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analyzing states beyond full synchronization on hypergraphs requires methods beyond projected networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.dis-nn","nlin.CD"],"primary_cat":"nlin.AO","authors_text":"Anastasiya Salova, Raissa M. D'Souza","submitted_at":"2021-07-29T02:32:43Z","abstract_excerpt":"A common approach for analyzing hypergraphs is to consider the projected adjacency or Laplacian matrices for each order of interactions (e.g., dyadic, triadic, etc.). However, this method can lose information about the hypergraph structure and is not universally applicable for studying dynamical processes on hypergraphs, which we demonstrate through the framework of cluster synchronization. Specifically, we show that the projected network does not always correspond to a unique hypergraph structure. This means the projection does not always properly predict the true dynamics unfolding on the hy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.13712","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.13712/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2107.13712","created_at":"2026-07-05T03:01:39.570574+00:00"},{"alias_kind":"arxiv_version","alias_value":"2107.13712v1","created_at":"2026-07-05T03:01:39.570574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.13712","created_at":"2026-07-05T03:01:39.570574+00:00"},{"alias_kind":"pith_short_12","alias_value":"UQMIML6P6UK2","created_at":"2026-07-05T03:01:39.570574+00:00"},{"alias_kind":"pith_short_16","alias_value":"UQMIML6P6UK2YEZS","created_at":"2026-07-05T03:01:39.570574+00:00"},{"alias_kind":"pith_short_8","alias_value":"UQMIML6P","created_at":"2026-07-05T03:01:39.570574+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.01479","citing_title":"Exploring the Non-uniqueness of Node Co-occurrence Matrices of Hypergraphs","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UQMIML6P6UK2YEZSWPOXJVNRGR","json":"https://pith.science/pith/UQMIML6P6UK2YEZSWPOXJVNRGR.json","graph_json":"https://pith.science/api/pith-number/UQMIML6P6UK2YEZSWPOXJVNRGR/graph.json","events_json":"https://pith.science/api/pith-number/UQMIML6P6UK2YEZSWPOXJVNRGR/events.json","paper":"https://pith.science/paper/UQMIML6P"},"agent_actions":{"view_html":"https://pith.science/pith/UQMIML6P6UK2YEZSWPOXJVNRGR","download_json":"https://pith.science/pith/UQMIML6P6UK2YEZSWPOXJVNRGR.json","view_paper":"https://pith.science/paper/UQMIML6P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2107.13712&json=true","fetch_graph":"https://pith.science/api/pith-number/UQMIML6P6UK2YEZSWPOXJVNRGR/graph.json","fetch_events":"https://pith.science/api/pith-number/UQMIML6P6UK2YEZSWPOXJVNRGR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UQMIML6P6UK2YEZSWPOXJVNRGR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UQMIML6P6UK2YEZSWPOXJVNRGR/action/storage_attestation","attest_author":"https://pith.science/pith/UQMIML6P6UK2YEZSWPOXJVNRGR/action/author_attestation","sign_citation":"https://pith.science/pith/UQMIML6P6UK2YEZSWPOXJVNRGR/action/citation_signature","submit_replication":"https://pith.science/pith/UQMIML6P6UK2YEZSWPOXJVNRGR/action/replication_record"}},"created_at":"2026-07-05T03:01:39.570574+00:00","updated_at":"2026-07-05T03:01:39.570574+00:00"}