{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6XZRL4EFLF5W6H4OUV34FSAI7B","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":"93cad9111720481cc2d9bad98248064022b103375604fd87d152b68d8ef30823","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-08T20:22:46Z","title_canon_sha256":"de5defeccc54e701727ce338b251b0579b7de3f633072aa9263536f139ae003d"},"schema_version":"1.0","source":{"id":"1310.2268","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2268","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2268v1","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2268","created_at":"2026-05-18T03:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"6XZRL4EFLF5W","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6XZRL4EFLF5W6H4O","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6XZRL4EF","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:efa11542d7cbdc2bb65a8e50f7e76b381da4d04d02344de7fce9b08a0b74b35f","target":"graph","created_at":"2026-05-18T03:10:57Z","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":"For any graph $G$ on $n$ vertices and for any {\\em symmetric} subgraph $J$ of $K_{n,n}$, we construct an infinite sequence of graphs based on the pair $(G,J)$. The First graph in the sequence is $G$, then at each stage replacing every vertex of the previous graph by a copy of $G$ and every edge of the previous graph by a copy of $J$ the new graph is constructed. We call these graphs {\\em self-similar} graphs. We are interested in delineating those pairs $(G,J)$ for which the chromatic numbers of the graphs in the sequence are bounded. Here we have some partial results. When $G$ is a complete g","authors_text":"C. E. Larson, C. J. Tymczak, Kiran B. Chilakamarri, M. F. Khan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-08T20:22:46Z","title":"Self-Similar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2268","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:4457caf2963824719d25d2f66c207038b7a3ba26178fc828834281fb7bdfec76","target":"record","created_at":"2026-05-18T03:10:57Z","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":"93cad9111720481cc2d9bad98248064022b103375604fd87d152b68d8ef30823","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-08T20:22:46Z","title_canon_sha256":"de5defeccc54e701727ce338b251b0579b7de3f633072aa9263536f139ae003d"},"schema_version":"1.0","source":{"id":"1310.2268","kind":"arxiv","version":1}},"canonical_sha256":"f5f315f085597b6f1f8ea577c2c808f84a19f2618cebfe4662c413555c2e62d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5f315f085597b6f1f8ea577c2c808f84a19f2618cebfe4662c413555c2e62d5","first_computed_at":"2026-05-18T03:10:57.469217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:57.469217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kiY4bCLzdY73rFJRUdJ6ArzxHJtVKhnDT0k21F68l504MuvIavW5FJQKfpJ70bQ2qJ/NT4P1Q/Bveu0vCTk7Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:57.470130Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2268","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4457caf2963824719d25d2f66c207038b7a3ba26178fc828834281fb7bdfec76","sha256:efa11542d7cbdc2bb65a8e50f7e76b381da4d04d02344de7fce9b08a0b74b35f"],"state_sha256":"31caca5b7719c2a471d9b8a4a4a8748ac5cddcd307b3dbe62f547f419ae8c848"}