{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OCEZSEEN4OEXGKEMAJIYC5SAM2","short_pith_number":"pith:OCEZSEEN","schema_version":"1.0","canonical_sha256":"708999108de38973288c025181764066bc00eba624722fdaeb1edf7b0c7a26d2","source":{"kind":"arxiv","id":"1506.04383","version":2},"attestation_state":"computed","paper":{"title":"Drawing Large Graphs by Multilevel Maxent-Stress Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Henning Meyerhenke, Martin N\\\"ollenburg","submitted_at":"2015-06-14T11:53:36Z","abstract_excerpt":"Drawing large graphs appropriately is an important step for the visual analysis of data from real-world networks. Here we present a novel multilevel algorithm to compute a graph layout with respect to a recently proposed metric that combines layout stress and entropy. As opposed to previous work, we do not solve the linear systems of the maxent-stress metric with a typical numerical solver. Instead we use a simple local iterative scheme within a multilevel approach. To accelerate local optimization, we approximate long-range forces and use shared-memory parallelism. Our experiments validate th"},"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":"1506.04383","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-14T11:53:36Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"3fae50b23e87dc41f8444fe181be185c17e2d74ed7765acd5b69c94face2ada6","abstract_canon_sha256":"e7fe2486e5102c9e27004ff6ce1cbf43ce93c1d684515606e48597c52e8ec14d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:34.672647Z","signature_b64":"PvgSspEl+8e6HJ/bkifHwAd4lroUCStyjN7/wDWllDcDj3JlQ2sk5HUWso3VmhqLvgKJWcusIzhs6LfAC/EXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"708999108de38973288c025181764066bc00eba624722fdaeb1edf7b0c7a26d2","last_reissued_at":"2026-05-18T01:35:34.671947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:34.671947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Drawing Large Graphs by Multilevel Maxent-Stress Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Henning Meyerhenke, Martin N\\\"ollenburg","submitted_at":"2015-06-14T11:53:36Z","abstract_excerpt":"Drawing large graphs appropriately is an important step for the visual analysis of data from real-world networks. Here we present a novel multilevel algorithm to compute a graph layout with respect to a recently proposed metric that combines layout stress and entropy. As opposed to previous work, we do not solve the linear systems of the maxent-stress metric with a typical numerical solver. Instead we use a simple local iterative scheme within a multilevel approach. To accelerate local optimization, we approximate long-range forces and use shared-memory parallelism. Our experiments validate th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04383","kind":"arxiv","version":2},"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":"1506.04383","created_at":"2026-05-18T01:35:34.672055+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.04383v2","created_at":"2026-05-18T01:35:34.672055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04383","created_at":"2026-05-18T01:35:34.672055+00:00"},{"alias_kind":"pith_short_12","alias_value":"OCEZSEEN4OEX","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OCEZSEEN4OEXGKEM","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OCEZSEEN","created_at":"2026-05-18T12:29:34.919912+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/OCEZSEEN4OEXGKEMAJIYC5SAM2","json":"https://pith.science/pith/OCEZSEEN4OEXGKEMAJIYC5SAM2.json","graph_json":"https://pith.science/api/pith-number/OCEZSEEN4OEXGKEMAJIYC5SAM2/graph.json","events_json":"https://pith.science/api/pith-number/OCEZSEEN4OEXGKEMAJIYC5SAM2/events.json","paper":"https://pith.science/paper/OCEZSEEN"},"agent_actions":{"view_html":"https://pith.science/pith/OCEZSEEN4OEXGKEMAJIYC5SAM2","download_json":"https://pith.science/pith/OCEZSEEN4OEXGKEMAJIYC5SAM2.json","view_paper":"https://pith.science/paper/OCEZSEEN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.04383&json=true","fetch_graph":"https://pith.science/api/pith-number/OCEZSEEN4OEXGKEMAJIYC5SAM2/graph.json","fetch_events":"https://pith.science/api/pith-number/OCEZSEEN4OEXGKEMAJIYC5SAM2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OCEZSEEN4OEXGKEMAJIYC5SAM2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OCEZSEEN4OEXGKEMAJIYC5SAM2/action/storage_attestation","attest_author":"https://pith.science/pith/OCEZSEEN4OEXGKEMAJIYC5SAM2/action/author_attestation","sign_citation":"https://pith.science/pith/OCEZSEEN4OEXGKEMAJIYC5SAM2/action/citation_signature","submit_replication":"https://pith.science/pith/OCEZSEEN4OEXGKEMAJIYC5SAM2/action/replication_record"}},"created_at":"2026-05-18T01:35:34.672055+00:00","updated_at":"2026-05-18T01:35:34.672055+00:00"}