{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EJBFKC2APD5WL4SAAUGYRHOVTA","short_pith_number":"pith:EJBFKC2A","schema_version":"1.0","canonical_sha256":"2242550b4078fb65f240050d889dd598020b424e89d7e5afe94157a762eb6549","source":{"kind":"arxiv","id":"1605.03390","version":2},"attestation_state":"computed","paper":{"title":"Variance of the Internal Profile in Suffix Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jeffrey Gaither, Mark Daniel Ward","submitted_at":"2016-05-11T11:47:59Z","abstract_excerpt":"The precise analysis of the variance of the profile of a suffix tree has been a longstanding open problem. We analyze three regimes of the asymptotic growth of the variance of the profile of a suffix tree built from a randomly generated binary string, in the nonuniform case. We utilize combinatorics on words, singularity analysis, and the Mellin transform."},"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":"1605.03390","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-11T11:47:59Z","cross_cats_sorted":[],"title_canon_sha256":"db268676d03f39c9ef37ea0996a512b6705ce4a679048a1f38f41580ab9fb49b","abstract_canon_sha256":"e1f25a057c96a7e86f641988c283995b36953bee8cd33d53f9d77e68b21baf0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:54.655355Z","signature_b64":"1Zm49rFVRyodQZ/EcNum1MgHXyaApP3wmkh4LXf1g9Wvq68QqH6ZBGgiKu/KAtRoNlkoqK9bbwwX3wemP3IUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2242550b4078fb65f240050d889dd598020b424e89d7e5afe94157a762eb6549","last_reissued_at":"2026-05-18T01:14:54.654824Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:54.654824Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variance of the Internal Profile in Suffix Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jeffrey Gaither, Mark Daniel Ward","submitted_at":"2016-05-11T11:47:59Z","abstract_excerpt":"The precise analysis of the variance of the profile of a suffix tree has been a longstanding open problem. We analyze three regimes of the asymptotic growth of the variance of the profile of a suffix tree built from a randomly generated binary string, in the nonuniform case. We utilize combinatorics on words, singularity analysis, and the Mellin transform."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.03390","kind":"arxiv","version":2},"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":"1605.03390","created_at":"2026-05-18T01:14:54.654899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.03390v2","created_at":"2026-05-18T01:14:54.654899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.03390","created_at":"2026-05-18T01:14:54.654899+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJBFKC2APD5W","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJBFKC2APD5WL4SA","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJBFKC2A","created_at":"2026-05-18T12:30:12.583610+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/EJBFKC2APD5WL4SAAUGYRHOVTA","json":"https://pith.science/pith/EJBFKC2APD5WL4SAAUGYRHOVTA.json","graph_json":"https://pith.science/api/pith-number/EJBFKC2APD5WL4SAAUGYRHOVTA/graph.json","events_json":"https://pith.science/api/pith-number/EJBFKC2APD5WL4SAAUGYRHOVTA/events.json","paper":"https://pith.science/paper/EJBFKC2A"},"agent_actions":{"view_html":"https://pith.science/pith/EJBFKC2APD5WL4SAAUGYRHOVTA","download_json":"https://pith.science/pith/EJBFKC2APD5WL4SAAUGYRHOVTA.json","view_paper":"https://pith.science/paper/EJBFKC2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.03390&json=true","fetch_graph":"https://pith.science/api/pith-number/EJBFKC2APD5WL4SAAUGYRHOVTA/graph.json","fetch_events":"https://pith.science/api/pith-number/EJBFKC2APD5WL4SAAUGYRHOVTA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJBFKC2APD5WL4SAAUGYRHOVTA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJBFKC2APD5WL4SAAUGYRHOVTA/action/storage_attestation","attest_author":"https://pith.science/pith/EJBFKC2APD5WL4SAAUGYRHOVTA/action/author_attestation","sign_citation":"https://pith.science/pith/EJBFKC2APD5WL4SAAUGYRHOVTA/action/citation_signature","submit_replication":"https://pith.science/pith/EJBFKC2APD5WL4SAAUGYRHOVTA/action/replication_record"}},"created_at":"2026-05-18T01:14:54.654899+00:00","updated_at":"2026-05-18T01:14:54.654899+00:00"}