{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:767K46OIDBJKFCDYMF5EJDO7U5","short_pith_number":"pith:767K46OI","canonical_record":{"source":{"id":"1308.6706","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-30T10:48:25Z","cross_cats_sorted":[],"title_canon_sha256":"88b42ead68fec0cd4d8f8060fe6d8d449156c36a0aabbbcc1602e6b437ff76ee","abstract_canon_sha256":"e9dcbb48a9f3536fcca2d0247e3fcd70e1c8c8334af597ab93ea8626ca96e283"},"schema_version":"1.0"},"canonical_sha256":"ffbeae79c81852a28878617a448ddfa74aef5cfdaddf3f7d042f171469f83751","source":{"kind":"arxiv","id":"1308.6706","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6706","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6706v2","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6706","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"pith_short_12","alias_value":"767K46OIDBJK","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"767K46OIDBJKFCDY","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"767K46OI","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:767K46OIDBJKFCDYMF5EJDO7U5","target":"record","payload":{"canonical_record":{"source":{"id":"1308.6706","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-30T10:48:25Z","cross_cats_sorted":[],"title_canon_sha256":"88b42ead68fec0cd4d8f8060fe6d8d449156c36a0aabbbcc1602e6b437ff76ee","abstract_canon_sha256":"e9dcbb48a9f3536fcca2d0247e3fcd70e1c8c8334af597ab93ea8626ca96e283"},"schema_version":"1.0"},"canonical_sha256":"ffbeae79c81852a28878617a448ddfa74aef5cfdaddf3f7d042f171469f83751","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:39.610021Z","signature_b64":"Z18EW7x0RcUc8cSNx8cqix+lt37vcX4silfSVy7Jin5HanR2oP0sydfTZToPLM95xyeY7ynWdrEHxL4P6rtFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffbeae79c81852a28878617a448ddfa74aef5cfdaddf3f7d042f171469f83751","last_reissued_at":"2026-05-18T02:45:39.609536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:39.609536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.6706","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-18T02:45:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lgJXxQkkpv9QgeFYvpMpHiqikjj/Mvc+87CxNFRLlKKAyqAUInBTOn2fN44yLqsZxFv+xBW1hF5IK6IV1RPtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:59:44.992499Z"},"content_sha256":"0c2916f50910cc34bb3975278c3faddd4ed76675284b03e0619ae329ad44c4a6","schema_version":"1.0","event_id":"sha256:0c2916f50910cc34bb3975278c3faddd4ed76675284b03e0619ae329ad44c4a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:767K46OIDBJKFCDYMF5EJDO7U5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Carla Binucci, Fabrizio Montecchiani, Giordano Da Lozzo, Ioannis G. Tollis, Luca Grilli, Maurizio Patrignani, Patrizio Angelini, Walter Didimo","submitted_at":"2013-08-30T10:48:25Z","abstract_excerpt":"We initiate the study of the following problem: Given a non-planar graph G and a planar subgraph S of G, does there exist a straight-line drawing {\\Gamma} of G in the plane such that the edges of S are not crossed in {\\Gamma} by any edge of G? We give positive and negative results for different kinds of connected spanning subgraphs S of G. Moreover, in order to enlarge the subset of instances that admit a solution, we consider the possibility of bending the edges of G not in S; in this setting we discuss different trade-offs between the number of bends and the required drawing area."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6706","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-18T02:45:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qf5VcHBtAk/X74Vio5/tIEH76U2tquD+9lnzcLXxug2X4zNHYApcINFK4HxjXmSGIJkJXW8GSIM91rJHM/pnBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:59:44.993205Z"},"content_sha256":"eff45a5082026cdc07a40c149e2c04bde9a51a88f7d00e3fa2a5b66c5e05c73c","schema_version":"1.0","event_id":"sha256:eff45a5082026cdc07a40c149e2c04bde9a51a88f7d00e3fa2a5b66c5e05c73c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/767K46OIDBJKFCDYMF5EJDO7U5/bundle.json","state_url":"https://pith.science/pith/767K46OIDBJKFCDYMF5EJDO7U5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/767K46OIDBJKFCDYMF5EJDO7U5/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-05-26T12:59:44Z","links":{"resolver":"https://pith.science/pith/767K46OIDBJKFCDYMF5EJDO7U5","bundle":"https://pith.science/pith/767K46OIDBJKFCDYMF5EJDO7U5/bundle.json","state":"https://pith.science/pith/767K46OIDBJKFCDYMF5EJDO7U5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/767K46OIDBJKFCDYMF5EJDO7U5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:767K46OIDBJKFCDYMF5EJDO7U5","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":"e9dcbb48a9f3536fcca2d0247e3fcd70e1c8c8334af597ab93ea8626ca96e283","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-30T10:48:25Z","title_canon_sha256":"88b42ead68fec0cd4d8f8060fe6d8d449156c36a0aabbbcc1602e6b437ff76ee"},"schema_version":"1.0","source":{"id":"1308.6706","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6706","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6706v2","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6706","created_at":"2026-05-18T02:45:39Z"},{"alias_kind":"pith_short_12","alias_value":"767K46OIDBJK","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"767K46OIDBJKFCDY","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"767K46OI","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:eff45a5082026cdc07a40c149e2c04bde9a51a88f7d00e3fa2a5b66c5e05c73c","target":"graph","created_at":"2026-05-18T02:45:39Z","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":"We initiate the study of the following problem: Given a non-planar graph G and a planar subgraph S of G, does there exist a straight-line drawing {\\Gamma} of G in the plane such that the edges of S are not crossed in {\\Gamma} by any edge of G? We give positive and negative results for different kinds of connected spanning subgraphs S of G. Moreover, in order to enlarge the subset of instances that admit a solution, we consider the possibility of bending the edges of G not in S; in this setting we discuss different trade-offs between the number of bends and the required drawing area.","authors_text":"Carla Binucci, Fabrizio Montecchiani, Giordano Da Lozzo, Ioannis G. Tollis, Luca Grilli, Maurizio Patrignani, Patrizio Angelini, Walter Didimo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-30T10:48:25Z","title":"Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6706","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:0c2916f50910cc34bb3975278c3faddd4ed76675284b03e0619ae329ad44c4a6","target":"record","created_at":"2026-05-18T02:45:39Z","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":"e9dcbb48a9f3536fcca2d0247e3fcd70e1c8c8334af597ab93ea8626ca96e283","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-08-30T10:48:25Z","title_canon_sha256":"88b42ead68fec0cd4d8f8060fe6d8d449156c36a0aabbbcc1602e6b437ff76ee"},"schema_version":"1.0","source":{"id":"1308.6706","kind":"arxiv","version":2}},"canonical_sha256":"ffbeae79c81852a28878617a448ddfa74aef5cfdaddf3f7d042f171469f83751","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffbeae79c81852a28878617a448ddfa74aef5cfdaddf3f7d042f171469f83751","first_computed_at":"2026-05-18T02:45:39.609536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:39.609536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z18EW7x0RcUc8cSNx8cqix+lt37vcX4silfSVy7Jin5HanR2oP0sydfTZToPLM95xyeY7ynWdrEHxL4P6rtFAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:39.610021Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.6706","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c2916f50910cc34bb3975278c3faddd4ed76675284b03e0619ae329ad44c4a6","sha256:eff45a5082026cdc07a40c149e2c04bde9a51a88f7d00e3fa2a5b66c5e05c73c"],"state_sha256":"b2340a9297cdd062d7a8ba5a061dacdad1da41843d3906eee4d2a68c4d076407"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yZPuWJS9TTVAKa1hdpLY23LD3HnV2O/cQnBo65bbdhZ5WcjtzsmHY3RLw4b0SPgjGBkOKykb/xyLyE+Kc0cRCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:59:44.996658Z","bundle_sha256":"214e03d5f0825f30fa93d2947132352e9228f2dc18beb884094d109cb09aeda2"}}