{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:F34NUOWMHS4GCGQLEXLTRU5UJX","short_pith_number":"pith:F34NUOWM","schema_version":"1.0","canonical_sha256":"2ef8da3acc3cb8611a0b25d738d3b44de5839948dd63502ff0a25e0dc7e72a43","source":{"kind":"arxiv","id":"1512.00398","version":1},"attestation_state":"computed","paper":{"title":"Grout: A 1-Dimensional Substitution Tiling Space Program","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Dan Rust, Scott Balchin","submitted_at":"2015-12-01T19:29:57Z","abstract_excerpt":"We introduce a GUI fronted program that can compute combinatorial properties and topological invariants of recognisable and primitive symbolic substitutions on finite alphabets and their associated tiling spaces. We introduce theory from the study of aperiodic 1-dimensional tilings along with pseudocode highlighting the algorithms that we have implemented into the GUI. Grout is written using C++ and its standard library."},"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":"1512.00398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2015-12-01T19:29:57Z","cross_cats_sorted":[],"title_canon_sha256":"26da320447bfa89aeab2dbea71d3c0ac8d91892d6fee6c08d66cc0913e902007","abstract_canon_sha256":"1e152ec3281f6b678652a2bc830b3474bc246cac34b354b747925dbda20fc47a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:32.033463Z","signature_b64":"0gcLEDbDOeQ4FvGhYA0xL2Olaok9MAoYHCZHagzPQpBVBUSYPNQ6zSLbnPSqTXe4SW7JF7UYBik+8nJGiWkgDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ef8da3acc3cb8611a0b25d738d3b44de5839948dd63502ff0a25e0dc7e72a43","last_reissued_at":"2026-05-18T01:25:32.032956Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:32.032956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Grout: A 1-Dimensional Substitution Tiling Space Program","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.DS","authors_text":"Dan Rust, Scott Balchin","submitted_at":"2015-12-01T19:29:57Z","abstract_excerpt":"We introduce a GUI fronted program that can compute combinatorial properties and topological invariants of recognisable and primitive symbolic substitutions on finite alphabets and their associated tiling spaces. We introduce theory from the study of aperiodic 1-dimensional tilings along with pseudocode highlighting the algorithms that we have implemented into the GUI. Grout is written using C++ and its standard library."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.00398","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":"1512.00398","created_at":"2026-05-18T01:25:32.033047+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.00398v1","created_at":"2026-05-18T01:25:32.033047+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.00398","created_at":"2026-05-18T01:25:32.033047+00:00"},{"alias_kind":"pith_short_12","alias_value":"F34NUOWMHS4G","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"F34NUOWMHS4GCGQL","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"F34NUOWM","created_at":"2026-05-18T12:29:19.899920+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/F34NUOWMHS4GCGQLEXLTRU5UJX","json":"https://pith.science/pith/F34NUOWMHS4GCGQLEXLTRU5UJX.json","graph_json":"https://pith.science/api/pith-number/F34NUOWMHS4GCGQLEXLTRU5UJX/graph.json","events_json":"https://pith.science/api/pith-number/F34NUOWMHS4GCGQLEXLTRU5UJX/events.json","paper":"https://pith.science/paper/F34NUOWM"},"agent_actions":{"view_html":"https://pith.science/pith/F34NUOWMHS4GCGQLEXLTRU5UJX","download_json":"https://pith.science/pith/F34NUOWMHS4GCGQLEXLTRU5UJX.json","view_paper":"https://pith.science/paper/F34NUOWM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.00398&json=true","fetch_graph":"https://pith.science/api/pith-number/F34NUOWMHS4GCGQLEXLTRU5UJX/graph.json","fetch_events":"https://pith.science/api/pith-number/F34NUOWMHS4GCGQLEXLTRU5UJX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F34NUOWMHS4GCGQLEXLTRU5UJX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F34NUOWMHS4GCGQLEXLTRU5UJX/action/storage_attestation","attest_author":"https://pith.science/pith/F34NUOWMHS4GCGQLEXLTRU5UJX/action/author_attestation","sign_citation":"https://pith.science/pith/F34NUOWMHS4GCGQLEXLTRU5UJX/action/citation_signature","submit_replication":"https://pith.science/pith/F34NUOWMHS4GCGQLEXLTRU5UJX/action/replication_record"}},"created_at":"2026-05-18T01:25:32.033047+00:00","updated_at":"2026-05-18T01:25:32.033047+00:00"}