{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:X54NWKFABWIY4MNAXAKULTME2S","short_pith_number":"pith:X54NWKFA","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"},"canonical_sha256":"bf78db28a00d918e31a0b81545cd84d4a8a6562d0f6c40cdb2555fcff69b3429","source":{"kind":"arxiv","id":"1709.08433","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08433","created_at":"2026-05-18T00:34:25Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08433v1","created_at":"2026-05-18T00:34:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08433","created_at":"2026-05-18T00:34:25Z"},{"alias_kind":"pith_short_12","alias_value":"X54NWKFABWIY","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X54NWKFABWIY4MNA","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X54NWKFA","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:X54NWKFABWIY4MNAXAKULTME2S","target":"record","payload":{"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"},"canonical_sha256":"bf78db28a00d918e31a0b81545cd84d4a8a6562d0f6c40cdb2555fcff69b3429","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"},"source_kind":"arxiv","source_id":"1709.08433","source_version":1,"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:34:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C0A/FkuPuL3QVrsU5vPZfj+dfBjxpMNjaCkYAVJyeV3OwoYZtOrtL4uByWwh2TE9g/SdodO6ap/va3uuz/qsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:23:50.338567Z"},"content_sha256":"665d2ebc9bbb6dbcbbaa4228adc88e9f3a785bc5b487cf527a429c20420317de","schema_version":"1.0","event_id":"sha256:665d2ebc9bbb6dbcbbaa4228adc88e9f3a785bc5b487cf527a429c20420317de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:X54NWKFABWIY4MNAXAKULTME2S","target":"graph","payload":{"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"},"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:34:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IiUtgbhRFeFYiqjx5tvoUSdRqik09xTpkggTdu04rzYg4JXyIbYpTjmlJh/I4GFO8Dhb5BRUMhSpsYEfzNZ7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T08:23:50.338906Z"},"content_sha256":"35a595d1ed2341ee3a5327e950f01ec659509fb6aa2b06d8a8ddb7fda7b1c5c9","schema_version":"1.0","event_id":"sha256:35a595d1ed2341ee3a5327e950f01ec659509fb6aa2b06d8a8ddb7fda7b1c5c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X54NWKFABWIY4MNAXAKULTME2S/bundle.json","state_url":"https://pith.science/pith/X54NWKFABWIY4MNAXAKULTME2S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X54NWKFABWIY4MNAXAKULTME2S/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-23T08:23:50Z","links":{"resolver":"https://pith.science/pith/X54NWKFABWIY4MNAXAKULTME2S","bundle":"https://pith.science/pith/X54NWKFABWIY4MNAXAKULTME2S/bundle.json","state":"https://pith.science/pith/X54NWKFABWIY4MNAXAKULTME2S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X54NWKFABWIY4MNAXAKULTME2S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:X54NWKFABWIY4MNAXAKULTME2S","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":"250ad94582aa516276680f8c1f3b5cf0ff9c05eb0310ff7673ff7f8d7ed27f26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-25T11:39:11Z","title_canon_sha256":"9b7f9d6101fa030530be0e74ad328a58eba17ad858bc2358f4f75a05aff05d62"},"schema_version":"1.0","source":{"id":"1709.08433","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08433","created_at":"2026-05-18T00:34:25Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08433v1","created_at":"2026-05-18T00:34:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08433","created_at":"2026-05-18T00:34:25Z"},{"alias_kind":"pith_short_12","alias_value":"X54NWKFABWIY","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X54NWKFABWIY4MNA","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X54NWKFA","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:35a595d1ed2341ee3a5327e950f01ec659509fb6aa2b06d8a8ddb7fda7b1c5c9","target":"graph","created_at":"2026-05-18T00:34:25Z","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":"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.","authors_text":"A. Mohammadian, B. Tayfeh-Rezaie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-25T11:39:11Z","title":"Star Saturation Number of Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08433","kind":"arxiv","version":1},"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:665d2ebc9bbb6dbcbbaa4228adc88e9f3a785bc5b487cf527a429c20420317de","target":"record","created_at":"2026-05-18T00:34:25Z","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":"250ad94582aa516276680f8c1f3b5cf0ff9c05eb0310ff7673ff7f8d7ed27f26","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-25T11:39:11Z","title_canon_sha256":"9b7f9d6101fa030530be0e74ad328a58eba17ad858bc2358f4f75a05aff05d62"},"schema_version":"1.0","source":{"id":"1709.08433","kind":"arxiv","version":1}},"canonical_sha256":"bf78db28a00d918e31a0b81545cd84d4a8a6562d0f6c40cdb2555fcff69b3429","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf78db28a00d918e31a0b81545cd84d4a8a6562d0f6c40cdb2555fcff69b3429","first_computed_at":"2026-05-18T00:34:25.667745Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:25.667745Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QYk/V37O1unkwx6dQ1v2bRIzLtXvlwir3R81Am9ONhPW4axPMMkglDRoz5Tm7ednl78rllpNKABYFBHlx+UVAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:25.668215Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.08433","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:665d2ebc9bbb6dbcbbaa4228adc88e9f3a785bc5b487cf527a429c20420317de","sha256:35a595d1ed2341ee3a5327e950f01ec659509fb6aa2b06d8a8ddb7fda7b1c5c9"],"state_sha256":"2837278415e985f4b8826fdc43faeeea8dd463d40c8fa846754644274c1ced9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DzwudbR5jXu+omSQSyjz1rvDAJZVPlyHLWrleLDTjPGxz6aJNMg6VJrEhk5AQQ/gJRPHj6dUp2oAXhx7LcKsDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T08:23:50.340849Z","bundle_sha256":"693b556de0d662bbd085be87e37f7a64de69d4c489e5304207754f4509786bb5"}}