{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:JGMFWTXFLYZ474OJTTYC7PW3ED","short_pith_number":"pith:JGMFWTXF","schema_version":"1.0","canonical_sha256":"49985b4ee55e33cff1c99cf02fbedb20d03202ce2035ed47d1955ed4d2e927dc","source":{"kind":"arxiv","id":"1908.09152","version":2},"attestation_state":"computed","paper":{"title":"Hyper-Path-Based Representation Learning for Hyper-Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Jie Huang, Xin Liu, Yangqiu Song","submitted_at":"2019-08-24T15:19:29Z","abstract_excerpt":"Network representation learning has aroused widespread interests in recent years. While most of the existing methods deal with edges as pairwise relationships, only a few studies have been proposed for hyper-networks to capture more complicated tuplewise relationships among multiple nodes. A hyper-network is a network where each edge, called hyperedge, connects an arbitrary number of nodes. Different from conventional networks, hyper-networks have certain degrees of indecomposability such that the nodes in a subset of a hyperedge may not possess a strong relationship. That is the main reason w"},"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":"1908.09152","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-08-24T15:19:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"073f5a7fd877346380732b23869f0fe67ecf5b94c5537bef2c13294e0b58ddb1","abstract_canon_sha256":"caa00e6787b01546f81b885fc8b9ef0ad5b466429937631148ff0a50aa4d5ef5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:13:53.738625Z","signature_b64":"Hh0EtfUIn/XpDW7tOUo3ymCiIh2CrzUk5LbjYS2wNPvrNzMF7B6VgyavyDSugIiki9zPPkUtqFK0CpPVaN2vBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49985b4ee55e33cff1c99cf02fbedb20d03202ce2035ed47d1955ed4d2e927dc","last_reissued_at":"2026-07-05T00:13:53.738238Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:13:53.738238Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hyper-Path-Based Representation Learning for Hyper-Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Jie Huang, Xin Liu, Yangqiu Song","submitted_at":"2019-08-24T15:19:29Z","abstract_excerpt":"Network representation learning has aroused widespread interests in recent years. While most of the existing methods deal with edges as pairwise relationships, only a few studies have been proposed for hyper-networks to capture more complicated tuplewise relationships among multiple nodes. A hyper-network is a network where each edge, called hyperedge, connects an arbitrary number of nodes. Different from conventional networks, hyper-networks have certain degrees of indecomposability such that the nodes in a subset of a hyperedge may not possess a strong relationship. That is the main reason w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.09152","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/1908.09152/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":"1908.09152","created_at":"2026-07-05T00:13:53.738293+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.09152v2","created_at":"2026-07-05T00:13:53.738293+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.09152","created_at":"2026-07-05T00:13:53.738293+00:00"},{"alias_kind":"pith_short_12","alias_value":"JGMFWTXFLYZ4","created_at":"2026-07-05T00:13:53.738293+00:00"},{"alias_kind":"pith_short_16","alias_value":"JGMFWTXFLYZ474OJ","created_at":"2026-07-05T00:13:53.738293+00:00"},{"alias_kind":"pith_short_8","alias_value":"JGMFWTXF","created_at":"2026-07-05T00:13:53.738293+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/JGMFWTXFLYZ474OJTTYC7PW3ED","json":"https://pith.science/pith/JGMFWTXFLYZ474OJTTYC7PW3ED.json","graph_json":"https://pith.science/api/pith-number/JGMFWTXFLYZ474OJTTYC7PW3ED/graph.json","events_json":"https://pith.science/api/pith-number/JGMFWTXFLYZ474OJTTYC7PW3ED/events.json","paper":"https://pith.science/paper/JGMFWTXF"},"agent_actions":{"view_html":"https://pith.science/pith/JGMFWTXFLYZ474OJTTYC7PW3ED","download_json":"https://pith.science/pith/JGMFWTXFLYZ474OJTTYC7PW3ED.json","view_paper":"https://pith.science/paper/JGMFWTXF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.09152&json=true","fetch_graph":"https://pith.science/api/pith-number/JGMFWTXFLYZ474OJTTYC7PW3ED/graph.json","fetch_events":"https://pith.science/api/pith-number/JGMFWTXFLYZ474OJTTYC7PW3ED/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JGMFWTXFLYZ474OJTTYC7PW3ED/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JGMFWTXFLYZ474OJTTYC7PW3ED/action/storage_attestation","attest_author":"https://pith.science/pith/JGMFWTXFLYZ474OJTTYC7PW3ED/action/author_attestation","sign_citation":"https://pith.science/pith/JGMFWTXFLYZ474OJTTYC7PW3ED/action/citation_signature","submit_replication":"https://pith.science/pith/JGMFWTXFLYZ474OJTTYC7PW3ED/action/replication_record"}},"created_at":"2026-07-05T00:13:53.738293+00:00","updated_at":"2026-07-05T00:13:53.738293+00:00"}