{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QNVPZN27GRQQOPIXUJDOFZVVKR","short_pith_number":"pith:QNVPZN27","schema_version":"1.0","canonical_sha256":"836afcb75f3461073d17a246e2e6b55453882522470b37b05d862e3417678781","source":{"kind":"arxiv","id":"2307.13818","version":2},"attestation_state":"computed","paper":{"title":"Gradient-Based Spectral Embeddings of Random Dot Product Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Bernardo Marenco, Federico Larroca, Gonzalo Mateos, Marcelo Fiori, Paola Bermolen","submitted_at":"2023-07-25T21:09:55Z","abstract_excerpt":"The Random Dot Product Graph (RDPG) is a generative model for relational data, where nodes are represented via latent vectors in low-dimensional Euclidean space. RDPGs crucially postulate that edge formation probabilities are given by the dot product of the corresponding latent positions. Accordingly, the embedding task of estimating these vectors from an observed graph is typically posed as a low-rank matrix factorization problem. The workhorse Adjacency Spectral Embedding (ASE) enjoys solid statistical properties, but it is formally solving a surrogate problem and can be computationally inte"},"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":"2307.13818","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-07-25T21:09:55Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b84f1a93b6359d7324155f21c35c2b5a015968ea616c0564533cdebe608033c7","abstract_canon_sha256":"97fc6cb357c00366280f812b7b0832189095e61a14896fee049f69d766ce02b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:21:43.463893Z","signature_b64":"rU01t5Y7ExF1JMPZQjHEF5XthAT2SoHisaoU7E3Mi6PRusBbEC2HkqrftowW4ozXiJVm/Z2uVYP19g07tcjoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"836afcb75f3461073d17a246e2e6b55453882522470b37b05d862e3417678781","last_reissued_at":"2026-07-05T07:21:43.463374Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:21:43.463374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient-Based Spectral Embeddings of Random Dot Product Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Bernardo Marenco, Federico Larroca, Gonzalo Mateos, Marcelo Fiori, Paola Bermolen","submitted_at":"2023-07-25T21:09:55Z","abstract_excerpt":"The Random Dot Product Graph (RDPG) is a generative model for relational data, where nodes are represented via latent vectors in low-dimensional Euclidean space. RDPGs crucially postulate that edge formation probabilities are given by the dot product of the corresponding latent positions. Accordingly, the embedding task of estimating these vectors from an observed graph is typically posed as a low-rank matrix factorization problem. The workhorse Adjacency Spectral Embedding (ASE) enjoys solid statistical properties, but it is formally solving a surrogate problem and can be computationally inte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.13818","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/2307.13818/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":"2307.13818","created_at":"2026-07-05T07:21:43.463442+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.13818v2","created_at":"2026-07-05T07:21:43.463442+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.13818","created_at":"2026-07-05T07:21:43.463442+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNVPZN27GRQQ","created_at":"2026-07-05T07:21:43.463442+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNVPZN27GRQQOPIX","created_at":"2026-07-05T07:21:43.463442+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNVPZN27","created_at":"2026-07-05T07:21:43.463442+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.02675","citing_title":"Attractor-Based Coevolving Dot Product Random Graph Model","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QNVPZN27GRQQOPIXUJDOFZVVKR","json":"https://pith.science/pith/QNVPZN27GRQQOPIXUJDOFZVVKR.json","graph_json":"https://pith.science/api/pith-number/QNVPZN27GRQQOPIXUJDOFZVVKR/graph.json","events_json":"https://pith.science/api/pith-number/QNVPZN27GRQQOPIXUJDOFZVVKR/events.json","paper":"https://pith.science/paper/QNVPZN27"},"agent_actions":{"view_html":"https://pith.science/pith/QNVPZN27GRQQOPIXUJDOFZVVKR","download_json":"https://pith.science/pith/QNVPZN27GRQQOPIXUJDOFZVVKR.json","view_paper":"https://pith.science/paper/QNVPZN27","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.13818&json=true","fetch_graph":"https://pith.science/api/pith-number/QNVPZN27GRQQOPIXUJDOFZVVKR/graph.json","fetch_events":"https://pith.science/api/pith-number/QNVPZN27GRQQOPIXUJDOFZVVKR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNVPZN27GRQQOPIXUJDOFZVVKR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNVPZN27GRQQOPIXUJDOFZVVKR/action/storage_attestation","attest_author":"https://pith.science/pith/QNVPZN27GRQQOPIXUJDOFZVVKR/action/author_attestation","sign_citation":"https://pith.science/pith/QNVPZN27GRQQOPIXUJDOFZVVKR/action/citation_signature","submit_replication":"https://pith.science/pith/QNVPZN27GRQQOPIXUJDOFZVVKR/action/replication_record"}},"created_at":"2026-07-05T07:21:43.463442+00:00","updated_at":"2026-07-05T07:21:43.463442+00:00"}