{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RGKXDLEMGRFNZS7MAUJEJGJXIS","short_pith_number":"pith:RGKXDLEM","schema_version":"1.0","canonical_sha256":"899571ac8c344adccbec051244993744b21412d96ca73134081e412fd858e681","source":{"kind":"arxiv","id":"1908.05387","version":2},"attestation_state":"computed","paper":{"title":"HONEM: Learning Embedding for Higher Order Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Giovanni Luca Ciampaglia, Lance M Kaplan, Mandana Saebi, Nitesh V Chawla","submitted_at":"2019-08-15T01:22:27Z","abstract_excerpt":"Representation learning on networks offers a powerful alternative to the oft painstaking process of manual feature engineering, and as a result, has enjoyed considerable success in recent years. However, all the existing representation learning methods are based on the first-order network (FON), that is, the network that only captures the pairwise interactions between the nodes. As a result, these methods may fail to incorporate non-Markovian higher-order dependencies in the network. Thus, the embeddings that are generated may not accurately represent of the underlying phenomena in a network, "},"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.05387","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-08-15T01:22:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6b1b4edfe3db384a360bc1f4521033a4c7ffa9952ddae9a550c71790e1cd0755","abstract_canon_sha256":"7baa847e062cc9a51cb4e6f3a1719d6f21275789c7150fe8e0bf0d6bc10d9841"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:02:00.832524Z","signature_b64":"n0DuQkLup2mnxqAnaFvkSZbnSHm/PKmAaL171i3NwJFFVsuafRS/tUOS+kwprUs96+Y77Lpu1XUBlTm1SAx7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"899571ac8c344adccbec051244993744b21412d96ca73134081e412fd858e681","last_reissued_at":"2026-05-20T00:02:00.831754Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:02:00.831754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HONEM: Learning Embedding for Higher Order Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Giovanni Luca Ciampaglia, Lance M Kaplan, Mandana Saebi, Nitesh V Chawla","submitted_at":"2019-08-15T01:22:27Z","abstract_excerpt":"Representation learning on networks offers a powerful alternative to the oft painstaking process of manual feature engineering, and as a result, has enjoyed considerable success in recent years. However, all the existing representation learning methods are based on the first-order network (FON), that is, the network that only captures the pairwise interactions between the nodes. As a result, these methods may fail to incorporate non-Markovian higher-order dependencies in the network. Thus, the embeddings that are generated may not accurately represent of the underlying phenomena in a network, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05387","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.05387/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.05387","created_at":"2026-05-20T00:02:00.831869+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.05387v2","created_at":"2026-05-20T00:02:00.831869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05387","created_at":"2026-05-20T00:02:00.831869+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGKXDLEMGRFN","created_at":"2026-05-20T00:02:00.831869+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGKXDLEMGRFNZS7M","created_at":"2026-05-20T00:02:00.831869+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGKXDLEM","created_at":"2026-05-20T00:02:00.831869+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/RGKXDLEMGRFNZS7MAUJEJGJXIS","json":"https://pith.science/pith/RGKXDLEMGRFNZS7MAUJEJGJXIS.json","graph_json":"https://pith.science/api/pith-number/RGKXDLEMGRFNZS7MAUJEJGJXIS/graph.json","events_json":"https://pith.science/api/pith-number/RGKXDLEMGRFNZS7MAUJEJGJXIS/events.json","paper":"https://pith.science/paper/RGKXDLEM"},"agent_actions":{"view_html":"https://pith.science/pith/RGKXDLEMGRFNZS7MAUJEJGJXIS","download_json":"https://pith.science/pith/RGKXDLEMGRFNZS7MAUJEJGJXIS.json","view_paper":"https://pith.science/paper/RGKXDLEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.05387&json=true","fetch_graph":"https://pith.science/api/pith-number/RGKXDLEMGRFNZS7MAUJEJGJXIS/graph.json","fetch_events":"https://pith.science/api/pith-number/RGKXDLEMGRFNZS7MAUJEJGJXIS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGKXDLEMGRFNZS7MAUJEJGJXIS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGKXDLEMGRFNZS7MAUJEJGJXIS/action/storage_attestation","attest_author":"https://pith.science/pith/RGKXDLEMGRFNZS7MAUJEJGJXIS/action/author_attestation","sign_citation":"https://pith.science/pith/RGKXDLEMGRFNZS7MAUJEJGJXIS/action/citation_signature","submit_replication":"https://pith.science/pith/RGKXDLEMGRFNZS7MAUJEJGJXIS/action/replication_record"}},"created_at":"2026-05-20T00:02:00.831869+00:00","updated_at":"2026-05-20T00:02:00.831869+00:00"}