{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:L7UPULFM6S5HV2WLWDN6ZPYVZ4","short_pith_number":"pith:L7UPULFM","schema_version":"1.0","canonical_sha256":"5fe8fa2cacf4ba7aeacbb0dbecbf15cf17adea13163e11597407ba0ac4729e80","source":{"kind":"arxiv","id":"1906.01056","version":1},"attestation_state":"computed","paper":{"title":"A separator-based method for generating weakly chordal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Asish Mukhopadhyay, Md. Zamilur Rahman, Yash P. Aneja","submitted_at":"2019-05-08T20:11:52Z","abstract_excerpt":"We propose a scheme for generating a weakly chordal graph on n vertices with m edges. In this method, we first construct a tree and then generate an orthogonal layout (which is a weakly chordal graph on the n vertices) based on this tree. In the next and final step, we insert additional edges to give us a weakly chordal graph on m edges. Our algorithm ensures that the graph remains weakly chordal after each edge is inserted. The time complexity of an insertion query is O(n^3) time and an insertion takes constant time. On the other hand, a generation algorithm based on finding a 2-pair takes O("},"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":"1906.01056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-08T20:11:52Z","cross_cats_sorted":[],"title_canon_sha256":"a80479ecb1ddf13a6626f72f9ea9aad6b01c9bbb14ea4b8027c3a888910457bd","abstract_canon_sha256":"2843a7ac1d168285f49ab07f4479a66e36042274040a3cc985e12d2f6b802453"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:17.949655Z","signature_b64":"B9K+AEZfEdam/e7IK1tQKFFNTa5XMj2q+h4EE2p0IeWvQOjDl0cia/znFyy5T6GmxPROAnqABq2Cf1p9FjtNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fe8fa2cacf4ba7aeacbb0dbecbf15cf17adea13163e11597407ba0ac4729e80","last_reissued_at":"2026-05-17T23:44:17.949043Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:17.949043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A separator-based method for generating weakly chordal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Asish Mukhopadhyay, Md. Zamilur Rahman, Yash P. Aneja","submitted_at":"2019-05-08T20:11:52Z","abstract_excerpt":"We propose a scheme for generating a weakly chordal graph on n vertices with m edges. In this method, we first construct a tree and then generate an orthogonal layout (which is a weakly chordal graph on the n vertices) based on this tree. In the next and final step, we insert additional edges to give us a weakly chordal graph on m edges. Our algorithm ensures that the graph remains weakly chordal after each edge is inserted. The time complexity of an insertion query is O(n^3) time and an insertion takes constant time. On the other hand, a generation algorithm based on finding a 2-pair takes O("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01056","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":"1906.01056","created_at":"2026-05-17T23:44:17.949131+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.01056v1","created_at":"2026-05-17T23:44:17.949131+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01056","created_at":"2026-05-17T23:44:17.949131+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7UPULFM6S5H","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7UPULFM6S5HV2WL","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7UPULFM","created_at":"2026-05-18T12:33:21.387695+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/L7UPULFM6S5HV2WLWDN6ZPYVZ4","json":"https://pith.science/pith/L7UPULFM6S5HV2WLWDN6ZPYVZ4.json","graph_json":"https://pith.science/api/pith-number/L7UPULFM6S5HV2WLWDN6ZPYVZ4/graph.json","events_json":"https://pith.science/api/pith-number/L7UPULFM6S5HV2WLWDN6ZPYVZ4/events.json","paper":"https://pith.science/paper/L7UPULFM"},"agent_actions":{"view_html":"https://pith.science/pith/L7UPULFM6S5HV2WLWDN6ZPYVZ4","download_json":"https://pith.science/pith/L7UPULFM6S5HV2WLWDN6ZPYVZ4.json","view_paper":"https://pith.science/paper/L7UPULFM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.01056&json=true","fetch_graph":"https://pith.science/api/pith-number/L7UPULFM6S5HV2WLWDN6ZPYVZ4/graph.json","fetch_events":"https://pith.science/api/pith-number/L7UPULFM6S5HV2WLWDN6ZPYVZ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7UPULFM6S5HV2WLWDN6ZPYVZ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7UPULFM6S5HV2WLWDN6ZPYVZ4/action/storage_attestation","attest_author":"https://pith.science/pith/L7UPULFM6S5HV2WLWDN6ZPYVZ4/action/author_attestation","sign_citation":"https://pith.science/pith/L7UPULFM6S5HV2WLWDN6ZPYVZ4/action/citation_signature","submit_replication":"https://pith.science/pith/L7UPULFM6S5HV2WLWDN6ZPYVZ4/action/replication_record"}},"created_at":"2026-05-17T23:44:17.949131+00:00","updated_at":"2026-05-17T23:44:17.949131+00:00"}