{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7Q2B6YBHLF2TDRHOXH3GAV5NTX","short_pith_number":"pith:7Q2B6YBH","schema_version":"1.0","canonical_sha256":"fc341f6027597531c4eeb9f66057ad9df96b27d5d0ff6b1ad3ff5710b96b554f","source":{"kind":"arxiv","id":"1909.00472","version":3},"attestation_state":"computed","paper":{"title":"Latent Space Modelling of Hypergraph Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Christopher Nemeth, Edoardo Airoldi, Kathryn Turnbull, Sim\\'on Lunag\\'omez","submitted_at":"2019-09-01T20:53:07Z","abstract_excerpt":"The increasing prevalence of relational data describing interactions among a target population has motivated a wide literature on statistical network analysis. In many applications, interactions may involve more than two members of the population and this data is more appropriately represented by a hypergraph. In this paper, we present a model for hypergraph data which extends the well established latent space approach for graphs and, by drawing a connection to constructs from computational topology, we develop a model whose likelihood is inexpensive to compute. A delayed-acceptance MCMC schem"},"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":"1909.00472","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2019-09-01T20:53:07Z","cross_cats_sorted":[],"title_canon_sha256":"0c5e28b0c7251da17ad3749d42e458dde3c91144fc388728b68533810af172e2","abstract_canon_sha256":"134b481fb66fef99de964d234a20352642111867a39aa77c2afe4a10e8d6e012"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:28:08.947835Z","signature_b64":"2/xs4F3Fft9t8YI/BFjWpmka+8qK2KhyPnEC66VL0jruu+hd4OVLj/HbyZhzHNXUvcne1B4BmHvLQuUoqMU/Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc341f6027597531c4eeb9f66057ad9df96b27d5d0ff6b1ad3ff5710b96b554f","last_reissued_at":"2026-07-05T03:28:08.947363Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:28:08.947363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Latent Space Modelling of Hypergraph Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Christopher Nemeth, Edoardo Airoldi, Kathryn Turnbull, Sim\\'on Lunag\\'omez","submitted_at":"2019-09-01T20:53:07Z","abstract_excerpt":"The increasing prevalence of relational data describing interactions among a target population has motivated a wide literature on statistical network analysis. In many applications, interactions may involve more than two members of the population and this data is more appropriately represented by a hypergraph. In this paper, we present a model for hypergraph data which extends the well established latent space approach for graphs and, by drawing a connection to constructs from computational topology, we develop a model whose likelihood is inexpensive to compute. A delayed-acceptance MCMC schem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00472","kind":"arxiv","version":3},"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/1909.00472/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":"1909.00472","created_at":"2026-07-05T03:28:08.947432+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.00472v3","created_at":"2026-07-05T03:28:08.947432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00472","created_at":"2026-07-05T03:28:08.947432+00:00"},{"alias_kind":"pith_short_12","alias_value":"7Q2B6YBHLF2T","created_at":"2026-07-05T03:28:08.947432+00:00"},{"alias_kind":"pith_short_16","alias_value":"7Q2B6YBHLF2TDRHO","created_at":"2026-07-05T03:28:08.947432+00:00"},{"alias_kind":"pith_short_8","alias_value":"7Q2B6YBH","created_at":"2026-07-05T03:28:08.947432+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.04251","citing_title":"Modeling Hypergraphs with Diversity and Heterogeneous Popularity","ref_index":53,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7Q2B6YBHLF2TDRHOXH3GAV5NTX","json":"https://pith.science/pith/7Q2B6YBHLF2TDRHOXH3GAV5NTX.json","graph_json":"https://pith.science/api/pith-number/7Q2B6YBHLF2TDRHOXH3GAV5NTX/graph.json","events_json":"https://pith.science/api/pith-number/7Q2B6YBHLF2TDRHOXH3GAV5NTX/events.json","paper":"https://pith.science/paper/7Q2B6YBH"},"agent_actions":{"view_html":"https://pith.science/pith/7Q2B6YBHLF2TDRHOXH3GAV5NTX","download_json":"https://pith.science/pith/7Q2B6YBHLF2TDRHOXH3GAV5NTX.json","view_paper":"https://pith.science/paper/7Q2B6YBH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.00472&json=true","fetch_graph":"https://pith.science/api/pith-number/7Q2B6YBHLF2TDRHOXH3GAV5NTX/graph.json","fetch_events":"https://pith.science/api/pith-number/7Q2B6YBHLF2TDRHOXH3GAV5NTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7Q2B6YBHLF2TDRHOXH3GAV5NTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7Q2B6YBHLF2TDRHOXH3GAV5NTX/action/storage_attestation","attest_author":"https://pith.science/pith/7Q2B6YBHLF2TDRHOXH3GAV5NTX/action/author_attestation","sign_citation":"https://pith.science/pith/7Q2B6YBHLF2TDRHOXH3GAV5NTX/action/citation_signature","submit_replication":"https://pith.science/pith/7Q2B6YBHLF2TDRHOXH3GAV5NTX/action/replication_record"}},"created_at":"2026-07-05T03:28:08.947432+00:00","updated_at":"2026-07-05T03:28:08.947432+00:00"}