{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PPTEWH3GQ46AZT47TMZQSP6BRZ","short_pith_number":"pith:PPTEWH3G","canonical_record":{"source":{"id":"1802.09839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-27T11:54:41Z","cross_cats_sorted":[],"title_canon_sha256":"211a4e6fa4edd92b6059ef7a01f181cfd1c354a5df590e07917bece2459ae648","abstract_canon_sha256":"53558e64be49596e315d56d91278377485be977b4f19abf68bef30adccf33894"},"schema_version":"1.0"},"canonical_sha256":"7be64b1f66873c0ccf9f9b33093fc18e69fd4ab0c1ab0ee6d1878e7b4b8a86cc","source":{"kind":"arxiv","id":"1802.09839","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09839","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09839v1","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09839","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"pith_short_12","alias_value":"PPTEWH3GQ46A","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PPTEWH3GQ46AZT47","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PPTEWH3G","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PPTEWH3GQ46AZT47TMZQSP6BRZ","target":"record","payload":{"canonical_record":{"source":{"id":"1802.09839","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-27T11:54:41Z","cross_cats_sorted":[],"title_canon_sha256":"211a4e6fa4edd92b6059ef7a01f181cfd1c354a5df590e07917bece2459ae648","abstract_canon_sha256":"53558e64be49596e315d56d91278377485be977b4f19abf68bef30adccf33894"},"schema_version":"1.0"},"canonical_sha256":"7be64b1f66873c0ccf9f9b33093fc18e69fd4ab0c1ab0ee6d1878e7b4b8a86cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:22.065721Z","signature_b64":"Mwht5jUCkWFy/AsDoFNHbWJ04M4QH5Yv+Df53eIJwhgIHMltZOaDNddCYOBdxTm/Yr+WklCpjqqKXfn9hrStCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7be64b1f66873c0ccf9f9b33093fc18e69fd4ab0c1ab0ee6d1878e7b4b8a86cc","last_reissued_at":"2026-05-18T00:22:22.065165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:22.065165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.09839","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-18T00:22:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D0PqirjptEi2POxcIMDAa43wfLI0CG/EnMsq5K0KDfxN1yko15KxhUpizdMX7MCZNaCjSh9dKBAwsIuGxXl+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T16:07:31.179327Z"},"content_sha256":"0f3971b46a1a9e0b62d12b8ab9f6fad17b993bd66bd7bda1475ac847a93d4799","schema_version":"1.0","event_id":"sha256:0f3971b46a1a9e0b62d12b8ab9f6fad17b993bd66bd7bda1475ac847a93d4799"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PPTEWH3GQ46AZT47TMZQSP6BRZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Isomorphism classification of infinite Sierpinski carpet graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alfredo Donno, Daniele D'Angeli","submitted_at":"2018-02-27T11:54:41Z","abstract_excerpt":"For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted limit graph. We show that there are uncountably many classes of isomorphism of such limit graphs, regarded as unrooted graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09839","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-18T00:22:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UJ25+TJ9FddZvTEiv2YVuY7rI0K0StP2FMKsXmk3EzxLGL548S3zwXnvFhOQN7ibZPNGNQTgOQzIRfy8255UDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T16:07:31.179677Z"},"content_sha256":"e0f64af8caf1eb262b7868c3f864fde40babf7fe78d19f9b6a58738c9487ddb1","schema_version":"1.0","event_id":"sha256:e0f64af8caf1eb262b7868c3f864fde40babf7fe78d19f9b6a58738c9487ddb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PPTEWH3GQ46AZT47TMZQSP6BRZ/bundle.json","state_url":"https://pith.science/pith/PPTEWH3GQ46AZT47TMZQSP6BRZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PPTEWH3GQ46AZT47TMZQSP6BRZ/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-21T16:07:31Z","links":{"resolver":"https://pith.science/pith/PPTEWH3GQ46AZT47TMZQSP6BRZ","bundle":"https://pith.science/pith/PPTEWH3GQ46AZT47TMZQSP6BRZ/bundle.json","state":"https://pith.science/pith/PPTEWH3GQ46AZT47TMZQSP6BRZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PPTEWH3GQ46AZT47TMZQSP6BRZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PPTEWH3GQ46AZT47TMZQSP6BRZ","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":"53558e64be49596e315d56d91278377485be977b4f19abf68bef30adccf33894","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-27T11:54:41Z","title_canon_sha256":"211a4e6fa4edd92b6059ef7a01f181cfd1c354a5df590e07917bece2459ae648"},"schema_version":"1.0","source":{"id":"1802.09839","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09839","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09839v1","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09839","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"pith_short_12","alias_value":"PPTEWH3GQ46A","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"PPTEWH3GQ46AZT47","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"PPTEWH3G","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:e0f64af8caf1eb262b7868c3f864fde40babf7fe78d19f9b6a58738c9487ddb1","target":"graph","created_at":"2026-05-18T00:22:22Z","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 each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted limit graph. We show that there are uncountably many classes of isomorphism of such limit graphs, regarded as unrooted graphs.","authors_text":"Alfredo Donno, Daniele D'Angeli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-27T11:54:41Z","title":"Isomorphism classification of infinite Sierpinski carpet graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09839","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:0f3971b46a1a9e0b62d12b8ab9f6fad17b993bd66bd7bda1475ac847a93d4799","target":"record","created_at":"2026-05-18T00:22:22Z","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":"53558e64be49596e315d56d91278377485be977b4f19abf68bef30adccf33894","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-27T11:54:41Z","title_canon_sha256":"211a4e6fa4edd92b6059ef7a01f181cfd1c354a5df590e07917bece2459ae648"},"schema_version":"1.0","source":{"id":"1802.09839","kind":"arxiv","version":1}},"canonical_sha256":"7be64b1f66873c0ccf9f9b33093fc18e69fd4ab0c1ab0ee6d1878e7b4b8a86cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7be64b1f66873c0ccf9f9b33093fc18e69fd4ab0c1ab0ee6d1878e7b4b8a86cc","first_computed_at":"2026-05-18T00:22:22.065165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:22.065165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mwht5jUCkWFy/AsDoFNHbWJ04M4QH5Yv+Df53eIJwhgIHMltZOaDNddCYOBdxTm/Yr+WklCpjqqKXfn9hrStCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:22.065721Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09839","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0f3971b46a1a9e0b62d12b8ab9f6fad17b993bd66bd7bda1475ac847a93d4799","sha256:e0f64af8caf1eb262b7868c3f864fde40babf7fe78d19f9b6a58738c9487ddb1"],"state_sha256":"087465f792a0b410b7b1540974dbc63a9bad38b05dd108609187eb18632efd9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YpG01a8C9J4MIUtrFjJ7zwopQozKsefrJi8LQqtt8OeJ2hoZm+HWZTbiZNE8MzTUwsXtOdDyimYF8L3EPkYaAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T16:07:31.181623Z","bundle_sha256":"a941cd2b05accfaf6201e0f73ba5a8ca8816c82d1ef8e1c78e5cb6ed69afae16"}}