{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3IB763PYKRT3Z7JLO3QLPJ7QUW","short_pith_number":"pith:3IB763PY","schema_version":"1.0","canonical_sha256":"da03ff6df85467bcfd2b76e0b7a7f0a5ae71272bc143625fcb26fc49286df312","source":{"kind":"arxiv","id":"2309.06351","version":1},"attestation_state":"computed","paper":{"title":"Chemically inspired Erd\\H{o}s-R\\'enyi oriented hypergraphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Angel Garcia-Chung, Guillermo Restrepo, J\\\"urgen Jost, Marisol Berm\\'udez-Monta\\~na, Peter F. Stadler","submitted_at":"2023-09-12T16:16:25Z","abstract_excerpt":"High-order structures have been recognised as suitable models for systems going beyond the binary relationships for which graph models are appropriate. Despite their importance and surge in research on these structures, their random cases have been only recently become subjects of interest. One of these high-order structures is the oriented hypergraph, which relates couples of subsets of an arbitrary number of vertices. Here we develop the Erd\\H{o}s-R\\'enyi model for oriented hypergraphs, which corresponds to the random realisation of oriented hyperedges of the complete oriented hypergraph. A "},"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":"2309.06351","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DM","submitted_at":"2023-09-12T16:16:25Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"498aa5e33401c86a5ceb56f837d6672ac1f4b000710605a4206388e67ca85927","abstract_canon_sha256":"1276d8c89e1984b19f0520128eda5bfa08b3e164347b1bed3d6ff5f859cb7212"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:54:35.515409Z","signature_b64":"0LBE0H/orroY8KO1EMMphj1v1lR96QNogaHw5EkWvRuZ0QNMbW58qBTQpxcEi3as839fL+GQnhHc9k5A8+vOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da03ff6df85467bcfd2b76e0b7a7f0a5ae71272bc143625fcb26fc49286df312","last_reissued_at":"2026-07-05T08:54:35.514975Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:54:35.514975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chemically inspired Erd\\H{o}s-R\\'enyi oriented hypergraphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Angel Garcia-Chung, Guillermo Restrepo, J\\\"urgen Jost, Marisol Berm\\'udez-Monta\\~na, Peter F. Stadler","submitted_at":"2023-09-12T16:16:25Z","abstract_excerpt":"High-order structures have been recognised as suitable models for systems going beyond the binary relationships for which graph models are appropriate. Despite their importance and surge in research on these structures, their random cases have been only recently become subjects of interest. One of these high-order structures is the oriented hypergraph, which relates couples of subsets of an arbitrary number of vertices. Here we develop the Erd\\H{o}s-R\\'enyi model for oriented hypergraphs, which corresponds to the random realisation of oriented hyperedges of the complete oriented hypergraph. A "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.06351","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/2309.06351/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":"2309.06351","created_at":"2026-07-05T08:54:35.515036+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.06351v1","created_at":"2026-07-05T08:54:35.515036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.06351","created_at":"2026-07-05T08:54:35.515036+00:00"},{"alias_kind":"pith_short_12","alias_value":"3IB763PYKRT3","created_at":"2026-07-05T08:54:35.515036+00:00"},{"alias_kind":"pith_short_16","alias_value":"3IB763PYKRT3Z7JL","created_at":"2026-07-05T08:54:35.515036+00:00"},{"alias_kind":"pith_short_8","alias_value":"3IB763PY","created_at":"2026-07-05T08:54:35.515036+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.09570","citing_title":"Enhancing the Utility of Higher-Order Information in Relational Learning","ref_index":2024,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3IB763PYKRT3Z7JLO3QLPJ7QUW","json":"https://pith.science/pith/3IB763PYKRT3Z7JLO3QLPJ7QUW.json","graph_json":"https://pith.science/api/pith-number/3IB763PYKRT3Z7JLO3QLPJ7QUW/graph.json","events_json":"https://pith.science/api/pith-number/3IB763PYKRT3Z7JLO3QLPJ7QUW/events.json","paper":"https://pith.science/paper/3IB763PY"},"agent_actions":{"view_html":"https://pith.science/pith/3IB763PYKRT3Z7JLO3QLPJ7QUW","download_json":"https://pith.science/pith/3IB763PYKRT3Z7JLO3QLPJ7QUW.json","view_paper":"https://pith.science/paper/3IB763PY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.06351&json=true","fetch_graph":"https://pith.science/api/pith-number/3IB763PYKRT3Z7JLO3QLPJ7QUW/graph.json","fetch_events":"https://pith.science/api/pith-number/3IB763PYKRT3Z7JLO3QLPJ7QUW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3IB763PYKRT3Z7JLO3QLPJ7QUW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3IB763PYKRT3Z7JLO3QLPJ7QUW/action/storage_attestation","attest_author":"https://pith.science/pith/3IB763PYKRT3Z7JLO3QLPJ7QUW/action/author_attestation","sign_citation":"https://pith.science/pith/3IB763PYKRT3Z7JLO3QLPJ7QUW/action/citation_signature","submit_replication":"https://pith.science/pith/3IB763PYKRT3Z7JLO3QLPJ7QUW/action/replication_record"}},"created_at":"2026-07-05T08:54:35.515036+00:00","updated_at":"2026-07-05T08:54:35.515036+00:00"}