{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:PMH3MKPEQ5EXVG2OZKHAQRYPBS","short_pith_number":"pith:PMH3MKPE","schema_version":"1.0","canonical_sha256":"7b0fb629e487497a9b4eca8e08470f0cada237c8af40c5025fdd97268ad636b3","source":{"kind":"arxiv","id":"2110.02510","version":3},"attestation_state":"computed","paper":{"title":"Cycle Representation Learning for Inductive Relation Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chao Chen, Liangcai Gao, Tengfei Ma, Zhi Tang, Zuoyu Yan","submitted_at":"2021-10-06T05:18:18Z","abstract_excerpt":"In recent years, algebraic topology and its modern development, the theory of persistent homology, has shown great potential in graph representation learning. In this paper, based on the mathematics of algebraic topology, we propose a novel solution for inductive relation prediction, an important learning task for knowledge graph completion. To predict the relation between two entities, one can use the existence of rules, namely a sequence of relations. Previous works view rules as paths and primarily focus on the searching of paths between entities. The space of rules is huge, and one has to "},"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":"2110.02510","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-10-06T05:18:18Z","cross_cats_sorted":[],"title_canon_sha256":"34a5e0ff69932a8d2ef91a2e0eeb36fafc1dbc5103f786df7b4767570ca681c4","abstract_canon_sha256":"0ac2c12a5de33b946894c26387aee6984cb2ea77b9dcaa9aa30992cb12b3698d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:30:53.328839Z","signature_b64":"jYOBh0cykywaWy8mUJyzwTWCqvIDJZzfnVlB1C0qIh0GuOnHCJ5JrSV92otDKae/6hEjMlG9pS0babKmx5IdCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b0fb629e487497a9b4eca8e08470f0cada237c8af40c5025fdd97268ad636b3","last_reissued_at":"2026-07-05T04:30:53.328349Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:30:53.328349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cycle Representation Learning for Inductive Relation Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chao Chen, Liangcai Gao, Tengfei Ma, Zhi Tang, Zuoyu Yan","submitted_at":"2021-10-06T05:18:18Z","abstract_excerpt":"In recent years, algebraic topology and its modern development, the theory of persistent homology, has shown great potential in graph representation learning. In this paper, based on the mathematics of algebraic topology, we propose a novel solution for inductive relation prediction, an important learning task for knowledge graph completion. To predict the relation between two entities, one can use the existence of rules, namely a sequence of relations. Previous works view rules as paths and primarily focus on the searching of paths between entities. The space of rules is huge, and one has to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.02510","kind":"arxiv","version":3},"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/2110.02510/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":"2110.02510","created_at":"2026-07-05T04:30:53.328414+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.02510v3","created_at":"2026-07-05T04:30:53.328414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.02510","created_at":"2026-07-05T04:30:53.328414+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMH3MKPEQ5EX","created_at":"2026-07-05T04:30:53.328414+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMH3MKPEQ5EXVG2O","created_at":"2026-07-05T04:30:53.328414+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMH3MKPE","created_at":"2026-07-05T04:30:53.328414+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/PMH3MKPEQ5EXVG2OZKHAQRYPBS","json":"https://pith.science/pith/PMH3MKPEQ5EXVG2OZKHAQRYPBS.json","graph_json":"https://pith.science/api/pith-number/PMH3MKPEQ5EXVG2OZKHAQRYPBS/graph.json","events_json":"https://pith.science/api/pith-number/PMH3MKPEQ5EXVG2OZKHAQRYPBS/events.json","paper":"https://pith.science/paper/PMH3MKPE"},"agent_actions":{"view_html":"https://pith.science/pith/PMH3MKPEQ5EXVG2OZKHAQRYPBS","download_json":"https://pith.science/pith/PMH3MKPEQ5EXVG2OZKHAQRYPBS.json","view_paper":"https://pith.science/paper/PMH3MKPE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.02510&json=true","fetch_graph":"https://pith.science/api/pith-number/PMH3MKPEQ5EXVG2OZKHAQRYPBS/graph.json","fetch_events":"https://pith.science/api/pith-number/PMH3MKPEQ5EXVG2OZKHAQRYPBS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMH3MKPEQ5EXVG2OZKHAQRYPBS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMH3MKPEQ5EXVG2OZKHAQRYPBS/action/storage_attestation","attest_author":"https://pith.science/pith/PMH3MKPEQ5EXVG2OZKHAQRYPBS/action/author_attestation","sign_citation":"https://pith.science/pith/PMH3MKPEQ5EXVG2OZKHAQRYPBS/action/citation_signature","submit_replication":"https://pith.science/pith/PMH3MKPEQ5EXVG2OZKHAQRYPBS/action/replication_record"}},"created_at":"2026-07-05T04:30:53.328414+00:00","updated_at":"2026-07-05T04:30:53.328414+00:00"}