{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OC6A5LO7G4M7ICUPQUULQ432LH","short_pith_number":"pith:OC6A5LO7","schema_version":"1.0","canonical_sha256":"70bc0eaddf3719f40a8f8528b8737a59deba59f6589dfb7d1488e7312dc9797c","source":{"kind":"arxiv","id":"1811.12164","version":1},"attestation_state":"computed","paper":{"title":"Symmetrization for Embedding Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.SI","authors_text":"Jiankai Sun, Srinivasan Parthasarathy","submitted_at":"2018-11-06T14:20:44Z","abstract_excerpt":"Recently, one has seen a surge of interest in developing such methods including ones for learning such representations for (undirected) graphs (while preserving important properties). However, most of the work to date on embedding graphs has targeted undirected networks and very little has focused on the thorny issue of embedding directed networks. In this paper, we instead propose to solve the directed graph embedding problem via a two-stage approach: in the first stage, the graph is symmetrized in one of several possible ways, and in the second stage, the so-obtained symmetrized graph is emb"},"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":"1811.12164","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-11-06T14:20:44Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"8eb1d9d93468350ab4b1fbf74aa74e00db397e18e06d78512d1174c0e27e555d","abstract_canon_sha256":"a7f1f2a2fb9cbe1763cbd2939061bc5b183f92707a1fbb7df65807ab0c77b711"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:34.248839Z","signature_b64":"HEXbPIEUlm5JYWpIy857ITme38KeJRdas0M9fShXKWqzICIW2B+wn1nVlifpzc0ghoxZkAzmH0EqZEKK5FNCCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70bc0eaddf3719f40a8f8528b8737a59deba59f6589dfb7d1488e7312dc9797c","last_reissued_at":"2026-05-17T23:59:34.248097Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:34.248097Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Symmetrization for Embedding Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.SI","authors_text":"Jiankai Sun, Srinivasan Parthasarathy","submitted_at":"2018-11-06T14:20:44Z","abstract_excerpt":"Recently, one has seen a surge of interest in developing such methods including ones for learning such representations for (undirected) graphs (while preserving important properties). However, most of the work to date on embedding graphs has targeted undirected networks and very little has focused on the thorny issue of embedding directed networks. In this paper, we instead propose to solve the directed graph embedding problem via a two-stage approach: in the first stage, the graph is symmetrized in one of several possible ways, and in the second stage, the so-obtained symmetrized graph is emb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12164","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":"1811.12164","created_at":"2026-05-17T23:59:34.248216+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.12164v1","created_at":"2026-05-17T23:59:34.248216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12164","created_at":"2026-05-17T23:59:34.248216+00:00"},{"alias_kind":"pith_short_12","alias_value":"OC6A5LO7G4M7","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OC6A5LO7G4M7ICUP","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OC6A5LO7","created_at":"2026-05-18T12:32:43.782077+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/OC6A5LO7G4M7ICUPQUULQ432LH","json":"https://pith.science/pith/OC6A5LO7G4M7ICUPQUULQ432LH.json","graph_json":"https://pith.science/api/pith-number/OC6A5LO7G4M7ICUPQUULQ432LH/graph.json","events_json":"https://pith.science/api/pith-number/OC6A5LO7G4M7ICUPQUULQ432LH/events.json","paper":"https://pith.science/paper/OC6A5LO7"},"agent_actions":{"view_html":"https://pith.science/pith/OC6A5LO7G4M7ICUPQUULQ432LH","download_json":"https://pith.science/pith/OC6A5LO7G4M7ICUPQUULQ432LH.json","view_paper":"https://pith.science/paper/OC6A5LO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.12164&json=true","fetch_graph":"https://pith.science/api/pith-number/OC6A5LO7G4M7ICUPQUULQ432LH/graph.json","fetch_events":"https://pith.science/api/pith-number/OC6A5LO7G4M7ICUPQUULQ432LH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OC6A5LO7G4M7ICUPQUULQ432LH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OC6A5LO7G4M7ICUPQUULQ432LH/action/storage_attestation","attest_author":"https://pith.science/pith/OC6A5LO7G4M7ICUPQUULQ432LH/action/author_attestation","sign_citation":"https://pith.science/pith/OC6A5LO7G4M7ICUPQUULQ432LH/action/citation_signature","submit_replication":"https://pith.science/pith/OC6A5LO7G4M7ICUPQUULQ432LH/action/replication_record"}},"created_at":"2026-05-17T23:59:34.248216+00:00","updated_at":"2026-05-17T23:59:34.248216+00:00"}