{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PD2SGOUMHOXT62ZNK6X5HCMLS4","short_pith_number":"pith:PD2SGOUM","canonical_record":{"source":{"id":"1802.08751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-23T22:27:47Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"cc26d164c6732b1115d2f2dda10ebc37d2350a66e352b576ea4327bfe92be404","abstract_canon_sha256":"872e1cffc654386c21ee28d00a5abc18d83b774d9b5e5955defe7e97c785e89c"},"schema_version":"1.0"},"canonical_sha256":"78f5233a8c3baf3f6b2d57afd3898b9727f4fd18bc08095861fba2a8f0ad8d8b","source":{"kind":"arxiv","id":"1802.08751","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08751","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08751v1","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08751","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"pith_short_12","alias_value":"PD2SGOUMHOXT","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PD2SGOUMHOXT62ZN","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PD2SGOUM","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PD2SGOUMHOXT62ZNK6X5HCMLS4","target":"record","payload":{"canonical_record":{"source":{"id":"1802.08751","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-23T22:27:47Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"cc26d164c6732b1115d2f2dda10ebc37d2350a66e352b576ea4327bfe92be404","abstract_canon_sha256":"872e1cffc654386c21ee28d00a5abc18d83b774d9b5e5955defe7e97c785e89c"},"schema_version":"1.0"},"canonical_sha256":"78f5233a8c3baf3f6b2d57afd3898b9727f4fd18bc08095861fba2a8f0ad8d8b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:36.589783Z","signature_b64":"g1N9jIPF5sb+1pU2bZ0WG832N+iNft3wa+ELv4QZWsnvq4q8CxSXlYo8UWu18gyX0VCvfMuSSlkZSCdyoayKAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78f5233a8c3baf3f6b2d57afd3898b9727f4fd18bc08095861fba2a8f0ad8d8b","last_reissued_at":"2026-05-18T00:22:36.588998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:36.588998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.08751","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-18T00:22:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dAmTlNA8WIdPRBFSA4i80Hp7IPYSsxytsxraYW+OKXrXRx7JZJt5y881nyEdynkWYUzQGGVJhK1dqzNCjxdWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:22:47.268703Z"},"content_sha256":"affede7284b749c3e50707788a7ce7c1e10a007bb693f4d30129513e9eb28a1a","schema_version":"1.0","event_id":"sha256:affede7284b749c3e50707788a7ce7c1e10a007bb693f4d30129513e9eb28a1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PD2SGOUMHOXT62ZNK6X5HCMLS4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Generalized Discrete-Time Altafini Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SY","authors_text":"A. S. Morse, B. D. O. Anderson, D. Fullmer, J. Liu, L. Wang","submitted_at":"2018-02-23T22:27:47Z","abstract_excerpt":"A discrete-time modulus consensus model is considered in which the interaction among a family of networked agents is described by a time-dependent gain graph whose vertices correspond to agents and whose arcs are assigned complex numbers from a cyclic group. Limiting behavior of the model is studied using a graphical approach. It is shown that, under appropriate connectedness, a certain type of clustering will be reached exponentially fast for almost all initial conditions if and only if the sequence of gain graphs is \"repeatedly jointly structurally balanced\" corresponding to that type of clu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08751","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-18T00:22:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"igX8akyRoqWPeUG2oj8nk7UE9Jb836AeOqHgoNIFbc0uAVfYUtvunc7UatDVbRepRNwxVlXxH7bwWB5icf1tBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:22:47.269051Z"},"content_sha256":"a91d7920c60b3840ee88c5ccca22003c77050272629ed6755007ddb5807a2936","schema_version":"1.0","event_id":"sha256:a91d7920c60b3840ee88c5ccca22003c77050272629ed6755007ddb5807a2936"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PD2SGOUMHOXT62ZNK6X5HCMLS4/bundle.json","state_url":"https://pith.science/pith/PD2SGOUMHOXT62ZNK6X5HCMLS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PD2SGOUMHOXT62ZNK6X5HCMLS4/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-01T13:22:47Z","links":{"resolver":"https://pith.science/pith/PD2SGOUMHOXT62ZNK6X5HCMLS4","bundle":"https://pith.science/pith/PD2SGOUMHOXT62ZNK6X5HCMLS4/bundle.json","state":"https://pith.science/pith/PD2SGOUMHOXT62ZNK6X5HCMLS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PD2SGOUMHOXT62ZNK6X5HCMLS4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PD2SGOUMHOXT62ZNK6X5HCMLS4","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":"872e1cffc654386c21ee28d00a5abc18d83b774d9b5e5955defe7e97c785e89c","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-23T22:27:47Z","title_canon_sha256":"cc26d164c6732b1115d2f2dda10ebc37d2350a66e352b576ea4327bfe92be404"},"schema_version":"1.0","source":{"id":"1802.08751","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08751","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08751v1","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08751","created_at":"2026-05-18T00:22:36Z"},{"alias_kind":"pith_short_12","alias_value":"PD2SGOUMHOXT","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PD2SGOUMHOXT62ZN","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PD2SGOUM","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:a91d7920c60b3840ee88c5ccca22003c77050272629ed6755007ddb5807a2936","target":"graph","created_at":"2026-05-18T00:22:36Z","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":"A discrete-time modulus consensus model is considered in which the interaction among a family of networked agents is described by a time-dependent gain graph whose vertices correspond to agents and whose arcs are assigned complex numbers from a cyclic group. Limiting behavior of the model is studied using a graphical approach. It is shown that, under appropriate connectedness, a certain type of clustering will be reached exponentially fast for almost all initial conditions if and only if the sequence of gain graphs is \"repeatedly jointly structurally balanced\" corresponding to that type of clu","authors_text":"A. S. Morse, B. D. O. Anderson, D. Fullmer, J. Liu, L. Wang","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-23T22:27:47Z","title":"A Generalized Discrete-Time Altafini Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08751","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:affede7284b749c3e50707788a7ce7c1e10a007bb693f4d30129513e9eb28a1a","target":"record","created_at":"2026-05-18T00:22:36Z","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":"872e1cffc654386c21ee28d00a5abc18d83b774d9b5e5955defe7e97c785e89c","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-23T22:27:47Z","title_canon_sha256":"cc26d164c6732b1115d2f2dda10ebc37d2350a66e352b576ea4327bfe92be404"},"schema_version":"1.0","source":{"id":"1802.08751","kind":"arxiv","version":1}},"canonical_sha256":"78f5233a8c3baf3f6b2d57afd3898b9727f4fd18bc08095861fba2a8f0ad8d8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78f5233a8c3baf3f6b2d57afd3898b9727f4fd18bc08095861fba2a8f0ad8d8b","first_computed_at":"2026-05-18T00:22:36.588998Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:36.588998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g1N9jIPF5sb+1pU2bZ0WG832N+iNft3wa+ELv4QZWsnvq4q8CxSXlYo8UWu18gyX0VCvfMuSSlkZSCdyoayKAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:36.589783Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08751","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:affede7284b749c3e50707788a7ce7c1e10a007bb693f4d30129513e9eb28a1a","sha256:a91d7920c60b3840ee88c5ccca22003c77050272629ed6755007ddb5807a2936"],"state_sha256":"cbe6fde4bb02ee77a160f74d73b56e87d6e5c9f1450922984da385c3875ad2e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1eh6lnedKeZySyxYQXENwkxmZykh3HTUZC8hirxEeXX3yuLEMhLIKs+DdtWVc11W+WEfF0+jy/lEJiER8hPKBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:22:47.271091Z","bundle_sha256":"69cd3dd25692f45a67468884b7555320b084eafb41c70b0ef77baa99cce8d4e0"}}