{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5FATG7WKLA3FXU2TGLLC722V44","short_pith_number":"pith:5FATG7WK","canonical_record":{"source":{"id":"2607.24375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-07-27T12:51:47Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"990f37ae6f0161d14f1aac57d33ca069a7cbe379e41bedc61bfdf38a4e84cd43","abstract_canon_sha256":"a9efd4d9999dae146db378dca41798f001397de37fb40675271b1207ff00ba57"},"schema_version":"1.0"},"canonical_sha256":"e941337eca58365bd35332d62feb55e70853e5ba74752b9f6e064d924d331976","source":{"kind":"arxiv","id":"2607.24375","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.24375","created_at":"2026-07-28T02:23:59Z"},{"alias_kind":"arxiv_version","alias_value":"2607.24375v1","created_at":"2026-07-28T02:23:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.24375","created_at":"2026-07-28T02:23:59Z"},{"alias_kind":"pith_short_12","alias_value":"5FATG7WKLA3F","created_at":"2026-07-28T02:23:59Z"},{"alias_kind":"pith_short_16","alias_value":"5FATG7WKLA3FXU2T","created_at":"2026-07-28T02:23:59Z"},{"alias_kind":"pith_short_8","alias_value":"5FATG7WK","created_at":"2026-07-28T02:23:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5FATG7WKLA3FXU2TGLLC722V44","target":"record","payload":{"canonical_record":{"source":{"id":"2607.24375","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-07-27T12:51:47Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"990f37ae6f0161d14f1aac57d33ca069a7cbe379e41bedc61bfdf38a4e84cd43","abstract_canon_sha256":"a9efd4d9999dae146db378dca41798f001397de37fb40675271b1207ff00ba57"},"schema_version":"1.0"},"canonical_sha256":"e941337eca58365bd35332d62feb55e70853e5ba74752b9f6e064d924d331976","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T02:23:59.880408Z","signature_b64":"9ALFMhFgoqoaA+q+MCL2U0Wk4H5wf9gVrdmQvvi4jkqPYjDjVOc9mJThPy7B/+tTfYjjtvFXctP/6AVg8iGhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e941337eca58365bd35332d62feb55e70853e5ba74752b9f6e064d924d331976","last_reissued_at":"2026-07-28T02:23:59.879559Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T02:23:59.879559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.24375","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-28T02:23:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+wPAdPXFXSbI5bGjCWva5ceDAqyQnCTFKdga86LPxaCs8FEgkyjCKGrcy5kpbxdUB88bz1HjI6J6iQ6txEhvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T22:54:52.593932Z"},"content_sha256":"644f1b7b1388a4c209e357cd587d193af816dad70dee2bc7b371351cf338e392","schema_version":"1.0","event_id":"sha256:644f1b7b1388a4c209e357cd587d193af816dad70dee2bc7b371351cf338e392"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5FATG7WKLA3FXU2TGLLC722V44","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Weighted Book Thickness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CG","authors_text":"Alexandra Weinberger, Henry F\\\"orster, Johannes Zink, Maria Eleni Pavlidi, Michael Hoffmann, Stephen Kobourov","submitted_at":"2026-07-27T12:51:47Z","abstract_excerpt":"We introduce and study the weighted book thickness of graphs. A $k$-page book embedding of a graph $G=(V,E)$ is defined by a spanning cycle $C$ for $V$ (which does not need to be part of $G$) and a partition $E=\\bigcup_{i=1}^{k}E_i$ such that $E\\cap C\\subseteq E_1$ and each graph $G_i=(V,E_i\\cup C)$, for $1 \\le i \\le k$, is outerplane with outer cycle $C$. If $e\\in E_i$, we say that $e$ appears on Page $i$. The classical book thickness of a graph $G$ is the minimum $k$ such that there exists a $k$-page book embedding of $G$, that is, the minimum (over all book embeddings of $G$) achievable max"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.24375","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/2607.24375/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-28T02:23:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KSI4aCOnI7plJ0aEbmurliWJVef6wtw6QOtrEa6lEGwgm+jInAQJoSg6vgsZ4/NXJ0HZghlWquBdVV7AV2FEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T22:54:52.594687Z"},"content_sha256":"a9a6f481cfb2c0dbffe4b120cca2630b3bad8f344f3530ba3b1fa056130bb131","schema_version":"1.0","event_id":"sha256:a9a6f481cfb2c0dbffe4b120cca2630b3bad8f344f3530ba3b1fa056130bb131"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:5FATG7WKLA3FXU2TGLLC722V44","target":"integrity","payload":{"note":"Identifier '10.1007/978-3-540-30559-0' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Michael Baur and Ulrik Brandes. Crossing reduction in circular layouts. In Juraj Hromkovic, Manfred Nagl, and Bernhard Westfechtel, editors, Proc. 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004) , volum","arxiv_id":"2607.24375","detector":"doi_compliance","evidence":{"doi":"10.1007/978-3-540-30559-0","arxiv_id":null,"ref_index":3,"raw_excerpt":"Michael Baur and Ulrik Brandes. Crossing reduction in circular layouts. In Juraj Hromkovic, Manfred Nagl, and Bernhard Westfechtel, editors, Proc. 30th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2004) , volume 3353 of Lecture Notes in Computer Science , pages 332--343. Springer, 2004. https://doi.org/10.1007/978-3-540-30559-0\\_28 doi:10.1007/978-3-540-30559-0\\_28","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":3,"audited_at":"2026-07-31T17:01:58.011790Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-540-30559-0","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"abed3d4ea8fa918ae9771c272f9229d232860f38fb30b8d4752f5e5b9ad2a17f","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14453,"payload_sha256":"570c1fd10be8a18fae563cb8a48a75389fd39434f033e42e7657bcc9c519680e","signature_b64":"Vm2q/gzQPY/vEKQK46Jr4SzmF1ZBKKgjQw9eqyBkXDpKcBckQDG81dHBsAUWfoyoTMfkKlzAwj6Ysl2p7SukCQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-31T17:06:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ak+QiNh1IIOMMjJs+q9MtbRQV7y/9IgFk/4aDK5XvlxaHmyG4hDLVjlzdmZUKUDgJ7kRr8dOET1gWMHTJeABAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T22:54:52.599887Z"},"content_sha256":"e9cace6733ac07a14480655e1536c407da9068670bb94eee765942d9f00132f8","schema_version":"1.0","event_id":"sha256:e9cace6733ac07a14480655e1536c407da9068670bb94eee765942d9f00132f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5FATG7WKLA3FXU2TGLLC722V44/bundle.json","state_url":"https://pith.science/pith/5FATG7WKLA3FXU2TGLLC722V44/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5FATG7WKLA3FXU2TGLLC722V44/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-05T22:54:52Z","links":{"resolver":"https://pith.science/pith/5FATG7WKLA3FXU2TGLLC722V44","bundle":"https://pith.science/pith/5FATG7WKLA3FXU2TGLLC722V44/bundle.json","state":"https://pith.science/pith/5FATG7WKLA3FXU2TGLLC722V44/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5FATG7WKLA3FXU2TGLLC722V44/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5FATG7WKLA3FXU2TGLLC722V44","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a9efd4d9999dae146db378dca41798f001397de37fb40675271b1207ff00ba57","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-07-27T12:51:47Z","title_canon_sha256":"990f37ae6f0161d14f1aac57d33ca069a7cbe379e41bedc61bfdf38a4e84cd43"},"schema_version":"1.0","source":{"id":"2607.24375","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.24375","created_at":"2026-07-28T02:23:59Z"},{"alias_kind":"arxiv_version","alias_value":"2607.24375v1","created_at":"2026-07-28T02:23:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.24375","created_at":"2026-07-28T02:23:59Z"},{"alias_kind":"pith_short_12","alias_value":"5FATG7WKLA3F","created_at":"2026-07-28T02:23:59Z"},{"alias_kind":"pith_short_16","alias_value":"5FATG7WKLA3FXU2T","created_at":"2026-07-28T02:23:59Z"},{"alias_kind":"pith_short_8","alias_value":"5FATG7WK","created_at":"2026-07-28T02:23:59Z"}],"graph_snapshots":[{"event_id":"sha256:a9a6f481cfb2c0dbffe4b120cca2630b3bad8f344f3530ba3b1fa056130bb131","target":"graph","created_at":"2026-07-28T02:23:59Z","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/2607.24375/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce and study the weighted book thickness of graphs. A $k$-page book embedding of a graph $G=(V,E)$ is defined by a spanning cycle $C$ for $V$ (which does not need to be part of $G$) and a partition $E=\\bigcup_{i=1}^{k}E_i$ such that $E\\cap C\\subseteq E_1$ and each graph $G_i=(V,E_i\\cup C)$, for $1 \\le i \\le k$, is outerplane with outer cycle $C$. If $e\\in E_i$, we say that $e$ appears on Page $i$. The classical book thickness of a graph $G$ is the minimum $k$ such that there exists a $k$-page book embedding of $G$, that is, the minimum (over all book embeddings of $G$) achievable max","authors_text":"Alexandra Weinberger, Henry F\\\"orster, Johannes Zink, Maria Eleni Pavlidi, Michael Hoffmann, Stephen Kobourov","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-07-27T12:51:47Z","title":"Weighted Book Thickness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.24375","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:644f1b7b1388a4c209e357cd587d193af816dad70dee2bc7b371351cf338e392","target":"record","created_at":"2026-07-28T02:23:59Z","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":"a9efd4d9999dae146db378dca41798f001397de37fb40675271b1207ff00ba57","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2026-07-27T12:51:47Z","title_canon_sha256":"990f37ae6f0161d14f1aac57d33ca069a7cbe379e41bedc61bfdf38a4e84cd43"},"schema_version":"1.0","source":{"id":"2607.24375","kind":"arxiv","version":1}},"canonical_sha256":"e941337eca58365bd35332d62feb55e70853e5ba74752b9f6e064d924d331976","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e941337eca58365bd35332d62feb55e70853e5ba74752b9f6e064d924d331976","first_computed_at":"2026-07-28T02:23:59.879559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-28T02:23:59.879559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9ALFMhFgoqoaA+q+MCL2U0Wk4H5wf9gVrdmQvvi4jkqPYjDjVOc9mJThPy7B/+tTfYjjtvFXctP/6AVg8iGhDg==","signature_status":"signed_v1","signed_at":"2026-07-28T02:23:59.880408Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.24375","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:644f1b7b1388a4c209e357cd587d193af816dad70dee2bc7b371351cf338e392","sha256:a9a6f481cfb2c0dbffe4b120cca2630b3bad8f344f3530ba3b1fa056130bb131","sha256:e9cace6733ac07a14480655e1536c407da9068670bb94eee765942d9f00132f8"],"state_sha256":"fbfdda728bbc1a3895d01d18018882ca1b543d191fcdd2357ead16c87d76f602"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IJU/ucQaza9ve9SFbcyp7E5PoZAz9uF7sYGnyY695wIZNC6JGemFa2yDs7XPTNoLafB88aP5+625w2uqQFovBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T22:54:52.602894Z","bundle_sha256":"e543665370b565f88dff6671a715679df7dc2b2c7e6fda6fcbd3f43c3a43457e"}}