{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BS4MVZ634MIYSHX6X52F7JIUN2","short_pith_number":"pith:BS4MVZ63","canonical_record":{"source":{"id":"1109.3556","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-16T09:23:54Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"8b62845441562fa75b9c6fdd55c9305275f0b204aa4de791d488471ba51c87c8","abstract_canon_sha256":"b644732bfa45c778b5b3928c48ad5ebf1d3976e73987dacdc9b30db541229558"},"schema_version":"1.0"},"canonical_sha256":"0cb8cae7dbe311891efebf745fa5146eb1eb1f905e73477160635ae01fecf37f","source":{"kind":"arxiv","id":"1109.3556","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3556","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3556v1","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3556","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"BS4MVZ634MIY","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BS4MVZ634MIYSHX6","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BS4MVZ63","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BS4MVZ634MIYSHX6X52F7JIUN2","target":"record","payload":{"canonical_record":{"source":{"id":"1109.3556","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-16T09:23:54Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"8b62845441562fa75b9c6fdd55c9305275f0b204aa4de791d488471ba51c87c8","abstract_canon_sha256":"b644732bfa45c778b5b3928c48ad5ebf1d3976e73987dacdc9b30db541229558"},"schema_version":"1.0"},"canonical_sha256":"0cb8cae7dbe311891efebf745fa5146eb1eb1f905e73477160635ae01fecf37f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:36.686517Z","signature_b64":"YdzDPJl63Cbc5UYhYx2wrJ+yNgeerBA8jnwdRDMnCIXYIHQ2JT638I+1s8iEOVACBgx9JD1Z4wpbNsBj1V8XAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0cb8cae7dbe311891efebf745fa5146eb1eb1f905e73477160635ae01fecf37f","last_reissued_at":"2026-05-18T02:21:36.686084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:36.686084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.3556","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-18T02:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7Qc5pvh0xMxxZxaiJg+z6V96GC8dg8mX198VAc8TJzaCjYmlYYK403EIknpmK9pcrVG/x565el5I/Ok1/OJyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:53:25.970041Z"},"content_sha256":"b2eef2d5877e0d3e85c796a847d7896939b5292e9312963310f54f4113915a4d","schema_version":"1.0","event_id":"sha256:b2eef2d5877e0d3e85c796a847d7896939b5292e9312963310f54f4113915a4d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BS4MVZ634MIYSHX6X52F7JIUN2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the reachability and observability of path and cycle graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Gianfranco Parlangeli, Giuseppe Notarstefano","submitted_at":"2011-09-16T09:23:54Z","abstract_excerpt":"In this paper we investigate the reachability and observability properties of a network system, running a Laplacian based average consensus algorithm, when the communication graph is a path or a cycle. More in detail, we provide necessary and sufficient conditions, based on simple algebraic rules from number theory, to characterize all and only the nodes from which the network system is reachable (respectively observable). Interesting immediate corollaries of our results are: (i) a path graph is reachable (observable) from any single node if and only if the number of nodes of the graph is a po"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3556","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-18T02:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Uv/1AucDCLzZH9GEO2EgvVAI2R9kiEYjNwD2zJ3DaS3gyxVY0wAcxu1q7gm7kBoNnGTaUcbTb+nroE3afPOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T07:53:25.970712Z"},"content_sha256":"3b206adc0522c749a0f78384120320f785c8c7d7539e6c9522e3b3f4f99ac4b4","schema_version":"1.0","event_id":"sha256:3b206adc0522c749a0f78384120320f785c8c7d7539e6c9522e3b3f4f99ac4b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BS4MVZ634MIYSHX6X52F7JIUN2/bundle.json","state_url":"https://pith.science/pith/BS4MVZ634MIYSHX6X52F7JIUN2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BS4MVZ634MIYSHX6X52F7JIUN2/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-10T07:53:25Z","links":{"resolver":"https://pith.science/pith/BS4MVZ634MIYSHX6X52F7JIUN2","bundle":"https://pith.science/pith/BS4MVZ634MIYSHX6X52F7JIUN2/bundle.json","state":"https://pith.science/pith/BS4MVZ634MIYSHX6X52F7JIUN2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BS4MVZ634MIYSHX6X52F7JIUN2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BS4MVZ634MIYSHX6X52F7JIUN2","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":"b644732bfa45c778b5b3928c48ad5ebf1d3976e73987dacdc9b30db541229558","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-16T09:23:54Z","title_canon_sha256":"8b62845441562fa75b9c6fdd55c9305275f0b204aa4de791d488471ba51c87c8"},"schema_version":"1.0","source":{"id":"1109.3556","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3556","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3556v1","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3556","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"BS4MVZ634MIY","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BS4MVZ634MIYSHX6","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BS4MVZ63","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:3b206adc0522c749a0f78384120320f785c8c7d7539e6c9522e3b3f4f99ac4b4","target":"graph","created_at":"2026-05-18T02:21: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":"In this paper we investigate the reachability and observability properties of a network system, running a Laplacian based average consensus algorithm, when the communication graph is a path or a cycle. More in detail, we provide necessary and sufficient conditions, based on simple algebraic rules from number theory, to characterize all and only the nodes from which the network system is reachable (respectively observable). Interesting immediate corollaries of our results are: (i) a path graph is reachable (observable) from any single node if and only if the number of nodes of the graph is a po","authors_text":"Gianfranco Parlangeli, Giuseppe Notarstefano","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-16T09:23:54Z","title":"On the reachability and observability of path and cycle graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3556","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:b2eef2d5877e0d3e85c796a847d7896939b5292e9312963310f54f4113915a4d","target":"record","created_at":"2026-05-18T02:21: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":"b644732bfa45c778b5b3928c48ad5ebf1d3976e73987dacdc9b30db541229558","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-09-16T09:23:54Z","title_canon_sha256":"8b62845441562fa75b9c6fdd55c9305275f0b204aa4de791d488471ba51c87c8"},"schema_version":"1.0","source":{"id":"1109.3556","kind":"arxiv","version":1}},"canonical_sha256":"0cb8cae7dbe311891efebf745fa5146eb1eb1f905e73477160635ae01fecf37f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cb8cae7dbe311891efebf745fa5146eb1eb1f905e73477160635ae01fecf37f","first_computed_at":"2026-05-18T02:21:36.686084Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:36.686084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YdzDPJl63Cbc5UYhYx2wrJ+yNgeerBA8jnwdRDMnCIXYIHQ2JT638I+1s8iEOVACBgx9JD1Z4wpbNsBj1V8XAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:36.686517Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.3556","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b2eef2d5877e0d3e85c796a847d7896939b5292e9312963310f54f4113915a4d","sha256:3b206adc0522c749a0f78384120320f785c8c7d7539e6c9522e3b3f4f99ac4b4"],"state_sha256":"56139cdd0a6176233cb20f1db539e35e845ae1be6a0e6f6b71cf9de3cec5f9cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J+1D0XP4eh157ap4qybNFe6X7uUbQcmZFYEpbP9KHs6a8b4N9EA3Lsu5oq7CwbsA/N9aQTWeJxWI+cx8BIJRCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T07:53:25.979239Z","bundle_sha256":"194a304328aa05b719ffcd4b730bfca57947db8facfc195f0b3842985008f978"}}