{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:UIASPTZ5Q3GUKOLZ573EDGQBCV","short_pith_number":"pith:UIASPTZ5","canonical_record":{"source":{"id":"1209.0598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-04T10:45:47Z","cross_cats_sorted":[],"title_canon_sha256":"fae10c43b98c506d6f730ec3c33071eba002649d2f922ae4f11aa9bbb25493ee","abstract_canon_sha256":"013052ea9fa6fdfa1c9e7853bcce407dfc990e1519894e2b231fce6c7a35092d"},"schema_version":"1.0"},"canonical_sha256":"a20127cf3d86cd453979eff6419a011549ec60b19d94a167ef5fa0a9457127f5","source":{"kind":"arxiv","id":"1209.0598","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0598","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0598v1","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0598","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"UIASPTZ5Q3GU","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UIASPTZ5Q3GUKOLZ","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UIASPTZ5","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:UIASPTZ5Q3GUKOLZ573EDGQBCV","target":"record","payload":{"canonical_record":{"source":{"id":"1209.0598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-04T10:45:47Z","cross_cats_sorted":[],"title_canon_sha256":"fae10c43b98c506d6f730ec3c33071eba002649d2f922ae4f11aa9bbb25493ee","abstract_canon_sha256":"013052ea9fa6fdfa1c9e7853bcce407dfc990e1519894e2b231fce6c7a35092d"},"schema_version":"1.0"},"canonical_sha256":"a20127cf3d86cd453979eff6419a011549ec60b19d94a167ef5fa0a9457127f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:17.726150Z","signature_b64":"Ai/muPPLPaQOZx3PJ7O7GNXeIcms0F6gu5Y4U8W8t/A4QerE5kcRDQWG8XmjoLOhq0lnAdh3+j0yXPy6ufUUAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a20127cf3d86cd453979eff6419a011549ec60b19d94a167ef5fa0a9457127f5","last_reissued_at":"2026-05-18T03:46:17.725599Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:17.725599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.0598","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-18T03:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bltFv+aR0llhrvSxoUTH/VKcprZJ0LYPql2w1RWHhN8zK+iUBiwyIMQcTnagc3mrFj6q3Rw9y/B9fJe2Z1ZUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:51:17.068900Z"},"content_sha256":"4f1043e4b5eb86744fbfe77b971d62c2cf585a3cae93e546306d29d3cf4bd964","schema_version":"1.0","event_id":"sha256:4f1043e4b5eb86744fbfe77b971d62c2cf585a3cae93e546306d29d3cf4bd964"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:UIASPTZ5Q3GUKOLZ573EDGQBCV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Implementing a Partitioned 2-page Book Embedding Testing Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Giuseppe Di Battista, Marco Di Bartolomeo, Patrizio Angelini","submitted_at":"2012-09-04T10:45:47Z","abstract_excerpt":"In a book embedding the vertices of a graph are placed on the \"spine\" of a \"book\" and the edges are assigned to \"pages\" so that edges on the same page do not cross. In the Partitioned 2-page Book Embedding problem egdes are partitioned into two sets E_1 and E_2, the pages are two, the edges of E_1 are assigned to page 1, and the edges of E_2 are assigned to page 2. The problem consists of checking if an ordering of the vertices exists along the spine so that the edges of each page do not cross. Hong and Nagamochi give an interesting and complex linear time algorithm for tackling Partitioned 2-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0598","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-18T03:46:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H15pGz6z2nPK4YDp6A9gWY3VcGyNpjmmHIQm8evyonJI2Nmv+iiYcbtjMb8TKGUNmaTQylMWLsjduHE8hd8iAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:51:17.069339Z"},"content_sha256":"53f69de40ec146659dcca941ed32c4c8347349b515410828dbc0cfa41a7c419d","schema_version":"1.0","event_id":"sha256:53f69de40ec146659dcca941ed32c4c8347349b515410828dbc0cfa41a7c419d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UIASPTZ5Q3GUKOLZ573EDGQBCV/bundle.json","state_url":"https://pith.science/pith/UIASPTZ5Q3GUKOLZ573EDGQBCV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UIASPTZ5Q3GUKOLZ573EDGQBCV/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-30T03:51:17Z","links":{"resolver":"https://pith.science/pith/UIASPTZ5Q3GUKOLZ573EDGQBCV","bundle":"https://pith.science/pith/UIASPTZ5Q3GUKOLZ573EDGQBCV/bundle.json","state":"https://pith.science/pith/UIASPTZ5Q3GUKOLZ573EDGQBCV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UIASPTZ5Q3GUKOLZ573EDGQBCV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UIASPTZ5Q3GUKOLZ573EDGQBCV","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":"013052ea9fa6fdfa1c9e7853bcce407dfc990e1519894e2b231fce6c7a35092d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-04T10:45:47Z","title_canon_sha256":"fae10c43b98c506d6f730ec3c33071eba002649d2f922ae4f11aa9bbb25493ee"},"schema_version":"1.0","source":{"id":"1209.0598","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0598","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0598v1","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0598","created_at":"2026-05-18T03:46:17Z"},{"alias_kind":"pith_short_12","alias_value":"UIASPTZ5Q3GU","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UIASPTZ5Q3GUKOLZ","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UIASPTZ5","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:53f69de40ec146659dcca941ed32c4c8347349b515410828dbc0cfa41a7c419d","target":"graph","created_at":"2026-05-18T03:46:17Z","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 a book embedding the vertices of a graph are placed on the \"spine\" of a \"book\" and the edges are assigned to \"pages\" so that edges on the same page do not cross. In the Partitioned 2-page Book Embedding problem egdes are partitioned into two sets E_1 and E_2, the pages are two, the edges of E_1 are assigned to page 1, and the edges of E_2 are assigned to page 2. The problem consists of checking if an ordering of the vertices exists along the spine so that the edges of each page do not cross. Hong and Nagamochi give an interesting and complex linear time algorithm for tackling Partitioned 2-","authors_text":"Giuseppe Di Battista, Marco Di Bartolomeo, Patrizio Angelini","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-04T10:45:47Z","title":"Implementing a Partitioned 2-page Book Embedding Testing Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0598","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:4f1043e4b5eb86744fbfe77b971d62c2cf585a3cae93e546306d29d3cf4bd964","target":"record","created_at":"2026-05-18T03:46:17Z","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":"013052ea9fa6fdfa1c9e7853bcce407dfc990e1519894e2b231fce6c7a35092d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-04T10:45:47Z","title_canon_sha256":"fae10c43b98c506d6f730ec3c33071eba002649d2f922ae4f11aa9bbb25493ee"},"schema_version":"1.0","source":{"id":"1209.0598","kind":"arxiv","version":1}},"canonical_sha256":"a20127cf3d86cd453979eff6419a011549ec60b19d94a167ef5fa0a9457127f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a20127cf3d86cd453979eff6419a011549ec60b19d94a167ef5fa0a9457127f5","first_computed_at":"2026-05-18T03:46:17.725599Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:17.725599Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ai/muPPLPaQOZx3PJ7O7GNXeIcms0F6gu5Y4U8W8t/A4QerE5kcRDQWG8XmjoLOhq0lnAdh3+j0yXPy6ufUUAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:17.726150Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.0598","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f1043e4b5eb86744fbfe77b971d62c2cf585a3cae93e546306d29d3cf4bd964","sha256:53f69de40ec146659dcca941ed32c4c8347349b515410828dbc0cfa41a7c419d"],"state_sha256":"4a868262bca475b229ebf89e89d83d7a813d1230ae4a66854f5f952e46450dd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a8SHPD1zpV0y1RqPNIBWJh3hbn89wk9gVLm7wxyBUdAnt2NxoTvD2ZGbN8Xn0sRjhu8ozC3vMI5HILB9unHsBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:51:17.071826Z","bundle_sha256":"e9cd3c219cc358748c93e2d0fec83fd331f09cc4517ae0253955277917d230fa"}}