{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:S26ELIREFLRBC7U7ZUDN4AKN5S","short_pith_number":"pith:S26ELIRE","canonical_record":{"source":{"id":"1506.03389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-10T16:47:52Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"c0246d2c0399b32fb1d8046b62573a8d3992b4402124cd476a208486487d4ce8","abstract_canon_sha256":"8f37bcfdd2a86fd51975f009dd30d97d7284595e8ac1a302e4480063af56a68f"},"schema_version":"1.0"},"canonical_sha256":"96bc45a2242ae2117e9fcd06de014dec87f157fdf44a96eafbe379c46e1c81f8","source":{"kind":"arxiv","id":"1506.03389","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03389","created_at":"2026-05-18T00:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03389v2","created_at":"2026-05-18T00:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03389","created_at":"2026-05-18T00:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"S26ELIREFLRB","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S26ELIREFLRBC7U7","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S26ELIRE","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:S26ELIREFLRBC7U7ZUDN4AKN5S","target":"record","payload":{"canonical_record":{"source":{"id":"1506.03389","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-10T16:47:52Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"c0246d2c0399b32fb1d8046b62573a8d3992b4402124cd476a208486487d4ce8","abstract_canon_sha256":"8f37bcfdd2a86fd51975f009dd30d97d7284595e8ac1a302e4480063af56a68f"},"schema_version":"1.0"},"canonical_sha256":"96bc45a2242ae2117e9fcd06de014dec87f157fdf44a96eafbe379c46e1c81f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:01.541395Z","signature_b64":"GpSR7c3pPWbFfGggNDpie8JGp7riYi6HjpbJbJCPle26jLItuN06ZW4r1xsnVBPM/GYso8i0VbNMjMQztORHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96bc45a2242ae2117e9fcd06de014dec87f157fdf44a96eafbe379c46e1c81f8","last_reissued_at":"2026-05-18T00:51:01.540852Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:01.540852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.03389","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-18T00:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPPiH1QhBKqn5H54ptokdMVCfL+y+kiLEoWBQLGeO7Y5FXLFHNI+c4SiLBEko+KKbkQitt1h4+OWvop9bbebDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:41:39.107145Z"},"content_sha256":"92fd3e3d2c66aba3c719973db054187a6f52335ba06f207677445622ad2a96cb","schema_version":"1.0","event_id":"sha256:92fd3e3d2c66aba3c719973db054187a6f52335ba06f207677445622ad2a96cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:S26ELIREFLRBC7U7ZUDN4AKN5S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the total variation distance between the binomial random graph and the random intersection graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Jeong Han Kim, Joohan Na, Sang June Lee","submitted_at":"2015-06-10T16:47:52Z","abstract_excerpt":"When each vertex is assigned a set, the intersection graph generated by the sets is the graph in which two distinct vertices are joined by an edge if and only if their assigned sets have a nonempty intersection. An interval graph is an intersection graph generated by intervals in the real line. A chordal graph can be considered as an intersection graph generated by subtrees of a tree. In 1999, Karo\\'nski, Scheinerman and Singer-Cohen [Combin Probab Comput 8 (1999), 131--159] introduced a random intersection graph by taking randomly assigned sets. The random intersection graph $G(n,m;p)$ has $n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03389","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-18T00:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+oyXQWU3rBmP9rkMxmgdba4KkFTJV/wQYKZn8KVKr9nTES5iTH4DLNL/nx8Uge8Cj6Tf5F2tER0tUsAgRwDzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:41:39.107508Z"},"content_sha256":"127e53dd68292ec512cd42a31513d0dfd3fe6af9643a3f94c10b49c4ad2305c6","schema_version":"1.0","event_id":"sha256:127e53dd68292ec512cd42a31513d0dfd3fe6af9643a3f94c10b49c4ad2305c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S26ELIREFLRBC7U7ZUDN4AKN5S/bundle.json","state_url":"https://pith.science/pith/S26ELIREFLRBC7U7ZUDN4AKN5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S26ELIREFLRBC7U7ZUDN4AKN5S/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-05-28T04:41:39Z","links":{"resolver":"https://pith.science/pith/S26ELIREFLRBC7U7ZUDN4AKN5S","bundle":"https://pith.science/pith/S26ELIREFLRBC7U7ZUDN4AKN5S/bundle.json","state":"https://pith.science/pith/S26ELIREFLRBC7U7ZUDN4AKN5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S26ELIREFLRBC7U7ZUDN4AKN5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:S26ELIREFLRBC7U7ZUDN4AKN5S","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":"8f37bcfdd2a86fd51975f009dd30d97d7284595e8ac1a302e4480063af56a68f","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-10T16:47:52Z","title_canon_sha256":"c0246d2c0399b32fb1d8046b62573a8d3992b4402124cd476a208486487d4ce8"},"schema_version":"1.0","source":{"id":"1506.03389","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.03389","created_at":"2026-05-18T00:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1506.03389v2","created_at":"2026-05-18T00:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03389","created_at":"2026-05-18T00:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"S26ELIREFLRB","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"S26ELIREFLRBC7U7","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"S26ELIRE","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:127e53dd68292ec512cd42a31513d0dfd3fe6af9643a3f94c10b49c4ad2305c6","target":"graph","created_at":"2026-05-18T00:51:01Z","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":"When each vertex is assigned a set, the intersection graph generated by the sets is the graph in which two distinct vertices are joined by an edge if and only if their assigned sets have a nonempty intersection. An interval graph is an intersection graph generated by intervals in the real line. A chordal graph can be considered as an intersection graph generated by subtrees of a tree. In 1999, Karo\\'nski, Scheinerman and Singer-Cohen [Combin Probab Comput 8 (1999), 131--159] introduced a random intersection graph by taking randomly assigned sets. The random intersection graph $G(n,m;p)$ has $n","authors_text":"Jeong Han Kim, Joohan Na, Sang June Lee","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-10T16:47:52Z","title":"On the total variation distance between the binomial random graph and the random intersection graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.03389","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:92fd3e3d2c66aba3c719973db054187a6f52335ba06f207677445622ad2a96cb","target":"record","created_at":"2026-05-18T00:51:01Z","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":"8f37bcfdd2a86fd51975f009dd30d97d7284595e8ac1a302e4480063af56a68f","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-06-10T16:47:52Z","title_canon_sha256":"c0246d2c0399b32fb1d8046b62573a8d3992b4402124cd476a208486487d4ce8"},"schema_version":"1.0","source":{"id":"1506.03389","kind":"arxiv","version":2}},"canonical_sha256":"96bc45a2242ae2117e9fcd06de014dec87f157fdf44a96eafbe379c46e1c81f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96bc45a2242ae2117e9fcd06de014dec87f157fdf44a96eafbe379c46e1c81f8","first_computed_at":"2026-05-18T00:51:01.540852Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:01.540852Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GpSR7c3pPWbFfGggNDpie8JGp7riYi6HjpbJbJCPle26jLItuN06ZW4r1xsnVBPM/GYso8i0VbNMjMQztORHAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:01.541395Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.03389","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92fd3e3d2c66aba3c719973db054187a6f52335ba06f207677445622ad2a96cb","sha256:127e53dd68292ec512cd42a31513d0dfd3fe6af9643a3f94c10b49c4ad2305c6"],"state_sha256":"6fd872091c83809f79a461c37c6ad780f811b0bfad5f280187d22d0da022f2a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AdYnt3gyHmRmJyQRXRW3lJRD8gmOon3/AAmkaF4+yYBSwW2Wq1vjGWiaD38Ko9/IryTNm3Nfrr9ZirQ6QZwpDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:41:39.109637Z","bundle_sha256":"51f5baec91f3743425c7f3be8f735401a8d1938712e091d180d1db7a72f92c4c"}}