{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FAQSMHUTZ5DBD5MBHJ635J3BMU","short_pith_number":"pith:FAQSMHUT","canonical_record":{"source":{"id":"1602.07267","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-23T19:13:00Z","cross_cats_sorted":[],"title_canon_sha256":"6ce6504b61eed5002cf4b7a97329674e18b211f0cbe450cfb8d7fbe109b11768","abstract_canon_sha256":"16c86042224dee0fb17171eb0eccf531c834fdb87653c38fbd499062e70bccc8"},"schema_version":"1.0"},"canonical_sha256":"2821261e93cf4611f5813a7dbea761650561f8a561742b43944345b2ef613cb3","source":{"kind":"arxiv","id":"1602.07267","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07267","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07267v2","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07267","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"pith_short_12","alias_value":"FAQSMHUTZ5DB","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FAQSMHUTZ5DBD5MB","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FAQSMHUT","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FAQSMHUTZ5DBD5MBHJ635J3BMU","target":"record","payload":{"canonical_record":{"source":{"id":"1602.07267","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-23T19:13:00Z","cross_cats_sorted":[],"title_canon_sha256":"6ce6504b61eed5002cf4b7a97329674e18b211f0cbe450cfb8d7fbe109b11768","abstract_canon_sha256":"16c86042224dee0fb17171eb0eccf531c834fdb87653c38fbd499062e70bccc8"},"schema_version":"1.0"},"canonical_sha256":"2821261e93cf4611f5813a7dbea761650561f8a561742b43944345b2ef613cb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:01.587158Z","signature_b64":"EB9o9n8VEVphuZJ5gL8zyNdtd7vzZYUEeQ90S1ru7YecyVeN4MGc9qfasuivJ4DhxbhpnAnIo/WMME4EUH2bDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2821261e93cf4611f5813a7dbea761650561f8a561742b43944345b2ef613cb3","last_reissued_at":"2026-05-18T00:50:01.586493Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:01.586493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.07267","source_version":2,"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-18T00:50:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DbsKgtjvjur1cHUU5AfHh5BEUqxS6+TJP+lzBnTjq4nKXK72olzcuyNNSzIoqJ7khURoRlQjeuCPdjW0xvNuAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T07:18:15.722214Z"},"content_sha256":"94c9e32221dd4cac25836ce4a0f73fa6c4a6a19e1e536cac40e1207cbba0d039","schema_version":"1.0","event_id":"sha256:94c9e32221dd4cac25836ce4a0f73fa6c4a6a19e1e536cac40e1207cbba0d039"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FAQSMHUTZ5DBD5MBHJ635J3BMU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On closure operators related to maximal tricliques in tripartite hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Dmitry I. Ignatov","submitted_at":"2016-02-23T19:13:00Z","abstract_excerpt":"Triadic Formal Concept Analysis (3FCA) was introduced by Lehman and Wille almost two decades ago. And many researchers work in Data Mining and Formal Concept Analysis using the notions of closed sets, Galois and closure operators, closure systems, but up-to-date even though that different researchers actively work on mining triadic and n-ary relations, a proper closure operator for enumeration of triconcepts, i.e. maximal triadic cliques of tripartite hypergaphs, was not introduced. In this paper we show that the previously introduced operators for obtaining triconcepts and maximal connected a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07267","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:50:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+/TqYG2wvypJA1UFlgGE0nPH/YmsI9T7OUe8LO4+8FZYWS1wLR/wx2yO2fC3RfZ18hJci43hfG1o+lZnaDWdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T07:18:15.722578Z"},"content_sha256":"df41f47aa5ece14590d6ed30ae18ab7ce2335e9881e8dc6f610ae72916fea97f","schema_version":"1.0","event_id":"sha256:df41f47aa5ece14590d6ed30ae18ab7ce2335e9881e8dc6f610ae72916fea97f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FAQSMHUTZ5DBD5MBHJ635J3BMU/bundle.json","state_url":"https://pith.science/pith/FAQSMHUTZ5DBD5MBHJ635J3BMU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FAQSMHUTZ5DBD5MBHJ635J3BMU/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-07-04T07:18:15Z","links":{"resolver":"https://pith.science/pith/FAQSMHUTZ5DBD5MBHJ635J3BMU","bundle":"https://pith.science/pith/FAQSMHUTZ5DBD5MBHJ635J3BMU/bundle.json","state":"https://pith.science/pith/FAQSMHUTZ5DBD5MBHJ635J3BMU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FAQSMHUTZ5DBD5MBHJ635J3BMU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FAQSMHUTZ5DBD5MBHJ635J3BMU","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":"16c86042224dee0fb17171eb0eccf531c834fdb87653c38fbd499062e70bccc8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-23T19:13:00Z","title_canon_sha256":"6ce6504b61eed5002cf4b7a97329674e18b211f0cbe450cfb8d7fbe109b11768"},"schema_version":"1.0","source":{"id":"1602.07267","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.07267","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"arxiv_version","alias_value":"1602.07267v2","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.07267","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"pith_short_12","alias_value":"FAQSMHUTZ5DB","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FAQSMHUTZ5DBD5MB","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FAQSMHUT","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:df41f47aa5ece14590d6ed30ae18ab7ce2335e9881e8dc6f610ae72916fea97f","target":"graph","created_at":"2026-05-18T00:50:01Z","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":"Triadic Formal Concept Analysis (3FCA) was introduced by Lehman and Wille almost two decades ago. And many researchers work in Data Mining and Formal Concept Analysis using the notions of closed sets, Galois and closure operators, closure systems, but up-to-date even though that different researchers actively work on mining triadic and n-ary relations, a proper closure operator for enumeration of triconcepts, i.e. maximal triadic cliques of tripartite hypergaphs, was not introduced. In this paper we show that the previously introduced operators for obtaining triconcepts and maximal connected a","authors_text":"Dmitry I. Ignatov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-23T19:13:00Z","title":"On closure operators related to maximal tricliques in tripartite hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.07267","kind":"arxiv","version":2},"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:94c9e32221dd4cac25836ce4a0f73fa6c4a6a19e1e536cac40e1207cbba0d039","target":"record","created_at":"2026-05-18T00:50:01Z","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":"16c86042224dee0fb17171eb0eccf531c834fdb87653c38fbd499062e70bccc8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-02-23T19:13:00Z","title_canon_sha256":"6ce6504b61eed5002cf4b7a97329674e18b211f0cbe450cfb8d7fbe109b11768"},"schema_version":"1.0","source":{"id":"1602.07267","kind":"arxiv","version":2}},"canonical_sha256":"2821261e93cf4611f5813a7dbea761650561f8a561742b43944345b2ef613cb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2821261e93cf4611f5813a7dbea761650561f8a561742b43944345b2ef613cb3","first_computed_at":"2026-05-18T00:50:01.586493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:01.586493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EB9o9n8VEVphuZJ5gL8zyNdtd7vzZYUEeQ90S1ru7YecyVeN4MGc9qfasuivJ4DhxbhpnAnIo/WMME4EUH2bDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:01.587158Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.07267","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94c9e32221dd4cac25836ce4a0f73fa6c4a6a19e1e536cac40e1207cbba0d039","sha256:df41f47aa5ece14590d6ed30ae18ab7ce2335e9881e8dc6f610ae72916fea97f"],"state_sha256":"fafe2770c2a41504c45659b9342050a70bb2bcba4666c9bb80a236d7f5152aa7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L8NDjXN4rFzbuGwrQ97KwflrjgGpAFk3olc/MOfgSDUNkkzlfyoHEVZcBmGp4RdlwEeqJ5+J3LhbKPUWpShKDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T07:18:15.724591Z","bundle_sha256":"8001fc6bde263fd0eebd9fb6a04b23eaa418f0c58b197b85f32679ca871938f2"}}