{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:X54NWKFABWIY4MNAXAKULTME2S","short_pith_number":"pith:X54NWKFA","schema_version":"1.0","canonical_sha256":"bf78db28a00d918e31a0b81545cd84d4a8a6562d0f6c40cdb2555fcff69b3429","source":{"kind":"arxiv","id":"1709.08433","version":1},"attestation_state":"computed","paper":{"title":"Star Saturation Number of Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Mohammadian, B. Tayfeh-Rezaie","submitted_at":"2017-09-25T11:39:11Z","abstract_excerpt":"For a given graph $F$, the $F$-saturation number of a graph $G$ is the minimum number of edges in an edge-maximal $F$-free subgraph of $G$. Recently, the $F$-saturation number of the Erd\\H{o}s$\\text{\\bf--}$R\\'enyi random graph $\\mathbbmsl{G}(n, p)$ has been determined asymptotically for any complete graph $F$. In this paper, we give an asymptotic formula for the $F$-saturation number of $\\mathbbmsl{G}(n, p)$ when $F$ is a star graph."},"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":"1709.08433","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-25T11:39:11Z","cross_cats_sorted":[],"title_canon_sha256":"9b7f9d6101fa030530be0e74ad328a58eba17ad858bc2358f4f75a05aff05d62","abstract_canon_sha256":"250ad94582aa516276680f8c1f3b5cf0ff9c05eb0310ff7673ff7f8d7ed27f26"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:25.668215Z","signature_b64":"QYk/V37O1unkwx6dQ1v2bRIzLtXvlwir3R81Am9ONhPW4axPMMkglDRoz5Tm7ednl78rllpNKABYFBHlx+UVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf78db28a00d918e31a0b81545cd84d4a8a6562d0f6c40cdb2555fcff69b3429","last_reissued_at":"2026-05-18T00:34:25.667745Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:25.667745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Star Saturation Number of Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"A. Mohammadian, B. Tayfeh-Rezaie","submitted_at":"2017-09-25T11:39:11Z","abstract_excerpt":"For a given graph $F$, the $F$-saturation number of a graph $G$ is the minimum number of edges in an edge-maximal $F$-free subgraph of $G$. Recently, the $F$-saturation number of the Erd\\H{o}s$\\text{\\bf--}$R\\'enyi random graph $\\mathbbmsl{G}(n, p)$ has been determined asymptotically for any complete graph $F$. In this paper, we give an asymptotic formula for the $F$-saturation number of $\\mathbbmsl{G}(n, p)$ when $F$ is a star graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08433","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":"1709.08433","created_at":"2026-05-18T00:34:25.667815+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.08433v1","created_at":"2026-05-18T00:34:25.667815+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08433","created_at":"2026-05-18T00:34:25.667815+00:00"},{"alias_kind":"pith_short_12","alias_value":"X54NWKFABWIY","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"X54NWKFABWIY4MNA","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"X54NWKFA","created_at":"2026-05-18T12:31:53.515858+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/X54NWKFABWIY4MNAXAKULTME2S","json":"https://pith.science/pith/X54NWKFABWIY4MNAXAKULTME2S.json","graph_json":"https://pith.science/api/pith-number/X54NWKFABWIY4MNAXAKULTME2S/graph.json","events_json":"https://pith.science/api/pith-number/X54NWKFABWIY4MNAXAKULTME2S/events.json","paper":"https://pith.science/paper/X54NWKFA"},"agent_actions":{"view_html":"https://pith.science/pith/X54NWKFABWIY4MNAXAKULTME2S","download_json":"https://pith.science/pith/X54NWKFABWIY4MNAXAKULTME2S.json","view_paper":"https://pith.science/paper/X54NWKFA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.08433&json=true","fetch_graph":"https://pith.science/api/pith-number/X54NWKFABWIY4MNAXAKULTME2S/graph.json","fetch_events":"https://pith.science/api/pith-number/X54NWKFABWIY4MNAXAKULTME2S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X54NWKFABWIY4MNAXAKULTME2S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X54NWKFABWIY4MNAXAKULTME2S/action/storage_attestation","attest_author":"https://pith.science/pith/X54NWKFABWIY4MNAXAKULTME2S/action/author_attestation","sign_citation":"https://pith.science/pith/X54NWKFABWIY4MNAXAKULTME2S/action/citation_signature","submit_replication":"https://pith.science/pith/X54NWKFABWIY4MNAXAKULTME2S/action/replication_record"}},"created_at":"2026-05-18T00:34:25.667815+00:00","updated_at":"2026-05-18T00:34:25.667815+00:00"}