{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:VI2Z4REVS5TZIMNUQ4EZZNJ7AJ","short_pith_number":"pith:VI2Z4REV","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"},"canonical_sha256":"aa359e449597679431b487099cb53f025817b5633c94c77393a2a86dfa1559c2","source":{"kind":"arxiv","id":"1012.0037","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0037","created_at":"2026-05-18T04:34:19Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0037v1","created_at":"2026-05-18T04:34:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0037","created_at":"2026-05-18T04:34:19Z"},{"alias_kind":"pith_short_12","alias_value":"VI2Z4REVS5TZ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VI2Z4REVS5TZIMNU","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VI2Z4REV","created_at":"2026-05-18T12:26:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:VI2Z4REVS5TZIMNUQ4EZZNJ7AJ","target":"record","payload":{"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"},"canonical_sha256":"aa359e449597679431b487099cb53f025817b5633c94c77393a2a86dfa1559c2","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"},"source_kind":"arxiv","source_id":"1012.0037","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-18T04:34:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3x9psk9oJnPx2uel0TZUXK+MhOtFdt0Io7PZeVTc6tOMpTYWvpYiAYgWK0lyHi5pof6aFxjtnNA0doIh/zuxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T22:38:46.636480Z"},"content_sha256":"ecfe9f7f555be6650cb177d243f2c97376c5cd0e3b11aa673f70456089f1f921","schema_version":"1.0","event_id":"sha256:ecfe9f7f555be6650cb177d243f2c97376c5cd0e3b11aa673f70456089f1f921"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:VI2Z4REVS5TZIMNUQ4EZZNJ7AJ","target":"graph","payload":{"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"},"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-18T04:34:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kk9QfOXpXBLdm5sTK3gUOs/Eg3QyFsBTYyo99c6B9CiScxvQyxeJQPtABnm7iaw+No0++NbTKEVqscRfJ4TcCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T22:38:46.636826Z"},"content_sha256":"5dbef2fc8a7c1bedbefe731d804a4e7a1f61640718a4639f5e061946e897fde4","schema_version":"1.0","event_id":"sha256:5dbef2fc8a7c1bedbefe731d804a4e7a1f61640718a4639f5e061946e897fde4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ/bundle.json","state_url":"https://pith.science/pith/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ/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-07-02T22:38:46Z","links":{"resolver":"https://pith.science/pith/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ","bundle":"https://pith.science/pith/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ/bundle.json","state":"https://pith.science/pith/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VI2Z4REVS5TZIMNUQ4EZZNJ7AJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:VI2Z4REVS5TZIMNUQ4EZZNJ7AJ","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":"c66fde22bd0265aaaa4b90ce6dd2899a32577483a1dfa2aa6a72a559ff6f0929","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-11-30T21:54:41Z","title_canon_sha256":"c866f7526001b9b8435ba730ed5203beaa8bf9e8256103ddb630aacd1ec43ea5"},"schema_version":"1.0","source":{"id":"1012.0037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.0037","created_at":"2026-05-18T04:34:19Z"},{"alias_kind":"arxiv_version","alias_value":"1012.0037v1","created_at":"2026-05-18T04:34:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.0037","created_at":"2026-05-18T04:34:19Z"},{"alias_kind":"pith_short_12","alias_value":"VI2Z4REVS5TZ","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_16","alias_value":"VI2Z4REVS5TZIMNU","created_at":"2026-05-18T12:26:15Z"},{"alias_kind":"pith_short_8","alias_value":"VI2Z4REV","created_at":"2026-05-18T12:26:15Z"}],"graph_snapshots":[{"event_id":"sha256:5dbef2fc8a7c1bedbefe731d804a4e7a1f61640718a4639f5e061946e897fde4","target":"graph","created_at":"2026-05-18T04:34:19Z","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":"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","authors_text":"Bernard Cousin (IRISA), Fen Zhou (IRISA), Miklos Molnar (IRISA)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-11-30T21:54:41Z","title":"Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.0037","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:ecfe9f7f555be6650cb177d243f2c97376c5cd0e3b11aa673f70456089f1f921","target":"record","created_at":"2026-05-18T04:34:19Z","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":"c66fde22bd0265aaaa4b90ce6dd2899a32577483a1dfa2aa6a72a559ff6f0929","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2010-11-30T21:54:41Z","title_canon_sha256":"c866f7526001b9b8435ba730ed5203beaa8bf9e8256103ddb630aacd1ec43ea5"},"schema_version":"1.0","source":{"id":"1012.0037","kind":"arxiv","version":1}},"canonical_sha256":"aa359e449597679431b487099cb53f025817b5633c94c77393a2a86dfa1559c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa359e449597679431b487099cb53f025817b5633c94c77393a2a86dfa1559c2","first_computed_at":"2026-05-18T04:34:19.042632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:19.042632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SbvRfApnZo40OQqYpRCVCF1nckSMg15Q45PGg5bkV936orWFjA+pSOgitQd7l6Sw0o287eMvZ8WLDh6WW0jrDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:19.043139Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.0037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ecfe9f7f555be6650cb177d243f2c97376c5cd0e3b11aa673f70456089f1f921","sha256:5dbef2fc8a7c1bedbefe731d804a4e7a1f61640718a4639f5e061946e897fde4"],"state_sha256":"aab42fdd63b9dc13bfe7879cf055d417f2c8dbb62975f6529ad5dfac7d122af7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hS+0YwbziJRFgy3nPeTIstQHUnCJTFZJj51ZoZ82H1obCXNtBLMCK1ACVJ8L0DBEw2wW+Ko8YdElz14QPItkDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T22:38:46.638906Z","bundle_sha256":"8b95d91a38aaf9011feee3d62c461fb12f182250f96ffd928da01f4b76a1a5d9"}}