{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5YQIUA36ECDCV4VG5X4VUGL6YJ","short_pith_number":"pith:5YQIUA36","schema_version":"1.0","canonical_sha256":"ee208a037e20862af2a6edf95a197ec265f1245d2746e584259eb18faa64dc47","source":{"kind":"arxiv","id":"2405.12235","version":6},"attestation_state":"computed","paper":{"title":"Hypergraph: A Unified and Uniform Definition with Application to Chemical Hypergraph and More","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"cs.LG","authors_text":"Daniel T. Chang","submitted_at":"2024-05-14T23:50:01Z","abstract_excerpt":"The conventional definition of hypergraph has two major issues: (1) there is not a standard definition of directed hypergraph and (2) there is not a formal definition of nested hypergraph. To resolve these issues, we propose a new definition of hypergraph that unifies the concepts of undirected, directed and nested hypergraphs, and that is uniform in using hyperedge as a single construct for representing high-order correlations among things, i.e., nodes and hyperedges. Specifically, we define a hyperedge to be a simple hyperedge, a nesting hyperedge, or a directed hyperedge. With this new defi"},"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":"2405.12235","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-05-14T23:50:01Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"ab7df57abf0b155b5e5a22d7a194ea33c2651d4dc372f0aec551694f83a53d0d","abstract_canon_sha256":"e21977b668a650a3b37bce03ab55c58a61d47b5ce1119e2fbeaaf789088008bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:23:05.899951Z","signature_b64":"4xceRXsszgnBxCxikN4l+uQ0XYHXTpwVGOeCcpq8Gb1GyWiugsQqMGYxERdtA1u+7T+cs1rLf5r2AQS/2x6yBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee208a037e20862af2a6edf95a197ec265f1245d2746e584259eb18faa64dc47","last_reissued_at":"2026-07-05T09:23:05.899511Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:23:05.899511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph: A Unified and Uniform Definition with Application to Chemical Hypergraph and More","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"cs.LG","authors_text":"Daniel T. Chang","submitted_at":"2024-05-14T23:50:01Z","abstract_excerpt":"The conventional definition of hypergraph has two major issues: (1) there is not a standard definition of directed hypergraph and (2) there is not a formal definition of nested hypergraph. To resolve these issues, we propose a new definition of hypergraph that unifies the concepts of undirected, directed and nested hypergraphs, and that is uniform in using hyperedge as a single construct for representing high-order correlations among things, i.e., nodes and hyperedges. Specifically, we define a hyperedge to be a simple hyperedge, a nesting hyperedge, or a directed hyperedge. With this new defi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.12235","kind":"arxiv","version":6},"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/2405.12235/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":"2405.12235","created_at":"2026-07-05T09:23:05.899566+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.12235v6","created_at":"2026-07-05T09:23:05.899566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.12235","created_at":"2026-07-05T09:23:05.899566+00:00"},{"alias_kind":"pith_short_12","alias_value":"5YQIUA36ECDC","created_at":"2026-07-05T09:23:05.899566+00:00"},{"alias_kind":"pith_short_16","alias_value":"5YQIUA36ECDCV4VG","created_at":"2026-07-05T09:23:05.899566+00:00"},{"alias_kind":"pith_short_8","alias_value":"5YQIUA36","created_at":"2026-07-05T09:23:05.899566+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.11041","citing_title":"ChemHGNN: A Hierarchical Hypergraph Neural Network for Reaction Virtual Screening and Discovery","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5YQIUA36ECDCV4VG5X4VUGL6YJ","json":"https://pith.science/pith/5YQIUA36ECDCV4VG5X4VUGL6YJ.json","graph_json":"https://pith.science/api/pith-number/5YQIUA36ECDCV4VG5X4VUGL6YJ/graph.json","events_json":"https://pith.science/api/pith-number/5YQIUA36ECDCV4VG5X4VUGL6YJ/events.json","paper":"https://pith.science/paper/5YQIUA36"},"agent_actions":{"view_html":"https://pith.science/pith/5YQIUA36ECDCV4VG5X4VUGL6YJ","download_json":"https://pith.science/pith/5YQIUA36ECDCV4VG5X4VUGL6YJ.json","view_paper":"https://pith.science/paper/5YQIUA36","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.12235&json=true","fetch_graph":"https://pith.science/api/pith-number/5YQIUA36ECDCV4VG5X4VUGL6YJ/graph.json","fetch_events":"https://pith.science/api/pith-number/5YQIUA36ECDCV4VG5X4VUGL6YJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5YQIUA36ECDCV4VG5X4VUGL6YJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5YQIUA36ECDCV4VG5X4VUGL6YJ/action/storage_attestation","attest_author":"https://pith.science/pith/5YQIUA36ECDCV4VG5X4VUGL6YJ/action/author_attestation","sign_citation":"https://pith.science/pith/5YQIUA36ECDCV4VG5X4VUGL6YJ/action/citation_signature","submit_replication":"https://pith.science/pith/5YQIUA36ECDCV4VG5X4VUGL6YJ/action/replication_record"}},"created_at":"2026-07-05T09:23:05.899566+00:00","updated_at":"2026-07-05T09:23:05.899566+00:00"}