{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KMY7NPG7JQLRDQZEBH3RUS4WWZ","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":"a494acf4dad9b3416794fc4c924c000308811d7084cec79b8a17cd62c5c0a7a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-28T16:24:58Z","title_canon_sha256":"efbfd19fd215227e1ce7a2966fc656f34ecae02dff8bf1fa703718b43e3ddc57"},"schema_version":"1.0","source":{"id":"1811.11655","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11655","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11655v1","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11655","created_at":"2026-05-17T23:59:40Z"},{"alias_kind":"pith_short_12","alias_value":"KMY7NPG7JQLR","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KMY7NPG7JQLRDQZE","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KMY7NPG7","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:9e6770f7dd33d849b3a09bf9d9b7abf9f8f8190885f0c027ed37de6befb558ab","target":"graph","created_at":"2026-05-17T23:59:40Z","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":"A graph $G$ is \\textit{asymmetric} if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erd\\H{o}s and R\\'{e}nyi in 1963. They showed that the probability of a graph on $n$ vertices being asymmetric tends to $1$ as $n$ tends to infinity. In this paper, we first give consider the number of asymmetric trees, a question posed by Erd\\H{o}s and R\\'enyi. We give a partial result, showing that the number of asymmetric subdivided stars is approximately $q(n-1) - \\lfloor \\frac{n-1}{2} \\rfloor$ where $q(n)$ is the number of ways to sum to $n$ using distinct positive inte","authors_text":"Adam Gregory, Alejandra Brewer, Darren A. Narayan, Quindel Jones, Rigoberto Florez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-28T16:24:58Z","title":"Infinite Families of Asymmetric Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11655","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:03680577fbd1102453f2fd17277035454f6e6d4c94f32e3c270590209a254632","target":"record","created_at":"2026-05-17T23:59:40Z","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":"a494acf4dad9b3416794fc4c924c000308811d7084cec79b8a17cd62c5c0a7a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-28T16:24:58Z","title_canon_sha256":"efbfd19fd215227e1ce7a2966fc656f34ecae02dff8bf1fa703718b43e3ddc57"},"schema_version":"1.0","source":{"id":"1811.11655","kind":"arxiv","version":1}},"canonical_sha256":"5331f6bcdf4c1711c32409f71a4b96b64c52db04f9e4a530c60751d8c0b34982","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5331f6bcdf4c1711c32409f71a4b96b64c52db04f9e4a530c60751d8c0b34982","first_computed_at":"2026-05-17T23:59:40.388275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:40.388275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GuASK8DUsR+Dlpe+a9bA3zFIEsTq2wPuOQSm07OBsDavkCuXq2PPcsZy0VOUBWwXqZKDmd6rLI3TwAZtDqk9Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:40.388948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11655","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03680577fbd1102453f2fd17277035454f6e6d4c94f32e3c270590209a254632","sha256:9e6770f7dd33d849b3a09bf9d9b7abf9f8f8190885f0c027ed37de6befb558ab"],"state_sha256":"7d52cf681414c3e9193a0f36739643c5158d348c0e427bc7b91a2643a19a622a"}