{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PZZJRFIZLVNLSWLAZ7MWPRCRIL","short_pith_number":"pith:PZZJRFIZ","schema_version":"1.0","canonical_sha256":"7e729895195d5ab95960cfd967c45142f3d2a06d07c567cbaf6e31c32f2cb470","source":{"kind":"arxiv","id":"1812.03684","version":3},"attestation_state":"computed","paper":{"title":"Guided Graph Spectral Embedding: Application to the C. elegans Connectome","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["q-bio.NC","stat.ML"],"primary_cat":"cs.LG","authors_text":"2), 2) ((1) Institute of Bioengineering, (2) Department of Radiology, Campus Biotech, Dimitri Van De Ville (1, \\'Ecole Polytechnique F\\'ed\\'erale de Lausanne, Geneva, Maria Giulia Preti (1, Medical Informatics, Miljan Petrovi\\'c (1, Rapha\\\"el Li\\'egeois (1, Switzerland, Switzerland), Thomas A.W. Bolton (1, University of Geneva","submitted_at":"2018-12-10T09:16:21Z","abstract_excerpt":"Graph spectral analysis can yield meaningful embeddings of graphs by providing insight into distributed features not directly accessible in nodal domain. Recent efforts in graph signal processing have proposed new decompositions-e.g., based on wavelets and Slepians-that can be applied to filter signals defined on the graph. In this work, we take inspiration from these constructions to define a new guided spectral embedding that combines maximizing energy concentration with minimizing modified embedded distance for a given importance weighting of the nodes. We show these optimization goals are "},"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":"1812.03684","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-12-10T09:16:21Z","cross_cats_sorted":["q-bio.NC","stat.ML"],"title_canon_sha256":"3a0403afe754de82fe62bd18dd1fdcbbf43c058a18e121e859df54b009bbaba9","abstract_canon_sha256":"673485fe6f57311fd4211256d9a0726a8542d385f8d38533cfce068d32cc154c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:55.769258Z","signature_b64":"4ZBa3xDl+SceJbnjJus7bMH8t0zm4kJX0/m6IaDDja4V3KSAasCHejsjxAhK/YPulZIIaSUO/yGLSaDIOTkjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e729895195d5ab95960cfd967c45142f3d2a06d07c567cbaf6e31c32f2cb470","last_reissued_at":"2026-05-17T23:51:55.768830Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:55.768830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guided Graph Spectral Embedding: Application to the C. elegans Connectome","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["q-bio.NC","stat.ML"],"primary_cat":"cs.LG","authors_text":"2), 2) ((1) Institute of Bioengineering, (2) Department of Radiology, Campus Biotech, Dimitri Van De Ville (1, \\'Ecole Polytechnique F\\'ed\\'erale de Lausanne, Geneva, Maria Giulia Preti (1, Medical Informatics, Miljan Petrovi\\'c (1, Rapha\\\"el Li\\'egeois (1, Switzerland, Switzerland), Thomas A.W. Bolton (1, University of Geneva","submitted_at":"2018-12-10T09:16:21Z","abstract_excerpt":"Graph spectral analysis can yield meaningful embeddings of graphs by providing insight into distributed features not directly accessible in nodal domain. Recent efforts in graph signal processing have proposed new decompositions-e.g., based on wavelets and Slepians-that can be applied to filter signals defined on the graph. In this work, we take inspiration from these constructions to define a new guided spectral embedding that combines maximizing energy concentration with minimizing modified embedded distance for a given importance weighting of the nodes. We show these optimization goals are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.03684","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":""},"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":"1812.03684","created_at":"2026-05-17T23:51:55.768892+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.03684v3","created_at":"2026-05-17T23:51:55.768892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.03684","created_at":"2026-05-17T23:51:55.768892+00:00"},{"alias_kind":"pith_short_12","alias_value":"PZZJRFIZLVNL","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_16","alias_value":"PZZJRFIZLVNLSWLA","created_at":"2026-05-18T12:32:46.962924+00:00"},{"alias_kind":"pith_short_8","alias_value":"PZZJRFIZ","created_at":"2026-05-18T12:32:46.962924+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/PZZJRFIZLVNLSWLAZ7MWPRCRIL","json":"https://pith.science/pith/PZZJRFIZLVNLSWLAZ7MWPRCRIL.json","graph_json":"https://pith.science/api/pith-number/PZZJRFIZLVNLSWLAZ7MWPRCRIL/graph.json","events_json":"https://pith.science/api/pith-number/PZZJRFIZLVNLSWLAZ7MWPRCRIL/events.json","paper":"https://pith.science/paper/PZZJRFIZ"},"agent_actions":{"view_html":"https://pith.science/pith/PZZJRFIZLVNLSWLAZ7MWPRCRIL","download_json":"https://pith.science/pith/PZZJRFIZLVNLSWLAZ7MWPRCRIL.json","view_paper":"https://pith.science/paper/PZZJRFIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.03684&json=true","fetch_graph":"https://pith.science/api/pith-number/PZZJRFIZLVNLSWLAZ7MWPRCRIL/graph.json","fetch_events":"https://pith.science/api/pith-number/PZZJRFIZLVNLSWLAZ7MWPRCRIL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PZZJRFIZLVNLSWLAZ7MWPRCRIL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PZZJRFIZLVNLSWLAZ7MWPRCRIL/action/storage_attestation","attest_author":"https://pith.science/pith/PZZJRFIZLVNLSWLAZ7MWPRCRIL/action/author_attestation","sign_citation":"https://pith.science/pith/PZZJRFIZLVNLSWLAZ7MWPRCRIL/action/citation_signature","submit_replication":"https://pith.science/pith/PZZJRFIZLVNLSWLAZ7MWPRCRIL/action/replication_record"}},"created_at":"2026-05-17T23:51:55.768892+00:00","updated_at":"2026-05-17T23:51:55.768892+00:00"}