{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BGL5JIMFOY3GY2CBFTAKYBAXQN","short_pith_number":"pith:BGL5JIMF","schema_version":"1.0","canonical_sha256":"0997d4a18576366c68412cc0ac04178354ebc0594c582a3161be025eaad5db5f","source":{"kind":"arxiv","id":"1809.00162","version":1},"attestation_state":"computed","paper":{"title":"On Adjacency and e-Adjacency in General Hypergraphs: Towards a New e-Adjacency Tensor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jean-Marie Le Goff, Stephane Marchand-Maillet, Xavier Ouvrard","submitted_at":"2018-09-01T12:35:33Z","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"},"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":"1809.00162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-01T12:35:33Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"16257b7eeff6714e70efaa2533ee09cfc0eecff278e29be4da07f10bb50e4af3","abstract_canon_sha256":"6d4ec83d5cb99c36ccffe0bb9d4bfa75c3311b8241da3f03258bd4f13c728562"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:35.900271Z","signature_b64":"ozE2jL4I4TA2mGJaGlISqx/AdCQGM3v4Q4WDJSG8HsUWo+fpNdOGSu2V2WkeoMoqZehaTIaC8/9ONUbdUVIGBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0997d4a18576366c68412cc0ac04178354ebc0594c582a3161be025eaad5db5f","last_reissued_at":"2026-05-18T00:06:35.899640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:35.899640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Adjacency and e-Adjacency in General Hypergraphs: Towards a New e-Adjacency Tensor","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jean-Marie Le Goff, Stephane Marchand-Maillet, Xavier Ouvrard","submitted_at":"2018-09-01T12:35:33Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00162","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":""},"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":"1809.00162","created_at":"2026-05-18T00:06:35.899737+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.00162v1","created_at":"2026-05-18T00:06:35.899737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00162","created_at":"2026-05-18T00:06:35.899737+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGL5JIMFOY3G","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGL5JIMFOY3GY2CB","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGL5JIMF","created_at":"2026-05-18T12:32:16.446611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BGL5JIMFOY3GY2CBFTAKYBAXQN","json":"https://pith.science/pith/BGL5JIMFOY3GY2CBFTAKYBAXQN.json","graph_json":"https://pith.science/api/pith-number/BGL5JIMFOY3GY2CBFTAKYBAXQN/graph.json","events_json":"https://pith.science/api/pith-number/BGL5JIMFOY3GY2CBFTAKYBAXQN/events.json","paper":"https://pith.science/paper/BGL5JIMF"},"agent_actions":{"view_html":"https://pith.science/pith/BGL5JIMFOY3GY2CBFTAKYBAXQN","download_json":"https://pith.science/pith/BGL5JIMFOY3GY2CBFTAKYBAXQN.json","view_paper":"https://pith.science/paper/BGL5JIMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.00162&json=true","fetch_graph":"https://pith.science/api/pith-number/BGL5JIMFOY3GY2CBFTAKYBAXQN/graph.json","fetch_events":"https://pith.science/api/pith-number/BGL5JIMFOY3GY2CBFTAKYBAXQN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGL5JIMFOY3GY2CBFTAKYBAXQN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGL5JIMFOY3GY2CBFTAKYBAXQN/action/storage_attestation","attest_author":"https://pith.science/pith/BGL5JIMFOY3GY2CBFTAKYBAXQN/action/author_attestation","sign_citation":"https://pith.science/pith/BGL5JIMFOY3GY2CBFTAKYBAXQN/action/citation_signature","submit_replication":"https://pith.science/pith/BGL5JIMFOY3GY2CBFTAKYBAXQN/action/replication_record"}},"created_at":"2026-05-18T00:06:35.899737+00:00","updated_at":"2026-05-18T00:06:35.899737+00:00"}