{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MRUGQASYSAMSONEJSOJ2Z5A73Z","short_pith_number":"pith:MRUGQASY","schema_version":"1.0","canonical_sha256":"646868025890192734899393acf41fde6f8ee1fb3c2ef66531fd4d05206026ea","source":{"kind":"arxiv","id":"1405.0781","version":1},"attestation_state":"computed","paper":{"title":"Algorithms to test open set condition for self-similar set related to P.V. numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Hao Li, Li-Feng Xi, Qin Wang, qiu-li Guo","submitted_at":"2014-05-05T05:22:37Z","abstract_excerpt":"Fix a P.V. number $\\lambda ^{-1}>1.$ Given $\\mathbf{p}=(p_{1},\\cdots,p_{m})\\in \\mathbb{N}^{m}$, $\\mathbf{b}=(b_{1},\\cdots,b_{m})\\in \\mathbb{Q^{m}$, for the self-similar set $E_{\\mathbf{p},\\mathbf{b}}=\\cup_{i=1}^{m}(\\lambda ^{p_{i}}E_{\\mathbf{p},\\mathbf{b}}+b_{i})$ we find an efficient algorithm to test whether $E_{\\mathbf{p},\\mathbf{b}}$ satisfies the open set condition (strong separation condition) or not."},"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":"1405.0781","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2014-05-05T05:22:37Z","cross_cats_sorted":[],"title_canon_sha256":"eb3372cd1c6900ae0c499ce6cfae063b3b4ec580b98cf687e1633aedc72f1f5f","abstract_canon_sha256":"3c8ed1ffbb3b164d7bbb9b506daab1ca348081fc430f084fef605928b8d77486"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:40.717145Z","signature_b64":"af0pSPNrwog0qk36gsHrRz4EnIfZWq6npKRfMqegOhIvT/P6JnadqCsWZ23Bc5v/hYfj2+9my57e20qBFWBqCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"646868025890192734899393acf41fde6f8ee1fb3c2ef66531fd4d05206026ea","last_reissued_at":"2026-05-18T02:52:40.716728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:40.716728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms to test open set condition for self-similar set related to P.V. numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Hao Li, Li-Feng Xi, Qin Wang, qiu-li Guo","submitted_at":"2014-05-05T05:22:37Z","abstract_excerpt":"Fix a P.V. number $\\lambda ^{-1}>1.$ Given $\\mathbf{p}=(p_{1},\\cdots,p_{m})\\in \\mathbb{N}^{m}$, $\\mathbf{b}=(b_{1},\\cdots,b_{m})\\in \\mathbb{Q^{m}$, for the self-similar set $E_{\\mathbf{p},\\mathbf{b}}=\\cup_{i=1}^{m}(\\lambda ^{p_{i}}E_{\\mathbf{p},\\mathbf{b}}+b_{i})$ we find an efficient algorithm to test whether $E_{\\mathbf{p},\\mathbf{b}}$ satisfies the open set condition (strong separation condition) or not."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0781","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":"1405.0781","created_at":"2026-05-18T02:52:40.716792+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.0781v1","created_at":"2026-05-18T02:52:40.716792+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0781","created_at":"2026-05-18T02:52:40.716792+00:00"},{"alias_kind":"pith_short_12","alias_value":"MRUGQASYSAMS","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MRUGQASYSAMSONEJ","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MRUGQASY","created_at":"2026-05-18T12:28:38.356838+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/MRUGQASYSAMSONEJSOJ2Z5A73Z","json":"https://pith.science/pith/MRUGQASYSAMSONEJSOJ2Z5A73Z.json","graph_json":"https://pith.science/api/pith-number/MRUGQASYSAMSONEJSOJ2Z5A73Z/graph.json","events_json":"https://pith.science/api/pith-number/MRUGQASYSAMSONEJSOJ2Z5A73Z/events.json","paper":"https://pith.science/paper/MRUGQASY"},"agent_actions":{"view_html":"https://pith.science/pith/MRUGQASYSAMSONEJSOJ2Z5A73Z","download_json":"https://pith.science/pith/MRUGQASYSAMSONEJSOJ2Z5A73Z.json","view_paper":"https://pith.science/paper/MRUGQASY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.0781&json=true","fetch_graph":"https://pith.science/api/pith-number/MRUGQASYSAMSONEJSOJ2Z5A73Z/graph.json","fetch_events":"https://pith.science/api/pith-number/MRUGQASYSAMSONEJSOJ2Z5A73Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MRUGQASYSAMSONEJSOJ2Z5A73Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MRUGQASYSAMSONEJSOJ2Z5A73Z/action/storage_attestation","attest_author":"https://pith.science/pith/MRUGQASYSAMSONEJSOJ2Z5A73Z/action/author_attestation","sign_citation":"https://pith.science/pith/MRUGQASYSAMSONEJSOJ2Z5A73Z/action/citation_signature","submit_replication":"https://pith.science/pith/MRUGQASYSAMSONEJSOJ2Z5A73Z/action/replication_record"}},"created_at":"2026-05-18T02:52:40.716792+00:00","updated_at":"2026-05-18T02:52:40.716792+00:00"}