{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:NS2JL6CPYELNPGU4PRUQ335KDX","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":"ed3e37bc6b19cd7806057d9eac8aa13f1f5e75f2a7a9b86e852906e48d88e1f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2020-06-21T15:43:01Z","title_canon_sha256":"ab50cc67c5ab13b6795718c7c1491e7fb19a2e20d9a1f82f982cc3b03a4a391f"},"schema_version":"1.0","source":{"id":"2006.11831","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2006.11831","created_at":"2026-07-05T01:11:54Z"},{"alias_kind":"arxiv_version","alias_value":"2006.11831v1","created_at":"2026-07-05T01:11:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.11831","created_at":"2026-07-05T01:11:54Z"},{"alias_kind":"pith_short_12","alias_value":"NS2JL6CPYELN","created_at":"2026-07-05T01:11:54Z"},{"alias_kind":"pith_short_16","alias_value":"NS2JL6CPYELNPGU4","created_at":"2026-07-05T01:11:54Z"},{"alias_kind":"pith_short_8","alias_value":"NS2JL6CP","created_at":"2026-07-05T01:11:54Z"}],"graph_snapshots":[{"event_id":"sha256:aabfc412eac9fa41c327152bdc5a60d81cf0077105e97d5a96cf633b6762e85a","target":"graph","created_at":"2026-07-05T01:11:54Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2006.11831/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we are interested in decomposing a dihypergraph $\\mathcal{H} = (V, \\mathcal{E})$ into simpler dihypergraphs, that can be handled more efficiently. We study the properties of dihypergraphs that can be hierarchically decomposed into trivial dihypergraphs, \\ie vertex hypergraph. The hierarchical decomposition is represented by a full labelled binary tree called $\\mathcal{H}$-tree, in the fashion of hierarchical clustering. We present a polynomial time and space algorithm to achieve such a decomposition by producing its corresponding $\\mathcal{H}$-tree. However, there are dihypergrap","authors_text":"Lhouari Nourine, Simon Vilmin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2020-06-21T15:43:01Z","title":"Hierarchical Decompositions of dihypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.11831","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3b9f3004aa119fb22583bd51fcafee257c43597ce43ba98d5b02bb13e571422f","target":"record","created_at":"2026-07-05T01:11:54Z","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":"ed3e37bc6b19cd7806057d9eac8aa13f1f5e75f2a7a9b86e852906e48d88e1f8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2020-06-21T15:43:01Z","title_canon_sha256":"ab50cc67c5ab13b6795718c7c1491e7fb19a2e20d9a1f82f982cc3b03a4a391f"},"schema_version":"1.0","source":{"id":"2006.11831","kind":"arxiv","version":1}},"canonical_sha256":"6cb495f84fc116d79a9c7c690defaa1dfbf306514ab7f227bc8d1cce0c4863a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cb495f84fc116d79a9c7c690defaa1dfbf306514ab7f227bc8d1cce0c4863a7","first_computed_at":"2026-07-05T01:11:54.175426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:11:54.175426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qigqUB46SdhJt419r2vx5JoBHS5LXmRXvroObvojMg4xmC5+wAh9tgv1YB96G55fZRnrmv+/YeOU7pHcVT2aCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:11:54.175836Z","signed_message":"canonical_sha256_bytes"},"source_id":"2006.11831","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b9f3004aa119fb22583bd51fcafee257c43597ce43ba98d5b02bb13e571422f","sha256:aabfc412eac9fa41c327152bdc5a60d81cf0077105e97d5a96cf633b6762e85a"],"state_sha256":"17772e388b9ec8038c529114a2fb13729f446632e12b56906aaa25fab84de689"}