{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:W36PSHNQSEF7D34SBNH3JRNKA4","short_pith_number":"pith:W36PSHNQ","canonical_record":{"source":{"id":"1401.4408","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-01-17T17:16:25Z","cross_cats_sorted":[],"title_canon_sha256":"a8f99829e53beb9d364deb133b3da609ae2c001461b82a4f50b7a29df9d77b0a","abstract_canon_sha256":"ef92f696f3f28681235bf8d5b8728ed08ede594b3305806952a93fa229228ac0"},"schema_version":"1.0"},"canonical_sha256":"b6fcf91db0910bf1ef920b4fb4c5aa07256042a3448528684ddb4fab27825b2f","source":{"kind":"arxiv","id":"1401.4408","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4408","created_at":"2026-05-18T03:01:55Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4408v1","created_at":"2026-05-18T03:01:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4408","created_at":"2026-05-18T03:01:55Z"},{"alias_kind":"pith_short_12","alias_value":"W36PSHNQSEF7","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W36PSHNQSEF7D34S","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W36PSHNQ","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:W36PSHNQSEF7D34SBNH3JRNKA4","target":"record","payload":{"canonical_record":{"source":{"id":"1401.4408","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-01-17T17:16:25Z","cross_cats_sorted":[],"title_canon_sha256":"a8f99829e53beb9d364deb133b3da609ae2c001461b82a4f50b7a29df9d77b0a","abstract_canon_sha256":"ef92f696f3f28681235bf8d5b8728ed08ede594b3305806952a93fa229228ac0"},"schema_version":"1.0"},"canonical_sha256":"b6fcf91db0910bf1ef920b4fb4c5aa07256042a3448528684ddb4fab27825b2f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:55.106761Z","signature_b64":"G8bK2BLZ0tSDZyFHt0VbY50wOQeC2EYt1NfU/UF9ugQtpnFmlHVrZRCTz1BSCfmNHYH6MHzeyXTMCdz07RFMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6fcf91db0910bf1ef920b4fb4c5aa07256042a3448528684ddb4fab27825b2f","last_reissued_at":"2026-05-18T03:01:55.106137Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:55.106137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.4408","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:01:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y3bswvN+R9V5f+qU7wQbNZ5xTIQ58hZZ1o1JWzvaX1SzTIs1evCjCudihRKR2bn15FjR8Spk9EoXYmzfvJ1jCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:25:18.143147Z"},"content_sha256":"97735fa0b0b5614cff861b29b90c97f8f032628a6414bfc0aa82da0bb08bb0d4","schema_version":"1.0","event_id":"sha256:97735fa0b0b5614cff861b29b90c97f8f032628a6414bfc0aa82da0bb08bb0d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:W36PSHNQSEF7D34SBNH3JRNKA4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Embedding Graphs under Centrality Constraints for Network Visualization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Brian Baingana, Georgios B. Giannakis","submitted_at":"2014-01-17T17:16:25Z","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 two graph embedding approaches with centrality considerations to comply with node hierarchy. The problem is formulated first 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 p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4408","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:01:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QiaTr+N6WBIdnWsqX9xXaLI5vdmgVA0aW8QjlTFvB8bDYX7hLm4S7bNmbLxO+46W0TvOL2vjJkaEPUHbnUpdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:25:18.143519Z"},"content_sha256":"088f80ac08cfbf4b8fbe654b22dba8db066cb8e05d78a37d6d54ede6de21c78d","schema_version":"1.0","event_id":"sha256:088f80ac08cfbf4b8fbe654b22dba8db066cb8e05d78a37d6d54ede6de21c78d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W36PSHNQSEF7D34SBNH3JRNKA4/bundle.json","state_url":"https://pith.science/pith/W36PSHNQSEF7D34SBNH3JRNKA4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W36PSHNQSEF7D34SBNH3JRNKA4/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-03T09:25:18Z","links":{"resolver":"https://pith.science/pith/W36PSHNQSEF7D34SBNH3JRNKA4","bundle":"https://pith.science/pith/W36PSHNQSEF7D34SBNH3JRNKA4/bundle.json","state":"https://pith.science/pith/W36PSHNQSEF7D34SBNH3JRNKA4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W36PSHNQSEF7D34SBNH3JRNKA4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:W36PSHNQSEF7D34SBNH3JRNKA4","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":"ef92f696f3f28681235bf8d5b8728ed08ede594b3305806952a93fa229228ac0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-01-17T17:16:25Z","title_canon_sha256":"a8f99829e53beb9d364deb133b3da609ae2c001461b82a4f50b7a29df9d77b0a"},"schema_version":"1.0","source":{"id":"1401.4408","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4408","created_at":"2026-05-18T03:01:55Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4408v1","created_at":"2026-05-18T03:01:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4408","created_at":"2026-05-18T03:01:55Z"},{"alias_kind":"pith_short_12","alias_value":"W36PSHNQSEF7","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"W36PSHNQSEF7D34S","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"W36PSHNQ","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:088f80ac08cfbf4b8fbe654b22dba8db066cb8e05d78a37d6d54ede6de21c78d","target":"graph","created_at":"2026-05-18T03:01:55Z","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 two graph embedding approaches with centrality considerations to comply with node hierarchy. The problem is formulated first 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 p","authors_text":"Brian Baingana, Georgios B. Giannakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-01-17T17:16:25Z","title":"Embedding Graphs under Centrality Constraints for Network Visualization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4408","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:97735fa0b0b5614cff861b29b90c97f8f032628a6414bfc0aa82da0bb08bb0d4","target":"record","created_at":"2026-05-18T03:01:55Z","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":"ef92f696f3f28681235bf8d5b8728ed08ede594b3305806952a93fa229228ac0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-01-17T17:16:25Z","title_canon_sha256":"a8f99829e53beb9d364deb133b3da609ae2c001461b82a4f50b7a29df9d77b0a"},"schema_version":"1.0","source":{"id":"1401.4408","kind":"arxiv","version":1}},"canonical_sha256":"b6fcf91db0910bf1ef920b4fb4c5aa07256042a3448528684ddb4fab27825b2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6fcf91db0910bf1ef920b4fb4c5aa07256042a3448528684ddb4fab27825b2f","first_computed_at":"2026-05-18T03:01:55.106137Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:55.106137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G8bK2BLZ0tSDZyFHt0VbY50wOQeC2EYt1NfU/UF9ugQtpnFmlHVrZRCTz1BSCfmNHYH6MHzeyXTMCdz07RFMBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:55.106761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4408","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97735fa0b0b5614cff861b29b90c97f8f032628a6414bfc0aa82da0bb08bb0d4","sha256:088f80ac08cfbf4b8fbe654b22dba8db066cb8e05d78a37d6d54ede6de21c78d"],"state_sha256":"8860244a8aacb44ff9decce95f93e8f25fd12f765b3701ac8f1a3fb71ea86a45"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SvPdpum+lZwkswxx4aXb6NV9u8ChAOgAxcEBokZftrWbZh13WkJMzaeGiUMTLreFx64VfZ7YnMRcqhw6lUzrBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:25:18.145521Z","bundle_sha256":"2ac20ec81ceb73eae52c6ce1be0a6123c58ddb56d3f7bc3b86ace3d57d19dd7a"}}