{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:Q64MRSQAXUC7WDYTNJ63GFS5SO","short_pith_number":"pith:Q64MRSQA","schema_version":"1.0","canonical_sha256":"87b8c8ca00bd05fb0f136a7db3165d93a5db4c87d44aa7d1f01b1c5c59633779","source":{"kind":"arxiv","id":"1908.01769","version":5},"attestation_state":"computed","paper":{"title":"Stress-Plus-X (SPX) Graph Layout","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CG","authors_text":"Felice De Luca, Katherine E. Isaacs, Reyan Ahmed, Sabin Devkota, Stephen Kobourov","submitted_at":"2019-08-04T22:31:02Z","abstract_excerpt":"Stress, edge crossings, and crossing angles play an important role in the quality and readability of graph drawings. Most standard graph drawing algorithms optimize one of these criteria which may lead to layouts that are deficient in other criteria. We introduce an optimization framework, Stress-Plus-X (SPX), that simultaneously optimizes stress together with several other criteria: edge crossings, minimum crossing angle, and upwardness (for directed acyclic graphs). SPX achieves results that are close to the state-of-the-art algorithms that optimize these metrics individually. SPX is flexibl"},"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":"1908.01769","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-08-04T22:31:02Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"dd11d15e44b74c5e11f434f41c25b1633ed78f5af11c6d25b9e974d066a87dc3","abstract_canon_sha256":"fe3019c924bcd977eb6e0492383e7e623ef599bb9fc5a1f7765d6e0f417064f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:23.268855Z","signature_b64":"/s8alZOHq8P4aJCR1suD1olLPkSVp3fY7WLPpZ8XNiZYUEtGpupkkI8zVy+GsBuqi0eCPut+r3jQWNU/xrSfAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87b8c8ca00bd05fb0f136a7db3165d93a5db4c87d44aa7d1f01b1c5c59633779","last_reissued_at":"2026-07-04T23:59:23.268303Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:23.268303Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stress-Plus-X (SPX) Graph Layout","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CG","authors_text":"Felice De Luca, Katherine E. Isaacs, Reyan Ahmed, Sabin Devkota, Stephen Kobourov","submitted_at":"2019-08-04T22:31:02Z","abstract_excerpt":"Stress, edge crossings, and crossing angles play an important role in the quality and readability of graph drawings. Most standard graph drawing algorithms optimize one of these criteria which may lead to layouts that are deficient in other criteria. We introduce an optimization framework, Stress-Plus-X (SPX), that simultaneously optimizes stress together with several other criteria: edge crossings, minimum crossing angle, and upwardness (for directed acyclic graphs). SPX achieves results that are close to the state-of-the-art algorithms that optimize these metrics individually. SPX is flexibl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.01769","kind":"arxiv","version":5},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.01769/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.01769","created_at":"2026-07-04T23:59:23.268371+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.01769v5","created_at":"2026-07-04T23:59:23.268371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.01769","created_at":"2026-07-04T23:59:23.268371+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q64MRSQAXUC7","created_at":"2026-07-04T23:59:23.268371+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q64MRSQAXUC7WDYT","created_at":"2026-07-04T23:59:23.268371+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q64MRSQA","created_at":"2026-07-04T23:59:23.268371+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/Q64MRSQAXUC7WDYTNJ63GFS5SO","json":"https://pith.science/pith/Q64MRSQAXUC7WDYTNJ63GFS5SO.json","graph_json":"https://pith.science/api/pith-number/Q64MRSQAXUC7WDYTNJ63GFS5SO/graph.json","events_json":"https://pith.science/api/pith-number/Q64MRSQAXUC7WDYTNJ63GFS5SO/events.json","paper":"https://pith.science/paper/Q64MRSQA"},"agent_actions":{"view_html":"https://pith.science/pith/Q64MRSQAXUC7WDYTNJ63GFS5SO","download_json":"https://pith.science/pith/Q64MRSQAXUC7WDYTNJ63GFS5SO.json","view_paper":"https://pith.science/paper/Q64MRSQA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.01769&json=true","fetch_graph":"https://pith.science/api/pith-number/Q64MRSQAXUC7WDYTNJ63GFS5SO/graph.json","fetch_events":"https://pith.science/api/pith-number/Q64MRSQAXUC7WDYTNJ63GFS5SO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q64MRSQAXUC7WDYTNJ63GFS5SO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q64MRSQAXUC7WDYTNJ63GFS5SO/action/storage_attestation","attest_author":"https://pith.science/pith/Q64MRSQAXUC7WDYTNJ63GFS5SO/action/author_attestation","sign_citation":"https://pith.science/pith/Q64MRSQAXUC7WDYTNJ63GFS5SO/action/citation_signature","submit_replication":"https://pith.science/pith/Q64MRSQAXUC7WDYTNJ63GFS5SO/action/replication_record"}},"created_at":"2026-07-04T23:59:23.268371+00:00","updated_at":"2026-07-04T23:59:23.268371+00:00"}