{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SMAGDRJGRCM2R253PMDXH6CLWL","short_pith_number":"pith:SMAGDRJG","schema_version":"1.0","canonical_sha256":"930061c5268899a8ebbb7b0773f84bb2e44e5cc8af8889c6c9826b105ef4f619","source":{"kind":"arxiv","id":"1303.5139","version":2},"attestation_state":"computed","paper":{"title":"The first k-regular subgraph is large","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pu Gao","submitted_at":"2013-03-21T01:48:11Z","abstract_excerpt":"We prove that for sufficiently large k, there exist $0\\le\\sigma_k\\le\\eps_k\\to 0$ as $k\\to\\infty$, such that asymptotically almost surely the first k-regular subgraph appeared in the random graph process where one edge is added at a time has size between $(1-\\eps_k)|\\K_k|$ and $(1-\\sigma_k)|\\K_k|$, where $\\K_k$ denotes the $k$-core of the 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":"1303.5139","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-21T01:48:11Z","cross_cats_sorted":[],"title_canon_sha256":"98b975f83ded563c6eeb7c8570b927c796636899a86e609b8aa46c147054bf0b","abstract_canon_sha256":"162f4c9c300034b88a3af03a6e3444939927d178fd6163cfc7cd8748865fe73a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:12.895750Z","signature_b64":"AyqiNI+2GSzmQTrhnFonaNdU2Agy96zdRbtNpKihzqtfkEPfcJ2JDRBwKzGLEKgD6Iazn1xFX6BiJviQ4KyMCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"930061c5268899a8ebbb7b0773f84bb2e44e5cc8af8889c6c9826b105ef4f619","last_reissued_at":"2026-05-18T03:00:12.895184Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:12.895184Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The first k-regular subgraph is large","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Pu Gao","submitted_at":"2013-03-21T01:48:11Z","abstract_excerpt":"We prove that for sufficiently large k, there exist $0\\le\\sigma_k\\le\\eps_k\\to 0$ as $k\\to\\infty$, such that asymptotically almost surely the first k-regular subgraph appeared in the random graph process where one edge is added at a time has size between $(1-\\eps_k)|\\K_k|$ and $(1-\\sigma_k)|\\K_k|$, where $\\K_k$ denotes the $k$-core of the graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.5139","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":"1303.5139","created_at":"2026-05-18T03:00:12.895264+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.5139v2","created_at":"2026-05-18T03:00:12.895264+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.5139","created_at":"2026-05-18T03:00:12.895264+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMAGDRJGRCM2","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMAGDRJGRCM2R253","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMAGDRJG","created_at":"2026-05-18T12:27:59.945178+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/SMAGDRJGRCM2R253PMDXH6CLWL","json":"https://pith.science/pith/SMAGDRJGRCM2R253PMDXH6CLWL.json","graph_json":"https://pith.science/api/pith-number/SMAGDRJGRCM2R253PMDXH6CLWL/graph.json","events_json":"https://pith.science/api/pith-number/SMAGDRJGRCM2R253PMDXH6CLWL/events.json","paper":"https://pith.science/paper/SMAGDRJG"},"agent_actions":{"view_html":"https://pith.science/pith/SMAGDRJGRCM2R253PMDXH6CLWL","download_json":"https://pith.science/pith/SMAGDRJGRCM2R253PMDXH6CLWL.json","view_paper":"https://pith.science/paper/SMAGDRJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.5139&json=true","fetch_graph":"https://pith.science/api/pith-number/SMAGDRJGRCM2R253PMDXH6CLWL/graph.json","fetch_events":"https://pith.science/api/pith-number/SMAGDRJGRCM2R253PMDXH6CLWL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMAGDRJGRCM2R253PMDXH6CLWL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMAGDRJGRCM2R253PMDXH6CLWL/action/storage_attestation","attest_author":"https://pith.science/pith/SMAGDRJGRCM2R253PMDXH6CLWL/action/author_attestation","sign_citation":"https://pith.science/pith/SMAGDRJGRCM2R253PMDXH6CLWL/action/citation_signature","submit_replication":"https://pith.science/pith/SMAGDRJGRCM2R253PMDXH6CLWL/action/replication_record"}},"created_at":"2026-05-18T03:00:12.895264+00:00","updated_at":"2026-05-18T03:00:12.895264+00:00"}