{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:H4LGJJ6VLOMP2Y2I7RWBGHHVRP","short_pith_number":"pith:H4LGJJ6V","schema_version":"1.0","canonical_sha256":"3f1664a7d55b98fd6348fc6c131cf58bcd772849de642c44e82082ad05dfdb29","source":{"kind":"arxiv","id":"1712.09855","version":1},"attestation_state":"computed","paper":{"title":"Beyond-Planarity: Density Results for Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DM","authors_text":"Maximilian Pfister, Michael A. Bekos, Michael Kaufmann, Patrizio Angelini, Torsten Ueckerdt","submitted_at":"2017-12-28T13:34:37Z","abstract_excerpt":"Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations. Early research dates back to the 1960s (e.g., Avital and Hanani 1966) for extremal problems on geometric graphs, but is also related to graph drawing problems where visual clutter by edge crossings should be minimized (e.g., Huang et al. 2008) that could negatively affect the readability of the drawing. Different types of forbidden crossing configurations give"},"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":"1712.09855","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-12-28T13:34:37Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"2ed6bfad770acd708efb9f03d2f80fc6774b48993541511c31ed045ce958819a","abstract_canon_sha256":"e1eb2ebe56501616293a0edbb2a2b1835126b82392b71c2d49d78521cd434265"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:05.374772Z","signature_b64":"E+h+YlJFNLKiGhBRVl9M9bQEsAE+GXkfMreBKAYKuBx71iQ0K2kwkXxmGTUdC5lHTnWvqgA957OanI3nozVKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f1664a7d55b98fd6348fc6c131cf58bcd772849de642c44e82082ad05dfdb29","last_reissued_at":"2026-05-18T00:27:05.374160Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:05.374160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond-Planarity: Density Results for Bipartite Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DM","authors_text":"Maximilian Pfister, Michael A. Bekos, Michael Kaufmann, Patrizio Angelini, Torsten Ueckerdt","submitted_at":"2017-12-28T13:34:37Z","abstract_excerpt":"Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations. Early research dates back to the 1960s (e.g., Avital and Hanani 1966) for extremal problems on geometric graphs, but is also related to graph drawing problems where visual clutter by edge crossings should be minimized (e.g., Huang et al. 2008) that could negatively affect the readability of the drawing. Different types of forbidden crossing configurations give"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09855","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.09855","created_at":"2026-05-18T00:27:05.374260+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.09855v1","created_at":"2026-05-18T00:27:05.374260+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09855","created_at":"2026-05-18T00:27:05.374260+00:00"},{"alias_kind":"pith_short_12","alias_value":"H4LGJJ6VLOMP","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"H4LGJJ6VLOMP2Y2I","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"H4LGJJ6V","created_at":"2026-05-18T12:31:18.294218+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.00368","citing_title":"Some remarks on the midrange crossing constant","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H4LGJJ6VLOMP2Y2I7RWBGHHVRP","json":"https://pith.science/pith/H4LGJJ6VLOMP2Y2I7RWBGHHVRP.json","graph_json":"https://pith.science/api/pith-number/H4LGJJ6VLOMP2Y2I7RWBGHHVRP/graph.json","events_json":"https://pith.science/api/pith-number/H4LGJJ6VLOMP2Y2I7RWBGHHVRP/events.json","paper":"https://pith.science/paper/H4LGJJ6V"},"agent_actions":{"view_html":"https://pith.science/pith/H4LGJJ6VLOMP2Y2I7RWBGHHVRP","download_json":"https://pith.science/pith/H4LGJJ6VLOMP2Y2I7RWBGHHVRP.json","view_paper":"https://pith.science/paper/H4LGJJ6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.09855&json=true","fetch_graph":"https://pith.science/api/pith-number/H4LGJJ6VLOMP2Y2I7RWBGHHVRP/graph.json","fetch_events":"https://pith.science/api/pith-number/H4LGJJ6VLOMP2Y2I7RWBGHHVRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H4LGJJ6VLOMP2Y2I7RWBGHHVRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H4LGJJ6VLOMP2Y2I7RWBGHHVRP/action/storage_attestation","attest_author":"https://pith.science/pith/H4LGJJ6VLOMP2Y2I7RWBGHHVRP/action/author_attestation","sign_citation":"https://pith.science/pith/H4LGJJ6VLOMP2Y2I7RWBGHHVRP/action/citation_signature","submit_replication":"https://pith.science/pith/H4LGJJ6VLOMP2Y2I7RWBGHHVRP/action/replication_record"}},"created_at":"2026-05-18T00:27:05.374260+00:00","updated_at":"2026-05-18T00:27:05.374260+00:00"}