{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:F5ACMGDSV34GBBPJKF3WXIRB72","short_pith_number":"pith:F5ACMGDS","schema_version":"1.0","canonical_sha256":"2f40261872aef86085e951776ba221feb1f497fcd6b6247850dc5eb0db192729","source":{"kind":"arxiv","id":"1106.3037","version":1},"attestation_state":"computed","paper":{"title":"Efficient algorithm for the vertex connectivity of trapezoid graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Aleksandar Ilic","submitted_at":"2011-06-15T17:48:52Z","abstract_excerpt":"The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. These graphs and their generalizations were applied in various fields, including modeling channel routing problems in VLSI design and identifying the optimal chain of non-overlapping fragments in bioinformatics. Using modified binary indexed tree data structure, we design an algorithm for calculating the vertex connectivity of trapezoid graph $G$ with time complexity $O (n \\log n)$, where $n$ is the number of trapezoids. Furthermore, we establish sufficient and neces"},"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":"1106.3037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-15T17:48:52Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3fcec575365d8d6aa4aeb866ac5eded2f8cdbaf47a3d61b9fa84317e4787fc8b","abstract_canon_sha256":"21a0c5e36de290bb5361be255feed6f8bc30d5fdaeedc0c359e8492422af5dd7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:55.139341Z","signature_b64":"O5kRiEc2KEr/EK+KsgcqaoFKiR0aIBOzxsGPWfYOY128ofPF3fwXkvx4xwDW7HVy6BTfeVLNtjoU8Vhrio38BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f40261872aef86085e951776ba221feb1f497fcd6b6247850dc5eb0db192729","last_reissued_at":"2026-05-18T04:19:55.138544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:55.138544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient algorithm for the vertex connectivity of trapezoid graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DS","authors_text":"Aleksandar Ilic","submitted_at":"2011-06-15T17:48:52Z","abstract_excerpt":"The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. These graphs and their generalizations were applied in various fields, including modeling channel routing problems in VLSI design and identifying the optimal chain of non-overlapping fragments in bioinformatics. Using modified binary indexed tree data structure, we design an algorithm for calculating the vertex connectivity of trapezoid graph $G$ with time complexity $O (n \\log n)$, where $n$ is the number of trapezoids. Furthermore, we establish sufficient and neces"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3037","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":"1106.3037","created_at":"2026-05-18T04:19:55.138678+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.3037v1","created_at":"2026-05-18T04:19:55.138678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3037","created_at":"2026-05-18T04:19:55.138678+00:00"},{"alias_kind":"pith_short_12","alias_value":"F5ACMGDSV34G","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"F5ACMGDSV34GBBPJ","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"F5ACMGDS","created_at":"2026-05-18T12:26:28.662955+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/F5ACMGDSV34GBBPJKF3WXIRB72","json":"https://pith.science/pith/F5ACMGDSV34GBBPJKF3WXIRB72.json","graph_json":"https://pith.science/api/pith-number/F5ACMGDSV34GBBPJKF3WXIRB72/graph.json","events_json":"https://pith.science/api/pith-number/F5ACMGDSV34GBBPJKF3WXIRB72/events.json","paper":"https://pith.science/paper/F5ACMGDS"},"agent_actions":{"view_html":"https://pith.science/pith/F5ACMGDSV34GBBPJKF3WXIRB72","download_json":"https://pith.science/pith/F5ACMGDSV34GBBPJKF3WXIRB72.json","view_paper":"https://pith.science/paper/F5ACMGDS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.3037&json=true","fetch_graph":"https://pith.science/api/pith-number/F5ACMGDSV34GBBPJKF3WXIRB72/graph.json","fetch_events":"https://pith.science/api/pith-number/F5ACMGDSV34GBBPJKF3WXIRB72/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F5ACMGDSV34GBBPJKF3WXIRB72/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F5ACMGDSV34GBBPJKF3WXIRB72/action/storage_attestation","attest_author":"https://pith.science/pith/F5ACMGDSV34GBBPJKF3WXIRB72/action/author_attestation","sign_citation":"https://pith.science/pith/F5ACMGDSV34GBBPJKF3WXIRB72/action/citation_signature","submit_replication":"https://pith.science/pith/F5ACMGDSV34GBBPJKF3WXIRB72/action/replication_record"}},"created_at":"2026-05-18T04:19:55.138678+00:00","updated_at":"2026-05-18T04:19:55.138678+00:00"}