{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:WOANM2NJAH5KTB4GIOHVU4OZJO","short_pith_number":"pith:WOANM2NJ","canonical_record":{"source":{"id":"1511.04395","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-13T18:41:58Z","cross_cats_sorted":[],"title_canon_sha256":"2d99330a11cfb4e01c4f350dbacc22b0ce42866fad16c44a1f522dc2f8e83623","abstract_canon_sha256":"04164663e1b36998db21025c003b731284805cf74b69f1042d2beb6ab6684405"},"schema_version":"1.0"},"canonical_sha256":"b380d669a901faa98786438f5a71d94b8326be34e8d9ede96b528d0d09c16d06","source":{"kind":"arxiv","id":"1511.04395","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04395","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04395v1","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04395","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"WOANM2NJAH5K","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WOANM2NJAH5KTB4G","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WOANM2NJ","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:WOANM2NJAH5KTB4GIOHVU4OZJO","target":"record","payload":{"canonical_record":{"source":{"id":"1511.04395","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-13T18:41:58Z","cross_cats_sorted":[],"title_canon_sha256":"2d99330a11cfb4e01c4f350dbacc22b0ce42866fad16c44a1f522dc2f8e83623","abstract_canon_sha256":"04164663e1b36998db21025c003b731284805cf74b69f1042d2beb6ab6684405"},"schema_version":"1.0"},"canonical_sha256":"b380d669a901faa98786438f5a71d94b8326be34e8d9ede96b528d0d09c16d06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:58.989872Z","signature_b64":"+3XIWthgKUtehrY7kjfHsiwz8WO+0++3Xb8y3ZRJ4yNLfUt4OKn1Oi89Edyy/fgG9IxciRbFs9TWWctzxYlgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b380d669a901faa98786438f5a71d94b8326be34e8d9ede96b528d0d09c16d06","last_reissued_at":"2026-05-18T01:26:58.989264Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:58.989264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.04395","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HMBqeyKO07KG1HHC2sV657aHJ8VixAptQNNBCcGILX1MfSXCcO90kfvP3LmuJeIJq0XWTBfvaiCACV7A0a41Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:04:36.477623Z"},"content_sha256":"7e671c2ad4836255494ab4b3eea6bf10bc5b7b57b57104fad6a4e6c9088e38d9","schema_version":"1.0","event_id":"sha256:7e671c2ad4836255494ab4b3eea6bf10bc5b7b57b57104fad6a4e6c9088e38d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:WOANM2NJAH5KTB4GIOHVU4OZJO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a theorem of Halin","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Simon M. Smith, Wilfried Imrich","submitted_at":"2015-11-13T18:41:58Z","abstract_excerpt":"This note presents a new, elementary proof of a generalization of a theorem of Halin to graphs with unbounded degrees, which is then applied to show that every connected, countably infinite graph G with a subdegree-finite, infinite automorphism group whose cardinality is strictly less than continuum, has a finite set F of vertices that is setwise stabilized only by the identity automorphism. A bound on the size of such sets, which are called distinguishing, is also provided.\n  To put this theorem of Halin and its generalization into perspective, we also discuss several related non-elementary, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04395","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:26:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uJeRVjPWK5Ou2loCCv8T9c3IiIYmLxSisf5LLbOxmc9+W+iLxWNgTfV/DhiT426MigZ47IkejlWpw+JUv1SyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:04:36.477969Z"},"content_sha256":"dc4c2b40ee8161522084bd024434dc0e1f2b24134efbc7d0935501ef33d405ab","schema_version":"1.0","event_id":"sha256:dc4c2b40ee8161522084bd024434dc0e1f2b24134efbc7d0935501ef33d405ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WOANM2NJAH5KTB4GIOHVU4OZJO/bundle.json","state_url":"https://pith.science/pith/WOANM2NJAH5KTB4GIOHVU4OZJO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WOANM2NJAH5KTB4GIOHVU4OZJO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T11:04:36Z","links":{"resolver":"https://pith.science/pith/WOANM2NJAH5KTB4GIOHVU4OZJO","bundle":"https://pith.science/pith/WOANM2NJAH5KTB4GIOHVU4OZJO/bundle.json","state":"https://pith.science/pith/WOANM2NJAH5KTB4GIOHVU4OZJO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WOANM2NJAH5KTB4GIOHVU4OZJO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:WOANM2NJAH5KTB4GIOHVU4OZJO","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":"04164663e1b36998db21025c003b731284805cf74b69f1042d2beb6ab6684405","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-13T18:41:58Z","title_canon_sha256":"2d99330a11cfb4e01c4f350dbacc22b0ce42866fad16c44a1f522dc2f8e83623"},"schema_version":"1.0","source":{"id":"1511.04395","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.04395","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"arxiv_version","alias_value":"1511.04395v1","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.04395","created_at":"2026-05-18T01:26:58Z"},{"alias_kind":"pith_short_12","alias_value":"WOANM2NJAH5K","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"WOANM2NJAH5KTB4G","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"WOANM2NJ","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:dc4c2b40ee8161522084bd024434dc0e1f2b24134efbc7d0935501ef33d405ab","target":"graph","created_at":"2026-05-18T01:26:58Z","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":"This note presents a new, elementary proof of a generalization of a theorem of Halin to graphs with unbounded degrees, which is then applied to show that every connected, countably infinite graph G with a subdegree-finite, infinite automorphism group whose cardinality is strictly less than continuum, has a finite set F of vertices that is setwise stabilized only by the identity automorphism. A bound on the size of such sets, which are called distinguishing, is also provided.\n  To put this theorem of Halin and its generalization into perspective, we also discuss several related non-elementary, ","authors_text":"Simon M. Smith, Wilfried Imrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-13T18:41:58Z","title":"On a theorem of Halin"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.04395","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:7e671c2ad4836255494ab4b3eea6bf10bc5b7b57b57104fad6a4e6c9088e38d9","target":"record","created_at":"2026-05-18T01:26:58Z","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":"04164663e1b36998db21025c003b731284805cf74b69f1042d2beb6ab6684405","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-13T18:41:58Z","title_canon_sha256":"2d99330a11cfb4e01c4f350dbacc22b0ce42866fad16c44a1f522dc2f8e83623"},"schema_version":"1.0","source":{"id":"1511.04395","kind":"arxiv","version":1}},"canonical_sha256":"b380d669a901faa98786438f5a71d94b8326be34e8d9ede96b528d0d09c16d06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b380d669a901faa98786438f5a71d94b8326be34e8d9ede96b528d0d09c16d06","first_computed_at":"2026-05-18T01:26:58.989264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:58.989264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+3XIWthgKUtehrY7kjfHsiwz8WO+0++3Xb8y3ZRJ4yNLfUt4OKn1Oi89Edyy/fgG9IxciRbFs9TWWctzxYlgDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:58.989872Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.04395","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e671c2ad4836255494ab4b3eea6bf10bc5b7b57b57104fad6a4e6c9088e38d9","sha256:dc4c2b40ee8161522084bd024434dc0e1f2b24134efbc7d0935501ef33d405ab"],"state_sha256":"5d9984a28342c71d98babe6223fdb2fed8e0dfd44464bbecbe623d600e257ba3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O4KHWVrisDT5wgypFNaetxZ6I142vmDJuKIqeqse4UfkWunNtnkCDfliPMc13/96MkXHR0dHjUEqQQT/iOV5BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:04:36.480053Z","bundle_sha256":"bddc6e52baa92cdad9cd739457cb38202494d3e76ab1a2c8ca4f66a42de01157"}}