{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:D3U37FCOIKVF3TS7YGKWKLTVJQ","short_pith_number":"pith:D3U37FCO","schema_version":"1.0","canonical_sha256":"1ee9bf944e42aa5dce5fc195652e754c2e8be78dd36b65e37e80b91bf55c31d9","source":{"kind":"arxiv","id":"1207.3934","version":4},"attestation_state":"computed","paper":{"title":"Relaxing the Constraints of Clustered Planarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DM","authors_text":"Fabrizio Frati, Giordano Da Lozzo, Giuseppe Di Battista, Maurizio Patrignani, Patrizio Angelini, Vincenzo Roselli","submitted_at":"2012-07-17T10:28:34Z","abstract_excerpt":"In a drawing of a clustered graph vertices and edges are drawn as points and curves, respectively, while clusters are represented by simple closed regions. A drawing of a clustered graph is c-planar if it has no edge-edge, edge-region, or region-region crossings. Determining the complexity of testing whether a clustered graph admits a c-planar drawing is a long-standing open problem in the Graph Drawing research area. An obvious necessary condition for c-planarity is the planarity of the graph underlying the clustered graph. However, such a condition is not sufficient and the consequences on t"},"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":"1207.3934","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-07-17T10:28:34Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"e8b56e6b554671c2e13f66b62a6676080b7cde8ea6f42a7033f60d0e5564cbca","abstract_canon_sha256":"1c49f3bf1769c55915c2c7a9bb884c04303ceab1152dd27d962cfbe8023f0d2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:46.622407Z","signature_b64":"/diQaMJirELccpmm0ojOCuFvFeEf+w32vS48fhO+5fv8/yNY6mXq+TLWrmDafCe+6yM2Bcg8NIBS0P8e3DYeBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ee9bf944e42aa5dce5fc195652e754c2e8be78dd36b65e37e80b91bf55c31d9","last_reissued_at":"2026-05-18T02:58:46.621620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:46.621620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relaxing the Constraints of Clustered Planarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DM","authors_text":"Fabrizio Frati, Giordano Da Lozzo, Giuseppe Di Battista, Maurizio Patrignani, Patrizio Angelini, Vincenzo Roselli","submitted_at":"2012-07-17T10:28:34Z","abstract_excerpt":"In a drawing of a clustered graph vertices and edges are drawn as points and curves, respectively, while clusters are represented by simple closed regions. A drawing of a clustered graph is c-planar if it has no edge-edge, edge-region, or region-region crossings. Determining the complexity of testing whether a clustered graph admits a c-planar drawing is a long-standing open problem in the Graph Drawing research area. An obvious necessary condition for c-planarity is the planarity of the graph underlying the clustered graph. However, such a condition is not sufficient and the consequences on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3934","kind":"arxiv","version":4},"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":"1207.3934","created_at":"2026-05-18T02:58:46.621760+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.3934v4","created_at":"2026-05-18T02:58:46.621760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3934","created_at":"2026-05-18T02:58:46.621760+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3U37FCOIKVF","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3U37FCOIKVF3TS7","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3U37FCO","created_at":"2026-05-18T12:27:01.376967+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/D3U37FCOIKVF3TS7YGKWKLTVJQ","json":"https://pith.science/pith/D3U37FCOIKVF3TS7YGKWKLTVJQ.json","graph_json":"https://pith.science/api/pith-number/D3U37FCOIKVF3TS7YGKWKLTVJQ/graph.json","events_json":"https://pith.science/api/pith-number/D3U37FCOIKVF3TS7YGKWKLTVJQ/events.json","paper":"https://pith.science/paper/D3U37FCO"},"agent_actions":{"view_html":"https://pith.science/pith/D3U37FCOIKVF3TS7YGKWKLTVJQ","download_json":"https://pith.science/pith/D3U37FCOIKVF3TS7YGKWKLTVJQ.json","view_paper":"https://pith.science/paper/D3U37FCO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.3934&json=true","fetch_graph":"https://pith.science/api/pith-number/D3U37FCOIKVF3TS7YGKWKLTVJQ/graph.json","fetch_events":"https://pith.science/api/pith-number/D3U37FCOIKVF3TS7YGKWKLTVJQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3U37FCOIKVF3TS7YGKWKLTVJQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3U37FCOIKVF3TS7YGKWKLTVJQ/action/storage_attestation","attest_author":"https://pith.science/pith/D3U37FCOIKVF3TS7YGKWKLTVJQ/action/author_attestation","sign_citation":"https://pith.science/pith/D3U37FCOIKVF3TS7YGKWKLTVJQ/action/citation_signature","submit_replication":"https://pith.science/pith/D3U37FCOIKVF3TS7YGKWKLTVJQ/action/replication_record"}},"created_at":"2026-05-18T02:58:46.621760+00:00","updated_at":"2026-05-18T02:58:46.621760+00:00"}