{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4V7RTMHABQNKUB4YH7A3LNF3FR","short_pith_number":"pith:4V7RTMHA","schema_version":"1.0","canonical_sha256":"e57f19b0e00c1aaa07983fc1b5b4bb2c716fc9315e3e409e133b76e42017c72e","source":{"kind":"arxiv","id":"1502.00405","version":1},"attestation_state":"computed","paper":{"title":"Monotone Increasing Properties and Their Phase Transitions in Uniform Random Intersection Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","math.CO","math.PR"],"primary_cat":"physics.soc-ph","authors_text":"Jun Zhao, Osman Ya\\u{g}an, Virgil Gligor","submitted_at":"2015-02-02T09:04:51Z","abstract_excerpt":"Uniform random intersection graphs have received much interest and been used in diverse applications. A uniform random intersection graph with $n$ nodes is constructed as follows: each node selects a set of $K_n$ different items uniformly at random from the same pool of $P_n$ distinct items, and two nodes establish an undirected edge in between if and only if they share at least one item. For such graph denoted by $G(n, K_n, P_n)$, we present the following results in this paper. First, we provide an exact analysis on the probabilities of $G(n, K_n, P_n)$ having a perfect matching and having a "},"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":"1502.00405","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-02-02T09:04:51Z","cross_cats_sorted":["cs.DM","cs.SI","math.CO","math.PR"],"title_canon_sha256":"dcae88dd8f668ead6847fa1a6e6ad7bc038dccf0365226af1de1ec5fa91d7d13","abstract_canon_sha256":"fecb86836dc86917932216499b36e19b581451bac7d2eed83d141b0396955e15"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:06.055874Z","signature_b64":"tnNieXxOllrTKc3sT14klKyVBxsqgc+o0Bbq9tc3vApt7s8bOfFim2wg4WvKBMShNvavsDoJz/w/fMkr+4JlCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e57f19b0e00c1aaa07983fc1b5b4bb2c716fc9315e3e409e133b76e42017c72e","last_reissued_at":"2026-05-18T02:28:06.055439Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:06.055439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monotone Increasing Properties and Their Phase Transitions in Uniform Random Intersection Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI","math.CO","math.PR"],"primary_cat":"physics.soc-ph","authors_text":"Jun Zhao, Osman Ya\\u{g}an, Virgil Gligor","submitted_at":"2015-02-02T09:04:51Z","abstract_excerpt":"Uniform random intersection graphs have received much interest and been used in diverse applications. A uniform random intersection graph with $n$ nodes is constructed as follows: each node selects a set of $K_n$ different items uniformly at random from the same pool of $P_n$ distinct items, and two nodes establish an undirected edge in between if and only if they share at least one item. For such graph denoted by $G(n, K_n, P_n)$, we present the following results in this paper. First, we provide an exact analysis on the probabilities of $G(n, K_n, P_n)$ having a perfect matching and having a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00405","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":"1502.00405","created_at":"2026-05-18T02:28:06.055514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00405v1","created_at":"2026-05-18T02:28:06.055514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00405","created_at":"2026-05-18T02:28:06.055514+00:00"},{"alias_kind":"pith_short_12","alias_value":"4V7RTMHABQNK","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4V7RTMHABQNKUB4Y","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4V7RTMHA","created_at":"2026-05-18T12:29:05.191682+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/4V7RTMHABQNKUB4YH7A3LNF3FR","json":"https://pith.science/pith/4V7RTMHABQNKUB4YH7A3LNF3FR.json","graph_json":"https://pith.science/api/pith-number/4V7RTMHABQNKUB4YH7A3LNF3FR/graph.json","events_json":"https://pith.science/api/pith-number/4V7RTMHABQNKUB4YH7A3LNF3FR/events.json","paper":"https://pith.science/paper/4V7RTMHA"},"agent_actions":{"view_html":"https://pith.science/pith/4V7RTMHABQNKUB4YH7A3LNF3FR","download_json":"https://pith.science/pith/4V7RTMHABQNKUB4YH7A3LNF3FR.json","view_paper":"https://pith.science/paper/4V7RTMHA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00405&json=true","fetch_graph":"https://pith.science/api/pith-number/4V7RTMHABQNKUB4YH7A3LNF3FR/graph.json","fetch_events":"https://pith.science/api/pith-number/4V7RTMHABQNKUB4YH7A3LNF3FR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4V7RTMHABQNKUB4YH7A3LNF3FR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4V7RTMHABQNKUB4YH7A3LNF3FR/action/storage_attestation","attest_author":"https://pith.science/pith/4V7RTMHABQNKUB4YH7A3LNF3FR/action/author_attestation","sign_citation":"https://pith.science/pith/4V7RTMHABQNKUB4YH7A3LNF3FR/action/citation_signature","submit_replication":"https://pith.science/pith/4V7RTMHABQNKUB4YH7A3LNF3FR/action/replication_record"}},"created_at":"2026-05-18T02:28:06.055514+00:00","updated_at":"2026-05-18T02:28:06.055514+00:00"}