{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BGL5JIMFOY3GY2CBFTAKYBAXQN","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":"6d4ec83d5cb99c36ccffe0bb9d4bfa75c3311b8241da3f03258bd4f13c728562","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-01T12:35:33Z","title_canon_sha256":"16257b7eeff6714e70efaa2533ee09cfc0eecff278e29be4da07f10bb50e4af3"},"schema_version":"1.0","source":{"id":"1809.00162","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.00162","created_at":"2026-05-18T00:06:35Z"},{"alias_kind":"arxiv_version","alias_value":"1809.00162v1","created_at":"2026-05-18T00:06:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00162","created_at":"2026-05-18T00:06:35Z"},{"alias_kind":"pith_short_12","alias_value":"BGL5JIMFOY3G","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BGL5JIMFOY3GY2CB","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BGL5JIMF","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:e918e8ec297f5aaa80de4474f20a6707df2eee22caec5da591e2c62f06e3c7c8","target":"graph","created_at":"2026-05-18T00:06:35Z","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"},"paper":{"abstract_excerpt":"In graphs, the concept of adjacency is clearly defined: it is a pairwise relationship between vertices. Adjacency in hypergraphs has to integrate hyperedge multi-adicity: the concept of adjacency needs to be defined properly by introducing two new concepts: $k$-adjacency - $k$ vertices are in the same hyperedge - and e-adjacency - vertices of a given hyperedge are e-adjacent. In order to build a new e-adjacency tensor that is interpretable in terms of hypergraph uniformisation, we designed two processes: the first is a hypergraph uniformisation process (HUP) and the second is a polynomial homo","authors_text":"Jean-Marie Le Goff, Stephane Marchand-Maillet, Xavier Ouvrard","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-01T12:35:33Z","title":"On Adjacency and e-Adjacency in General Hypergraphs: Towards a New e-Adjacency Tensor"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00162","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:d283b1d8e3cfcb56ec965c0069c03dd86a4ba5bf85c6beeb8b537759a755c63c","target":"record","created_at":"2026-05-18T00:06:35Z","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":"6d4ec83d5cb99c36ccffe0bb9d4bfa75c3311b8241da3f03258bd4f13c728562","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-01T12:35:33Z","title_canon_sha256":"16257b7eeff6714e70efaa2533ee09cfc0eecff278e29be4da07f10bb50e4af3"},"schema_version":"1.0","source":{"id":"1809.00162","kind":"arxiv","version":1}},"canonical_sha256":"0997d4a18576366c68412cc0ac04178354ebc0594c582a3161be025eaad5db5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0997d4a18576366c68412cc0ac04178354ebc0594c582a3161be025eaad5db5f","first_computed_at":"2026-05-18T00:06:35.899640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:35.899640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ozE2jL4I4TA2mGJaGlISqx/AdCQGM3v4Q4WDJSG8HsUWo+fpNdOGSu2V2WkeoMoqZehaTIaC8/9ONUbdUVIGBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:35.900271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.00162","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d283b1d8e3cfcb56ec965c0069c03dd86a4ba5bf85c6beeb8b537759a755c63c","sha256:e918e8ec297f5aaa80de4474f20a6707df2eee22caec5da591e2c62f06e3c7c8"],"state_sha256":"272c1fcaf122fb8fd1fffa8622162634007315bfdebd6a9418b822276b4bc31e"}