{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BTHFUAWAXAOBNYFL5BYNRMA7SG","short_pith_number":"pith:BTHFUAWA","canonical_record":{"source":{"id":"1208.5373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-08-27T12:35:29Z","cross_cats_sorted":[],"title_canon_sha256":"e1e7c21035c22ba7388d41805defad62ac040c41bdcd9c2886e4e7ea8c25c360","abstract_canon_sha256":"2f2415b173fa95e17b287961da75308b48930713c5ff554a40e2ebc1e05b2b3f"},"schema_version":"1.0"},"canonical_sha256":"0cce5a02c0b81c16e0abe870d8b01f919ab2b6f94611ae469673638520fd9a96","source":{"kind":"arxiv","id":"1208.5373","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5373","created_at":"2026-05-18T03:46:59Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5373v1","created_at":"2026-05-18T03:46:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5373","created_at":"2026-05-18T03:46:59Z"},{"alias_kind":"pith_short_12","alias_value":"BTHFUAWAXAOB","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BTHFUAWAXAOBNYFL","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BTHFUAWA","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BTHFUAWAXAOBNYFL5BYNRMA7SG","target":"record","payload":{"canonical_record":{"source":{"id":"1208.5373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-08-27T12:35:29Z","cross_cats_sorted":[],"title_canon_sha256":"e1e7c21035c22ba7388d41805defad62ac040c41bdcd9c2886e4e7ea8c25c360","abstract_canon_sha256":"2f2415b173fa95e17b287961da75308b48930713c5ff554a40e2ebc1e05b2b3f"},"schema_version":"1.0"},"canonical_sha256":"0cce5a02c0b81c16e0abe870d8b01f919ab2b6f94611ae469673638520fd9a96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:59.640092Z","signature_b64":"hU72twG0yjGnXojR5BzMY2Rvvgg82c1kuDlzbvrhNGarwF2l8KIboM7+BSGtx06xICcjJ5hfgAxF7+Q3aNbPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cce5a02c0b81c16e0abe870d8b01f919ab2b6f94611ae469673638520fd9a96","last_reissued_at":"2026-05-18T03:46:59.639282Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:59.639282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.5373","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-18T03:46:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9DCZYRGGVubEhQz6s8iFBVNrfcLxxJdciBfEat5+Yj3BhoW89b81DBcCLprwYr/JoYhjYQ8Yzgh0EbOtQvtAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:30:36.442697Z"},"content_sha256":"64c958ffb8ceebbd6386d39dbb72e1d26ee4f729e04558b0722af2ddf0539bf4","schema_version":"1.0","event_id":"sha256:64c958ffb8ceebbd6386d39dbb72e1d26ee4f729e04558b0722af2ddf0539bf4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BTHFUAWAXAOBNYFL5BYNRMA7SG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Pharaoh System for Network Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Camelia-M. Pintea, D. Dumitrescu","submitted_at":"2012-08-27T12:35:29Z","abstract_excerpt":"In this paper it is introduced a biobjective ant algorithm for constructing low cost routing networks. The new algorithm is called the Distributed Pharaoh System (DPS). DPS is based on AntNet algorithm. The algorithm is using Pharaoh Ant System (PAS) with an extra-exploration phase and a 'no-entry' condition in order to improve the solutions for the Low Cost Network Routing problem. Additionally it is used a cost model for overlay network construction that includes network traffic demands. The Pharaoh ants (Monomorium pharaonis) includes negative pheromones with signals concentrated at decisio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5373","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-18T03:46:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bzkVACe23k8e6uz/HTF736mg+ckc1JKK+6s4YQ5CsGtVT61JS+HygPhzaRJEk2dD+J1gfZCmXiKK1TSadL9fCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T17:30:36.443284Z"},"content_sha256":"bd674466e23b9b9d9fe3b841f32c855cfb78de6f99ffc02fca2158aa5faccfc0","schema_version":"1.0","event_id":"sha256:bd674466e23b9b9d9fe3b841f32c855cfb78de6f99ffc02fca2158aa5faccfc0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BTHFUAWAXAOBNYFL5BYNRMA7SG/bundle.json","state_url":"https://pith.science/pith/BTHFUAWAXAOBNYFL5BYNRMA7SG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BTHFUAWAXAOBNYFL5BYNRMA7SG/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-25T17:30:36Z","links":{"resolver":"https://pith.science/pith/BTHFUAWAXAOBNYFL5BYNRMA7SG","bundle":"https://pith.science/pith/BTHFUAWAXAOBNYFL5BYNRMA7SG/bundle.json","state":"https://pith.science/pith/BTHFUAWAXAOBNYFL5BYNRMA7SG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BTHFUAWAXAOBNYFL5BYNRMA7SG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BTHFUAWAXAOBNYFL5BYNRMA7SG","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":"2f2415b173fa95e17b287961da75308b48930713c5ff554a40e2ebc1e05b2b3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-08-27T12:35:29Z","title_canon_sha256":"e1e7c21035c22ba7388d41805defad62ac040c41bdcd9c2886e4e7ea8c25c360"},"schema_version":"1.0","source":{"id":"1208.5373","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5373","created_at":"2026-05-18T03:46:59Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5373v1","created_at":"2026-05-18T03:46:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5373","created_at":"2026-05-18T03:46:59Z"},{"alias_kind":"pith_short_12","alias_value":"BTHFUAWAXAOB","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BTHFUAWAXAOBNYFL","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BTHFUAWA","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:bd674466e23b9b9d9fe3b841f32c855cfb78de6f99ffc02fca2158aa5faccfc0","target":"graph","created_at":"2026-05-18T03:46:59Z","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 this paper it is introduced a biobjective ant algorithm for constructing low cost routing networks. The new algorithm is called the Distributed Pharaoh System (DPS). DPS is based on AntNet algorithm. The algorithm is using Pharaoh Ant System (PAS) with an extra-exploration phase and a 'no-entry' condition in order to improve the solutions for the Low Cost Network Routing problem. Additionally it is used a cost model for overlay network construction that includes network traffic demands. The Pharaoh ants (Monomorium pharaonis) includes negative pheromones with signals concentrated at decisio","authors_text":"Camelia-M. Pintea, D. Dumitrescu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-08-27T12:35:29Z","title":"Distributed Pharaoh System for Network Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5373","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:64c958ffb8ceebbd6386d39dbb72e1d26ee4f729e04558b0722af2ddf0539bf4","target":"record","created_at":"2026-05-18T03:46:59Z","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":"2f2415b173fa95e17b287961da75308b48930713c5ff554a40e2ebc1e05b2b3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-08-27T12:35:29Z","title_canon_sha256":"e1e7c21035c22ba7388d41805defad62ac040c41bdcd9c2886e4e7ea8c25c360"},"schema_version":"1.0","source":{"id":"1208.5373","kind":"arxiv","version":1}},"canonical_sha256":"0cce5a02c0b81c16e0abe870d8b01f919ab2b6f94611ae469673638520fd9a96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cce5a02c0b81c16e0abe870d8b01f919ab2b6f94611ae469673638520fd9a96","first_computed_at":"2026-05-18T03:46:59.639282Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:59.639282Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hU72twG0yjGnXojR5BzMY2Rvvgg82c1kuDlzbvrhNGarwF2l8KIboM7+BSGtx06xICcjJ5hfgAxF7+Q3aNbPCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:59.640092Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.5373","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:64c958ffb8ceebbd6386d39dbb72e1d26ee4f729e04558b0722af2ddf0539bf4","sha256:bd674466e23b9b9d9fe3b841f32c855cfb78de6f99ffc02fca2158aa5faccfc0"],"state_sha256":"2fe93175bed34251a1d8c43e028024b76fc9abd8cd74beb55db698c7536360b7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"89QrEmducOGvM/OsYtcAy16SfIziqP/qeHNy/C1Yk2QqcQ0/37ogeJbiBXAtn2Gtfxz89bIGGtCm7CE+CiloBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T17:30:36.446451Z","bundle_sha256":"4058510dbef81881a01931738c53c53c2c9c40700fe8a4456b8f592c6a51d8c2"}}