{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2003:7425XI4ZNOA4VQ2X2GRKVTVOCI","short_pith_number":"pith:7425XI4Z","canonical_record":{"source":{"id":"cs/0310004","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DC","submitted_at":"2003-10-05T18:41:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bd40a9aaeafa098c92ee07017c93834dc108104b347afd646081063d7d90e4e7","abstract_canon_sha256":"a61a3af81e7dbda720061223bda7aaa9fda6f506683ab78e1f4bf51d8719f3bd"},"schema_version":"1.0"},"canonical_sha256":"ff35dba3996b81cac357d1a2aaceae120a31a282bc3eb65d6cf5c0b5d7ed55cd","source":{"kind":"arxiv","id":"cs/0310004","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0310004","created_at":"2026-07-04T14:24:37Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0310004v1","created_at":"2026-07-04T14:24:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0310004","created_at":"2026-07-04T14:24:37Z"},{"alias_kind":"pith_short_12","alias_value":"7425XI4ZNOA4","created_at":"2026-07-04T14:24:37Z"},{"alias_kind":"pith_short_16","alias_value":"7425XI4ZNOA4VQ2X","created_at":"2026-07-04T14:24:37Z"},{"alias_kind":"pith_short_8","alias_value":"7425XI4Z","created_at":"2026-07-04T14:24:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2003:7425XI4ZNOA4VQ2X2GRKVTVOCI","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0310004","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DC","submitted_at":"2003-10-05T18:41:16Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bd40a9aaeafa098c92ee07017c93834dc108104b347afd646081063d7d90e4e7","abstract_canon_sha256":"a61a3af81e7dbda720061223bda7aaa9fda6f506683ab78e1f4bf51d8719f3bd"},"schema_version":"1.0"},"canonical_sha256":"ff35dba3996b81cac357d1a2aaceae120a31a282bc3eb65d6cf5c0b5d7ed55cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:24:37.364973Z","signature_b64":"yI9r+hCLmPE7tI3TLzLFr6TF1lUgB2eeJ5EemhLGi3VXnKJFgVgS7KOUKy4lK1KKSziCeZ21LVNxLIUn4Vx6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff35dba3996b81cac357d1a2aaceae120a31a282bc3eb65d6cf5c0b5d7ed55cd","last_reissued_at":"2026-07-04T14:24:37.364584Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:24:37.364584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0310004","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-07-04T14:24:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KHXWkIHBmTJUBDLkem5vc5HvFr8b5IEuEjIkXY1smcLxqDEruOXG01So1EyiX1m6glfN9AJxotTM2E1pbzjvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:03:09.294666Z"},"content_sha256":"a7c4e9914ad2fae18189a904ffc166232d0179eead23db17bf83d12a78e161b0","schema_version":"1.0","event_id":"sha256:a7c4e9914ad2fae18189a904ffc166232d0179eead23db17bf83d12a78e161b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2003:7425XI4ZNOA4VQ2X2GRKVTVOCI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Determination of the Topology of a Directed Network","license":"","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Darin Goldstein","submitted_at":"2003-10-05T18:41:16Z","abstract_excerpt":"We consider strongly-connected directed networks of identical synchronous, finite-state processors with in- and out-degree uniformly bounded by a network constant. Via a straightforward extension of Ostrovsky and Wilkerson's Backwards Communication Algorithm in [OW], we exhibit a protocol which solves the Global Topology Determination Problem, the problem of having the root processor map the global topology of a network of unknown size and topology, with running time O(ND) where N represents the number of processors and D represents the diameter of the network. A simple counting argument suffi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0310004","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0310004/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:24:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y116/dabS8KlcBZm7VjfIG+QlSYcYGlGv1153D7gGc8zS4PLWNgWX2kkf1PqjiapjgbBNICAWNgh1U4p79NJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T13:03:09.295636Z"},"content_sha256":"168ecc97afb98b897b7343445e7dc3f38f22d5153673883a927459d0b94a9fd8","schema_version":"1.0","event_id":"sha256:168ecc97afb98b897b7343445e7dc3f38f22d5153673883a927459d0b94a9fd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7425XI4ZNOA4VQ2X2GRKVTVOCI/bundle.json","state_url":"https://pith.science/pith/7425XI4ZNOA4VQ2X2GRKVTVOCI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7425XI4ZNOA4VQ2X2GRKVTVOCI/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-08-19T13:03:09Z","links":{"resolver":"https://pith.science/pith/7425XI4ZNOA4VQ2X2GRKVTVOCI","bundle":"https://pith.science/pith/7425XI4ZNOA4VQ2X2GRKVTVOCI/bundle.json","state":"https://pith.science/pith/7425XI4ZNOA4VQ2X2GRKVTVOCI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7425XI4ZNOA4VQ2X2GRKVTVOCI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:7425XI4ZNOA4VQ2X2GRKVTVOCI","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":"a61a3af81e7dbda720061223bda7aaa9fda6f506683ab78e1f4bf51d8719f3bd","cross_cats_sorted":["cs.DS"],"license":"","primary_cat":"cs.DC","submitted_at":"2003-10-05T18:41:16Z","title_canon_sha256":"bd40a9aaeafa098c92ee07017c93834dc108104b347afd646081063d7d90e4e7"},"schema_version":"1.0","source":{"id":"cs/0310004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0310004","created_at":"2026-07-04T14:24:37Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0310004v1","created_at":"2026-07-04T14:24:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0310004","created_at":"2026-07-04T14:24:37Z"},{"alias_kind":"pith_short_12","alias_value":"7425XI4ZNOA4","created_at":"2026-07-04T14:24:37Z"},{"alias_kind":"pith_short_16","alias_value":"7425XI4ZNOA4VQ2X","created_at":"2026-07-04T14:24:37Z"},{"alias_kind":"pith_short_8","alias_value":"7425XI4Z","created_at":"2026-07-04T14:24:37Z"}],"graph_snapshots":[{"event_id":"sha256:168ecc97afb98b897b7343445e7dc3f38f22d5153673883a927459d0b94a9fd8","target":"graph","created_at":"2026-07-04T14:24:37Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0310004/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider strongly-connected directed networks of identical synchronous, finite-state processors with in- and out-degree uniformly bounded by a network constant. Via a straightforward extension of Ostrovsky and Wilkerson's Backwards Communication Algorithm in [OW], we exhibit a protocol which solves the Global Topology Determination Problem, the problem of having the root processor map the global topology of a network of unknown size and topology, with running time O(ND) where N represents the number of processors and D represents the diameter of the network. A simple counting argument suffi","authors_text":"Darin Goldstein","cross_cats":["cs.DS"],"headline":"","license":"","primary_cat":"cs.DC","submitted_at":"2003-10-05T18:41:16Z","title":"Determination of the Topology of a Directed Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0310004","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:a7c4e9914ad2fae18189a904ffc166232d0179eead23db17bf83d12a78e161b0","target":"record","created_at":"2026-07-04T14:24:37Z","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":"a61a3af81e7dbda720061223bda7aaa9fda6f506683ab78e1f4bf51d8719f3bd","cross_cats_sorted":["cs.DS"],"license":"","primary_cat":"cs.DC","submitted_at":"2003-10-05T18:41:16Z","title_canon_sha256":"bd40a9aaeafa098c92ee07017c93834dc108104b347afd646081063d7d90e4e7"},"schema_version":"1.0","source":{"id":"cs/0310004","kind":"arxiv","version":1}},"canonical_sha256":"ff35dba3996b81cac357d1a2aaceae120a31a282bc3eb65d6cf5c0b5d7ed55cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff35dba3996b81cac357d1a2aaceae120a31a282bc3eb65d6cf5c0b5d7ed55cd","first_computed_at":"2026-07-04T14:24:37.364584Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:24:37.364584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yI9r+hCLmPE7tI3TLzLFr6TF1lUgB2eeJ5EemhLGi3VXnKJFgVgS7KOUKy4lK1KKSziCeZ21LVNxLIUn4Vx6Dg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:24:37.364973Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0310004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7c4e9914ad2fae18189a904ffc166232d0179eead23db17bf83d12a78e161b0","sha256:168ecc97afb98b897b7343445e7dc3f38f22d5153673883a927459d0b94a9fd8"],"state_sha256":"e04f979a3553c5c8546ad002051cbf966a8388f4ccb8cf58ca05a82ae01d2d63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r11lXtFqNqmrLpwwsFsMDWhnh0w+8bvKojkwSgJCvyB8ktzODvAKJ0rz2nxHFTDKegTeYOynW1ITNTsve6ZYCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T13:03:09.303231Z","bundle_sha256":"c656527396a2e0aa24407387f8252e13e4a84b8fd71781b99e440682adcf69ae"}}