{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OEKNRUIGPAATPBDYFYTUIDBFQX","short_pith_number":"pith:OEKNRUIG","schema_version":"1.0","canonical_sha256":"7114d8d10678013784782e27440c2585fbbf8d3c07a7026321a8ece0931a5dbe","source":{"kind":"arxiv","id":"1605.02307","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.02307","created_at":"2026-05-18T00:18:36.608323+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.02307v1","created_at":"2026-05-18T00:18:36.608323+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02307","created_at":"2026-05-18T00:18:36.608323+00:00"},{"alias_kind":"pith_short_12","alias_value":"OEKNRUIGPAAT","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OEKNRUIGPAATPBDY","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OEKNRUIG","created_at":"2026-05-18T12:30:36.002864+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/OEKNRUIGPAATPBDYFYTUIDBFQX","json":"https://pith.science/pith/OEKNRUIGPAATPBDYFYTUIDBFQX.json","graph_json":"https://pith.science/api/pith-number/OEKNRUIGPAATPBDYFYTUIDBFQX/graph.json","events_json":"https://pith.science/api/pith-number/OEKNRUIGPAATPBDYFYTUIDBFQX/events.json","paper":"https://pith.science/paper/OEKNRUIG"},"agent_actions":{"view_html":"https://pith.science/pith/OEKNRUIGPAATPBDYFYTUIDBFQX","download_json":"https://pith.science/pith/OEKNRUIGPAATPBDYFYTUIDBFQX.json","view_paper":"https://pith.science/paper/OEKNRUIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.02307&json=true","fetch_graph":"https://pith.science/api/pith-number/OEKNRUIGPAATPBDYFYTUIDBFQX/graph.json","fetch_events":"https://pith.science/api/pith-number/OEKNRUIGPAATPBDYFYTUIDBFQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OEKNRUIGPAATPBDYFYTUIDBFQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OEKNRUIGPAATPBDYFYTUIDBFQX/action/storage_attestation","attest_author":"https://pith.science/pith/OEKNRUIGPAATPBDYFYTUIDBFQX/action/author_attestation","sign_citation":"https://pith.science/pith/OEKNRUIGPAATPBDYFYTUIDBFQX/action/citation_signature","submit_replication":"https://pith.science/pith/OEKNRUIGPAATPBDYFYTUIDBFQX/action/replication_record"}},"created_at":"2026-05-18T00:18:36.608323+00:00","updated_at":"2026-05-18T00:18:36.608323+00:00"}