{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AEY4FEEKAWDCSPEF5OSAAKEF3Z","short_pith_number":"pith:AEY4FEEK","canonical_record":{"source":{"id":"1206.4203","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2012-06-19T13:29:04Z","cross_cats_sorted":["hep-th","math.CO","math.MP"],"title_canon_sha256":"bedf100c95c219f8cf7eb7e4d02aa36e1821b419165298f4e22e016f16770a7e","abstract_canon_sha256":"ea10d7822b8c6f815f3bfcba1eb0ea9d19bc25eff300bb74e53dfbd90cbd7bad"},"schema_version":"1.0"},"canonical_sha256":"0131c2908a0586293c85eba4002885de450dce487b1402e7c6e6521de1d1c417","source":{"kind":"arxiv","id":"1206.4203","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.4203","created_at":"2026-05-18T03:53:16Z"},{"alias_kind":"arxiv_version","alias_value":"1206.4203v1","created_at":"2026-05-18T03:53:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4203","created_at":"2026-05-18T03:53:16Z"},{"alias_kind":"pith_short_12","alias_value":"AEY4FEEKAWDC","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AEY4FEEKAWDCSPEF","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AEY4FEEK","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AEY4FEEKAWDCSPEF5OSAAKEF3Z","target":"record","payload":{"canonical_record":{"source":{"id":"1206.4203","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2012-06-19T13:29:04Z","cross_cats_sorted":["hep-th","math.CO","math.MP"],"title_canon_sha256":"bedf100c95c219f8cf7eb7e4d02aa36e1821b419165298f4e22e016f16770a7e","abstract_canon_sha256":"ea10d7822b8c6f815f3bfcba1eb0ea9d19bc25eff300bb74e53dfbd90cbd7bad"},"schema_version":"1.0"},"canonical_sha256":"0131c2908a0586293c85eba4002885de450dce487b1402e7c6e6521de1d1c417","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:16.458591Z","signature_b64":"vmWEMHMNxKIsB+69GH51O+DFrpRZT1HKEVk5f6vQ2TJHNIJC7kMdBcdrGHQ9bAqs/U5Nzx/yuWpI6L3I2ZLJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0131c2908a0586293c85eba4002885de450dce487b1402e7c6e6521de1d1c417","last_reissued_at":"2026-05-18T03:53:16.457879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:16.457879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.4203","source_version":1,"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-18T03:53:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EN3RW1mYjUve6y2BfXhNQDa7ZOzyUFYtINh/PCyn5iPHqeyORHV0/kv/dLDbCZpYNjhtm8KXKBCgq4kfuk3SDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T06:26:10.125659Z"},"content_sha256":"72300b1f59ffaba79108350fea7cf2a364c716168fd6c195e39f2ea251f2bcab","schema_version":"1.0","event_id":"sha256:72300b1f59ffaba79108350fea7cf2a364c716168fd6c195e39f2ea251f2bcab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AEY4FEEKAWDCSPEF5OSAAKEF3Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Line-Colored D-ary Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["hep-th","math.CO","math.MP"],"primary_cat":"math-ph","authors_text":"Razvan Gurau, Valentin Bonzom","submitted_at":"2012-06-19T13:29:04Z","abstract_excerpt":"Random tensor models are generalizations of matrix models which also support a 1/N expansion. The dominant observables are in correspondence with some trees, namely rooted trees with vertices of degree at most $D$ and lines colored by a number $i$ from 1 to $D$ such that no two lines connecting a vertex to its descendants have the same color. In this Letter we study by independent methods a generating function for these observables. We prove that the number of such trees with exactly $p_i$ lines of color $i$ is $\\frac{1}{\\sum_{i=1}^D p_i +1} \\binom{\\sum_{i=1}^D p_i+1}{p_1} ... \\binom{\\sum_{i=1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4203","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"},"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-18T03:53:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0rfbFJ5s86Vf7BDbBD4seUZflb/jfjOOH+xcJe6vaRFJxUOfteSfL3PT7eo9EuaCPc2aHNS6KhLkgMMKjjFHAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T06:26:10.126034Z"},"content_sha256":"1a79a37d38699f2196ecd9ae5584350dd41048be12d7545b6020fbdb113d8258","schema_version":"1.0","event_id":"sha256:1a79a37d38699f2196ecd9ae5584350dd41048be12d7545b6020fbdb113d8258"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AEY4FEEKAWDCSPEF5OSAAKEF3Z/bundle.json","state_url":"https://pith.science/pith/AEY4FEEKAWDCSPEF5OSAAKEF3Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AEY4FEEKAWDCSPEF5OSAAKEF3Z/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-06-28T06:26:10Z","links":{"resolver":"https://pith.science/pith/AEY4FEEKAWDCSPEF5OSAAKEF3Z","bundle":"https://pith.science/pith/AEY4FEEKAWDCSPEF5OSAAKEF3Z/bundle.json","state":"https://pith.science/pith/AEY4FEEKAWDCSPEF5OSAAKEF3Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AEY4FEEKAWDCSPEF5OSAAKEF3Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AEY4FEEKAWDCSPEF5OSAAKEF3Z","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":"ea10d7822b8c6f815f3bfcba1eb0ea9d19bc25eff300bb74e53dfbd90cbd7bad","cross_cats_sorted":["hep-th","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2012-06-19T13:29:04Z","title_canon_sha256":"bedf100c95c219f8cf7eb7e4d02aa36e1821b419165298f4e22e016f16770a7e"},"schema_version":"1.0","source":{"id":"1206.4203","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.4203","created_at":"2026-05-18T03:53:16Z"},{"alias_kind":"arxiv_version","alias_value":"1206.4203v1","created_at":"2026-05-18T03:53:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4203","created_at":"2026-05-18T03:53:16Z"},{"alias_kind":"pith_short_12","alias_value":"AEY4FEEKAWDC","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AEY4FEEKAWDCSPEF","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AEY4FEEK","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:1a79a37d38699f2196ecd9ae5584350dd41048be12d7545b6020fbdb113d8258","target":"graph","created_at":"2026-05-18T03:53:16Z","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":"Random tensor models are generalizations of matrix models which also support a 1/N expansion. The dominant observables are in correspondence with some trees, namely rooted trees with vertices of degree at most $D$ and lines colored by a number $i$ from 1 to $D$ such that no two lines connecting a vertex to its descendants have the same color. In this Letter we study by independent methods a generating function for these observables. We prove that the number of such trees with exactly $p_i$ lines of color $i$ is $\\frac{1}{\\sum_{i=1}^D p_i +1} \\binom{\\sum_{i=1}^D p_i+1}{p_1} ... \\binom{\\sum_{i=1","authors_text":"Razvan Gurau, Valentin Bonzom","cross_cats":["hep-th","math.CO","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2012-06-19T13:29:04Z","title":"Counting Line-Colored D-ary Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4203","kind":"arxiv","version":1},"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:72300b1f59ffaba79108350fea7cf2a364c716168fd6c195e39f2ea251f2bcab","target":"record","created_at":"2026-05-18T03:53:16Z","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":"ea10d7822b8c6f815f3bfcba1eb0ea9d19bc25eff300bb74e53dfbd90cbd7bad","cross_cats_sorted":["hep-th","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math-ph","submitted_at":"2012-06-19T13:29:04Z","title_canon_sha256":"bedf100c95c219f8cf7eb7e4d02aa36e1821b419165298f4e22e016f16770a7e"},"schema_version":"1.0","source":{"id":"1206.4203","kind":"arxiv","version":1}},"canonical_sha256":"0131c2908a0586293c85eba4002885de450dce487b1402e7c6e6521de1d1c417","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0131c2908a0586293c85eba4002885de450dce487b1402e7c6e6521de1d1c417","first_computed_at":"2026-05-18T03:53:16.457879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:16.457879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vmWEMHMNxKIsB+69GH51O+DFrpRZT1HKEVk5f6vQ2TJHNIJC7kMdBcdrGHQ9bAqs/U5Nzx/yuWpI6L3I2ZLJAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:16.458591Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.4203","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72300b1f59ffaba79108350fea7cf2a364c716168fd6c195e39f2ea251f2bcab","sha256:1a79a37d38699f2196ecd9ae5584350dd41048be12d7545b6020fbdb113d8258"],"state_sha256":"902edfe750962d411bb0048f2cb83c5154cd621b137999d611c9210eb697505b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0RL0bSNaKJEmhQv35pbY460JtTL1YXjFrk/FnEj3X0bUEyDDc74lzSxIPrEUJLiiPdEoR5qg9cmCmwuiqCUBAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T06:26:10.128408Z","bundle_sha256":"94c9d5971782d18ad0a6f9620c61bd0cc1d345ebc0a5e79173db46bfabdf557d"}}