{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:IYPZ4YM3TVAR36OEFKA46XIS2U","short_pith_number":"pith:IYPZ4YM3","schema_version":"1.0","canonical_sha256":"461f9e619b9d411df9c42a81cf5d12d509c0471f4122f436e59f4bb2eef89126","source":{"kind":"arxiv","id":"cs/0310003","version":1},"attestation_state":"computed","paper":{"title":"The Wake Up and Report Problem is Time-Equivalent to the Firing Squad Synchronization Problem","license":"","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Darin Goldstein, Nick Meyer","submitted_at":"2003-10-05T18:27:22Z","abstract_excerpt":"We consider several problems relating to strongly-connected directed networks of identical finite-state processors that work synchronously in discrete time steps. The conceptually simplest of these is the Wake Up and Report Problem; this is the problem of having a unique \"root\" processor send a signal to all other processors in the network and then enter a special \"done\" state only when all other processors have received the signal. The most difficult of the problems we consider is the classic Firing Squad Synchronization Problem; this is the much-studied problem of achieving macro-synchroniza"},"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":"cs/0310003","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DC","submitted_at":"2003-10-05T18:27:22Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5cbb1d580261342ca49f678050ca81d9d35bcda4bd5de9975806e479e4446a9b","abstract_canon_sha256":"b06fc975c4dbec9d2ab339f288fe19931e8288db7c94d352fcff018919d78eb3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:24:37.352278Z","signature_b64":"2ovIkhCxB7GkLmg956RnZIUsiCgw7zxcLoC2CtrQGMdGSiZCslMFEpb0DfJHKkt87b+Tc5+5t6L10wRj8l/wCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"461f9e619b9d411df9c42a81cf5d12d509c0471f4122f436e59f4bb2eef89126","last_reissued_at":"2026-07-04T14:24:37.351787Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:24:37.351787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Wake Up and Report Problem is Time-Equivalent to the Firing Squad Synchronization Problem","license":"","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Darin Goldstein, Nick Meyer","submitted_at":"2003-10-05T18:27:22Z","abstract_excerpt":"We consider several problems relating to strongly-connected directed networks of identical finite-state processors that work synchronously in discrete time steps. The conceptually simplest of these is the Wake Up and Report Problem; this is the problem of having a unique \"root\" processor send a signal to all other processors in the network and then enter a special \"done\" state only when all other processors have received the signal. The most difficult of the problems we consider is the classic Firing Squad Synchronization Problem; this is the much-studied problem of achieving macro-synchroniza"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0310003","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/0310003/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0310003","created_at":"2026-07-04T14:24:37.351868+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0310003v1","created_at":"2026-07-04T14:24:37.351868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0310003","created_at":"2026-07-04T14:24:37.351868+00:00"},{"alias_kind":"pith_short_12","alias_value":"IYPZ4YM3TVAR","created_at":"2026-07-04T14:24:37.351868+00:00"},{"alias_kind":"pith_short_16","alias_value":"IYPZ4YM3TVAR36OE","created_at":"2026-07-04T14:24:37.351868+00:00"},{"alias_kind":"pith_short_8","alias_value":"IYPZ4YM3","created_at":"2026-07-04T14:24:37.351868+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/IYPZ4YM3TVAR36OEFKA46XIS2U","json":"https://pith.science/pith/IYPZ4YM3TVAR36OEFKA46XIS2U.json","graph_json":"https://pith.science/api/pith-number/IYPZ4YM3TVAR36OEFKA46XIS2U/graph.json","events_json":"https://pith.science/api/pith-number/IYPZ4YM3TVAR36OEFKA46XIS2U/events.json","paper":"https://pith.science/paper/IYPZ4YM3"},"agent_actions":{"view_html":"https://pith.science/pith/IYPZ4YM3TVAR36OEFKA46XIS2U","download_json":"https://pith.science/pith/IYPZ4YM3TVAR36OEFKA46XIS2U.json","view_paper":"https://pith.science/paper/IYPZ4YM3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0310003&json=true","fetch_graph":"https://pith.science/api/pith-number/IYPZ4YM3TVAR36OEFKA46XIS2U/graph.json","fetch_events":"https://pith.science/api/pith-number/IYPZ4YM3TVAR36OEFKA46XIS2U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IYPZ4YM3TVAR36OEFKA46XIS2U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IYPZ4YM3TVAR36OEFKA46XIS2U/action/storage_attestation","attest_author":"https://pith.science/pith/IYPZ4YM3TVAR36OEFKA46XIS2U/action/author_attestation","sign_citation":"https://pith.science/pith/IYPZ4YM3TVAR36OEFKA46XIS2U/action/citation_signature","submit_replication":"https://pith.science/pith/IYPZ4YM3TVAR36OEFKA46XIS2U/action/replication_record"}},"created_at":"2026-07-04T14:24:37.351868+00:00","updated_at":"2026-07-04T14:24:37.351868+00:00"}