{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NTOZK5VNZTVDMPPFZ32SMEPDOU","short_pith_number":"pith:NTOZK5VN","canonical_record":{"source":{"id":"1109.1231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-06T17:06:23Z","cross_cats_sorted":[],"title_canon_sha256":"fec1898339193dda3fd591044bb85662deeaa1b655d293153926c0e12ff72af1","abstract_canon_sha256":"557f7e87711c91eae5a529edaf96aec91b3705b4f82dbc38d886e14ca2723cec"},"schema_version":"1.0"},"canonical_sha256":"6cdd9576adccea363de5cef52611e3752f2a2b69a4db8519c69d1caf4bfb47d2","source":{"kind":"arxiv","id":"1109.1231","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1231","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1231v1","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1231","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"pith_short_12","alias_value":"NTOZK5VNZTVD","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NTOZK5VNZTVDMPPF","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NTOZK5VN","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NTOZK5VNZTVDMPPFZ32SMEPDOU","target":"record","payload":{"canonical_record":{"source":{"id":"1109.1231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-06T17:06:23Z","cross_cats_sorted":[],"title_canon_sha256":"fec1898339193dda3fd591044bb85662deeaa1b655d293153926c0e12ff72af1","abstract_canon_sha256":"557f7e87711c91eae5a529edaf96aec91b3705b4f82dbc38d886e14ca2723cec"},"schema_version":"1.0"},"canonical_sha256":"6cdd9576adccea363de5cef52611e3752f2a2b69a4db8519c69d1caf4bfb47d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:05.117501Z","signature_b64":"HRT7izjiXDrq1EHDrFqQbHb0382GAZICg2UVcXPeRKk51mCTcvxA2XM6YTCUNEV8ofY6guAPraYXaV3ukkdgDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cdd9576adccea363de5cef52611e3752f2a2b69a4db8519c69d1caf4bfb47d2","last_reissued_at":"2026-05-18T04:14:05.116922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:05.116922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.1231","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:14:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3iQ1aFEyUBoHdMtGuJzL/kn9PZtr8SE+ncdgDzTJxrSW38DSPTeGEb0hG2sMNjWCsdMWmcvjvcKIm6T9phOyAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:26:37.872859Z"},"content_sha256":"5534a93d15edd624138c1b4b4a65ecc4c51e53d7d23cf189ed82d148881e85ff","schema_version":"1.0","event_id":"sha256:5534a93d15edd624138c1b4b4a65ecc4c51e53d7d23cf189ed82d148881e85ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NTOZK5VNZTVDMPPFZ32SMEPDOU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Combinatorial Optimisation Approach to Designing Dual-Parented Long-Reach Passive Optical Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Barry O'Sullivan, David Payne, Deepak Mehta, Hadrien Cambazard, Linda Doyle, Luis Quesada, Marco Ruffini","submitted_at":"2011-09-06T17:06:23Z","abstract_excerpt":"We present an application focused on the design of resilient long-reach passive optical networks. We specifically consider dual-parented networks whereby each customer must be connected to two metro sites via local exchange sites. An important property of such a placement is resilience to single metro node failure. The objective of the application is to determine the optimal position of a set of metro nodes such that the total optical fibre length is minimized. We prove that this problem is NP-Complete. We present two alternative combinatorial optimisation approaches to finding an optimal metr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1231","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:14:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8ZBAJPtxJNNYWUY9lhKd4VS17XvFunsY4OYQg85givRTE156c+VGcPP9B1ESUAMPW+/SWOp3Nh2iAodYCtSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:26:37.873492Z"},"content_sha256":"b1927102bf0967b7029075bfe7f345ec223137b0daf855d8606adc938cca40d5","schema_version":"1.0","event_id":"sha256:b1927102bf0967b7029075bfe7f345ec223137b0daf855d8606adc938cca40d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NTOZK5VNZTVDMPPFZ32SMEPDOU/bundle.json","state_url":"https://pith.science/pith/NTOZK5VNZTVDMPPFZ32SMEPDOU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NTOZK5VNZTVDMPPFZ32SMEPDOU/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-30T22:26:37Z","links":{"resolver":"https://pith.science/pith/NTOZK5VNZTVDMPPFZ32SMEPDOU","bundle":"https://pith.science/pith/NTOZK5VNZTVDMPPFZ32SMEPDOU/bundle.json","state":"https://pith.science/pith/NTOZK5VNZTVDMPPFZ32SMEPDOU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NTOZK5VNZTVDMPPFZ32SMEPDOU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NTOZK5VNZTVDMPPFZ32SMEPDOU","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":"557f7e87711c91eae5a529edaf96aec91b3705b4f82dbc38d886e14ca2723cec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-06T17:06:23Z","title_canon_sha256":"fec1898339193dda3fd591044bb85662deeaa1b655d293153926c0e12ff72af1"},"schema_version":"1.0","source":{"id":"1109.1231","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.1231","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"arxiv_version","alias_value":"1109.1231v1","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1231","created_at":"2026-05-18T04:14:05Z"},{"alias_kind":"pith_short_12","alias_value":"NTOZK5VNZTVD","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NTOZK5VNZTVDMPPF","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NTOZK5VN","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:b1927102bf0967b7029075bfe7f345ec223137b0daf855d8606adc938cca40d5","target":"graph","created_at":"2026-05-18T04:14:05Z","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 present an application focused on the design of resilient long-reach passive optical networks. We specifically consider dual-parented networks whereby each customer must be connected to two metro sites via local exchange sites. An important property of such a placement is resilience to single metro node failure. The objective of the application is to determine the optimal position of a set of metro nodes such that the total optical fibre length is minimized. We prove that this problem is NP-Complete. We present two alternative combinatorial optimisation approaches to finding an optimal metr","authors_text":"Barry O'Sullivan, David Payne, Deepak Mehta, Hadrien Cambazard, Linda Doyle, Luis Quesada, Marco Ruffini","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-06T17:06:23Z","title":"A Combinatorial Optimisation Approach to Designing Dual-Parented Long-Reach Passive Optical Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1231","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:5534a93d15edd624138c1b4b4a65ecc4c51e53d7d23cf189ed82d148881e85ff","target":"record","created_at":"2026-05-18T04:14:05Z","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":"557f7e87711c91eae5a529edaf96aec91b3705b4f82dbc38d886e14ca2723cec","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-09-06T17:06:23Z","title_canon_sha256":"fec1898339193dda3fd591044bb85662deeaa1b655d293153926c0e12ff72af1"},"schema_version":"1.0","source":{"id":"1109.1231","kind":"arxiv","version":1}},"canonical_sha256":"6cdd9576adccea363de5cef52611e3752f2a2b69a4db8519c69d1caf4bfb47d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cdd9576adccea363de5cef52611e3752f2a2b69a4db8519c69d1caf4bfb47d2","first_computed_at":"2026-05-18T04:14:05.116922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:05.116922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HRT7izjiXDrq1EHDrFqQbHb0382GAZICg2UVcXPeRKk51mCTcvxA2XM6YTCUNEV8ofY6guAPraYXaV3ukkdgDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:05.117501Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.1231","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5534a93d15edd624138c1b4b4a65ecc4c51e53d7d23cf189ed82d148881e85ff","sha256:b1927102bf0967b7029075bfe7f345ec223137b0daf855d8606adc938cca40d5"],"state_sha256":"7bafc7da448ee435d738f2ebec0e47914cc8661c407cb81a24f7020431bc83d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eHIk7jjdB0DeFG6Yp2hjaxNId0nBu/hHa89UfnMDoHZmTW8zc0Bph3VpDFsQUSWlJsc/G38TYqoMZcSsBCwQBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:26:37.876714Z","bundle_sha256":"840a6d5070571e3d00d129ee1a6ad18f9e524886f101ffe7db57293a23577b22"}}