{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QU24RCJKDOAYEYNDFDPPHOL7XL","short_pith_number":"pith:QU24RCJK","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"},"canonical_sha256":"8535c8892a1b818261a328def3b97fbae3266251fffcf08893880fd8183aa6b2","source":{"kind":"arxiv","id":"1302.0870","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0870","created_at":"2026-05-18T03:34:26Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0870v1","created_at":"2026-05-18T03:34:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0870","created_at":"2026-05-18T03:34:26Z"},{"alias_kind":"pith_short_12","alias_value":"QU24RCJKDOAY","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QU24RCJKDOAYEYND","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QU24RCJK","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QU24RCJKDOAYEYNDFDPPHOL7XL","target":"record","payload":{"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"},"canonical_sha256":"8535c8892a1b818261a328def3b97fbae3266251fffcf08893880fd8183aa6b2","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"},"source_kind":"arxiv","source_id":"1302.0870","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:34:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xoiROq7fQo5+75N/85UfzSd9TtRw4ZUFi6MIjulKL4/RuoiZeqqqRcxoBtCMA1m31RjlKblXvgm58g9JxG6rAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:09:58.895075Z"},"content_sha256":"64720c9a5de9f38f8b6e771fb6ca42a9340f3a5643546f4f9bee7ce77f6350ee","schema_version":"1.0","event_id":"sha256:64720c9a5de9f38f8b6e771fb6ca42a9340f3a5643546f4f9bee7ce77f6350ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QU24RCJKDOAYEYNDFDPPHOL7XL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:34:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7MtFUoOqg9ajoOkpaGnCBx2+cgcNXFTwSv/p0yR3mAoyRkBWd0QZWzgtJ0EA+uA2l3ALU92W0JiYKaqNRRiWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T14:09:58.895451Z"},"content_sha256":"e35892c7f5d76ad0a17738dcb43250e1f5301d38a49ac50338e9452d773c95c7","schema_version":"1.0","event_id":"sha256:e35892c7f5d76ad0a17738dcb43250e1f5301d38a49ac50338e9452d773c95c7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QU24RCJKDOAYEYNDFDPPHOL7XL/bundle.json","state_url":"https://pith.science/pith/QU24RCJKDOAYEYNDFDPPHOL7XL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QU24RCJKDOAYEYNDFDPPHOL7XL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T14:09:58Z","links":{"resolver":"https://pith.science/pith/QU24RCJKDOAYEYNDFDPPHOL7XL","bundle":"https://pith.science/pith/QU24RCJKDOAYEYNDFDPPHOL7XL/bundle.json","state":"https://pith.science/pith/QU24RCJKDOAYEYNDFDPPHOL7XL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QU24RCJKDOAYEYNDFDPPHOL7XL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QU24RCJKDOAYEYNDFDPPHOL7XL","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"de09b8e96abf5a941ee74a6e2ba1f714d22d88ca41620f44855b4b7b4c37f525","cross_cats_sorted":["cs.CV","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-02-04T21:26:47Z","title_canon_sha256":"3925786c135590b31f75aed7b06324bafa9aee6a6e3448b06900cb8ac1e28fa6"},"schema_version":"1.0","source":{"id":"1302.0870","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0870","created_at":"2026-05-18T03:34:26Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0870v1","created_at":"2026-05-18T03:34:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0870","created_at":"2026-05-18T03:34:26Z"},{"alias_kind":"pith_short_12","alias_value":"QU24RCJKDOAY","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QU24RCJKDOAYEYND","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QU24RCJK","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:e35892c7f5d76ad0a17738dcb43250e1f5301d38a49ac50338e9452d773c95c7","target":"graph","created_at":"2026-05-18T03:34:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Brian Baingana, Georgios B. Giannakis","cross_cats":["cs.CV","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-02-04T21:26:47Z","title":"Centrality-constrained graph embedding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0870","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:64720c9a5de9f38f8b6e771fb6ca42a9340f3a5643546f4f9bee7ce77f6350ee","target":"record","created_at":"2026-05-18T03:34:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"de09b8e96abf5a941ee74a6e2ba1f714d22d88ca41620f44855b4b7b4c37f525","cross_cats_sorted":["cs.CV","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-02-04T21:26:47Z","title_canon_sha256":"3925786c135590b31f75aed7b06324bafa9aee6a6e3448b06900cb8ac1e28fa6"},"schema_version":"1.0","source":{"id":"1302.0870","kind":"arxiv","version":1}},"canonical_sha256":"8535c8892a1b818261a328def3b97fbae3266251fffcf08893880fd8183aa6b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8535c8892a1b818261a328def3b97fbae3266251fffcf08893880fd8183aa6b2","first_computed_at":"2026-05-18T03:34:26.896083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:26.896083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2PVkbXorewhTB/8vca0Sm6KgVbYMj8Jlk8Ed6CBN/qjA+kMVVS1GFbMtEvOLaEfcSr7w9zyYaXhL61BUduKwCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:26.896614Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.0870","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64720c9a5de9f38f8b6e771fb6ca42a9340f3a5643546f4f9bee7ce77f6350ee","sha256:e35892c7f5d76ad0a17738dcb43250e1f5301d38a49ac50338e9452d773c95c7"],"state_sha256":"d72d542cc8ee5b05376d9516f937d1521425f858491e2c533ba217eb4d5f4549"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Zf9GPDqQGWECzOUEqEn7bpoxo/vOtERjy0FOw2KXgsQYvkpuJJwqArfJFO+S/dp99V3WciJmIfwMS56it0RDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T14:09:58.897518Z","bundle_sha256":"e614ad87ac31c1f15714473c4961719d556f421a985a452abb1af7c06d119428"}}