{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:7DIGJPU4ASICA6OKHPTURQ5TPG","short_pith_number":"pith:7DIGJPU4","schema_version":"1.0","canonical_sha256":"f8d064be9c04902079ca3be748c3b3799bf67fdbcbb2e34ee4b84eb4478b30bc","source":{"kind":"arxiv","id":"2102.12926","version":4},"attestation_state":"computed","paper":{"title":"Persistent Homology and Graphs Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CV","math.AT"],"primary_cat":"cs.LG","authors_text":"Ghada Zamzmi, Mustafa Hajij, Xuanting Cai","submitted_at":"2021-02-25T15:26:21Z","abstract_excerpt":"This article aims to study the topological invariant properties encoded in node graph representational embeddings by utilizing tools available in persistent homology. Specifically, given a node embedding representation algorithm, we consider the case when these embeddings are real-valued. By viewing these embeddings as scalar functions on a domain of interest, we can utilize the tools available in persistent homology to study the topological information encoded in these representations. Our construction effectively defines a unique persistence-based graph descriptor, on both the graph and node"},"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":"2102.12926","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-25T15:26:21Z","cross_cats_sorted":["cs.CG","cs.CV","math.AT"],"title_canon_sha256":"320045ebb4d48b8753cd526467a1c0643ba055b70e8e04e166ada9c6ada602e4","abstract_canon_sha256":"de5fd2eb0217682ae8493528562587e17e449e7cbdf45b4fc5ee044da512aaa9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:21:08.589492Z","signature_b64":"p7tyobk8hWSssa7MpInyZDjt3JWpxJJyCRS/umB4IgWDtEXXZFSlegfyZjpDRXuFZEt/MTurcAMtl/XbvrC1BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8d064be9c04902079ca3be748c3b3799bf67fdbcbb2e34ee4b84eb4478b30bc","last_reissued_at":"2026-07-05T03:21:08.589012Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:21:08.589012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Persistent Homology and Graphs Representation Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.CV","math.AT"],"primary_cat":"cs.LG","authors_text":"Ghada Zamzmi, Mustafa Hajij, Xuanting Cai","submitted_at":"2021-02-25T15:26:21Z","abstract_excerpt":"This article aims to study the topological invariant properties encoded in node graph representational embeddings by utilizing tools available in persistent homology. Specifically, given a node embedding representation algorithm, we consider the case when these embeddings are real-valued. By viewing these embeddings as scalar functions on a domain of interest, we can utilize the tools available in persistent homology to study the topological information encoded in these representations. Our construction effectively defines a unique persistence-based graph descriptor, on both the graph and node"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.12926","kind":"arxiv","version":4},"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/2102.12926/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":"2102.12926","created_at":"2026-07-05T03:21:08.589063+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.12926v4","created_at":"2026-07-05T03:21:08.589063+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.12926","created_at":"2026-07-05T03:21:08.589063+00:00"},{"alias_kind":"pith_short_12","alias_value":"7DIGJPU4ASIC","created_at":"2026-07-05T03:21:08.589063+00:00"},{"alias_kind":"pith_short_16","alias_value":"7DIGJPU4ASICA6OK","created_at":"2026-07-05T03:21:08.589063+00:00"},{"alias_kind":"pith_short_8","alias_value":"7DIGJPU4","created_at":"2026-07-05T03:21:08.589063+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.05814","citing_title":"Positional Encoding meets Persistent Homology on Graphs","ref_index":2017,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7DIGJPU4ASICA6OKHPTURQ5TPG","json":"https://pith.science/pith/7DIGJPU4ASICA6OKHPTURQ5TPG.json","graph_json":"https://pith.science/api/pith-number/7DIGJPU4ASICA6OKHPTURQ5TPG/graph.json","events_json":"https://pith.science/api/pith-number/7DIGJPU4ASICA6OKHPTURQ5TPG/events.json","paper":"https://pith.science/paper/7DIGJPU4"},"agent_actions":{"view_html":"https://pith.science/pith/7DIGJPU4ASICA6OKHPTURQ5TPG","download_json":"https://pith.science/pith/7DIGJPU4ASICA6OKHPTURQ5TPG.json","view_paper":"https://pith.science/paper/7DIGJPU4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.12926&json=true","fetch_graph":"https://pith.science/api/pith-number/7DIGJPU4ASICA6OKHPTURQ5TPG/graph.json","fetch_events":"https://pith.science/api/pith-number/7DIGJPU4ASICA6OKHPTURQ5TPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7DIGJPU4ASICA6OKHPTURQ5TPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7DIGJPU4ASICA6OKHPTURQ5TPG/action/storage_attestation","attest_author":"https://pith.science/pith/7DIGJPU4ASICA6OKHPTURQ5TPG/action/author_attestation","sign_citation":"https://pith.science/pith/7DIGJPU4ASICA6OKHPTURQ5TPG/action/citation_signature","submit_replication":"https://pith.science/pith/7DIGJPU4ASICA6OKHPTURQ5TPG/action/replication_record"}},"created_at":"2026-07-05T03:21:08.589063+00:00","updated_at":"2026-07-05T03:21:08.589063+00:00"}