{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VI2Z4REVS5TZIMNUQ4EZZNJ7AJ","short_pith_number":"pith:VI2Z4REV","schema_version":"1.0","canonical_sha256":"aa359e449597679431b487099cb53f025817b5633c94c77393a2a86dfa1559c2","source":{"kind":"arxiv","id":"1012.0037","version":1},"attestation_state":"computed","paper":{"title":"Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Bernard Cousin (IRISA), Fen Zhou (IRISA), Miklos Molnar (IRISA)","submitted_at":"2010-11-30T21:54:41Z","abstract_excerpt":"In sparse light splitting all-optical WDM networks, the more destinations a light-tree can accommodate, the fewer light-trees andwavelengths amulticast session will require. In this article, a Hypo-Steiner light-tree algorithm (HSLT) is proposed to construct a HSLT light-tree to include as many destinations as possible. The upper bound cost of the light-trees built by HSLT is given as N(N -1)/2, where N is the number of nodes in the network. The analytical model proves that, under the same condition, more destinations could be held in a HSLT than a Member-Only (Zhang et al., J. Lightware Techn"},"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":"1012.0037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-11-30T21:54:41Z","cross_cats_sorted":[],"title_canon_sha256":"c866f7526001b9b8435ba730ed5203beaa8bf9e8256103ddb630aacd1ec43ea5","abstract_canon_sha256":"c66fde22bd0265aaaa4b90ce6dd2899a32577483a1dfa2aa6a72a559ff6f0929"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:19.043139Z","signature_b64":"SbvRfApnZo40OQqYpRCVCF1nckSMg15Q45PGg5bkV936orWFjA+pSOgitQd7l6Sw0o287eMvZ8WLDh6WW0jrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa359e449597679431b487099cb53f025817b5633c94c77393a2a86dfa1559c2","last_reissued_at":"2026-05-18T04:34:19.042632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:19.042632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Bernard Cousin (IRISA), Fen Zhou (IRISA), Miklos Molnar (IRISA)","submitted_at":"2010-11-30T21:54:41Z","abstract_excerpt":"In sparse light splitting all-optical WDM networks, the more destinations a light-tree can accommodate, the fewer light-trees andwavelengths amulticast session will require. In this article, a Hypo-Steiner light-tree algorithm (HSLT) is proposed to construct a HSLT light-tree to include as many destinations as possible. The upper bound cost of the light-trees built by HSLT is given as N(N -1)/2, where N is the number of nodes in the network. The analytical model proves that, under the same condition, more destinations could be held in a HSLT than a Member-Only (Zhang et al., J. Lightware Techn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0037","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":"1012.0037","created_at":"2026-05-18T04:34:19.042702+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.0037v1","created_at":"2026-05-18T04:34:19.042702+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0037","created_at":"2026-05-18T04:34:19.042702+00:00"},{"alias_kind":"pith_short_12","alias_value":"VI2Z4REVS5TZ","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VI2Z4REVS5TZIMNU","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VI2Z4REV","created_at":"2026-05-18T12:26:15.391820+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/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ","json":"https://pith.science/pith/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ.json","graph_json":"https://pith.science/api/pith-number/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ/graph.json","events_json":"https://pith.science/api/pith-number/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ/events.json","paper":"https://pith.science/paper/VI2Z4REV"},"agent_actions":{"view_html":"https://pith.science/pith/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ","download_json":"https://pith.science/pith/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ.json","view_paper":"https://pith.science/paper/VI2Z4REV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.0037&json=true","fetch_graph":"https://pith.science/api/pith-number/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ/graph.json","fetch_events":"https://pith.science/api/pith-number/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ/action/storage_attestation","attest_author":"https://pith.science/pith/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ/action/author_attestation","sign_citation":"https://pith.science/pith/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ/action/citation_signature","submit_replication":"https://pith.science/pith/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ/action/replication_record"}},"created_at":"2026-05-18T04:34:19.042702+00:00","updated_at":"2026-05-18T04:34:19.042702+00:00"}