{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:I3X6EY2AMT2QYOHZDXYOWAUQ2M","short_pith_number":"pith:I3X6EY2A","schema_version":"1.0","canonical_sha256":"46efe2634064f50c38f91df0eb0290d32108a4ba7e58a56d21d8a6e2176285f2","source":{"kind":"arxiv","id":"1102.2708","version":1},"attestation_state":"computed","paper":{"title":"On the enumeration of labelled hypertrees and of labelled bipartite trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Roland Bacher (IF)","submitted_at":"2011-02-14T09:26:58Z","abstract_excerpt":"We give a simple formula for the number of hypertrees with $k$ hyperedges of given sizes and $n+1$ labelled vertices with prescribed degrees. A slight generalization of this formula counts labelled bipartite trees with prescribed degrees in each class of vertices."},"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":"1102.2708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-14T09:26:58Z","cross_cats_sorted":[],"title_canon_sha256":"f35f254ae8db575e322373bbf577eb9a055f6a1254271a908fddf5548a71b94b","abstract_canon_sha256":"3ab45655e2400d14504d3e7f99b420bb7c5893457e7b95c43424a584798cfaa1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:46.668291Z","signature_b64":"V+VmA/hI2KIZYQprdabfO8MMxmt+KFXzUxJJCLWxdjgL6UX3d6rb56qym+7UYTTeHLgHdCbzWIe8hjGGZUYVDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46efe2634064f50c38f91df0eb0290d32108a4ba7e58a56d21d8a6e2176285f2","last_reissued_at":"2026-05-18T04:28:46.667679Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:46.667679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the enumeration of labelled hypertrees and of labelled bipartite trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Roland Bacher (IF)","submitted_at":"2011-02-14T09:26:58Z","abstract_excerpt":"We give a simple formula for the number of hypertrees with $k$ hyperedges of given sizes and $n+1$ labelled vertices with prescribed degrees. A slight generalization of this formula counts labelled bipartite trees with prescribed degrees in each class of vertices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2708","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":"1102.2708","created_at":"2026-05-18T04:28:46.667780+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.2708v1","created_at":"2026-05-18T04:28:46.667780+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2708","created_at":"2026-05-18T04:28:46.667780+00:00"},{"alias_kind":"pith_short_12","alias_value":"I3X6EY2AMT2Q","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"I3X6EY2AMT2QYOHZ","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"I3X6EY2A","created_at":"2026-05-18T12:26:30.835961+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/I3X6EY2AMT2QYOHZDXYOWAUQ2M","json":"https://pith.science/pith/I3X6EY2AMT2QYOHZDXYOWAUQ2M.json","graph_json":"https://pith.science/api/pith-number/I3X6EY2AMT2QYOHZDXYOWAUQ2M/graph.json","events_json":"https://pith.science/api/pith-number/I3X6EY2AMT2QYOHZDXYOWAUQ2M/events.json","paper":"https://pith.science/paper/I3X6EY2A"},"agent_actions":{"view_html":"https://pith.science/pith/I3X6EY2AMT2QYOHZDXYOWAUQ2M","download_json":"https://pith.science/pith/I3X6EY2AMT2QYOHZDXYOWAUQ2M.json","view_paper":"https://pith.science/paper/I3X6EY2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.2708&json=true","fetch_graph":"https://pith.science/api/pith-number/I3X6EY2AMT2QYOHZDXYOWAUQ2M/graph.json","fetch_events":"https://pith.science/api/pith-number/I3X6EY2AMT2QYOHZDXYOWAUQ2M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I3X6EY2AMT2QYOHZDXYOWAUQ2M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I3X6EY2AMT2QYOHZDXYOWAUQ2M/action/storage_attestation","attest_author":"https://pith.science/pith/I3X6EY2AMT2QYOHZDXYOWAUQ2M/action/author_attestation","sign_citation":"https://pith.science/pith/I3X6EY2AMT2QYOHZDXYOWAUQ2M/action/citation_signature","submit_replication":"https://pith.science/pith/I3X6EY2AMT2QYOHZDXYOWAUQ2M/action/replication_record"}},"created_at":"2026-05-18T04:28:46.667780+00:00","updated_at":"2026-05-18T04:28:46.667780+00:00"}