{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:F5ACMGDSV34GBBPJKF3WXIRB72","short_pith_number":"pith:F5ACMGDS","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"},"canonical_sha256":"2f40261872aef86085e951776ba221feb1f497fcd6b6247850dc5eb0db192729","source":{"kind":"arxiv","id":"1106.3037","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3037","created_at":"2026-05-18T04:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3037v1","created_at":"2026-05-18T04:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3037","created_at":"2026-05-18T04:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"F5ACMGDSV34G","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"F5ACMGDSV34GBBPJ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"F5ACMGDS","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:F5ACMGDSV34GBBPJKF3WXIRB72","target":"record","payload":{"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"},"canonical_sha256":"2f40261872aef86085e951776ba221feb1f497fcd6b6247850dc5eb0db192729","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"},"source_kind":"arxiv","source_id":"1106.3037","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XFE+f5Mca1ZQM2aDZNSW0B/oXH9MdvF0YLmfeyYiMZ5/IyNQTuwOSn5a8ENnfyJ3z31oRgmFMlcjGWsmE+9sCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:19:31.307570Z"},"content_sha256":"381e7165ca3a78fe132061c538f5b9c8f001235ca8930cdcd80217ad3f67c345","schema_version":"1.0","event_id":"sha256:381e7165ca3a78fe132061c538f5b9c8f001235ca8930cdcd80217ad3f67c345"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:F5ACMGDSV34GBBPJKF3WXIRB72","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:19:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vV/7ALq2RIp35sAWVadrlCabXcRNZ5uTANFi/gbbqVrTuLKPnumlT8fInNkVgA1ly9zv+xC9VhY9/iARwwrUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T09:19:31.307908Z"},"content_sha256":"62ca98724e8bbc7a59a71e88fbb54b1943260772dcd8a359802aaf428a2a6a8b","schema_version":"1.0","event_id":"sha256:62ca98724e8bbc7a59a71e88fbb54b1943260772dcd8a359802aaf428a2a6a8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F5ACMGDSV34GBBPJKF3WXIRB72/bundle.json","state_url":"https://pith.science/pith/F5ACMGDSV34GBBPJKF3WXIRB72/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F5ACMGDSV34GBBPJKF3WXIRB72/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-03T09:19:31Z","links":{"resolver":"https://pith.science/pith/F5ACMGDSV34GBBPJKF3WXIRB72","bundle":"https://pith.science/pith/F5ACMGDSV34GBBPJKF3WXIRB72/bundle.json","state":"https://pith.science/pith/F5ACMGDSV34GBBPJKF3WXIRB72/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F5ACMGDSV34GBBPJKF3WXIRB72/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:F5ACMGDSV34GBBPJKF3WXIRB72","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"21a0c5e36de290bb5361be255feed6f8bc30d5fdaeedc0c359e8492422af5dd7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-15T17:48:52Z","title_canon_sha256":"3fcec575365d8d6aa4aeb866ac5eded2f8cdbaf47a3d61b9fa84317e4787fc8b"},"schema_version":"1.0","source":{"id":"1106.3037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3037","created_at":"2026-05-18T04:19:55Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3037v1","created_at":"2026-05-18T04:19:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3037","created_at":"2026-05-18T04:19:55Z"},{"alias_kind":"pith_short_12","alias_value":"F5ACMGDSV34G","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"F5ACMGDSV34GBBPJ","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"F5ACMGDS","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:62ca98724e8bbc7a59a71e88fbb54b1943260772dcd8a359802aaf428a2a6a8b","target":"graph","created_at":"2026-05-18T04:19:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Aleksandar Ilic","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-15T17:48:52Z","title":"Efficient algorithm for the vertex connectivity of trapezoid graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3037","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:381e7165ca3a78fe132061c538f5b9c8f001235ca8930cdcd80217ad3f67c345","target":"record","created_at":"2026-05-18T04:19:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"21a0c5e36de290bb5361be255feed6f8bc30d5fdaeedc0c359e8492422af5dd7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-15T17:48:52Z","title_canon_sha256":"3fcec575365d8d6aa4aeb866ac5eded2f8cdbaf47a3d61b9fa84317e4787fc8b"},"schema_version":"1.0","source":{"id":"1106.3037","kind":"arxiv","version":1}},"canonical_sha256":"2f40261872aef86085e951776ba221feb1f497fcd6b6247850dc5eb0db192729","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f40261872aef86085e951776ba221feb1f497fcd6b6247850dc5eb0db192729","first_computed_at":"2026-05-18T04:19:55.138544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:55.138544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O5kRiEc2KEr/EK+KsgcqaoFKiR0aIBOzxsGPWfYOY128ofPF3fwXkvx4xwDW7HVy6BTfeVLNtjoU8Vhrio38BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:55.139341Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.3037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:381e7165ca3a78fe132061c538f5b9c8f001235ca8930cdcd80217ad3f67c345","sha256:62ca98724e8bbc7a59a71e88fbb54b1943260772dcd8a359802aaf428a2a6a8b"],"state_sha256":"744108266af54f8731e4cd3be99ad03d7f4d4b8547b5246ca6fc137cab350c89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fTAzjcmsrTqSXaiVf5j6hy3Tgb92yZuoXR2cDBrxxM06tNRZNbAxNI+EWozKrhCFD2P2t3rKwRS1MMvFdREKDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T09:19:31.309893Z","bundle_sha256":"73e852ec1b848d86917b079024a0bd5a0502b144febd4ecb5bc05282a07c4e5f"}}