{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QU24RCJKDOAYEYNDFDPPHOL7XL","short_pith_number":"pith:QU24RCJK","schema_version":"1.0","canonical_sha256":"8535c8892a1b818261a328def3b97fbae3266251fffcf08893880fd8183aa6b2","source":{"kind":"arxiv","id":"1302.0870","version":1},"attestation_state":"computed","paper":{"title":"Centrality-constrained graph embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.OC"],"primary_cat":"stat.ML","authors_text":"Brian Baingana, Georgios B. Giannakis","submitted_at":"2013-02-04T21:26:47Z","abstract_excerpt":"Visual rendering of graphs is a key task in the mapping of complex network data. Although most graph drawing algorithms emphasize aesthetic appeal, certain applications such as travel-time maps place more importance on visualization of structural network properties. The present paper advocates a graph embedding approach with centrality considerations to comply with node hierarchy. The problem is formulated as one of constrained multi-dimensional scaling (MDS), and it is solved via block coordinate descent iterations with successive approximations and guaranteed convergence to a KKT point. In a"},"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":"1302.0870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-02-04T21:26:47Z","cross_cats_sorted":["cs.CV","math.OC"],"title_canon_sha256":"3925786c135590b31f75aed7b06324bafa9aee6a6e3448b06900cb8ac1e28fa6","abstract_canon_sha256":"de09b8e96abf5a941ee74a6e2ba1f714d22d88ca41620f44855b4b7b4c37f525"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:26.896614Z","signature_b64":"2PVkbXorewhTB/8vca0Sm6KgVbYMj8Jlk8Ed6CBN/qjA+kMVVS1GFbMtEvOLaEfcSr7w9zyYaXhL61BUduKwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8535c8892a1b818261a328def3b97fbae3266251fffcf08893880fd8183aa6b2","last_reissued_at":"2026-05-18T03:34:26.896083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:26.896083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Centrality-constrained graph embedding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","math.OC"],"primary_cat":"stat.ML","authors_text":"Brian Baingana, Georgios B. Giannakis","submitted_at":"2013-02-04T21:26:47Z","abstract_excerpt":"Visual rendering of graphs is a key task in the mapping of complex network data. Although most graph drawing algorithms emphasize aesthetic appeal, certain applications such as travel-time maps place more importance on visualization of structural network properties. The present paper advocates a graph embedding approach with centrality considerations to comply with node hierarchy. The problem is formulated as one of constrained multi-dimensional scaling (MDS), and it is solved via block coordinate descent iterations with successive approximations and guaranteed convergence to a KKT point. In a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0870","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":"1302.0870","created_at":"2026-05-18T03:34:26.896166+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.0870v1","created_at":"2026-05-18T03:34:26.896166+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0870","created_at":"2026-05-18T03:34:26.896166+00:00"},{"alias_kind":"pith_short_12","alias_value":"QU24RCJKDOAY","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QU24RCJKDOAYEYND","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QU24RCJK","created_at":"2026-05-18T12:27:57.521954+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/QU24RCJKDOAYEYNDFDPPHOL7XL","json":"https://pith.science/pith/QU24RCJKDOAYEYNDFDPPHOL7XL.json","graph_json":"https://pith.science/api/pith-number/QU24RCJKDOAYEYNDFDPPHOL7XL/graph.json","events_json":"https://pith.science/api/pith-number/QU24RCJKDOAYEYNDFDPPHOL7XL/events.json","paper":"https://pith.science/paper/QU24RCJK"},"agent_actions":{"view_html":"https://pith.science/pith/QU24RCJKDOAYEYNDFDPPHOL7XL","download_json":"https://pith.science/pith/QU24RCJKDOAYEYNDFDPPHOL7XL.json","view_paper":"https://pith.science/paper/QU24RCJK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.0870&json=true","fetch_graph":"https://pith.science/api/pith-number/QU24RCJKDOAYEYNDFDPPHOL7XL/graph.json","fetch_events":"https://pith.science/api/pith-number/QU24RCJKDOAYEYNDFDPPHOL7XL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QU24RCJKDOAYEYNDFDPPHOL7XL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QU24RCJKDOAYEYNDFDPPHOL7XL/action/storage_attestation","attest_author":"https://pith.science/pith/QU24RCJKDOAYEYNDFDPPHOL7XL/action/author_attestation","sign_citation":"https://pith.science/pith/QU24RCJKDOAYEYNDFDPPHOL7XL/action/citation_signature","submit_replication":"https://pith.science/pith/QU24RCJKDOAYEYNDFDPPHOL7XL/action/replication_record"}},"created_at":"2026-05-18T03:34:26.896166+00:00","updated_at":"2026-05-18T03:34:26.896166+00:00"}