{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OEKNRUIGPAATPBDYFYTUIDBFQX","short_pith_number":"pith:OEKNRUIG","canonical_record":{"source":{"id":"1605.02307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-08T10:56:53Z","cross_cats_sorted":[],"title_canon_sha256":"243a92a6366ea1f85a0bec667899eb442d25eb572b41f5e3dc2b34e4f450641c","abstract_canon_sha256":"d455b5837ee2c82b133b2bb11b776d6e45368e1f107b65c3f7a9c42a18f49c33"},"schema_version":"1.0"},"canonical_sha256":"7114d8d10678013784782e27440c2585fbbf8d3c07a7026321a8ece0931a5dbe","source":{"kind":"arxiv","id":"1605.02307","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02307","created_at":"2026-05-18T00:18:36Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02307v1","created_at":"2026-05-18T00:18:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02307","created_at":"2026-05-18T00:18:36Z"},{"alias_kind":"pith_short_12","alias_value":"OEKNRUIGPAAT","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OEKNRUIGPAATPBDY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OEKNRUIG","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OEKNRUIGPAATPBDYFYTUIDBFQX","target":"record","payload":{"canonical_record":{"source":{"id":"1605.02307","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-08T10:56:53Z","cross_cats_sorted":[],"title_canon_sha256":"243a92a6366ea1f85a0bec667899eb442d25eb572b41f5e3dc2b34e4f450641c","abstract_canon_sha256":"d455b5837ee2c82b133b2bb11b776d6e45368e1f107b65c3f7a9c42a18f49c33"},"schema_version":"1.0"},"canonical_sha256":"7114d8d10678013784782e27440c2585fbbf8d3c07a7026321a8ece0931a5dbe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:36.609229Z","signature_b64":"WeHBCdZrK3+J8qRVSc8za2UEc3o2thIiDoRJcDjx6k+y/nRWrYtn+X8wC5S9JEy4BthzQwUygjjJ9FHh5H4VAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7114d8d10678013784782e27440c2585fbbf8d3c07a7026321a8ece0931a5dbe","last_reissued_at":"2026-05-18T00:18:36.608227Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:36.608227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.02307","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:18:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7TjfQ1oB+LgfwF3Zy/+ApvH5TcawMirENSpkt1VOge8jIKOZwetBdizHasg9exCrrwY9TmrvfXeX83N7Rvb7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:24:41.374016Z"},"content_sha256":"fffc933d10d9e6cc49ff4d87bd58eff85805da77b04c3fea688590d6cd9a2829","schema_version":"1.0","event_id":"sha256:fffc933d10d9e6cc49ff4d87bd58eff85805da77b04c3fea688590d6cd9a2829"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OEKNRUIGPAATPBDYFYTUIDBFQX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial analysis of growth models for series-parallel networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alois Panholzer, Markus Kuba","submitted_at":"2016-05-08T10:56:53Z","abstract_excerpt":"We give combinatorial descriptions of two stochastic growth models for series-parallel networks introduced by Hosam Mahmoud by encoding the growth process via recursive tree structures. Using decompositions of the tree structures and applying analytic combinatorics methods allows a study of quantities in the corresponding series-parallel networks. For both models we obtain limiting distribution results for the degree of the poles and the length of a random source-to-sink path, and furthermore we get asymptotic results for the expected number of source-to-sink paths."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02307","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:18:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bzol5w4BhfskSogQR50x4cBi8aDPIFxCYWJM1ttlA/na2YWmHbXxZK3vljbrHHG7s903A8NuF3et97JqikmdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:24:41.374378Z"},"content_sha256":"087f6633613b26fdd655e682e7b4f0ee4632f2204b8c44ececf2bc26f47f79c5","schema_version":"1.0","event_id":"sha256:087f6633613b26fdd655e682e7b4f0ee4632f2204b8c44ececf2bc26f47f79c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OEKNRUIGPAATPBDYFYTUIDBFQX/bundle.json","state_url":"https://pith.science/pith/OEKNRUIGPAATPBDYFYTUIDBFQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OEKNRUIGPAATPBDYFYTUIDBFQX/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-02T20:24:41Z","links":{"resolver":"https://pith.science/pith/OEKNRUIGPAATPBDYFYTUIDBFQX","bundle":"https://pith.science/pith/OEKNRUIGPAATPBDYFYTUIDBFQX/bundle.json","state":"https://pith.science/pith/OEKNRUIGPAATPBDYFYTUIDBFQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OEKNRUIGPAATPBDYFYTUIDBFQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OEKNRUIGPAATPBDYFYTUIDBFQX","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":"d455b5837ee2c82b133b2bb11b776d6e45368e1f107b65c3f7a9c42a18f49c33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-08T10:56:53Z","title_canon_sha256":"243a92a6366ea1f85a0bec667899eb442d25eb572b41f5e3dc2b34e4f450641c"},"schema_version":"1.0","source":{"id":"1605.02307","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02307","created_at":"2026-05-18T00:18:36Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02307v1","created_at":"2026-05-18T00:18:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02307","created_at":"2026-05-18T00:18:36Z"},{"alias_kind":"pith_short_12","alias_value":"OEKNRUIGPAAT","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OEKNRUIGPAATPBDY","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OEKNRUIG","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:087f6633613b26fdd655e682e7b4f0ee4632f2204b8c44ececf2bc26f47f79c5","target":"graph","created_at":"2026-05-18T00:18:36Z","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 give combinatorial descriptions of two stochastic growth models for series-parallel networks introduced by Hosam Mahmoud by encoding the growth process via recursive tree structures. Using decompositions of the tree structures and applying analytic combinatorics methods allows a study of quantities in the corresponding series-parallel networks. For both models we obtain limiting distribution results for the degree of the poles and the length of a random source-to-sink path, and furthermore we get asymptotic results for the expected number of source-to-sink paths.","authors_text":"Alois Panholzer, Markus Kuba","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-08T10:56:53Z","title":"Combinatorial analysis of growth models for series-parallel networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02307","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:fffc933d10d9e6cc49ff4d87bd58eff85805da77b04c3fea688590d6cd9a2829","target":"record","created_at":"2026-05-18T00:18:36Z","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":"d455b5837ee2c82b133b2bb11b776d6e45368e1f107b65c3f7a9c42a18f49c33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-08T10:56:53Z","title_canon_sha256":"243a92a6366ea1f85a0bec667899eb442d25eb572b41f5e3dc2b34e4f450641c"},"schema_version":"1.0","source":{"id":"1605.02307","kind":"arxiv","version":1}},"canonical_sha256":"7114d8d10678013784782e27440c2585fbbf8d3c07a7026321a8ece0931a5dbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7114d8d10678013784782e27440c2585fbbf8d3c07a7026321a8ece0931a5dbe","first_computed_at":"2026-05-18T00:18:36.608227Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:36.608227Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WeHBCdZrK3+J8qRVSc8za2UEc3o2thIiDoRJcDjx6k+y/nRWrYtn+X8wC5S9JEy4BthzQwUygjjJ9FHh5H4VAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:36.609229Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02307","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fffc933d10d9e6cc49ff4d87bd58eff85805da77b04c3fea688590d6cd9a2829","sha256:087f6633613b26fdd655e682e7b4f0ee4632f2204b8c44ececf2bc26f47f79c5"],"state_sha256":"9dbbac429715407ab2e7f411c6fde5ba25902be663fd9b8141da63f2112a108e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0VOh7RCaNphE+R4a5J6KXDnW9f47452R1ujS/kcmYTEgJMwe8nMZCDIFYD/prCmb9NXW1mgoNkhpWtTvePlKCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:24:41.376415Z","bundle_sha256":"c787018d9407bd72d44cccaf75804015ae1c256be26d92c29a232b9a0f077a0f"}}