{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VAYVPR3H7C2QPO5Q3JNQ2LMAYU","short_pith_number":"pith:VAYVPR3H","canonical_record":{"source":{"id":"1904.04916","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-09T21:23:15Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"24c55de724f327565934b41f94caa77faddb8e2addc7ce196bd6b2a279745373","abstract_canon_sha256":"18d1b5e5294acf44ec964fe44cda9a4393d89ac274b2c1a1fd96d1b357433e0d"},"schema_version":"1.0"},"canonical_sha256":"a83157c767f8b507bbb0da5b0d2d80c51d4744437d0d6d3e29dbf58849523dc0","source":{"kind":"arxiv","id":"1904.04916","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04916","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04916v2","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04916","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"VAYVPR3H7C2Q","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VAYVPR3H7C2QPO5Q","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VAYVPR3H","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VAYVPR3H7C2QPO5Q3JNQ2LMAYU","target":"record","payload":{"canonical_record":{"source":{"id":"1904.04916","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-09T21:23:15Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"24c55de724f327565934b41f94caa77faddb8e2addc7ce196bd6b2a279745373","abstract_canon_sha256":"18d1b5e5294acf44ec964fe44cda9a4393d89ac274b2c1a1fd96d1b357433e0d"},"schema_version":"1.0"},"canonical_sha256":"a83157c767f8b507bbb0da5b0d2d80c51d4744437d0d6d3e29dbf58849523dc0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:57.731343Z","signature_b64":"lmB96KKRSVa+gfPhHVO1HQfZWyI8+40o3RDR8Ut1kuM55GKxfCHj0TJSZzUGBfQD7oiIQhf31Q4OqeWggbQADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a83157c767f8b507bbb0da5b0d2d80c51d4744437d0d6d3e29dbf58849523dc0","last_reissued_at":"2026-05-17T23:45:57.730911Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:57.730911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.04916","source_version":2,"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:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sBvM6ly8MAaYJQLRxjxxJiS3o+vIbiLCSFOQTNQFXM+uCamywYrlI+0Xqm10ZAs7jAtaTnoLHZZ3LPlfIgEqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:29:56.481043Z"},"content_sha256":"ed5f07ba281c49b5a1e94dacb48c87f278b7fbbbbd2504e5d72920942823924f","schema_version":"1.0","event_id":"sha256:ed5f07ba281c49b5a1e94dacb48c87f278b7fbbbbd2504e5d72920942823924f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VAYVPR3H7C2QPO5Q3JNQ2LMAYU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Mordechai Shalom, Oylum \\c{S}eker, T{\\i}naz Ekim","submitted_at":"2019-04-09T21:23:15Z","abstract_excerpt":"It is known that any chordal graph on $n$ vertices can be represented as the intersection of $n$ subtrees in a tree on $n$ nodes. This fact is recently used in [2] to generate random chordal graphs on $n$ vertices by generating $n$ subtrees of a tree on $n$ nodes. It follows that the space (and thus time) complexity of such an algorithm is at least the sum of the sizes of the generated subtrees assuming that a tree is given by a set of nodes. In [2], this complexity was mistakenly claimed to be linear in the number $m$ of edges of the generated chordal graph. This error is corrected in [3] whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04916","kind":"arxiv","version":2},"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:45:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y5ggnWOewzuRtA+BOOqDGR9RywA/TaV1gy8llwPV7XSEkAZZbsKXee8Vmx5RHJgfKCC8RuzGuF/nMpt8ByvbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T04:29:56.481606Z"},"content_sha256":"2af284489a6125dc4256a3036441816216dedc317013b36fe922ae21e3b0d45d","schema_version":"1.0","event_id":"sha256:2af284489a6125dc4256a3036441816216dedc317013b36fe922ae21e3b0d45d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VAYVPR3H7C2QPO5Q3JNQ2LMAYU/bundle.json","state_url":"https://pith.science/pith/VAYVPR3H7C2QPO5Q3JNQ2LMAYU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VAYVPR3H7C2QPO5Q3JNQ2LMAYU/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-04T04:29:56Z","links":{"resolver":"https://pith.science/pith/VAYVPR3H7C2QPO5Q3JNQ2LMAYU","bundle":"https://pith.science/pith/VAYVPR3H7C2QPO5Q3JNQ2LMAYU/bundle.json","state":"https://pith.science/pith/VAYVPR3H7C2QPO5Q3JNQ2LMAYU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VAYVPR3H7C2QPO5Q3JNQ2LMAYU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VAYVPR3H7C2QPO5Q3JNQ2LMAYU","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":"18d1b5e5294acf44ec964fe44cda9a4393d89ac274b2c1a1fd96d1b357433e0d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-09T21:23:15Z","title_canon_sha256":"24c55de724f327565934b41f94caa77faddb8e2addc7ce196bd6b2a279745373"},"schema_version":"1.0","source":{"id":"1904.04916","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04916","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04916v2","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04916","created_at":"2026-05-17T23:45:57Z"},{"alias_kind":"pith_short_12","alias_value":"VAYVPR3H7C2Q","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VAYVPR3H7C2QPO5Q","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VAYVPR3H","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:2af284489a6125dc4256a3036441816216dedc317013b36fe922ae21e3b0d45d","target":"graph","created_at":"2026-05-17T23:45:57Z","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":"It is known that any chordal graph on $n$ vertices can be represented as the intersection of $n$ subtrees in a tree on $n$ nodes. This fact is recently used in [2] to generate random chordal graphs on $n$ vertices by generating $n$ subtrees of a tree on $n$ nodes. It follows that the space (and thus time) complexity of such an algorithm is at least the sum of the sizes of the generated subtrees assuming that a tree is given by a set of nodes. In [2], this complexity was mistakenly claimed to be linear in the number $m$ of edges of the generated chordal graph. This error is corrected in [3] whe","authors_text":"Mordechai Shalom, Oylum \\c{S}eker, T{\\i}naz Ekim","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-09T21:23:15Z","title":"The Complexity of Subtree Intersection Representation of Chordal Graphs and Linear Time Chordal Graph Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04916","kind":"arxiv","version":2},"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:ed5f07ba281c49b5a1e94dacb48c87f278b7fbbbbd2504e5d72920942823924f","target":"record","created_at":"2026-05-17T23:45:57Z","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":"18d1b5e5294acf44ec964fe44cda9a4393d89ac274b2c1a1fd96d1b357433e0d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-09T21:23:15Z","title_canon_sha256":"24c55de724f327565934b41f94caa77faddb8e2addc7ce196bd6b2a279745373"},"schema_version":"1.0","source":{"id":"1904.04916","kind":"arxiv","version":2}},"canonical_sha256":"a83157c767f8b507bbb0da5b0d2d80c51d4744437d0d6d3e29dbf58849523dc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a83157c767f8b507bbb0da5b0d2d80c51d4744437d0d6d3e29dbf58849523dc0","first_computed_at":"2026-05-17T23:45:57.730911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:57.730911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lmB96KKRSVa+gfPhHVO1HQfZWyI8+40o3RDR8Ut1kuM55GKxfCHj0TJSZzUGBfQD7oiIQhf31Q4OqeWggbQADg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:57.731343Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.04916","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed5f07ba281c49b5a1e94dacb48c87f278b7fbbbbd2504e5d72920942823924f","sha256:2af284489a6125dc4256a3036441816216dedc317013b36fe922ae21e3b0d45d"],"state_sha256":"d748f4d18862c5d45b0e8de0e3ac3ea8693a727ca6142b0dd96e6c7c10a74f74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ALVEkZQ/a0Y8x4z3GB6MdqPOv5p8g+3sqv05ETS4jA/MTuVDo8NQ5m7OPER/RBDRv2OkN8rJCQ2MLmLfWcblCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T04:29:56.484541Z","bundle_sha256":"971a1496f1c1f52edd7e0bb5b943866b96266bf8dfc964d47fcbb27e4fe90edc"}}