{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:2SYRZ7YQGN3HONU74BJHDYEBPN","short_pith_number":"pith:2SYRZ7YQ","schema_version":"1.0","canonical_sha256":"d4b11cff10337677369fe05271e0817b655b8e5ca2eb6211aad1b9f92811cbb5","source":{"kind":"arxiv","id":"2009.14441","version":1},"attestation_state":"computed","paper":{"title":"Spectral Embedding of Graph Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Shay Deutsch, Stefano Soatto","submitted_at":"2020-09-30T04:59:10Z","abstract_excerpt":"We introduce an unsupervised graph embedding that trades off local node similarity and connectivity, and global structure. The embedding is based on a generalized graph Laplacian, whose eigenvectors compactly capture both network structure and neighborhood proximity in a single representation. The key idea is to transform the given graph into one whose weights measure the centrality of an edge by the fraction of the number of shortest paths that pass through that edge, and employ its spectral proprieties in the representation. Testing the resulting graph network representation shows significan"},"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":"2009.14441","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-30T04:59:10Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"0f2812d48f3271dda28e09dde10271e204745facea593aa5c21b8bc674d3bcd8","abstract_canon_sha256":"d1ba92469f4f50adecdbc50ec3977f4bf014b218d0a4199650e746ce012445cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:39:19.359581Z","signature_b64":"doRniKMSyA8YXTOPBwdx8Z2gMp7+WpH2krxZVRY085CPclU4Bz9+M7ZY31vU4zWRQdXisypqTpTUSIFEQdddAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4b11cff10337677369fe05271e0817b655b8e5ca2eb6211aad1b9f92811cbb5","last_reissued_at":"2026-07-05T01:39:19.359208Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:39:19.359208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Embedding of Graph Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Shay Deutsch, Stefano Soatto","submitted_at":"2020-09-30T04:59:10Z","abstract_excerpt":"We introduce an unsupervised graph embedding that trades off local node similarity and connectivity, and global structure. The embedding is based on a generalized graph Laplacian, whose eigenvectors compactly capture both network structure and neighborhood proximity in a single representation. The key idea is to transform the given graph into one whose weights measure the centrality of an edge by the fraction of the number of shortest paths that pass through that edge, and employ its spectral proprieties in the representation. Testing the resulting graph network representation shows significan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.14441","kind":"arxiv","version":1},"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/2009.14441/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":"2009.14441","created_at":"2026-07-05T01:39:19.359267+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.14441v1","created_at":"2026-07-05T01:39:19.359267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.14441","created_at":"2026-07-05T01:39:19.359267+00:00"},{"alias_kind":"pith_short_12","alias_value":"2SYRZ7YQGN3H","created_at":"2026-07-05T01:39:19.359267+00:00"},{"alias_kind":"pith_short_16","alias_value":"2SYRZ7YQGN3HONU7","created_at":"2026-07-05T01:39:19.359267+00:00"},{"alias_kind":"pith_short_8","alias_value":"2SYRZ7YQ","created_at":"2026-07-05T01:39:19.359267+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.07451","citing_title":"An Analysis of Architectural and Operational Dynamics of Phishkits in the Wild","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2SYRZ7YQGN3HONU74BJHDYEBPN","json":"https://pith.science/pith/2SYRZ7YQGN3HONU74BJHDYEBPN.json","graph_json":"https://pith.science/api/pith-number/2SYRZ7YQGN3HONU74BJHDYEBPN/graph.json","events_json":"https://pith.science/api/pith-number/2SYRZ7YQGN3HONU74BJHDYEBPN/events.json","paper":"https://pith.science/paper/2SYRZ7YQ"},"agent_actions":{"view_html":"https://pith.science/pith/2SYRZ7YQGN3HONU74BJHDYEBPN","download_json":"https://pith.science/pith/2SYRZ7YQGN3HONU74BJHDYEBPN.json","view_paper":"https://pith.science/paper/2SYRZ7YQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.14441&json=true","fetch_graph":"https://pith.science/api/pith-number/2SYRZ7YQGN3HONU74BJHDYEBPN/graph.json","fetch_events":"https://pith.science/api/pith-number/2SYRZ7YQGN3HONU74BJHDYEBPN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2SYRZ7YQGN3HONU74BJHDYEBPN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2SYRZ7YQGN3HONU74BJHDYEBPN/action/storage_attestation","attest_author":"https://pith.science/pith/2SYRZ7YQGN3HONU74BJHDYEBPN/action/author_attestation","sign_citation":"https://pith.science/pith/2SYRZ7YQGN3HONU74BJHDYEBPN/action/citation_signature","submit_replication":"https://pith.science/pith/2SYRZ7YQGN3HONU74BJHDYEBPN/action/replication_record"}},"created_at":"2026-07-05T01:39:19.359267+00:00","updated_at":"2026-07-05T01:39:19.359267+00:00"}