{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:S26ELIREFLRBC7U7ZUDN4AKN5S","short_pith_number":"pith:S26ELIRE","schema_version":"1.0","canonical_sha256":"96bc45a2242ae2117e9fcd06de014dec87f157fdf44a96eafbe379c46e1c81f8","source":{"kind":"arxiv","id":"1506.03389","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.03389","created_at":"2026-05-18T00:51:01.540946+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.03389v2","created_at":"2026-05-18T00:51:01.540946+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.03389","created_at":"2026-05-18T00:51:01.540946+00:00"},{"alias_kind":"pith_short_12","alias_value":"S26ELIREFLRB","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"S26ELIREFLRBC7U7","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"S26ELIRE","created_at":"2026-05-18T12:29:39.896362+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/S26ELIREFLRBC7U7ZUDN4AKN5S","json":"https://pith.science/pith/S26ELIREFLRBC7U7ZUDN4AKN5S.json","graph_json":"https://pith.science/api/pith-number/S26ELIREFLRBC7U7ZUDN4AKN5S/graph.json","events_json":"https://pith.science/api/pith-number/S26ELIREFLRBC7U7ZUDN4AKN5S/events.json","paper":"https://pith.science/paper/S26ELIRE"},"agent_actions":{"view_html":"https://pith.science/pith/S26ELIREFLRBC7U7ZUDN4AKN5S","download_json":"https://pith.science/pith/S26ELIREFLRBC7U7ZUDN4AKN5S.json","view_paper":"https://pith.science/paper/S26ELIRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.03389&json=true","fetch_graph":"https://pith.science/api/pith-number/S26ELIREFLRBC7U7ZUDN4AKN5S/graph.json","fetch_events":"https://pith.science/api/pith-number/S26ELIREFLRBC7U7ZUDN4AKN5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S26ELIREFLRBC7U7ZUDN4AKN5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S26ELIREFLRBC7U7ZUDN4AKN5S/action/storage_attestation","attest_author":"https://pith.science/pith/S26ELIREFLRBC7U7ZUDN4AKN5S/action/author_attestation","sign_citation":"https://pith.science/pith/S26ELIREFLRBC7U7ZUDN4AKN5S/action/citation_signature","submit_replication":"https://pith.science/pith/S26ELIREFLRBC7U7ZUDN4AKN5S/action/replication_record"}},"created_at":"2026-05-18T00:51:01.540946+00:00","updated_at":"2026-05-18T00:51:01.540946+00:00"}