{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LSEHPUYO7RIE7OFQU5WG5HA7LL","short_pith_number":"pith:LSEHPUYO","schema_version":"1.0","canonical_sha256":"5c8877d30efc504fb8b0a76c6e9c1f5afb205260dcb8787fc016580b5eeff769","source":{"kind":"arxiv","id":"1501.03758","version":1},"attestation_state":"computed","paper":{"title":"Polynomial representation for the expected length of minimal spanning trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Colin Starr, Jared Nishikawa, Peter T. Otto","submitted_at":"2015-01-15T17:42:26Z","abstract_excerpt":"In this paper, we investigate the polynomial integrand of an integral formula that yields the expected length of the minimal spanning tree of a graph whose edges are uniformly distributed over the interval [0, 1]. In particular, we derive a general formula for the coefficients of the polynomial and apply it to express the first few coefficients in terms of the structure of the underlying graph; e.g. number of vertices, edges and cycles."},"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":"1501.03758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-01-15T17:42:26Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9088a241aa10c25aff13166c5ea880da3c1175547cef5002aded8b9e7c85949b","abstract_canon_sha256":"7e04a12ed98da515249527d0e407508b3fa97d9ae60e5baa290c773325f72b4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:17.895079Z","signature_b64":"thy6TV0UEvQFqKeAsq66V1wbrvL/nxAXWQoElstQWJOZw7JBTT6rYn71ZxdZzIpcu/ay8PdO6OuPpCBEj0roCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c8877d30efc504fb8b0a76c6e9c1f5afb205260dcb8787fc016580b5eeff769","last_reissued_at":"2026-05-18T02:29:17.894727Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:17.894727Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial representation for the expected length of minimal spanning trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Colin Starr, Jared Nishikawa, Peter T. Otto","submitted_at":"2015-01-15T17:42:26Z","abstract_excerpt":"In this paper, we investigate the polynomial integrand of an integral formula that yields the expected length of the minimal spanning tree of a graph whose edges are uniformly distributed over the interval [0, 1]. In particular, we derive a general formula for the coefficients of the polynomial and apply it to express the first few coefficients in terms of the structure of the underlying graph; e.g. number of vertices, edges and cycles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.03758","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":"1501.03758","created_at":"2026-05-18T02:29:17.894783+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.03758v1","created_at":"2026-05-18T02:29:17.894783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.03758","created_at":"2026-05-18T02:29:17.894783+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSEHPUYO7RIE","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSEHPUYO7RIE7OFQ","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSEHPUYO","created_at":"2026-05-18T12:29:29.992203+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/LSEHPUYO7RIE7OFQU5WG5HA7LL","json":"https://pith.science/pith/LSEHPUYO7RIE7OFQU5WG5HA7LL.json","graph_json":"https://pith.science/api/pith-number/LSEHPUYO7RIE7OFQU5WG5HA7LL/graph.json","events_json":"https://pith.science/api/pith-number/LSEHPUYO7RIE7OFQU5WG5HA7LL/events.json","paper":"https://pith.science/paper/LSEHPUYO"},"agent_actions":{"view_html":"https://pith.science/pith/LSEHPUYO7RIE7OFQU5WG5HA7LL","download_json":"https://pith.science/pith/LSEHPUYO7RIE7OFQU5WG5HA7LL.json","view_paper":"https://pith.science/paper/LSEHPUYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.03758&json=true","fetch_graph":"https://pith.science/api/pith-number/LSEHPUYO7RIE7OFQU5WG5HA7LL/graph.json","fetch_events":"https://pith.science/api/pith-number/LSEHPUYO7RIE7OFQU5WG5HA7LL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSEHPUYO7RIE7OFQU5WG5HA7LL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSEHPUYO7RIE7OFQU5WG5HA7LL/action/storage_attestation","attest_author":"https://pith.science/pith/LSEHPUYO7RIE7OFQU5WG5HA7LL/action/author_attestation","sign_citation":"https://pith.science/pith/LSEHPUYO7RIE7OFQU5WG5HA7LL/action/citation_signature","submit_replication":"https://pith.science/pith/LSEHPUYO7RIE7OFQU5WG5HA7LL/action/replication_record"}},"created_at":"2026-05-18T02:29:17.894783+00:00","updated_at":"2026-05-18T02:29:17.894783+00:00"}