{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:B2O2NTMTH4ZAGS2XUJ2HY6RARQ","short_pith_number":"pith:B2O2NTMT","schema_version":"1.0","canonical_sha256":"0e9da6cd933f32034b57a2747c7a208c137baa7578da3f786ffc9421b2aa4520","source":{"kind":"arxiv","id":"2508.04765","version":1},"attestation_state":"computed","paper":{"title":"Hyperbolic tiling neighborhoods in O(1) time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.other","hep-lat"],"primary_cat":"physics.comp-ph","authors_text":"Johanna Erdmenger, Manuel Schrauth, Yanick Thurn","submitted_at":"2025-08-06T18:00:01Z","abstract_excerpt":"Tilings of the hyperbolic plane are of significant interest among many branches of mathematics, physics and computer science. Yet, their construction remains a non-trivial task. Current approaches primarily use tree-based recursive algorithms, which are fundamentally limited: they do not readily yield the neighborhood graph representing cell adjacencies, which is however required for many applications. We introduce a novel approach that allows to build hyperbolic tilings and their associated graph structure simultaneously, using only combinatoric rules without requiring an explicit coordinate "},"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":"2508.04765","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"physics.comp-ph","submitted_at":"2025-08-06T18:00:01Z","cross_cats_sorted":["cond-mat.other","hep-lat"],"title_canon_sha256":"e2f19c201cbfdb7150dde42209b84258357407360f9588ddddca34cc480d505f","abstract_canon_sha256":"9fd68dcc5c66c1dfd63a3eff9e309fe9ce1ca42392632579f2f1282f970ba085"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:50:01.284141Z","signature_b64":"oyoBi2cyU0WBflw9LR4lRaCCobmU/XdaXyFWbPzCBfFAhVLfBhpW7LbfbHeQ/CkDsYa3PiPXZBR2qoF7roMRCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e9da6cd933f32034b57a2747c7a208c137baa7578da3f786ffc9421b2aa4520","last_reissued_at":"2026-07-05T11:50:01.283682Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:50:01.283682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hyperbolic tiling neighborhoods in O(1) time","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cond-mat.other","hep-lat"],"primary_cat":"physics.comp-ph","authors_text":"Johanna Erdmenger, Manuel Schrauth, Yanick Thurn","submitted_at":"2025-08-06T18:00:01Z","abstract_excerpt":"Tilings of the hyperbolic plane are of significant interest among many branches of mathematics, physics and computer science. Yet, their construction remains a non-trivial task. Current approaches primarily use tree-based recursive algorithms, which are fundamentally limited: they do not readily yield the neighborhood graph representing cell adjacencies, which is however required for many applications. We introduce a novel approach that allows to build hyperbolic tilings and their associated graph structure simultaneously, using only combinatoric rules without requiring an explicit coordinate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.04765","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2508.04765/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2508.04765","created_at":"2026-07-05T11:50:01.283742+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.04765v1","created_at":"2026-07-05T11:50:01.283742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.04765","created_at":"2026-07-05T11:50:01.283742+00:00"},{"alias_kind":"pith_short_12","alias_value":"B2O2NTMTH4ZA","created_at":"2026-07-05T11:50:01.283742+00:00"},{"alias_kind":"pith_short_16","alias_value":"B2O2NTMTH4ZAGS2X","created_at":"2026-07-05T11:50:01.283742+00:00"},{"alias_kind":"pith_short_8","alias_value":"B2O2NTMT","created_at":"2026-07-05T11:50:01.283742+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/B2O2NTMTH4ZAGS2XUJ2HY6RARQ","json":"https://pith.science/pith/B2O2NTMTH4ZAGS2XUJ2HY6RARQ.json","graph_json":"https://pith.science/api/pith-number/B2O2NTMTH4ZAGS2XUJ2HY6RARQ/graph.json","events_json":"https://pith.science/api/pith-number/B2O2NTMTH4ZAGS2XUJ2HY6RARQ/events.json","paper":"https://pith.science/paper/B2O2NTMT"},"agent_actions":{"view_html":"https://pith.science/pith/B2O2NTMTH4ZAGS2XUJ2HY6RARQ","download_json":"https://pith.science/pith/B2O2NTMTH4ZAGS2XUJ2HY6RARQ.json","view_paper":"https://pith.science/paper/B2O2NTMT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.04765&json=true","fetch_graph":"https://pith.science/api/pith-number/B2O2NTMTH4ZAGS2XUJ2HY6RARQ/graph.json","fetch_events":"https://pith.science/api/pith-number/B2O2NTMTH4ZAGS2XUJ2HY6RARQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B2O2NTMTH4ZAGS2XUJ2HY6RARQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B2O2NTMTH4ZAGS2XUJ2HY6RARQ/action/storage_attestation","attest_author":"https://pith.science/pith/B2O2NTMTH4ZAGS2XUJ2HY6RARQ/action/author_attestation","sign_citation":"https://pith.science/pith/B2O2NTMTH4ZAGS2XUJ2HY6RARQ/action/citation_signature","submit_replication":"https://pith.science/pith/B2O2NTMTH4ZAGS2XUJ2HY6RARQ/action/replication_record"}},"created_at":"2026-07-05T11:50:01.283742+00:00","updated_at":"2026-07-05T11:50:01.283742+00:00"}