{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DKG6WXXTNKGEWB3JXJMENCD5LQ","short_pith_number":"pith:DKG6WXXT","schema_version":"1.0","canonical_sha256":"1a8deb5ef36a8c4b0769ba5846887d5c1932fad91c41e0abc49b719b00d37fe1","source":{"kind":"arxiv","id":"1707.06030","version":1},"attestation_state":"computed","paper":{"title":"Horofunctions on Sierpi\\'nski type triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniele D'Angeli","submitted_at":"2017-07-19T11:45:04Z","abstract_excerpt":"We study an infinite set of graphs which are recursively constructed from an infinite word in a finite alphabet. These graphs are inspired by the construction of the Sierpi\\'nski gasket. We show that there are infinitely many non-isomorphic such graphs and we describe the horofunctions on the standard case."},"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":"1707.06030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-19T11:45:04Z","cross_cats_sorted":[],"title_canon_sha256":"4c585a0293fc397544d99a5e715fb22637ab16db815b41811d94f0f6ef011567","abstract_canon_sha256":"a6e1e4821d97135085bbbfbd6f3c58616db4320bc2ddc29a7d76e25861238fc8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:57.752813Z","signature_b64":"U8pbtaKDKs+VgVH5+NUmKSHw9AoUysLaGmkTZsYLB1LJTrS88fdkNY8WFXS9GWFkdYv3lttxjOW1dE5PllE6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a8deb5ef36a8c4b0769ba5846887d5c1932fad91c41e0abc49b719b00d37fe1","last_reissued_at":"2026-05-18T00:39:57.752175Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:57.752175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Horofunctions on Sierpi\\'nski type triangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniele D'Angeli","submitted_at":"2017-07-19T11:45:04Z","abstract_excerpt":"We study an infinite set of graphs which are recursively constructed from an infinite word in a finite alphabet. These graphs are inspired by the construction of the Sierpi\\'nski gasket. We show that there are infinitely many non-isomorphic such graphs and we describe the horofunctions on the standard case."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06030","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":"1707.06030","created_at":"2026-05-18T00:39:57.752287+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06030v1","created_at":"2026-05-18T00:39:57.752287+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06030","created_at":"2026-05-18T00:39:57.752287+00:00"},{"alias_kind":"pith_short_12","alias_value":"DKG6WXXTNKGE","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DKG6WXXTNKGEWB3J","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DKG6WXXT","created_at":"2026-05-18T12:31:10.602751+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/DKG6WXXTNKGEWB3JXJMENCD5LQ","json":"https://pith.science/pith/DKG6WXXTNKGEWB3JXJMENCD5LQ.json","graph_json":"https://pith.science/api/pith-number/DKG6WXXTNKGEWB3JXJMENCD5LQ/graph.json","events_json":"https://pith.science/api/pith-number/DKG6WXXTNKGEWB3JXJMENCD5LQ/events.json","paper":"https://pith.science/paper/DKG6WXXT"},"agent_actions":{"view_html":"https://pith.science/pith/DKG6WXXTNKGEWB3JXJMENCD5LQ","download_json":"https://pith.science/pith/DKG6WXXTNKGEWB3JXJMENCD5LQ.json","view_paper":"https://pith.science/paper/DKG6WXXT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06030&json=true","fetch_graph":"https://pith.science/api/pith-number/DKG6WXXTNKGEWB3JXJMENCD5LQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DKG6WXXTNKGEWB3JXJMENCD5LQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DKG6WXXTNKGEWB3JXJMENCD5LQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DKG6WXXTNKGEWB3JXJMENCD5LQ/action/storage_attestation","attest_author":"https://pith.science/pith/DKG6WXXTNKGEWB3JXJMENCD5LQ/action/author_attestation","sign_citation":"https://pith.science/pith/DKG6WXXTNKGEWB3JXJMENCD5LQ/action/citation_signature","submit_replication":"https://pith.science/pith/DKG6WXXTNKGEWB3JXJMENCD5LQ/action/replication_record"}},"created_at":"2026-05-18T00:39:57.752287+00:00","updated_at":"2026-05-18T00:39:57.752287+00:00"}