{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:N26ZVD3GEFNFNCCXW77IPLJP4T","short_pith_number":"pith:N26ZVD3G","canonical_record":{"source":{"id":"2306.15339","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-06-27T09:49:31Z","cross_cats_sorted":[],"title_canon_sha256":"89a4702b0e0d23f0e2b5aecd352b9eda67206c184c48c04652f97210dcd88649","abstract_canon_sha256":"b668bf250d8a55458cd8bee77a14eb656153783622aa9a5e6aa01b4256ab56e6"},"schema_version":"1.0"},"canonical_sha256":"6ebd9a8f66215a568857b7fe87ad2fe4d5b66c6fa02ccd12ddc67f99d7906992","source":{"kind":"arxiv","id":"2306.15339","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.15339","created_at":"2026-07-05T06:24:57Z"},{"alias_kind":"arxiv_version","alias_value":"2306.15339v1","created_at":"2026-07-05T06:24:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.15339","created_at":"2026-07-05T06:24:57Z"},{"alias_kind":"pith_short_12","alias_value":"N26ZVD3GEFNF","created_at":"2026-07-05T06:24:57Z"},{"alias_kind":"pith_short_16","alias_value":"N26ZVD3GEFNFNCCX","created_at":"2026-07-05T06:24:57Z"},{"alias_kind":"pith_short_8","alias_value":"N26ZVD3G","created_at":"2026-07-05T06:24:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:N26ZVD3GEFNFNCCXW77IPLJP4T","target":"record","payload":{"canonical_record":{"source":{"id":"2306.15339","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-06-27T09:49:31Z","cross_cats_sorted":[],"title_canon_sha256":"89a4702b0e0d23f0e2b5aecd352b9eda67206c184c48c04652f97210dcd88649","abstract_canon_sha256":"b668bf250d8a55458cd8bee77a14eb656153783622aa9a5e6aa01b4256ab56e6"},"schema_version":"1.0"},"canonical_sha256":"6ebd9a8f66215a568857b7fe87ad2fe4d5b66c6fa02ccd12ddc67f99d7906992","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:24:57.959178Z","signature_b64":"G/PoflhZLKOOgX4OV8BXOEncD79O058JVYNurCM0Fri0xktGXz2G61XldVR/xgnnObBBg6/+RUaceGMwlWXEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ebd9a8f66215a568857b7fe87ad2fe4d5b66c6fa02ccd12ddc67f99d7906992","last_reissued_at":"2026-07-05T06:24:57.958812Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:24:57.958812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2306.15339","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-07-05T06:24:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uzMSoc1M0areVYG3VDdZJJQaH5Itqnvzo6f/rR8pCaO6bRm2/sgZk6ayqfYeEwbYodeYeCXTVpOmrmtPopuqBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:41:56.488926Z"},"content_sha256":"2aaf9ffb6cc8d3534a901b49c1de321acc922eba1f3348bd4eee336c4c5fe197","schema_version":"1.0","event_id":"sha256:2aaf9ffb6cc8d3534a901b49c1de321acc922eba1f3348bd4eee336c4c5fe197"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:N26ZVD3GEFNFNCCXW77IPLJP4T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on the Complexity of One-Sided Crossing Minimization of Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander Dobler","submitted_at":"2023-06-27T09:49:31Z","abstract_excerpt":"In 2011, Harrigan and Healy published a polynomial-time algorithm for one-sided crossing minimization for trees. We point out a counterexample to that algorithm, and show that one-sided crossing minimization is NP-hard for trees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.15339","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.15339/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"},"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-07-05T06:24:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c2fPpm4e5WfcCewuF1J7m8a8XEOHTEdb320ZfAkHgwPHF9A9gzmOpzfQqTJllGhSQELEQzT9VIidgp39u319Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T21:41:56.489440Z"},"content_sha256":"cc28abe48da0d2f9b2b02446d35495e0d46c4333ec499963461d87754a17aa24","schema_version":"1.0","event_id":"sha256:cc28abe48da0d2f9b2b02446d35495e0d46c4333ec499963461d87754a17aa24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N26ZVD3GEFNFNCCXW77IPLJP4T/bundle.json","state_url":"https://pith.science/pith/N26ZVD3GEFNFNCCXW77IPLJP4T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N26ZVD3GEFNFNCCXW77IPLJP4T/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-08-12T21:41:56Z","links":{"resolver":"https://pith.science/pith/N26ZVD3GEFNFNCCXW77IPLJP4T","bundle":"https://pith.science/pith/N26ZVD3GEFNFNCCXW77IPLJP4T/bundle.json","state":"https://pith.science/pith/N26ZVD3GEFNFNCCXW77IPLJP4T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N26ZVD3GEFNFNCCXW77IPLJP4T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:N26ZVD3GEFNFNCCXW77IPLJP4T","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":"b668bf250d8a55458cd8bee77a14eb656153783622aa9a5e6aa01b4256ab56e6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-06-27T09:49:31Z","title_canon_sha256":"89a4702b0e0d23f0e2b5aecd352b9eda67206c184c48c04652f97210dcd88649"},"schema_version":"1.0","source":{"id":"2306.15339","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2306.15339","created_at":"2026-07-05T06:24:57Z"},{"alias_kind":"arxiv_version","alias_value":"2306.15339v1","created_at":"2026-07-05T06:24:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.15339","created_at":"2026-07-05T06:24:57Z"},{"alias_kind":"pith_short_12","alias_value":"N26ZVD3GEFNF","created_at":"2026-07-05T06:24:57Z"},{"alias_kind":"pith_short_16","alias_value":"N26ZVD3GEFNFNCCX","created_at":"2026-07-05T06:24:57Z"},{"alias_kind":"pith_short_8","alias_value":"N26ZVD3G","created_at":"2026-07-05T06:24:57Z"}],"graph_snapshots":[{"event_id":"sha256:cc28abe48da0d2f9b2b02446d35495e0d46c4333ec499963461d87754a17aa24","target":"graph","created_at":"2026-07-05T06:24:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2306.15339/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In 2011, Harrigan and Healy published a polynomial-time algorithm for one-sided crossing minimization for trees. We point out a counterexample to that algorithm, and show that one-sided crossing minimization is NP-hard for trees.","authors_text":"Alexander Dobler","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-06-27T09:49:31Z","title":"A Note on the Complexity of One-Sided Crossing Minimization of Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.15339","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:2aaf9ffb6cc8d3534a901b49c1de321acc922eba1f3348bd4eee336c4c5fe197","target":"record","created_at":"2026-07-05T06:24:57Z","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":"b668bf250d8a55458cd8bee77a14eb656153783622aa9a5e6aa01b4256ab56e6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2023-06-27T09:49:31Z","title_canon_sha256":"89a4702b0e0d23f0e2b5aecd352b9eda67206c184c48c04652f97210dcd88649"},"schema_version":"1.0","source":{"id":"2306.15339","kind":"arxiv","version":1}},"canonical_sha256":"6ebd9a8f66215a568857b7fe87ad2fe4d5b66c6fa02ccd12ddc67f99d7906992","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ebd9a8f66215a568857b7fe87ad2fe4d5b66c6fa02ccd12ddc67f99d7906992","first_computed_at":"2026-07-05T06:24:57.958812Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:24:57.958812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G/PoflhZLKOOgX4OV8BXOEncD79O058JVYNurCM0Fri0xktGXz2G61XldVR/xgnnObBBg6/+RUaceGMwlWXEDA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:24:57.959178Z","signed_message":"canonical_sha256_bytes"},"source_id":"2306.15339","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2aaf9ffb6cc8d3534a901b49c1de321acc922eba1f3348bd4eee336c4c5fe197","sha256:cc28abe48da0d2f9b2b02446d35495e0d46c4333ec499963461d87754a17aa24"],"state_sha256":"a3e0fa2160fac5d60d111e324acd3c236142a2c02b210625f4714808679d0bd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FHQGeRw8hYQrSVMZ5K8XEtx0aQk3nq398LdEfGK7hZrRF5Od7xcDV6OQKJuI+9p/IwBPArZRQttYTEDTwj8NBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T21:41:56.493018Z","bundle_sha256":"013a14786b939aef0fe2ff5c9c8b59273c0ddd10282d0322df57fa537745767d"}}