{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4HMTFQZ2T4JL7QPTSDBG7RAHFF","short_pith_number":"pith:4HMTFQZ2","schema_version":"1.0","canonical_sha256":"e1d932c33a9f12bfc1f390c26fc407295fe4210a8340c84cfdb202f7a018b9f4","source":{"kind":"arxiv","id":"1510.08511","version":1},"attestation_state":"computed","paper":{"title":"Lower bound of the asymptotic complexity of self-similar fractal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"math.CO","authors_text":"Konstantinos Tsougkas","submitted_at":"2015-10-28T22:20:27Z","abstract_excerpt":"We study the asymptotic complexity constant of the sequence of approximating graphs to a fully symmetric self-similar structure on a finitely ramified fractal $K$. We show how full symmetry implies existence of the asymptotic complexity constant and obtain a sharp lower bound thereby answering two conjectures by Anema."},"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":"1510.08511","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-28T22:20:27Z","cross_cats_sorted":["math.SP"],"title_canon_sha256":"3c530b810e636653143fa259c1dbd81f21dacb8d7914f5bdfd4c3b2053878bba","abstract_canon_sha256":"58581f51646f0d7deb20aa35d371a31799aeb1c272c1503cd164f9ffb31ec3d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:56.645618Z","signature_b64":"lQkPsHc9v0VB+Xh0ibAJL53mNF4hWtWSrv7BYhMqVQXQ5VSvPXejH9crHI3fUKutjRipWU0dWhty7HuGai8eAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1d932c33a9f12bfc1f390c26fc407295fe4210a8340c84cfdb202f7a018b9f4","last_reissued_at":"2026-05-18T01:25:56.644924Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:56.644924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bound of the asymptotic complexity of self-similar fractal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"math.CO","authors_text":"Konstantinos Tsougkas","submitted_at":"2015-10-28T22:20:27Z","abstract_excerpt":"We study the asymptotic complexity constant of the sequence of approximating graphs to a fully symmetric self-similar structure on a finitely ramified fractal $K$. We show how full symmetry implies existence of the asymptotic complexity constant and obtain a sharp lower bound thereby answering two conjectures by Anema."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08511","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":"1510.08511","created_at":"2026-05-18T01:25:56.645030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.08511v1","created_at":"2026-05-18T01:25:56.645030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08511","created_at":"2026-05-18T01:25:56.645030+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HMTFQZ2T4JL","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HMTFQZ2T4JL7QPT","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HMTFQZ2","created_at":"2026-05-18T12:29:05.191682+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/4HMTFQZ2T4JL7QPTSDBG7RAHFF","json":"https://pith.science/pith/4HMTFQZ2T4JL7QPTSDBG7RAHFF.json","graph_json":"https://pith.science/api/pith-number/4HMTFQZ2T4JL7QPTSDBG7RAHFF/graph.json","events_json":"https://pith.science/api/pith-number/4HMTFQZ2T4JL7QPTSDBG7RAHFF/events.json","paper":"https://pith.science/paper/4HMTFQZ2"},"agent_actions":{"view_html":"https://pith.science/pith/4HMTFQZ2T4JL7QPTSDBG7RAHFF","download_json":"https://pith.science/pith/4HMTFQZ2T4JL7QPTSDBG7RAHFF.json","view_paper":"https://pith.science/paper/4HMTFQZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.08511&json=true","fetch_graph":"https://pith.science/api/pith-number/4HMTFQZ2T4JL7QPTSDBG7RAHFF/graph.json","fetch_events":"https://pith.science/api/pith-number/4HMTFQZ2T4JL7QPTSDBG7RAHFF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HMTFQZ2T4JL7QPTSDBG7RAHFF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HMTFQZ2T4JL7QPTSDBG7RAHFF/action/storage_attestation","attest_author":"https://pith.science/pith/4HMTFQZ2T4JL7QPTSDBG7RAHFF/action/author_attestation","sign_citation":"https://pith.science/pith/4HMTFQZ2T4JL7QPTSDBG7RAHFF/action/citation_signature","submit_replication":"https://pith.science/pith/4HMTFQZ2T4JL7QPTSDBG7RAHFF/action/replication_record"}},"created_at":"2026-05-18T01:25:56.645030+00:00","updated_at":"2026-05-18T01:25:56.645030+00:00"}