{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Q5UTZPHKH4TDIUDA54NSPTW324","short_pith_number":"pith:Q5UTZPHK","canonical_record":{"source":{"id":"1806.00521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-06-01T19:45:21Z","cross_cats_sorted":["math.CO","math.CV"],"title_canon_sha256":"741c9799990ee01d88b042134ccdc1f9a065904502ef3c244ec386e15c367b09","abstract_canon_sha256":"d0a055a3761aea96600f168c71881baa957d50214096b1d70a65c73dbaf4eb99"},"schema_version":"1.0"},"canonical_sha256":"87693cbcea3f26345060ef1b27cedbd716ca1fb2526dd9445d70db2ea35a987a","source":{"kind":"arxiv","id":"1806.00521","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00521","created_at":"2026-05-18T00:14:20Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00521v1","created_at":"2026-05-18T00:14:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00521","created_at":"2026-05-18T00:14:20Z"},{"alias_kind":"pith_short_12","alias_value":"Q5UTZPHKH4TD","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q5UTZPHKH4TDIUDA","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q5UTZPHK","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Q5UTZPHKH4TDIUDA54NSPTW324","target":"record","payload":{"canonical_record":{"source":{"id":"1806.00521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-06-01T19:45:21Z","cross_cats_sorted":["math.CO","math.CV"],"title_canon_sha256":"741c9799990ee01d88b042134ccdc1f9a065904502ef3c244ec386e15c367b09","abstract_canon_sha256":"d0a055a3761aea96600f168c71881baa957d50214096b1d70a65c73dbaf4eb99"},"schema_version":"1.0"},"canonical_sha256":"87693cbcea3f26345060ef1b27cedbd716ca1fb2526dd9445d70db2ea35a987a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:20.991290Z","signature_b64":"5Au0uxEPf8AA/StTAzt+bDY687NTRt0kFvmIVzI8r3VckBlZeGSvXEzDRcO6zUzRfLpxVIOGRVo594DfcDkgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87693cbcea3f26345060ef1b27cedbd716ca1fb2526dd9445d70db2ea35a987a","last_reissued_at":"2026-05-18T00:14:20.990816Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:20.990816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.00521","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-18T00:14:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kTF0sEvBp9aRN3gpYYGCUVSDeD12vnIBuPjJFDcT1cBMzA2SKfVgNvS3bCioXmurVj7h5bJBtDKftMz5hoRsBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:51:43.680024Z"},"content_sha256":"f1e8383bf02700ff00fc338dc97c9dc2e5ea2d95d98e28959d9d44d73dbd9a98","schema_version":"1.0","event_id":"sha256:f1e8383bf02700ff00fc338dc97c9dc2e5ea2d95d98e28959d9d44d73dbd9a98"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Q5UTZPHKH4TDIUDA54NSPTW324","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The lemniscate tree of a random polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.CV"],"primary_cat":"math.PR","authors_text":"Boris Hanin, Erik Lundberg, Michael Epstein","submitted_at":"2018-06-01T19:45:21Z","abstract_excerpt":"To each generic complex polynomial $p(z)$ there is associated a labeled binary tree (here referred to as a \"lemniscate tree\") that encodes the topological type of the graph of $|p(z)|$. The branching structure of the lemniscate tree is determined by the configuration (i.e., arrangement in the plane) of the singular components of those level sets $|p(z)|=t$ passing through a critical point.\n  In this paper, we address the question \"How many branches appear in a typical lemniscate tree?\" We answer this question first for a lemniscate tree sampled uniformly from the combinatorial class and second"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00521","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-18T00:14:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2UkRH3cTSlkfIlUmApoj/wLdx6xHZMKZTCqkoKybdBkUVSEOwPnnynxFlF0IgW76BYcn6xGT5QSM18lo/EeSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:51:43.680857Z"},"content_sha256":"c41f34b98dd9c1a9d5856cc3a47beaf9f82efdf05c89c86de803587c99900077","schema_version":"1.0","event_id":"sha256:c41f34b98dd9c1a9d5856cc3a47beaf9f82efdf05c89c86de803587c99900077"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q5UTZPHKH4TDIUDA54NSPTW324/bundle.json","state_url":"https://pith.science/pith/Q5UTZPHKH4TDIUDA54NSPTW324/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q5UTZPHKH4TDIUDA54NSPTW324/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-31T20:51:43Z","links":{"resolver":"https://pith.science/pith/Q5UTZPHKH4TDIUDA54NSPTW324","bundle":"https://pith.science/pith/Q5UTZPHKH4TDIUDA54NSPTW324/bundle.json","state":"https://pith.science/pith/Q5UTZPHKH4TDIUDA54NSPTW324/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q5UTZPHKH4TDIUDA54NSPTW324/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Q5UTZPHKH4TDIUDA54NSPTW324","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":"d0a055a3761aea96600f168c71881baa957d50214096b1d70a65c73dbaf4eb99","cross_cats_sorted":["math.CO","math.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-06-01T19:45:21Z","title_canon_sha256":"741c9799990ee01d88b042134ccdc1f9a065904502ef3c244ec386e15c367b09"},"schema_version":"1.0","source":{"id":"1806.00521","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00521","created_at":"2026-05-18T00:14:20Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00521v1","created_at":"2026-05-18T00:14:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00521","created_at":"2026-05-18T00:14:20Z"},{"alias_kind":"pith_short_12","alias_value":"Q5UTZPHKH4TD","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"Q5UTZPHKH4TDIUDA","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"Q5UTZPHK","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:c41f34b98dd9c1a9d5856cc3a47beaf9f82efdf05c89c86de803587c99900077","target":"graph","created_at":"2026-05-18T00:14:20Z","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":"To each generic complex polynomial $p(z)$ there is associated a labeled binary tree (here referred to as a \"lemniscate tree\") that encodes the topological type of the graph of $|p(z)|$. The branching structure of the lemniscate tree is determined by the configuration (i.e., arrangement in the plane) of the singular components of those level sets $|p(z)|=t$ passing through a critical point.\n  In this paper, we address the question \"How many branches appear in a typical lemniscate tree?\" We answer this question first for a lemniscate tree sampled uniformly from the combinatorial class and second","authors_text":"Boris Hanin, Erik Lundberg, Michael Epstein","cross_cats":["math.CO","math.CV"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-06-01T19:45:21Z","title":"The lemniscate tree of a random polynomial"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00521","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:f1e8383bf02700ff00fc338dc97c9dc2e5ea2d95d98e28959d9d44d73dbd9a98","target":"record","created_at":"2026-05-18T00:14:20Z","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":"d0a055a3761aea96600f168c71881baa957d50214096b1d70a65c73dbaf4eb99","cross_cats_sorted":["math.CO","math.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2018-06-01T19:45:21Z","title_canon_sha256":"741c9799990ee01d88b042134ccdc1f9a065904502ef3c244ec386e15c367b09"},"schema_version":"1.0","source":{"id":"1806.00521","kind":"arxiv","version":1}},"canonical_sha256":"87693cbcea3f26345060ef1b27cedbd716ca1fb2526dd9445d70db2ea35a987a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87693cbcea3f26345060ef1b27cedbd716ca1fb2526dd9445d70db2ea35a987a","first_computed_at":"2026-05-18T00:14:20.990816Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:20.990816Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Au0uxEPf8AA/StTAzt+bDY687NTRt0kFvmIVzI8r3VckBlZeGSvXEzDRcO6zUzRfLpxVIOGRVo594DfcDkgDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:20.991290Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00521","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f1e8383bf02700ff00fc338dc97c9dc2e5ea2d95d98e28959d9d44d73dbd9a98","sha256:c41f34b98dd9c1a9d5856cc3a47beaf9f82efdf05c89c86de803587c99900077"],"state_sha256":"c53db0cbe624062267da59e2c6a05fa744ab49ba393bbb09f15fa0649bdaa4be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oa5CsQwa0uPJ8OKxwwQC4dRD+I577N6z0Pr3E7gauh/nnttuT8r2a5N+H6Hf3CzN+6cI4FB6lW9dH1Iz95e0Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:51:43.685119Z","bundle_sha256":"14919c4246f63eaa5a1f502f7f5aeb2a48237e13860ff448762caef2428a7c4b"}}