{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BGV2ABZ3MLIII5ANFW2AUYX6CF","short_pith_number":"pith:BGV2ABZ3","schema_version":"1.0","canonical_sha256":"09aba0073b62d084740d2db40a62fe1160b437bbe1aa7291ce7948c80e5cb69e","source":{"kind":"arxiv","id":"1408.2595","version":1},"attestation_state":"computed","paper":{"title":"Advances on Testing C-Planarity of Embedded Flat Clustered Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"cs.DS","authors_text":"Fabrizio Frati, Giuseppe Di Battista, Karsten Klein, Markus Chimani","submitted_at":"2014-08-12T01:05:40Z","abstract_excerpt":"We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face."},"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":"1408.2595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-12T01:05:40Z","cross_cats_sorted":["cs.CG","cs.DM"],"title_canon_sha256":"be4be9164aa6820c0f2cf73e3f9037e9dfcf845e1f0dce9fa8b2379b0835bae4","abstract_canon_sha256":"91c3452f04b079bcd1a0c0b59ec3878ff154c8855c002e10a487850f7e3b4ac2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:22.714839Z","signature_b64":"NAZt0aGqBM3PwFMrl5qyxFTa7JzGxs9Gr91d9kQ/wjWOVs3JrjwNwHeuXCgXI8i6o2NaUt2YeC9/OGtST3pnDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09aba0073b62d084740d2db40a62fe1160b437bbe1aa7291ce7948c80e5cb69e","last_reissued_at":"2026-05-18T02:45:22.714415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:22.714415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Advances on Testing C-Planarity of Embedded Flat Clustered Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DM"],"primary_cat":"cs.DS","authors_text":"Fabrizio Frati, Giuseppe Di Battista, Karsten Klein, Markus Chimani","submitted_at":"2014-08-12T01:05:40Z","abstract_excerpt":"We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.2595","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":"1408.2595","created_at":"2026-05-18T02:45:22.714479+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.2595v1","created_at":"2026-05-18T02:45:22.714479+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.2595","created_at":"2026-05-18T02:45:22.714479+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGV2ABZ3MLII","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGV2ABZ3MLIII5AN","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGV2ABZ3","created_at":"2026-05-18T12:28:22.404517+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/BGV2ABZ3MLIII5ANFW2AUYX6CF","json":"https://pith.science/pith/BGV2ABZ3MLIII5ANFW2AUYX6CF.json","graph_json":"https://pith.science/api/pith-number/BGV2ABZ3MLIII5ANFW2AUYX6CF/graph.json","events_json":"https://pith.science/api/pith-number/BGV2ABZ3MLIII5ANFW2AUYX6CF/events.json","paper":"https://pith.science/paper/BGV2ABZ3"},"agent_actions":{"view_html":"https://pith.science/pith/BGV2ABZ3MLIII5ANFW2AUYX6CF","download_json":"https://pith.science/pith/BGV2ABZ3MLIII5ANFW2AUYX6CF.json","view_paper":"https://pith.science/paper/BGV2ABZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.2595&json=true","fetch_graph":"https://pith.science/api/pith-number/BGV2ABZ3MLIII5ANFW2AUYX6CF/graph.json","fetch_events":"https://pith.science/api/pith-number/BGV2ABZ3MLIII5ANFW2AUYX6CF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGV2ABZ3MLIII5ANFW2AUYX6CF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGV2ABZ3MLIII5ANFW2AUYX6CF/action/storage_attestation","attest_author":"https://pith.science/pith/BGV2ABZ3MLIII5ANFW2AUYX6CF/action/author_attestation","sign_citation":"https://pith.science/pith/BGV2ABZ3MLIII5ANFW2AUYX6CF/action/citation_signature","submit_replication":"https://pith.science/pith/BGV2ABZ3MLIII5ANFW2AUYX6CF/action/replication_record"}},"created_at":"2026-05-18T02:45:22.714479+00:00","updated_at":"2026-05-18T02:45:22.714479+00:00"}