{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:6LCAV3L6OCAR2NMVDGUM7BJVK6","short_pith_number":"pith:6LCAV3L6","schema_version":"1.0","canonical_sha256":"f2c40aed7e70811d359519a8cf853557bcea7aa10336836f4a80d00ebf6dee23","source":{"kind":"arxiv","id":"2111.03030","version":2},"attestation_state":"computed","paper":{"title":"Exact Representation of Sparse Networks with Symmetric Nonnegative Embeddings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Anup Rao, Cameron Musco, Nedim Lipka, Ryan A. Rossi, Sudhanshu Chanpuriya, Tung Mai, Zhao Song","submitted_at":"2021-11-04T17:34:39Z","abstract_excerpt":"Many models for undirected graphs are based on factorizing the graph's adjacency matrix; these models find a vector representation of each node such that the predicted probability of a link between two nodes increases with the similarity (dot product) of their associated vectors. Recent work has shown that these models are unable to capture key structures in real-world graphs, particularly heterophilous structures, wherein links occur between dissimilar nodes. In contrast, a factorization with two vectors per node, based on logistic principal components analysis (LPCA), has been proven not onl"},"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":"2111.03030","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-11-04T17:34:39Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"b664d7e708b6d26befb39601768ac0de4536ef4030a6c323fdc8afd165c874aa","abstract_canon_sha256":"2c1b13586bf01669ef3cbfa7eb2a8710a59da44349e6bcccec824ce008a2ab7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:02:23.799018Z","signature_b64":"VnlowEE7UCbQ010tmzJBvJlRKJtsdz3UsghM6675XkO785CRPSU/zDW+4ahMz1paIjulwr+RMPYNYkhxb2e0Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2c40aed7e70811d359519a8cf853557bcea7aa10336836f4a80d00ebf6dee23","last_reissued_at":"2026-07-05T05:02:23.798566Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:02:23.798566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Representation of Sparse Networks with Symmetric Nonnegative Embeddings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Anup Rao, Cameron Musco, Nedim Lipka, Ryan A. Rossi, Sudhanshu Chanpuriya, Tung Mai, Zhao Song","submitted_at":"2021-11-04T17:34:39Z","abstract_excerpt":"Many models for undirected graphs are based on factorizing the graph's adjacency matrix; these models find a vector representation of each node such that the predicted probability of a link between two nodes increases with the similarity (dot product) of their associated vectors. Recent work has shown that these models are unable to capture key structures in real-world graphs, particularly heterophilous structures, wherein links occur between dissimilar nodes. In contrast, a factorization with two vectors per node, based on logistic principal components analysis (LPCA), has been proven not onl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.03030","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/2111.03030/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":"2111.03030","created_at":"2026-07-05T05:02:23.798632+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.03030v2","created_at":"2026-07-05T05:02:23.798632+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.03030","created_at":"2026-07-05T05:02:23.798632+00:00"},{"alias_kind":"pith_short_12","alias_value":"6LCAV3L6OCAR","created_at":"2026-07-05T05:02:23.798632+00:00"},{"alias_kind":"pith_short_16","alias_value":"6LCAV3L6OCAR2NMV","created_at":"2026-07-05T05:02:23.798632+00:00"},{"alias_kind":"pith_short_8","alias_value":"6LCAV3L6","created_at":"2026-07-05T05:02:23.798632+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/6LCAV3L6OCAR2NMVDGUM7BJVK6","json":"https://pith.science/pith/6LCAV3L6OCAR2NMVDGUM7BJVK6.json","graph_json":"https://pith.science/api/pith-number/6LCAV3L6OCAR2NMVDGUM7BJVK6/graph.json","events_json":"https://pith.science/api/pith-number/6LCAV3L6OCAR2NMVDGUM7BJVK6/events.json","paper":"https://pith.science/paper/6LCAV3L6"},"agent_actions":{"view_html":"https://pith.science/pith/6LCAV3L6OCAR2NMVDGUM7BJVK6","download_json":"https://pith.science/pith/6LCAV3L6OCAR2NMVDGUM7BJVK6.json","view_paper":"https://pith.science/paper/6LCAV3L6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.03030&json=true","fetch_graph":"https://pith.science/api/pith-number/6LCAV3L6OCAR2NMVDGUM7BJVK6/graph.json","fetch_events":"https://pith.science/api/pith-number/6LCAV3L6OCAR2NMVDGUM7BJVK6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6LCAV3L6OCAR2NMVDGUM7BJVK6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6LCAV3L6OCAR2NMVDGUM7BJVK6/action/storage_attestation","attest_author":"https://pith.science/pith/6LCAV3L6OCAR2NMVDGUM7BJVK6/action/author_attestation","sign_citation":"https://pith.science/pith/6LCAV3L6OCAR2NMVDGUM7BJVK6/action/citation_signature","submit_replication":"https://pith.science/pith/6LCAV3L6OCAR2NMVDGUM7BJVK6/action/replication_record"}},"created_at":"2026-07-05T05:02:23.798632+00:00","updated_at":"2026-07-05T05:02:23.798632+00:00"}