{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:Q2LA27DOLCYCJ4EIAEPQDYCDP3","short_pith_number":"pith:Q2LA27DO","canonical_record":{"source":{"id":"1708.09815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-31T16:59:52Z","cross_cats_sorted":[],"title_canon_sha256":"4e194850a1ceb683625ed8cf2251e3572d716d8a12b9fb617824e3fef8e6568d","abstract_canon_sha256":"f80ed1c2b1bb500491904bc75583ada249321c4b65357edb644102123344fa30"},"schema_version":"1.0"},"canonical_sha256":"86960d7c6e58b024f088011f01e0437ed1936eef7f4d2de0721aab60c75371e1","source":{"kind":"arxiv","id":"1708.09815","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09815","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09815v2","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09815","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"Q2LA27DOLCYC","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q2LA27DOLCYCJ4EI","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q2LA27DO","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:Q2LA27DOLCYCJ4EIAEPQDYCDP3","target":"record","payload":{"canonical_record":{"source":{"id":"1708.09815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-31T16:59:52Z","cross_cats_sorted":[],"title_canon_sha256":"4e194850a1ceb683625ed8cf2251e3572d716d8a12b9fb617824e3fef8e6568d","abstract_canon_sha256":"f80ed1c2b1bb500491904bc75583ada249321c4b65357edb644102123344fa30"},"schema_version":"1.0"},"canonical_sha256":"86960d7c6e58b024f088011f01e0437ed1936eef7f4d2de0721aab60c75371e1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:20.818536Z","signature_b64":"vt+VGyKIX6I5UBwFO7dx02IoY4ZqQ9/LkflmsfU7y3u8+JS9gnNx4QUlgrUFJKiDU7kS35VItCq2Mkj7pX6DBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86960d7c6e58b024f088011f01e0437ed1936eef7f4d2de0721aab60c75371e1","last_reissued_at":"2026-05-18T00:06:20.818030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:20.818030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.09815","source_version":2,"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-18T00:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GRBOJBYWUAIigBIC9rusF9mh+MeniYkaGFyC4Z5+Ydd87k4JqWksKFLSPDb6r949rp0IAvgOgqUUxjupElwpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:39:06.987091Z"},"content_sha256":"ada820677d31ebd5058572451de9f41ddc27123032060753eb216b26796c322b","schema_version":"1.0","event_id":"sha256:ada820677d31ebd5058572451de9f41ddc27123032060753eb216b26796c322b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:Q2LA27DOLCYCJ4EIAEPQDYCDP3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Experimental analysis of the accessibility of drawings with few segments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e Schulz, Philipp Kindermann, Wouter Meulemans","submitted_at":"2017-08-31T16:59:52Z","abstract_excerpt":"The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges, e.g., one needs only one line segment to draw two collinear incident edges. We study the question if drawings with few segments have a better aesthetic appeal and help the user to asses the underlying graph. We design an experiment that investigates two different graph types (trees and sparse graphs), three different layout algorithms for trees, and two different layout algorithms for sparse graphs. We asked the users "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09815","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"},"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-18T00:06:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gWon7dMCZ9rl2A+NDtMoFXAlB6fwKiXhERVvROkkB87Ko2AeDW1sdpky3dg7gCyyRemQn6JRZzoSWRpRcJbRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T12:39:06.987485Z"},"content_sha256":"e33172babd0ccad225d44204e60d9efdaa9770eba1b886f6c3cb128b6b23ee63","schema_version":"1.0","event_id":"sha256:e33172babd0ccad225d44204e60d9efdaa9770eba1b886f6c3cb128b6b23ee63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q2LA27DOLCYCJ4EIAEPQDYCDP3/bundle.json","state_url":"https://pith.science/pith/Q2LA27DOLCYCJ4EIAEPQDYCDP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q2LA27DOLCYCJ4EIAEPQDYCDP3/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-03T12:39:06Z","links":{"resolver":"https://pith.science/pith/Q2LA27DOLCYCJ4EIAEPQDYCDP3","bundle":"https://pith.science/pith/Q2LA27DOLCYCJ4EIAEPQDYCDP3/bundle.json","state":"https://pith.science/pith/Q2LA27DOLCYCJ4EIAEPQDYCDP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q2LA27DOLCYCJ4EIAEPQDYCDP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Q2LA27DOLCYCJ4EIAEPQDYCDP3","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":"f80ed1c2b1bb500491904bc75583ada249321c4b65357edb644102123344fa30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-31T16:59:52Z","title_canon_sha256":"4e194850a1ceb683625ed8cf2251e3572d716d8a12b9fb617824e3fef8e6568d"},"schema_version":"1.0","source":{"id":"1708.09815","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09815","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09815v2","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09815","created_at":"2026-05-18T00:06:20Z"},{"alias_kind":"pith_short_12","alias_value":"Q2LA27DOLCYC","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q2LA27DOLCYCJ4EI","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q2LA27DO","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:e33172babd0ccad225d44204e60d9efdaa9770eba1b886f6c3cb128b6b23ee63","target":"graph","created_at":"2026-05-18T00:06:20Z","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":"The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges, e.g., one needs only one line segment to draw two collinear incident edges. We study the question if drawings with few segments have a better aesthetic appeal and help the user to asses the underlying graph. We design an experiment that investigates two different graph types (trees and sparse graphs), three different layout algorithms for trees, and two different layout algorithms for sparse graphs. We asked the users ","authors_text":"Andr\\'e Schulz, Philipp Kindermann, Wouter Meulemans","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-31T16:59:52Z","title":"Experimental analysis of the accessibility of drawings with few segments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09815","kind":"arxiv","version":2},"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:ada820677d31ebd5058572451de9f41ddc27123032060753eb216b26796c322b","target":"record","created_at":"2026-05-18T00:06:20Z","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":"f80ed1c2b1bb500491904bc75583ada249321c4b65357edb644102123344fa30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-31T16:59:52Z","title_canon_sha256":"4e194850a1ceb683625ed8cf2251e3572d716d8a12b9fb617824e3fef8e6568d"},"schema_version":"1.0","source":{"id":"1708.09815","kind":"arxiv","version":2}},"canonical_sha256":"86960d7c6e58b024f088011f01e0437ed1936eef7f4d2de0721aab60c75371e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86960d7c6e58b024f088011f01e0437ed1936eef7f4d2de0721aab60c75371e1","first_computed_at":"2026-05-18T00:06:20.818030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:20.818030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vt+VGyKIX6I5UBwFO7dx02IoY4ZqQ9/LkflmsfU7y3u8+JS9gnNx4QUlgrUFJKiDU7kS35VItCq2Mkj7pX6DBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:20.818536Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09815","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ada820677d31ebd5058572451de9f41ddc27123032060753eb216b26796c322b","sha256:e33172babd0ccad225d44204e60d9efdaa9770eba1b886f6c3cb128b6b23ee63"],"state_sha256":"666cba6b88f93c18865d6abef37e3dca84349f099764a6ae7e1d4e010939e5df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uXhU8KnvwnQin9ydjwYYGekPiIlGLspRttIoCL6Fepu/Nqh6az9tcbyycG/JkTuK9ZqX8YFrxov4TgxsD5d9Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T12:39:06.989525Z","bundle_sha256":"5ad0804f09b1338cc64fbb64838b817f54467942ddf039ac5394da2985bc7319"}}