{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VLSRFLX2CBS6G4IUN72EMCHQBR","short_pith_number":"pith:VLSRFLX2","schema_version":"1.0","canonical_sha256":"aae512aefa1065e371146ff44608f00c4de5ce7f626d174070d762fb76311c13","source":{"kind":"arxiv","id":"1312.4096","version":1},"attestation_state":"computed","paper":{"title":"A Simple Proof of the Cayley Formula using Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew He, Ray Li, Scott Wu, Steven Hao","submitted_at":"2013-12-15T01:04:34Z","abstract_excerpt":"We present a nice result on the probability of a cycle occurring in a randomly generated graph. We then provide some extensions and applications, including the proof of the famous Cayley formula, which states that the number of labeled trees on $n$ vertices is $n^{n-2}.$"},"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":"1312.4096","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-15T01:04:34Z","cross_cats_sorted":[],"title_canon_sha256":"90362947fb2831038b3891b017c0eabd0352302d590366c8986257d9bb04248b","abstract_canon_sha256":"129a382dae2b4a9086146309048fbb2389ab42fa11e48c5f317342146e1744bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:35.770035Z","signature_b64":"6o+vPFVEfBZ3FlS9tvXr16Eqlifd5iJBVIC8J4it+o4qTz118nQXdv4Ves+VgRvR3q5zJl7Bz9gIrimGXLxYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aae512aefa1065e371146ff44608f00c4de5ce7f626d174070d762fb76311c13","last_reissued_at":"2026-05-18T03:04:35.769178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:35.769178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Simple Proof of the Cayley Formula using Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew He, Ray Li, Scott Wu, Steven Hao","submitted_at":"2013-12-15T01:04:34Z","abstract_excerpt":"We present a nice result on the probability of a cycle occurring in a randomly generated graph. We then provide some extensions and applications, including the proof of the famous Cayley formula, which states that the number of labeled trees on $n$ vertices is $n^{n-2}.$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4096","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":"1312.4096","created_at":"2026-05-18T03:04:35.769330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.4096v1","created_at":"2026-05-18T03:04:35.769330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4096","created_at":"2026-05-18T03:04:35.769330+00:00"},{"alias_kind":"pith_short_12","alias_value":"VLSRFLX2CBS6","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VLSRFLX2CBS6G4IU","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VLSRFLX2","created_at":"2026-05-18T12:28:04.890932+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/VLSRFLX2CBS6G4IUN72EMCHQBR","json":"https://pith.science/pith/VLSRFLX2CBS6G4IUN72EMCHQBR.json","graph_json":"https://pith.science/api/pith-number/VLSRFLX2CBS6G4IUN72EMCHQBR/graph.json","events_json":"https://pith.science/api/pith-number/VLSRFLX2CBS6G4IUN72EMCHQBR/events.json","paper":"https://pith.science/paper/VLSRFLX2"},"agent_actions":{"view_html":"https://pith.science/pith/VLSRFLX2CBS6G4IUN72EMCHQBR","download_json":"https://pith.science/pith/VLSRFLX2CBS6G4IUN72EMCHQBR.json","view_paper":"https://pith.science/paper/VLSRFLX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.4096&json=true","fetch_graph":"https://pith.science/api/pith-number/VLSRFLX2CBS6G4IUN72EMCHQBR/graph.json","fetch_events":"https://pith.science/api/pith-number/VLSRFLX2CBS6G4IUN72EMCHQBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VLSRFLX2CBS6G4IUN72EMCHQBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VLSRFLX2CBS6G4IUN72EMCHQBR/action/storage_attestation","attest_author":"https://pith.science/pith/VLSRFLX2CBS6G4IUN72EMCHQBR/action/author_attestation","sign_citation":"https://pith.science/pith/VLSRFLX2CBS6G4IUN72EMCHQBR/action/citation_signature","submit_replication":"https://pith.science/pith/VLSRFLX2CBS6G4IUN72EMCHQBR/action/replication_record"}},"created_at":"2026-05-18T03:04:35.769330+00:00","updated_at":"2026-05-18T03:04:35.769330+00:00"}