{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:26EP64DTM574SUPMDWPNDMOPNS","short_pith_number":"pith:26EP64DT","schema_version":"1.0","canonical_sha256":"d788ff7073677fc951ec1d9ed1b1cf6c8fc194e50d89bf628d11636be70f580c","source":{"kind":"arxiv","id":"1904.11027","version":1},"attestation_state":"computed","paper":{"title":"Generalized Modularity Embedding: a General Framework for Network Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Cheng-Shang Chang, Chia-Tai Chang, Ching-Chu Huang, Duan-Shin Lee, Ping-En Lu","submitted_at":"2019-04-24T19:16:25Z","abstract_excerpt":"The network embedding problem aims to map nodes that are similar to each other to vectors in a Euclidean space that are close to each other. Like centrality analysis (ranking) and community detection, network embedding is in general considered as an ill-posed problem, and its solution may depend on a person's view on this problem. In this book chapter, we adopt the framework of sampled graphs that treat a person's view as a sampling method for a network. The modularity for a sampled graph, called the generalized modularity in the book chapter, is a similarity matrix that has a specific probabi"},"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":"1904.11027","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2019-04-24T19:16:25Z","cross_cats_sorted":[],"title_canon_sha256":"0fa614f6cdbc2209116c970ff10810d5955c23684e7a9bf67ad88a3c65a7a38a","abstract_canon_sha256":"077f0f720838d9dcd0c4f9911dbb3d484f49d27e62419a1a3b02b8d71d81eca2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:47.843510Z","signature_b64":"2jMnIyc/W7oG6KuIuet89UMMycZhuZZGAuaBph1TVyqflzSgMi637c3wKDcff8QnGKC9FhS3/x53IA03Z+LmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d788ff7073677fc951ec1d9ed1b1cf6c8fc194e50d89bf628d11636be70f580c","last_reissued_at":"2026-05-17T23:47:47.842890Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:47.842890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Modularity Embedding: a General Framework for Network Embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Cheng-Shang Chang, Chia-Tai Chang, Ching-Chu Huang, Duan-Shin Lee, Ping-En Lu","submitted_at":"2019-04-24T19:16:25Z","abstract_excerpt":"The network embedding problem aims to map nodes that are similar to each other to vectors in a Euclidean space that are close to each other. Like centrality analysis (ranking) and community detection, network embedding is in general considered as an ill-posed problem, and its solution may depend on a person's view on this problem. In this book chapter, we adopt the framework of sampled graphs that treat a person's view as a sampling method for a network. The modularity for a sampled graph, called the generalized modularity in the book chapter, is a similarity matrix that has a specific probabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11027","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":""},"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":"1904.11027","created_at":"2026-05-17T23:47:47.842990+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.11027v1","created_at":"2026-05-17T23:47:47.842990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11027","created_at":"2026-05-17T23:47:47.842990+00:00"},{"alias_kind":"pith_short_12","alias_value":"26EP64DTM574","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"26EP64DTM574SUPM","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"26EP64DT","created_at":"2026-05-18T12:33:07.085635+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/26EP64DTM574SUPMDWPNDMOPNS","json":"https://pith.science/pith/26EP64DTM574SUPMDWPNDMOPNS.json","graph_json":"https://pith.science/api/pith-number/26EP64DTM574SUPMDWPNDMOPNS/graph.json","events_json":"https://pith.science/api/pith-number/26EP64DTM574SUPMDWPNDMOPNS/events.json","paper":"https://pith.science/paper/26EP64DT"},"agent_actions":{"view_html":"https://pith.science/pith/26EP64DTM574SUPMDWPNDMOPNS","download_json":"https://pith.science/pith/26EP64DTM574SUPMDWPNDMOPNS.json","view_paper":"https://pith.science/paper/26EP64DT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.11027&json=true","fetch_graph":"https://pith.science/api/pith-number/26EP64DTM574SUPMDWPNDMOPNS/graph.json","fetch_events":"https://pith.science/api/pith-number/26EP64DTM574SUPMDWPNDMOPNS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/26EP64DTM574SUPMDWPNDMOPNS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/26EP64DTM574SUPMDWPNDMOPNS/action/storage_attestation","attest_author":"https://pith.science/pith/26EP64DTM574SUPMDWPNDMOPNS/action/author_attestation","sign_citation":"https://pith.science/pith/26EP64DTM574SUPMDWPNDMOPNS/action/citation_signature","submit_replication":"https://pith.science/pith/26EP64DTM574SUPMDWPNDMOPNS/action/replication_record"}},"created_at":"2026-05-17T23:47:47.842990+00:00","updated_at":"2026-05-17T23:47:47.842990+00:00"}