{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KMY7NPG7JQLRDQZEBH3RUS4WWZ","short_pith_number":"pith:KMY7NPG7","schema_version":"1.0","canonical_sha256":"5331f6bcdf4c1711c32409f71a4b96b64c52db04f9e4a530c60751d8c0b34982","source":{"kind":"arxiv","id":"1811.11655","version":1},"attestation_state":"computed","paper":{"title":"Infinite Families of Asymmetric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Gregory, Alejandra Brewer, Darren A. Narayan, Quindel Jones, Rigoberto Florez","submitted_at":"2018-11-28T16:24:58Z","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"},"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":"1811.11655","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-28T16:24:58Z","cross_cats_sorted":[],"title_canon_sha256":"efbfd19fd215227e1ce7a2966fc656f34ecae02dff8bf1fa703718b43e3ddc57","abstract_canon_sha256":"a494acf4dad9b3416794fc4c924c000308811d7084cec79b8a17cd62c5c0a7a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:40.388948Z","signature_b64":"GuASK8DUsR+Dlpe+a9bA3zFIEsTq2wPuOQSm07OBsDavkCuXq2PPcsZy0VOUBWwXqZKDmd6rLI3TwAZtDqk9Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5331f6bcdf4c1711c32409f71a4b96b64c52db04f9e4a530c60751d8c0b34982","last_reissued_at":"2026-05-17T23:59:40.388275Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:40.388275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Infinite Families of Asymmetric Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Gregory, Alejandra Brewer, Darren A. Narayan, Quindel Jones, Rigoberto Florez","submitted_at":"2018-11-28T16:24:58Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11655","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":"1811.11655","created_at":"2026-05-17T23:59:40.388392+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.11655v1","created_at":"2026-05-17T23:59:40.388392+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11655","created_at":"2026-05-17T23:59:40.388392+00:00"},{"alias_kind":"pith_short_12","alias_value":"KMY7NPG7JQLR","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KMY7NPG7JQLRDQZE","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KMY7NPG7","created_at":"2026-05-18T12:32:33.847187+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/KMY7NPG7JQLRDQZEBH3RUS4WWZ","json":"https://pith.science/pith/KMY7NPG7JQLRDQZEBH3RUS4WWZ.json","graph_json":"https://pith.science/api/pith-number/KMY7NPG7JQLRDQZEBH3RUS4WWZ/graph.json","events_json":"https://pith.science/api/pith-number/KMY7NPG7JQLRDQZEBH3RUS4WWZ/events.json","paper":"https://pith.science/paper/KMY7NPG7"},"agent_actions":{"view_html":"https://pith.science/pith/KMY7NPG7JQLRDQZEBH3RUS4WWZ","download_json":"https://pith.science/pith/KMY7NPG7JQLRDQZEBH3RUS4WWZ.json","view_paper":"https://pith.science/paper/KMY7NPG7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.11655&json=true","fetch_graph":"https://pith.science/api/pith-number/KMY7NPG7JQLRDQZEBH3RUS4WWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/KMY7NPG7JQLRDQZEBH3RUS4WWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KMY7NPG7JQLRDQZEBH3RUS4WWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KMY7NPG7JQLRDQZEBH3RUS4WWZ/action/storage_attestation","attest_author":"https://pith.science/pith/KMY7NPG7JQLRDQZEBH3RUS4WWZ/action/author_attestation","sign_citation":"https://pith.science/pith/KMY7NPG7JQLRDQZEBH3RUS4WWZ/action/citation_signature","submit_replication":"https://pith.science/pith/KMY7NPG7JQLRDQZEBH3RUS4WWZ/action/replication_record"}},"created_at":"2026-05-17T23:59:40.388392+00:00","updated_at":"2026-05-17T23:59:40.388392+00:00"}