{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EFP4YY3MDIMUW67N327L5ALTJR","short_pith_number":"pith:EFP4YY3M","canonical_record":{"source":{"id":"1707.06844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-21T11:17:27Z","cross_cats_sorted":[],"title_canon_sha256":"737e585131c7e9b4061f4736550d1c2ef8953408929547b87aee90aafaf0c2df","abstract_canon_sha256":"777c6e89bbb28e87ea098f522e3a8fcc461d64ab5d305d19f9305132d81d4eb9"},"schema_version":"1.0"},"canonical_sha256":"215fcc636c1a194b7beddebebe81734c4ff0685575958b3e671f8e9062e7f63c","source":{"kind":"arxiv","id":"1707.06844","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06844","created_at":"2026-05-18T00:39:51Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06844v1","created_at":"2026-05-18T00:39:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06844","created_at":"2026-05-18T00:39:51Z"},{"alias_kind":"pith_short_12","alias_value":"EFP4YY3MDIMU","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EFP4YY3MDIMUW67N","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EFP4YY3M","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EFP4YY3MDIMUW67N327L5ALTJR","target":"record","payload":{"canonical_record":{"source":{"id":"1707.06844","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-21T11:17:27Z","cross_cats_sorted":[],"title_canon_sha256":"737e585131c7e9b4061f4736550d1c2ef8953408929547b87aee90aafaf0c2df","abstract_canon_sha256":"777c6e89bbb28e87ea098f522e3a8fcc461d64ab5d305d19f9305132d81d4eb9"},"schema_version":"1.0"},"canonical_sha256":"215fcc636c1a194b7beddebebe81734c4ff0685575958b3e671f8e9062e7f63c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:51.401481Z","signature_b64":"ogffcGG9oxDSZ/iPdfQTBPtl2NpYI2irEGzNq0ZstBiX69f+iyBkZd0l8G0Y00tp3/6stpeCWRvMEGCot57aDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"215fcc636c1a194b7beddebebe81734c4ff0685575958b3e671f8e9062e7f63c","last_reissued_at":"2026-05-18T00:39:51.400651Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:51.400651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.06844","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-18T00:39:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tRItOplz87RpI3vFs/IKCpE10HiR/P1PWY1p8tUYWLYYWErOf2U3kgu5nbCyHUpBG9+ooh1tOdsBf1LLW6JaDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:05:03.609652Z"},"content_sha256":"6c219e13e72d24792c9e7a7d132710b499684c8709a91ee4a997bec10f24311f","schema_version":"1.0","event_id":"sha256:6c219e13e72d24792c9e7a7d132710b499684c8709a91ee4a997bec10f24311f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EFP4YY3MDIMUW67N327L5ALTJR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Partial Planarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael A. Bekos, Patrizio Angelini","submitted_at":"2017-07-21T11:17:27Z","abstract_excerpt":"In this paper we consider graphs whose edges are associated with a degree of {\\em importance}, which may depend on the type of connections they represent or on how recently they appeared in the scene, in a streaming setting. The goal is to construct layouts of these graphs in which the readability of an edge is proportional to its importance, that is, more important edges have fewer crossings. We formalize this problem and study the case in which there exist three different degrees of importance. We give a polynomial-time testing algorithm when the graph induced by the two most important sets "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06844","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-18T00:39:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bXfRpr+fqAiz8NGcErkMpQvu/AZyhJwlkG+vzNDB6lU4Y2AQF/efbVLVzexNUTFkQyIyteNX08cTl3NGMAlbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:05:03.609983Z"},"content_sha256":"be75c13640482f4e049da5790deafda4c699ef89de949f86735fe4a771bce41a","schema_version":"1.0","event_id":"sha256:be75c13640482f4e049da5790deafda4c699ef89de949f86735fe4a771bce41a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EFP4YY3MDIMUW67N327L5ALTJR/bundle.json","state_url":"https://pith.science/pith/EFP4YY3MDIMUW67N327L5ALTJR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EFP4YY3MDIMUW67N327L5ALTJR/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-21T19:05:03Z","links":{"resolver":"https://pith.science/pith/EFP4YY3MDIMUW67N327L5ALTJR","bundle":"https://pith.science/pith/EFP4YY3MDIMUW67N327L5ALTJR/bundle.json","state":"https://pith.science/pith/EFP4YY3MDIMUW67N327L5ALTJR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EFP4YY3MDIMUW67N327L5ALTJR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EFP4YY3MDIMUW67N327L5ALTJR","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":"777c6e89bbb28e87ea098f522e3a8fcc461d64ab5d305d19f9305132d81d4eb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-21T11:17:27Z","title_canon_sha256":"737e585131c7e9b4061f4736550d1c2ef8953408929547b87aee90aafaf0c2df"},"schema_version":"1.0","source":{"id":"1707.06844","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.06844","created_at":"2026-05-18T00:39:51Z"},{"alias_kind":"arxiv_version","alias_value":"1707.06844v1","created_at":"2026-05-18T00:39:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06844","created_at":"2026-05-18T00:39:51Z"},{"alias_kind":"pith_short_12","alias_value":"EFP4YY3MDIMU","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EFP4YY3MDIMUW67N","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EFP4YY3M","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:be75c13640482f4e049da5790deafda4c699ef89de949f86735fe4a771bce41a","target":"graph","created_at":"2026-05-18T00:39:51Z","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":"In this paper we consider graphs whose edges are associated with a degree of {\\em importance}, which may depend on the type of connections they represent or on how recently they appeared in the scene, in a streaming setting. The goal is to construct layouts of these graphs in which the readability of an edge is proportional to its importance, that is, more important edges have fewer crossings. We formalize this problem and study the case in which there exist three different degrees of importance. We give a polynomial-time testing algorithm when the graph induced by the two most important sets ","authors_text":"Michael A. Bekos, Patrizio Angelini","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-21T11:17:27Z","title":"Hierarchical Partial Planarity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06844","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:6c219e13e72d24792c9e7a7d132710b499684c8709a91ee4a997bec10f24311f","target":"record","created_at":"2026-05-18T00:39:51Z","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":"777c6e89bbb28e87ea098f522e3a8fcc461d64ab5d305d19f9305132d81d4eb9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-21T11:17:27Z","title_canon_sha256":"737e585131c7e9b4061f4736550d1c2ef8953408929547b87aee90aafaf0c2df"},"schema_version":"1.0","source":{"id":"1707.06844","kind":"arxiv","version":1}},"canonical_sha256":"215fcc636c1a194b7beddebebe81734c4ff0685575958b3e671f8e9062e7f63c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"215fcc636c1a194b7beddebebe81734c4ff0685575958b3e671f8e9062e7f63c","first_computed_at":"2026-05-18T00:39:51.400651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:51.400651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ogffcGG9oxDSZ/iPdfQTBPtl2NpYI2irEGzNq0ZstBiX69f+iyBkZd0l8G0Y00tp3/6stpeCWRvMEGCot57aDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:51.401481Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.06844","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c219e13e72d24792c9e7a7d132710b499684c8709a91ee4a997bec10f24311f","sha256:be75c13640482f4e049da5790deafda4c699ef89de949f86735fe4a771bce41a"],"state_sha256":"cf325efd74cf83c943cb0207ee6a6f84bcd8f9a95751cd4f7dd2b65a53412049"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/rXO2ooNBtiFeUtfQQc8pBXiObuN8Q40jFNY3cdHlYEU1XjME5QSMlBjCnvc4WmSNr3xaZi2U0Uctfnf4YiXAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T19:05:03.611747Z","bundle_sha256":"efef9a3453793b9ca551352393dbd3fc0f12cba398b11b1f8f407bdff2c8f725"}}