{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:JYEYFURXALINUHEJ4HFCRB56V4","short_pith_number":"pith:JYEYFURX","canonical_record":{"source":{"id":"1108.4705","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-08-23T21:37:28Z","cross_cats_sorted":[],"title_canon_sha256":"bbadbd0090775201be61227dcbbe12ce324802f5126aeb9f670620073e659339","abstract_canon_sha256":"dd6762c35c8857b8b5f98726d787e1586a81521d724cc896f01a28429d7af0fa"},"schema_version":"1.0"},"canonical_sha256":"4e0982d23702d0da1c89e1ca2887beaf05bbc121a33fcebb62c5fc974fd2d17f","source":{"kind":"arxiv","id":"1108.4705","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4705","created_at":"2026-05-18T01:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4705v3","created_at":"2026-05-18T01:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4705","created_at":"2026-05-18T01:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"JYEYFURXALIN","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JYEYFURXALINUHEJ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JYEYFURX","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:JYEYFURXALINUHEJ4HFCRB56V4","target":"record","payload":{"canonical_record":{"source":{"id":"1108.4705","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-08-23T21:37:28Z","cross_cats_sorted":[],"title_canon_sha256":"bbadbd0090775201be61227dcbbe12ce324802f5126aeb9f670620073e659339","abstract_canon_sha256":"dd6762c35c8857b8b5f98726d787e1586a81521d724cc896f01a28429d7af0fa"},"schema_version":"1.0"},"canonical_sha256":"4e0982d23702d0da1c89e1ca2887beaf05bbc121a33fcebb62c5fc974fd2d17f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:51.965548Z","signature_b64":"EAwu+QLMZr6Tawk6yHrMPVwVLjQNirQzxO2n6pbhdYhyqHXx5zNqV4q3qMGuo2Hqu2RYZ0EhUllHubEcfxIPDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e0982d23702d0da1c89e1ca2887beaf05bbc121a33fcebb62c5fc974fd2d17f","last_reissued_at":"2026-05-18T01:36:51.965059Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:51.965059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.4705","source_version":3,"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-18T01:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Mz/zTLtefaeQMDWle36h61UhQVgnpzgTu6nYi1dRXb3cKKCTP+bhb6s6GBpjXxgoREyT+juMYwQZ8uwEFjdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T00:04:38.572041Z"},"content_sha256":"8bd30ce51534bfc6d8d132c36a4cb315c70a167d982850d5f23bed82cf014355","schema_version":"1.0","event_id":"sha256:8bd30ce51534bfc6d8d132c36a4cb315c70a167d982850d5f23bed82cf014355"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:JYEYFURXALINUHEJ4HFCRB56V4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Inapproximability of Orthogonal Compaction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"David Eppstein, Joseph A. Simons, Michael J. Bannister","submitted_at":"2011-08-23T21:37:28Z","abstract_excerpt":"We show that several problems of compacting orthogonal graph drawings to use the minimum number of rows, area, length of longest edge or total edge length cannot be approximated better than within a polynomial factor of optimal in polynomial time unless P = NP. We also provide a fixed-parameter-tractable algorithm for testing whether a drawing can be compacted to a small number of rows."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4705","kind":"arxiv","version":3},"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-18T01:36:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bk0nHrQZmbWfFEFzR5dts0x5E4ksCRdmxTKIJnxTXbKSdaPXCwQ0EC2x8pqLnQUYrloYTeSq94wrorgHWn/JCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T00:04:38.572384Z"},"content_sha256":"f6be25ef3c0b303c17b60fdef578bf76fb4ab52322d1df4986cef29d7d46f920","schema_version":"1.0","event_id":"sha256:f6be25ef3c0b303c17b60fdef578bf76fb4ab52322d1df4986cef29d7d46f920"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JYEYFURXALINUHEJ4HFCRB56V4/bundle.json","state_url":"https://pith.science/pith/JYEYFURXALINUHEJ4HFCRB56V4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JYEYFURXALINUHEJ4HFCRB56V4/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-25T00:04:38Z","links":{"resolver":"https://pith.science/pith/JYEYFURXALINUHEJ4HFCRB56V4","bundle":"https://pith.science/pith/JYEYFURXALINUHEJ4HFCRB56V4/bundle.json","state":"https://pith.science/pith/JYEYFURXALINUHEJ4HFCRB56V4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JYEYFURXALINUHEJ4HFCRB56V4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JYEYFURXALINUHEJ4HFCRB56V4","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":"dd6762c35c8857b8b5f98726d787e1586a81521d724cc896f01a28429d7af0fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-08-23T21:37:28Z","title_canon_sha256":"bbadbd0090775201be61227dcbbe12ce324802f5126aeb9f670620073e659339"},"schema_version":"1.0","source":{"id":"1108.4705","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4705","created_at":"2026-05-18T01:36:51Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4705v3","created_at":"2026-05-18T01:36:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4705","created_at":"2026-05-18T01:36:51Z"},{"alias_kind":"pith_short_12","alias_value":"JYEYFURXALIN","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JYEYFURXALINUHEJ","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JYEYFURX","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:f6be25ef3c0b303c17b60fdef578bf76fb4ab52322d1df4986cef29d7d46f920","target":"graph","created_at":"2026-05-18T01:36: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":"We show that several problems of compacting orthogonal graph drawings to use the minimum number of rows, area, length of longest edge or total edge length cannot be approximated better than within a polynomial factor of optimal in polynomial time unless P = NP. We also provide a fixed-parameter-tractable algorithm for testing whether a drawing can be compacted to a small number of rows.","authors_text":"David Eppstein, Joseph A. Simons, Michael J. Bannister","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-08-23T21:37:28Z","title":"Inapproximability of Orthogonal Compaction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4705","kind":"arxiv","version":3},"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:8bd30ce51534bfc6d8d132c36a4cb315c70a167d982850d5f23bed82cf014355","target":"record","created_at":"2026-05-18T01:36: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":"dd6762c35c8857b8b5f98726d787e1586a81521d724cc896f01a28429d7af0fa","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-08-23T21:37:28Z","title_canon_sha256":"bbadbd0090775201be61227dcbbe12ce324802f5126aeb9f670620073e659339"},"schema_version":"1.0","source":{"id":"1108.4705","kind":"arxiv","version":3}},"canonical_sha256":"4e0982d23702d0da1c89e1ca2887beaf05bbc121a33fcebb62c5fc974fd2d17f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e0982d23702d0da1c89e1ca2887beaf05bbc121a33fcebb62c5fc974fd2d17f","first_computed_at":"2026-05-18T01:36:51.965059Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:51.965059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EAwu+QLMZr6Tawk6yHrMPVwVLjQNirQzxO2n6pbhdYhyqHXx5zNqV4q3qMGuo2Hqu2RYZ0EhUllHubEcfxIPDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:51.965548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.4705","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8bd30ce51534bfc6d8d132c36a4cb315c70a167d982850d5f23bed82cf014355","sha256:f6be25ef3c0b303c17b60fdef578bf76fb4ab52322d1df4986cef29d7d46f920"],"state_sha256":"a80aff4a39d98ec856945ec26283c6e48ca20c79655deccfc44fd7e3a5da9701"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GBtHtZiJ0qfXtCCoFjCOnSVFdQSI8htkHsPmiKE4qx9MkvA43NhG/k8aJ64ShRjnfKZ50A+VOYRZRXAU0ZAlCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T00:04:38.574108Z","bundle_sha256":"c110821f1bfe222425f15246575cd19ae8ccf2186d6d299fca0187ba9966666a"}}