{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:FLQ7FML2WJKT32WZ6A33SMJTNO","short_pith_number":"pith:FLQ7FML2","schema_version":"1.0","canonical_sha256":"2ae1f2b17ab2553dead9f037b931336ba01c41a542414c6f4cdd4dda93d2d73e","source":{"kind":"arxiv","id":"2003.01853","version":2},"attestation_state":"computed","paper":{"title":"Hypergraph Motifs: Concepts, Algorithms, and Discoveries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS"],"primary_cat":"cs.SI","authors_text":"Geon Lee, Jihoon Ko, Kijung Shin","submitted_at":"2020-03-04T01:40:20Z","abstract_excerpt":"Hypergraphs naturally represent group interactions, which are omnipresent in many domains: collaborations of researchers, co-purchases of items, joint interactions of proteins, to name a few. In this work, we propose tools for answering the following questions in a systematic manner: (Q1) what are structural design principles of real-world hypergraphs? (Q2) how can we compare local structures of hypergraphs of different sizes? (Q3) how can we identify domains which hypergraphs are from? We first define hypergraph motifs (h-motifs), which describe the connectivity patterns of three connected hy"},"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":"2003.01853","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-03-04T01:40:20Z","cross_cats_sorted":["cs.DB","cs.DS"],"title_canon_sha256":"1783d148099174a234c37907315c9f1508ef855d8cacf48d0d9fe0f04596bcaa","abstract_canon_sha256":"8d314a939f95e4e74ff7b50043dded356aff8363372aa6c315bc5c7d3e9581cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:20:15.887583Z","signature_b64":"0ckIt7mmobqL8Ojb/HiT1IfMrX1RpDp/Nhj8NDnOXMtwn+mTOtiBQ5chgfyAcTCwfEXxAijSwB0ghuUWyHBeBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ae1f2b17ab2553dead9f037b931336ba01c41a542414c6f4cdd4dda93d2d73e","last_reissued_at":"2026-07-05T01:20:15.887113Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:20:15.887113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraph Motifs: Concepts, Algorithms, and Discoveries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DS"],"primary_cat":"cs.SI","authors_text":"Geon Lee, Jihoon Ko, Kijung Shin","submitted_at":"2020-03-04T01:40:20Z","abstract_excerpt":"Hypergraphs naturally represent group interactions, which are omnipresent in many domains: collaborations of researchers, co-purchases of items, joint interactions of proteins, to name a few. In this work, we propose tools for answering the following questions in a systematic manner: (Q1) what are structural design principles of real-world hypergraphs? (Q2) how can we compare local structures of hypergraphs of different sizes? (Q3) how can we identify domains which hypergraphs are from? We first define hypergraph motifs (h-motifs), which describe the connectivity patterns of three connected hy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.01853","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2003.01853/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2003.01853","created_at":"2026-07-05T01:20:15.887163+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.01853v2","created_at":"2026-07-05T01:20:15.887163+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.01853","created_at":"2026-07-05T01:20:15.887163+00:00"},{"alias_kind":"pith_short_12","alias_value":"FLQ7FML2WJKT","created_at":"2026-07-05T01:20:15.887163+00:00"},{"alias_kind":"pith_short_16","alias_value":"FLQ7FML2WJKT32WZ","created_at":"2026-07-05T01:20:15.887163+00:00"},{"alias_kind":"pith_short_8","alias_value":"FLQ7FML2","created_at":"2026-07-05T01:20:15.887163+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07733","citing_title":"A Self-Supervised Approach for Minimal-Annotation Hydroacoustic Data Exploration","ref_index":185,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FLQ7FML2WJKT32WZ6A33SMJTNO","json":"https://pith.science/pith/FLQ7FML2WJKT32WZ6A33SMJTNO.json","graph_json":"https://pith.science/api/pith-number/FLQ7FML2WJKT32WZ6A33SMJTNO/graph.json","events_json":"https://pith.science/api/pith-number/FLQ7FML2WJKT32WZ6A33SMJTNO/events.json","paper":"https://pith.science/paper/FLQ7FML2"},"agent_actions":{"view_html":"https://pith.science/pith/FLQ7FML2WJKT32WZ6A33SMJTNO","download_json":"https://pith.science/pith/FLQ7FML2WJKT32WZ6A33SMJTNO.json","view_paper":"https://pith.science/paper/FLQ7FML2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.01853&json=true","fetch_graph":"https://pith.science/api/pith-number/FLQ7FML2WJKT32WZ6A33SMJTNO/graph.json","fetch_events":"https://pith.science/api/pith-number/FLQ7FML2WJKT32WZ6A33SMJTNO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FLQ7FML2WJKT32WZ6A33SMJTNO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FLQ7FML2WJKT32WZ6A33SMJTNO/action/storage_attestation","attest_author":"https://pith.science/pith/FLQ7FML2WJKT32WZ6A33SMJTNO/action/author_attestation","sign_citation":"https://pith.science/pith/FLQ7FML2WJKT32WZ6A33SMJTNO/action/citation_signature","submit_replication":"https://pith.science/pith/FLQ7FML2WJKT32WZ6A33SMJTNO/action/replication_record"}},"created_at":"2026-07-05T01:20:15.887163+00:00","updated_at":"2026-07-05T01:20:15.887163+00:00"}