{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GSRMJZVWPGEDMSJENWPRYUPRTT","short_pith_number":"pith:GSRMJZVW","canonical_record":{"source":{"id":"1404.2910","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-04-10T19:19:21Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"7b4c0d31fa3b4ccbba20a02ef98fbe307b4fd53ae9fe2676c0411b1349361884","abstract_canon_sha256":"c0d812778e679fb0c4e3fb9d21aa2a61a600d48eacdeb2a4f3ecea488238d20a"},"schema_version":"1.0"},"canonical_sha256":"34a2c4e6b679883649246d9f1c51f19ced87e3e8d0444ce5cc7270377e854491","source":{"kind":"arxiv","id":"1404.2910","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2910","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2910v3","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2910","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"pith_short_12","alias_value":"GSRMJZVWPGED","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GSRMJZVWPGEDMSJE","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GSRMJZVW","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GSRMJZVWPGEDMSJENWPRYUPRTT","target":"record","payload":{"canonical_record":{"source":{"id":"1404.2910","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-04-10T19:19:21Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"7b4c0d31fa3b4ccbba20a02ef98fbe307b4fd53ae9fe2676c0411b1349361884","abstract_canon_sha256":"c0d812778e679fb0c4e3fb9d21aa2a61a600d48eacdeb2a4f3ecea488238d20a"},"schema_version":"1.0"},"canonical_sha256":"34a2c4e6b679883649246d9f1c51f19ced87e3e8d0444ce5cc7270377e854491","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:09.656380Z","signature_b64":"yb9sabC5QnLOSv6qiFG+kZYb39ZqcNKjMXsO/85tb7XC9rCCozcF3wo3ck2PY/D3xkFFsza01ea6z2ZwuCyFAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34a2c4e6b679883649246d9f1c51f19ced87e3e8d0444ce5cc7270377e854491","last_reissued_at":"2026-05-18T01:04:09.655713Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:09.655713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.2910","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"639hzd8uYa26lTRafH9+XqbFMhPT4FL1iCYm+cfa2Ayl6LDReYZID9hG/vxSvoF/NI8wKoMbxTzSIpqQXww0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:55:28.711348Z"},"content_sha256":"d47dbbdcfdae491283937cdabacc3c321b6cd22fbf80c9d6c68e6e533d320332","schema_version":"1.0","event_id":"sha256:d47dbbdcfdae491283937cdabacc3c321b6cd22fbf80c9d6c68e6e533d320332"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GSRMJZVWPGEDMSJENWPRYUPRTT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Statistical Tests for Large Tree-structured Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Arvind Rao, Dipak. K. Dey, Karthik Bharath, Prabhanjan Kambadur, Veerabhadran Baladandayuthapani","submitted_at":"2014-04-10T19:19:21Z","abstract_excerpt":"We develop a general statistical framework for the analysis and inference of large tree-structured data, with a focus on developing asymptotic goodness-of-fit tests. We first propose a consistent statistical model for binary trees, from which we develop a class of invariant tests. Using the model for binary trees, we then construct tests for general trees by using the distributional properties of the Continuum Random Tree, which arises as the invariant limit for a broad class of models for tree-structured data based on conditioned Galton--Watson processes. The test statistics for the goodness-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2910","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:04:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BXKwqt3z0xbX4TAgZrYnvAvA+3Uhsw5+jS5ZL7bZnSWGSaitktGzAJQZkF7hzqs7rsYJuqpzGh7LIlxLdrqhBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:55:28.712530Z"},"content_sha256":"2c099c65c8cc06be85d2bb4c3224457e9f8713ecba3a37b0b4b53a42efa10fb1","schema_version":"1.0","event_id":"sha256:2c099c65c8cc06be85d2bb4c3224457e9f8713ecba3a37b0b4b53a42efa10fb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GSRMJZVWPGEDMSJENWPRYUPRTT/bundle.json","state_url":"https://pith.science/pith/GSRMJZVWPGEDMSJENWPRYUPRTT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GSRMJZVWPGEDMSJENWPRYUPRTT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T21:55:28Z","links":{"resolver":"https://pith.science/pith/GSRMJZVWPGEDMSJENWPRYUPRTT","bundle":"https://pith.science/pith/GSRMJZVWPGEDMSJENWPRYUPRTT/bundle.json","state":"https://pith.science/pith/GSRMJZVWPGEDMSJENWPRYUPRTT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GSRMJZVWPGEDMSJENWPRYUPRTT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GSRMJZVWPGEDMSJENWPRYUPRTT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c0d812778e679fb0c4e3fb9d21aa2a61a600d48eacdeb2a4f3ecea488238d20a","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-04-10T19:19:21Z","title_canon_sha256":"7b4c0d31fa3b4ccbba20a02ef98fbe307b4fd53ae9fe2676c0411b1349361884"},"schema_version":"1.0","source":{"id":"1404.2910","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2910","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2910v3","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2910","created_at":"2026-05-18T01:04:09Z"},{"alias_kind":"pith_short_12","alias_value":"GSRMJZVWPGED","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GSRMJZVWPGEDMSJE","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GSRMJZVW","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:2c099c65c8cc06be85d2bb4c3224457e9f8713ecba3a37b0b4b53a42efa10fb1","target":"graph","created_at":"2026-05-18T01:04:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We develop a general statistical framework for the analysis and inference of large tree-structured data, with a focus on developing asymptotic goodness-of-fit tests. We first propose a consistent statistical model for binary trees, from which we develop a class of invariant tests. Using the model for binary trees, we then construct tests for general trees by using the distributional properties of the Continuum Random Tree, which arises as the invariant limit for a broad class of models for tree-structured data based on conditioned Galton--Watson processes. The test statistics for the goodness-","authors_text":"Arvind Rao, Dipak. K. Dey, Karthik Bharath, Prabhanjan Kambadur, Veerabhadran Baladandayuthapani","cross_cats":["stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-04-10T19:19:21Z","title":"Statistical Tests for Large Tree-structured Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2910","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d47dbbdcfdae491283937cdabacc3c321b6cd22fbf80c9d6c68e6e533d320332","target":"record","created_at":"2026-05-18T01:04:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c0d812778e679fb0c4e3fb9d21aa2a61a600d48eacdeb2a4f3ecea488238d20a","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-04-10T19:19:21Z","title_canon_sha256":"7b4c0d31fa3b4ccbba20a02ef98fbe307b4fd53ae9fe2676c0411b1349361884"},"schema_version":"1.0","source":{"id":"1404.2910","kind":"arxiv","version":3}},"canonical_sha256":"34a2c4e6b679883649246d9f1c51f19ced87e3e8d0444ce5cc7270377e854491","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34a2c4e6b679883649246d9f1c51f19ced87e3e8d0444ce5cc7270377e854491","first_computed_at":"2026-05-18T01:04:09.655713Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:09.655713Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yb9sabC5QnLOSv6qiFG+kZYb39ZqcNKjMXsO/85tb7XC9rCCozcF3wo3ck2PY/D3xkFFsza01ea6z2ZwuCyFAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:09.656380Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.2910","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d47dbbdcfdae491283937cdabacc3c321b6cd22fbf80c9d6c68e6e533d320332","sha256:2c099c65c8cc06be85d2bb4c3224457e9f8713ecba3a37b0b4b53a42efa10fb1"],"state_sha256":"19145c801c772f1564ad851bef6233b3330d9a2a6366403c5911122a35cfb0eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFXgOdY55ofsdEuYfzjQQFqyBQHdXzahXONWEfyCLiCJSpy0Ku8mVyLYoopwoEPm7VqV/KXYzESazwnPh7s0CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:55:28.715440Z","bundle_sha256":"f9c49035dd5107d5a883782852d46e865a2a5a9c66a1a04e906ea100c0734bb1"}}