{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PKMII45TMO7KFFMYSOMCFNRZ4G","short_pith_number":"pith:PKMII45T","schema_version":"1.0","canonical_sha256":"7a988473b363bea29598939822b639e18b8a430d26746e332003cbc9ad0dfb0e","source":{"kind":"arxiv","id":"1302.4409","version":1},"attestation_state":"computed","paper":{"title":"Bounding the distinguishing number of infinite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mark E. Watkins, Simon M. Smith","submitted_at":"2013-02-18T20:13:02Z","abstract_excerpt":"A group of permutations G of a set V is k-distinguishable if there exists a partition of V into k parts such that only the identity permutation in G fixes setwise all of the cells of the partition. The least cardinal number k such that (G,V) is k-distinguishable is its distinguishing number. In particular, a graph X is k-distinguishable if its automorphism group Aut(X) has distinguishing number at most k in its action on the vertices of X.\n  Various results in the literature demonstrate that when an infinite graph fails to have some property, then often some finite subgraph is similarly defici"},"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":"1302.4409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-18T20:13:02Z","cross_cats_sorted":[],"title_canon_sha256":"79010d8bb0edb16208a0c5bdb30622c027fff5d2a610ec4c63988e801ab46a7c","abstract_canon_sha256":"cedff2ea8d6f81a232bbc42e4d5b9f9ba59ae6989410dada969712d956e67e50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:14.642195Z","signature_b64":"1GRYXKq0feA86mShknxgp3OVIYpH/CwwZY18PI62U8ggL14C28iQMBsg6ota3S9PXtEuGH5dCWM1DPVxQTw1AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a988473b363bea29598939822b639e18b8a430d26746e332003cbc9ad0dfb0e","last_reissued_at":"2026-05-18T03:33:14.641409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:14.641409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounding the distinguishing number of infinite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mark E. Watkins, Simon M. Smith","submitted_at":"2013-02-18T20:13:02Z","abstract_excerpt":"A group of permutations G of a set V is k-distinguishable if there exists a partition of V into k parts such that only the identity permutation in G fixes setwise all of the cells of the partition. The least cardinal number k such that (G,V) is k-distinguishable is its distinguishing number. In particular, a graph X is k-distinguishable if its automorphism group Aut(X) has distinguishing number at most k in its action on the vertices of X.\n  Various results in the literature demonstrate that when an infinite graph fails to have some property, then often some finite subgraph is similarly defici"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4409","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":"1302.4409","created_at":"2026-05-18T03:33:14.641537+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4409v1","created_at":"2026-05-18T03:33:14.641537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4409","created_at":"2026-05-18T03:33:14.641537+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKMII45TMO7K","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKMII45TMO7KFFMY","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKMII45T","created_at":"2026-05-18T12:27:54.935989+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/PKMII45TMO7KFFMYSOMCFNRZ4G","json":"https://pith.science/pith/PKMII45TMO7KFFMYSOMCFNRZ4G.json","graph_json":"https://pith.science/api/pith-number/PKMII45TMO7KFFMYSOMCFNRZ4G/graph.json","events_json":"https://pith.science/api/pith-number/PKMII45TMO7KFFMYSOMCFNRZ4G/events.json","paper":"https://pith.science/paper/PKMII45T"},"agent_actions":{"view_html":"https://pith.science/pith/PKMII45TMO7KFFMYSOMCFNRZ4G","download_json":"https://pith.science/pith/PKMII45TMO7KFFMYSOMCFNRZ4G.json","view_paper":"https://pith.science/paper/PKMII45T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4409&json=true","fetch_graph":"https://pith.science/api/pith-number/PKMII45TMO7KFFMYSOMCFNRZ4G/graph.json","fetch_events":"https://pith.science/api/pith-number/PKMII45TMO7KFFMYSOMCFNRZ4G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKMII45TMO7KFFMYSOMCFNRZ4G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKMII45TMO7KFFMYSOMCFNRZ4G/action/storage_attestation","attest_author":"https://pith.science/pith/PKMII45TMO7KFFMYSOMCFNRZ4G/action/author_attestation","sign_citation":"https://pith.science/pith/PKMII45TMO7KFFMYSOMCFNRZ4G/action/citation_signature","submit_replication":"https://pith.science/pith/PKMII45TMO7KFFMYSOMCFNRZ4G/action/replication_record"}},"created_at":"2026-05-18T03:33:14.641537+00:00","updated_at":"2026-05-18T03:33:14.641537+00:00"}