{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:L7UPULFM6S5HV2WLWDN6ZPYVZ4","short_pith_number":"pith:L7UPULFM","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"},"canonical_sha256":"5fe8fa2cacf4ba7aeacbb0dbecbf15cf17adea13163e11597407ba0ac4729e80","source":{"kind":"arxiv","id":"1906.01056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01056","created_at":"2026-05-17T23:44:17Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01056v1","created_at":"2026-05-17T23:44:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01056","created_at":"2026-05-17T23:44:17Z"},{"alias_kind":"pith_short_12","alias_value":"L7UPULFM6S5H","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"L7UPULFM6S5HV2WL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"L7UPULFM","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:L7UPULFM6S5HV2WLWDN6ZPYVZ4","target":"record","payload":{"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"},"canonical_sha256":"5fe8fa2cacf4ba7aeacbb0dbecbf15cf17adea13163e11597407ba0ac4729e80","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"},"source_kind":"arxiv","source_id":"1906.01056","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-17T23:44:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jfDScDUwIlztbSAmhD8ejjyMFO1SHvJ2cwssEUyJslib/buIMBvKIIP9TUEPBGk3SNQgQQuKtfdpA2uYHnGvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:25:20.543307Z"},"content_sha256":"248430c75986b07100d8fcde9b1802bf72ca878652566dc9e9880a50d525eaa6","schema_version":"1.0","event_id":"sha256:248430c75986b07100d8fcde9b1802bf72ca878652566dc9e9880a50d525eaa6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:L7UPULFM6S5HV2WLWDN6ZPYVZ4","target":"graph","payload":{"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"},"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-17T23:44:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ApS3WDfQgTNuQjIes7orEZFyzrIT9ynkGqLBgWSjk1LCUTQhWA2sp7ae6HKc6xxwfbNR1jcLMS+dzFf51zPmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:25:20.543705Z"},"content_sha256":"f87bba37dfe6c78afde1c7a71cef1d4e9a7e14214e5807b68db40ba45838ab4d","schema_version":"1.0","event_id":"sha256:f87bba37dfe6c78afde1c7a71cef1d4e9a7e14214e5807b68db40ba45838ab4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L7UPULFM6S5HV2WLWDN6ZPYVZ4/bundle.json","state_url":"https://pith.science/pith/L7UPULFM6S5HV2WLWDN6ZPYVZ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L7UPULFM6S5HV2WLWDN6ZPYVZ4/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-06-30T07:25:20Z","links":{"resolver":"https://pith.science/pith/L7UPULFM6S5HV2WLWDN6ZPYVZ4","bundle":"https://pith.science/pith/L7UPULFM6S5HV2WLWDN6ZPYVZ4/bundle.json","state":"https://pith.science/pith/L7UPULFM6S5HV2WLWDN6ZPYVZ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L7UPULFM6S5HV2WLWDN6ZPYVZ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:L7UPULFM6S5HV2WLWDN6ZPYVZ4","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":"2843a7ac1d168285f49ab07f4479a66e36042274040a3cc985e12d2f6b802453","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-08T20:11:52Z","title_canon_sha256":"a80479ecb1ddf13a6626f72f9ea9aad6b01c9bbb14ea4b8027c3a888910457bd"},"schema_version":"1.0","source":{"id":"1906.01056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01056","created_at":"2026-05-17T23:44:17Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01056v1","created_at":"2026-05-17T23:44:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01056","created_at":"2026-05-17T23:44:17Z"},{"alias_kind":"pith_short_12","alias_value":"L7UPULFM6S5H","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"L7UPULFM6S5HV2WL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"L7UPULFM","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:f87bba37dfe6c78afde1c7a71cef1d4e9a7e14214e5807b68db40ba45838ab4d","target":"graph","created_at":"2026-05-17T23:44:17Z","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":"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(","authors_text":"Asish Mukhopadhyay, Md. Zamilur Rahman, Yash P. Aneja","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-08T20:11:52Z","title":"A separator-based method for generating weakly chordal graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01056","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:248430c75986b07100d8fcde9b1802bf72ca878652566dc9e9880a50d525eaa6","target":"record","created_at":"2026-05-17T23:44:17Z","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":"2843a7ac1d168285f49ab07f4479a66e36042274040a3cc985e12d2f6b802453","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-08T20:11:52Z","title_canon_sha256":"a80479ecb1ddf13a6626f72f9ea9aad6b01c9bbb14ea4b8027c3a888910457bd"},"schema_version":"1.0","source":{"id":"1906.01056","kind":"arxiv","version":1}},"canonical_sha256":"5fe8fa2cacf4ba7aeacbb0dbecbf15cf17adea13163e11597407ba0ac4729e80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fe8fa2cacf4ba7aeacbb0dbecbf15cf17adea13163e11597407ba0ac4729e80","first_computed_at":"2026-05-17T23:44:17.949043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:17.949043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B9K+AEZfEdam/e7IK1tQKFFNTa5XMj2q+h4EE2p0IeWvQOjDl0cia/znFyy5T6GmxPROAnqABq2Cf1p9FjtNAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:17.949655Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.01056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:248430c75986b07100d8fcde9b1802bf72ca878652566dc9e9880a50d525eaa6","sha256:f87bba37dfe6c78afde1c7a71cef1d4e9a7e14214e5807b68db40ba45838ab4d"],"state_sha256":"565f32d7a02ab436b6175cb1306205e8ba5cae67840ee97371bdbb08f1373531"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JPtU3XfaUV/rRJkLZ0rTEGtCyx/uzYN5jIjtxoWCODPIbL0yfPslM+MC/EAkrgtng31a/+GnameImxWi7wN3AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T07:25:20.545688Z","bundle_sha256":"4025622569455a65cb27bad3ba2f56a7206c0f15be9288ce03574d502c6cfb31"}}