{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5FATG7WKLA3FXU2TGLLC722V44","short_pith_number":"pith:5FATG7WK","schema_version":"1.0","canonical_sha256":"e941337eca58365bd35332d62feb55e70853e5ba74752b9f6e064d924d331976","source":{"kind":"arxiv","id":"2607.24375","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.24375","created_at":"2026-07-28T02:23:59.879998+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.24375v1","created_at":"2026-07-28T02:23:59.879998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.24375","created_at":"2026-07-28T02:23:59.879998+00:00"},{"alias_kind":"pith_short_12","alias_value":"5FATG7WKLA3F","created_at":"2026-07-28T02:23:59.879998+00:00"},{"alias_kind":"pith_short_16","alias_value":"5FATG7WKLA3FXU2T","created_at":"2026-07-28T02:23:59.879998+00:00"},{"alias_kind":"pith_short_8","alias_value":"5FATG7WK","created_at":"2026-07-28T02:23:59.879998+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5FATG7WKLA3FXU2TGLLC722V44","json":"https://pith.science/pith/5FATG7WKLA3FXU2TGLLC722V44.json","graph_json":"https://pith.science/api/pith-number/5FATG7WKLA3FXU2TGLLC722V44/graph.json","events_json":"https://pith.science/api/pith-number/5FATG7WKLA3FXU2TGLLC722V44/events.json","paper":"https://pith.science/paper/5FATG7WK"},"agent_actions":{"view_html":"https://pith.science/pith/5FATG7WKLA3FXU2TGLLC722V44","download_json":"https://pith.science/pith/5FATG7WKLA3FXU2TGLLC722V44.json","view_paper":"https://pith.science/paper/5FATG7WK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.24375&json=true","fetch_graph":"https://pith.science/api/pith-number/5FATG7WKLA3FXU2TGLLC722V44/graph.json","fetch_events":"https://pith.science/api/pith-number/5FATG7WKLA3FXU2TGLLC722V44/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5FATG7WKLA3FXU2TGLLC722V44/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5FATG7WKLA3FXU2TGLLC722V44/action/storage_attestation","attest_author":"https://pith.science/pith/5FATG7WKLA3FXU2TGLLC722V44/action/author_attestation","sign_citation":"https://pith.science/pith/5FATG7WKLA3FXU2TGLLC722V44/action/citation_signature","submit_replication":"https://pith.science/pith/5FATG7WKLA3FXU2TGLLC722V44/action/replication_record"}},"created_at":"2026-07-28T02:23:59.879998+00:00","updated_at":"2026-07-28T02:23:59.879998+00:00"}