{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5CJCC2BE3MZRUDMJRGC2DYBLSC","short_pith_number":"pith:5CJCC2BE","canonical_record":{"source":{"id":"2605.12509","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2026-03-24T03:28:40Z","cross_cats_sorted":["cs.AI","cs.CE","math.CO"],"title_canon_sha256":"240e6ef7e85079f184acd0f30acc4933b4135f8abc01967b893379360af3508a","abstract_canon_sha256":"aaab272003c35ecdfc8edf7fe2afae9da82fcea9c4ae466c5a458a39ce30434e"},"schema_version":"1.0"},"canonical_sha256":"e892216824db331a0d898985a1e02b90a6f41d60839539ef541f3de907e49733","source":{"kind":"arxiv","id":"2605.12509","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12509","created_at":"2026-05-18T03:10:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12509v1","created_at":"2026-05-18T03:10:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12509","created_at":"2026-05-18T03:10:03Z"},{"alias_kind":"pith_short_12","alias_value":"5CJCC2BE3MZR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"5CJCC2BE3MZRUDMJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"5CJCC2BE","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5CJCC2BE3MZRUDMJRGC2DYBLSC","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12509","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2026-03-24T03:28:40Z","cross_cats_sorted":["cs.AI","cs.CE","math.CO"],"title_canon_sha256":"240e6ef7e85079f184acd0f30acc4933b4135f8abc01967b893379360af3508a","abstract_canon_sha256":"aaab272003c35ecdfc8edf7fe2afae9da82fcea9c4ae466c5a458a39ce30434e"},"schema_version":"1.0"},"canonical_sha256":"e892216824db331a0d898985a1e02b90a6f41d60839539ef541f3de907e49733","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:03.079973Z","signature_b64":"tWAhr8UArtKeOi3gI5+RukSb3vLrEZOE4RLCJO1VGA+qNtSbQQbFctB7o2i80fB7Eib1frjcL1aY6D+O2bSZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e892216824db331a0d898985a1e02b90a6f41d60839539ef541f3de907e49733","last_reissued_at":"2026-05-18T03:10:03.079215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:03.079215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12509","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uyXaWoqhg0BumtiVPZFSHZ3sIu9wDUhJZgiN4Qe1IBxtv5Po7llU5CAaL1D/QaDG1qazQ0PRFSlY2V/rvr4QCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:49:22.207393Z"},"content_sha256":"192b770999302a686e607a1230d95bc79a43d619884d45b1a2f09833fffdda85","schema_version":"1.0","event_id":"sha256:192b770999302a686e607a1230d95bc79a43d619884d45b1a2f09833fffdda85"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5CJCC2BE3MZRUDMJRGC2DYBLSC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Representing Higher-Order Networks: A Survey of Graph-Based Frameworks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Higher-order graph formalisms extend classical networks to model multiway, hierarchical, temporal, and multilayer interactions in complex systems.","cross_cats":["cs.AI","cs.CE","math.CO"],"primary_cat":"cs.SI","authors_text":"Florentin Smarandache, Takaaki Fujita","submitted_at":"2026-03-24T03:28:40Z","abstract_excerpt":"Many real-world phenomena are naturally modeled by graphs and networks. However, classical graph models are often limited to pairwise interactions and may not adequately capture the richer structures that arise in practice. Higher-order graph formalisms extend this framework by incorporating multiway, hierarchical, temporal, multilayer, recursive, and tensor-based interactions, thereby providing more expressive representations of complex systems. This book presents a comprehensive overview of mathematical notions that can be used to model higher-order networks. It surveys foundational concepts"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Higher-order graph formalisms extend this framework by incorporating multiway, hierarchical, temporal, multilayer, recursive, and tensor-based interactions, thereby providing more expressive representations of complex systems.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the surveyed formalisms are representative of the field and that the structural principles and relationships are accurately described without major omissions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A comprehensive survey of graph-based formalisms for higher-order networks including multiway, hierarchical, temporal, multilayer, recursive, and tensor-based models.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Higher-order graph formalisms extend classical networks to model multiway, hierarchical, temporal, and multilayer interactions in complex systems.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a55695c6ed814edd3231e8997beab92feeda688e440733e1bb3614ca51534e47"},"source":{"id":"2605.12509","kind":"arxiv","version":1},"verdict":{"id":"317c6024-b528-40c1-98e7-acb4eca52a8e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T01:09:22.634336Z","strongest_claim":"Higher-order graph formalisms extend this framework by incorporating multiway, hierarchical, temporal, multilayer, recursive, and tensor-based interactions, thereby providing more expressive representations of complex systems.","one_line_summary":"A comprehensive survey of graph-based formalisms for higher-order networks including multiway, hierarchical, temporal, multilayer, recursive, and tensor-based models.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the surveyed formalisms are representative of the field and that the structural principles and relationships are accurately described without major omissions.","pith_extraction_headline":"Higher-order graph formalisms extend classical networks to model multiway, hierarchical, temporal, and multilayer interactions in complex systems."},"references":{"count":258,"sample":[{"doi":"","year":2024,"title":"Graph theory","work_id":"f27292d5-313f-4224-b060-5bed15dad228","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"Graph theory and its applications","work_id":"79f95b2e-12d3-4769-b7e2-7b47e454c591","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"Hypergraph theory","work_id":"3a531c4c-c618-4b5b-a9fe-e2cd8b9176d0","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2020,"title":"Extension of HyperGraph to n-SuperHyperGraph and to Plithogenic n- SuperHyperGraph, and Extension of HyperAlgebra to n-ary (Classical-/Neutro-/Anti-) HyperAlgebra","work_id":"56ad62b1-e1ad-4456-ad07-8f45ee5aae88","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"T. Fujita. Metahypergraphs, metasuperhypergdynaraphs, and iterated metagraphs: Modeling graphs of graphs, hypergraphs of hypergraphs, superhypergraphs of superhypergraphs, and beyond. Current Research","work_id":"906f4860-c645-48c4-b03b-d56b397663cc","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":258,"snapshot_sha256":"9e14e473aeb7391b92e20faa3223ded961342c3c49039b15dd6df91700c9b6c9","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"79a4deae414095665c277a4c4da1f623801c707bbf486464e12b2f2c70117abd"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"317c6024-b528-40c1-98e7-acb4eca52a8e"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h9MGi/7mOAowsziganLKE9ZD09GIM4WLkFGvlb+4M3LWxyn9k8MYdCnpz8nhnk7EMVzdO4rSSsT3TMir+Y9/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:49:22.208479Z"},"content_sha256":"2d98260c5506bf6182d36655c06603abcac38392c8f2d4883a885cbd36772c0c","schema_version":"1.0","event_id":"sha256:2d98260c5506bf6182d36655c06603abcac38392c8f2d4883a885cbd36772c0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5CJCC2BE3MZRUDMJRGC2DYBLSC/bundle.json","state_url":"https://pith.science/pith/5CJCC2BE3MZRUDMJRGC2DYBLSC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5CJCC2BE3MZRUDMJRGC2DYBLSC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T06:49:22Z","links":{"resolver":"https://pith.science/pith/5CJCC2BE3MZRUDMJRGC2DYBLSC","bundle":"https://pith.science/pith/5CJCC2BE3MZRUDMJRGC2DYBLSC/bundle.json","state":"https://pith.science/pith/5CJCC2BE3MZRUDMJRGC2DYBLSC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5CJCC2BE3MZRUDMJRGC2DYBLSC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5CJCC2BE3MZRUDMJRGC2DYBLSC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"aaab272003c35ecdfc8edf7fe2afae9da82fcea9c4ae466c5a458a39ce30434e","cross_cats_sorted":["cs.AI","cs.CE","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2026-03-24T03:28:40Z","title_canon_sha256":"240e6ef7e85079f184acd0f30acc4933b4135f8abc01967b893379360af3508a"},"schema_version":"1.0","source":{"id":"2605.12509","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12509","created_at":"2026-05-18T03:10:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12509v1","created_at":"2026-05-18T03:10:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12509","created_at":"2026-05-18T03:10:03Z"},{"alias_kind":"pith_short_12","alias_value":"5CJCC2BE3MZR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"5CJCC2BE3MZRUDMJ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"5CJCC2BE","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:2d98260c5506bf6182d36655c06603abcac38392c8f2d4883a885cbd36772c0c","target":"graph","created_at":"2026-05-18T03:10:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Higher-order graph formalisms extend this framework by incorporating multiway, hierarchical, temporal, multilayer, recursive, and tensor-based interactions, thereby providing more expressive representations of complex systems."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the surveyed formalisms are representative of the field and that the structural principles and relationships are accurately described without major omissions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A comprehensive survey of graph-based formalisms for higher-order networks including multiway, hierarchical, temporal, multilayer, recursive, and tensor-based models."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Higher-order graph formalisms extend classical networks to model multiway, hierarchical, temporal, and multilayer interactions in complex systems."}],"snapshot_sha256":"a55695c6ed814edd3231e8997beab92feeda688e440733e1bb3614ca51534e47"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"79a4deae414095665c277a4c4da1f623801c707bbf486464e12b2f2c70117abd"},"paper":{"abstract_excerpt":"Many real-world phenomena are naturally modeled by graphs and networks. However, classical graph models are often limited to pairwise interactions and may not adequately capture the richer structures that arise in practice. Higher-order graph formalisms extend this framework by incorporating multiway, hierarchical, temporal, multilayer, recursive, and tensor-based interactions, thereby providing more expressive representations of complex systems. This book presents a comprehensive overview of mathematical notions that can be used to model higher-order networks. It surveys foundational concepts","authors_text":"Florentin Smarandache, Takaaki Fujita","cross_cats":["cs.AI","cs.CE","math.CO"],"headline":"Higher-order graph formalisms extend classical networks to model multiway, hierarchical, temporal, and multilayer interactions in complex systems.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2026-03-24T03:28:40Z","title":"Representing Higher-Order Networks: A Survey of Graph-Based Frameworks"},"references":{"count":258,"internal_anchors":1,"resolved_work":258,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Graph theory","work_id":"f27292d5-313f-4224-b060-5bed15dad228","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Graph theory and its applications","work_id":"79f95b2e-12d3-4769-b7e2-7b47e454c591","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Hypergraph theory","work_id":"3a531c4c-c618-4b5b-a9fe-e2cd8b9176d0","year":2013},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Extension of HyperGraph to n-SuperHyperGraph and to Plithogenic n- SuperHyperGraph, and Extension of HyperAlgebra to n-ary (Classical-/Neutro-/Anti-) HyperAlgebra","work_id":"56ad62b1-e1ad-4456-ad07-8f45ee5aae88","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"T. Fujita. Metahypergraphs, metasuperhypergdynaraphs, and iterated metagraphs: Modeling graphs of graphs, hypergraphs of hypergraphs, superhypergraphs of superhypergraphs, and beyond. Current Research","work_id":"906f4860-c645-48c4-b03b-d56b397663cc","year":2025}],"snapshot_sha256":"9e14e473aeb7391b92e20faa3223ded961342c3c49039b15dd6df91700c9b6c9"},"source":{"id":"2605.12509","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T01:09:22.634336Z","id":"317c6024-b528-40c1-98e7-acb4eca52a8e","model_set":{"reader":"grok-4.3"},"one_line_summary":"A comprehensive survey of graph-based formalisms for higher-order networks including multiway, hierarchical, temporal, multilayer, recursive, and tensor-based models.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Higher-order graph formalisms extend classical networks to model multiway, hierarchical, temporal, and multilayer interactions in complex systems.","strongest_claim":"Higher-order graph formalisms extend this framework by incorporating multiway, hierarchical, temporal, multilayer, recursive, and tensor-based interactions, thereby providing more expressive representations of complex systems.","weakest_assumption":"That the surveyed formalisms are representative of the field and that the structural principles and relationships are accurately described without major omissions."}},"verdict_id":"317c6024-b528-40c1-98e7-acb4eca52a8e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:192b770999302a686e607a1230d95bc79a43d619884d45b1a2f09833fffdda85","target":"record","created_at":"2026-05-18T03:10:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"aaab272003c35ecdfc8edf7fe2afae9da82fcea9c4ae466c5a458a39ce30434e","cross_cats_sorted":["cs.AI","cs.CE","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SI","submitted_at":"2026-03-24T03:28:40Z","title_canon_sha256":"240e6ef7e85079f184acd0f30acc4933b4135f8abc01967b893379360af3508a"},"schema_version":"1.0","source":{"id":"2605.12509","kind":"arxiv","version":1}},"canonical_sha256":"e892216824db331a0d898985a1e02b90a6f41d60839539ef541f3de907e49733","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e892216824db331a0d898985a1e02b90a6f41d60839539ef541f3de907e49733","first_computed_at":"2026-05-18T03:10:03.079215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:03.079215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tWAhr8UArtKeOi3gI5+RukSb3vLrEZOE4RLCJO1VGA+qNtSbQQbFctB7o2i80fB7Eib1frjcL1aY6D+O2bSZDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:03.079973Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12509","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:192b770999302a686e607a1230d95bc79a43d619884d45b1a2f09833fffdda85","sha256:2d98260c5506bf6182d36655c06603abcac38392c8f2d4883a885cbd36772c0c"],"state_sha256":"83d824ed21e5136919d701fee9e60b20853a8fb436598d4dc4af9c76510d7061"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R3QE1XW8u8rjHGQ50PDtVN/M4o+C0fc7Afrn3BN1/c9s/NU8oweo0iAcliOmAJniYg0jW39K2bcAL2KbGMYfCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T06:49:22.213534Z","bundle_sha256":"1a2fc00e1e9d374cf6da7daeeb4856c8d925542d60107d6788046f448ef465c6"}}