{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PKMII45TMO7KFFMYSOMCFNRZ4G","short_pith_number":"pith:PKMII45T","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"},"canonical_sha256":"7a988473b363bea29598939822b639e18b8a430d26746e332003cbc9ad0dfb0e","source":{"kind":"arxiv","id":"1302.4409","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4409","created_at":"2026-05-18T03:33:14Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4409v1","created_at":"2026-05-18T03:33:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4409","created_at":"2026-05-18T03:33:14Z"},{"alias_kind":"pith_short_12","alias_value":"PKMII45TMO7K","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PKMII45TMO7KFFMY","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PKMII45T","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PKMII45TMO7KFFMYSOMCFNRZ4G","target":"record","payload":{"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"},"canonical_sha256":"7a988473b363bea29598939822b639e18b8a430d26746e332003cbc9ad0dfb0e","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"},"source_kind":"arxiv","source_id":"1302.4409","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-18T03:33:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0XMXDH0RP7IoXyf5+GJBrUCarx1MYcfrVmiFAfZL2U5SWvA+p/k1CYgGBLOnBeUhxkiMo3BPnc/cDqN/9wEtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:37:54.916619Z"},"content_sha256":"08ae7df9754047756aa47d6b933d67f0cd45a2511bb11f1287c1f39545fb9f4c","schema_version":"1.0","event_id":"sha256:08ae7df9754047756aa47d6b933d67f0cd45a2511bb11f1287c1f39545fb9f4c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PKMII45TMO7KFFMYSOMCFNRZ4G","target":"graph","payload":{"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"},"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-18T03:33:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fsCVQuWLAamr6VeMQjEREszkF5+L2a5inFsRecHk4ywg8DI7Tnf9I/4/9+0TO5ho7qf9nfTUmi86rPUX7vOKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:37:54.916980Z"},"content_sha256":"407f30cd65fb28f82594a8bbb90588c572e48f792a4c7d4762afec2ffe5a64dd","schema_version":"1.0","event_id":"sha256:407f30cd65fb28f82594a8bbb90588c572e48f792a4c7d4762afec2ffe5a64dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PKMII45TMO7KFFMYSOMCFNRZ4G/bundle.json","state_url":"https://pith.science/pith/PKMII45TMO7KFFMYSOMCFNRZ4G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PKMII45TMO7KFFMYSOMCFNRZ4G/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-05T09:37:54Z","links":{"resolver":"https://pith.science/pith/PKMII45TMO7KFFMYSOMCFNRZ4G","bundle":"https://pith.science/pith/PKMII45TMO7KFFMYSOMCFNRZ4G/bundle.json","state":"https://pith.science/pith/PKMII45TMO7KFFMYSOMCFNRZ4G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PKMII45TMO7KFFMYSOMCFNRZ4G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PKMII45TMO7KFFMYSOMCFNRZ4G","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":"cedff2ea8d6f81a232bbc42e4d5b9f9ba59ae6989410dada969712d956e67e50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-18T20:13:02Z","title_canon_sha256":"79010d8bb0edb16208a0c5bdb30622c027fff5d2a610ec4c63988e801ab46a7c"},"schema_version":"1.0","source":{"id":"1302.4409","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4409","created_at":"2026-05-18T03:33:14Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4409v1","created_at":"2026-05-18T03:33:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4409","created_at":"2026-05-18T03:33:14Z"},{"alias_kind":"pith_short_12","alias_value":"PKMII45TMO7K","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PKMII45TMO7KFFMY","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PKMII45T","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:407f30cd65fb28f82594a8bbb90588c572e48f792a4c7d4762afec2ffe5a64dd","target":"graph","created_at":"2026-05-18T03:33:14Z","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 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","authors_text":"Mark E. Watkins, Simon M. Smith","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-18T20:13:02Z","title":"Bounding the distinguishing number of infinite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4409","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:08ae7df9754047756aa47d6b933d67f0cd45a2511bb11f1287c1f39545fb9f4c","target":"record","created_at":"2026-05-18T03:33:14Z","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":"cedff2ea8d6f81a232bbc42e4d5b9f9ba59ae6989410dada969712d956e67e50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-18T20:13:02Z","title_canon_sha256":"79010d8bb0edb16208a0c5bdb30622c027fff5d2a610ec4c63988e801ab46a7c"},"schema_version":"1.0","source":{"id":"1302.4409","kind":"arxiv","version":1}},"canonical_sha256":"7a988473b363bea29598939822b639e18b8a430d26746e332003cbc9ad0dfb0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a988473b363bea29598939822b639e18b8a430d26746e332003cbc9ad0dfb0e","first_computed_at":"2026-05-18T03:33:14.641409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:14.641409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1GRYXKq0feA86mShknxgp3OVIYpH/CwwZY18PI62U8ggL14C28iQMBsg6ota3S9PXtEuGH5dCWM1DPVxQTw1AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:14.642195Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.4409","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08ae7df9754047756aa47d6b933d67f0cd45a2511bb11f1287c1f39545fb9f4c","sha256:407f30cd65fb28f82594a8bbb90588c572e48f792a4c7d4762afec2ffe5a64dd"],"state_sha256":"e907268adf6b722af6ec9c11fd9cd3d35ffde63c435e273b9447a12edb601efb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"or9IQDPE16xCe8U8Vdctpr9c1XIoSHEm790pedZ+ktbWixpr+ov4Rx6uLysF80Dpa0OW9Dt8aqPr21Ys8OQNAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:37:54.919323Z","bundle_sha256":"e27fca94e3d212e87723e42b95398f275d8ab07d4e58fc1912cbf6df8f3e1226"}}