{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:THX45SYMGZF2RLKMZZ6PAVEULJ","short_pith_number":"pith:THX45SYM","canonical_record":{"source":{"id":"1309.3151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-10T14:52:15Z","cross_cats_sorted":["cs.DC","cs.SY","math.DS"],"title_canon_sha256":"c029da803d7e32e11cbe3b7a0a777b08990735939049c8218c204aca765ef87b","abstract_canon_sha256":"187c63f6090a9241307df139be418f37d89eb3a552f028dee4fbc468f169fe57"},"schema_version":"1.0"},"canonical_sha256":"99efcecb0c364ba8ad4cce7cf054945a79e40794882b2344152d09a73a5134bb","source":{"kind":"arxiv","id":"1309.3151","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3151","created_at":"2026-05-18T03:13:32Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3151v1","created_at":"2026-05-18T03:13:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3151","created_at":"2026-05-18T03:13:32Z"},{"alias_kind":"pith_short_12","alias_value":"THX45SYMGZF2","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"THX45SYMGZF2RLKM","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"THX45SYM","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:THX45SYMGZF2RLKMZZ6PAVEULJ","target":"record","payload":{"canonical_record":{"source":{"id":"1309.3151","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-10T14:52:15Z","cross_cats_sorted":["cs.DC","cs.SY","math.DS"],"title_canon_sha256":"c029da803d7e32e11cbe3b7a0a777b08990735939049c8218c204aca765ef87b","abstract_canon_sha256":"187c63f6090a9241307df139be418f37d89eb3a552f028dee4fbc468f169fe57"},"schema_version":"1.0"},"canonical_sha256":"99efcecb0c364ba8ad4cce7cf054945a79e40794882b2344152d09a73a5134bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:32.690907Z","signature_b64":"SO7St41ENVAta3FS2IGk0Exb8PqXPjdjXYJSRdQ2lvPUmTt9z4tU9YB3kQOecPeQDQGJnmadhhtTTlxcIS7pCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99efcecb0c364ba8ad4cce7cf054945a79e40794882b2344152d09a73a5134bb","last_reissued_at":"2026-05-18T03:13:32.690151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:32.690151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.3151","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:13:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rdgWEtZ0ov4n45BAe9TLPpusJCzQbJvB8yQMSyJtgcLhnfcH+B17R81jTyiWqsdSC/Opw6GYlOcN5irc4kiQBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:04:55.380767Z"},"content_sha256":"442a21683510e6babc1e783c71204110a90344152e287cf0e6e46fa1c1766864","schema_version":"1.0","event_id":"sha256:442a21683510e6babc1e783c71204110a90344152e287cf0e6e46fa1c1766864"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:THX45SYMGZF2RLKMZZ6PAVEULJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed privacy-preserving network size computation: A system-identification based method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.SY","math.DS"],"primary_cat":"math.OC","authors_text":"Federica Garin (INRIA Grenoble Rh\\^one-Alpes / Gipsa-lab, GIPSA-lab), Ye Yuan","submitted_at":"2013-09-10T14:52:15Z","abstract_excerpt":"In this study, we propose an algorithm for computing the network size of communicating agents. The algorithm is distributed: a) it does not require a leader selection; b) it only requires local exchange of information, and; c) its design can be implemented using local information only, without any global information about the network. It is privacy-preserving, namely it does not require to propagate identifying labels. This algorithm is based on system identification, and more precisely on the identification of the order of a suitably-constructed discrete-time linear time-invariant system over"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3151","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:13:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Pg7hivbOgaIR9XwOAkxP9SzPb9XblOvMlWuq2Gj36ko3Rn8gVV++Vv/96p6qF1yPe840gXC9uVHTFXucCB2Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:04:55.381484Z"},"content_sha256":"f8884225cdeb42fc089b01b222a0850f7d4aa55756d7a4cfad85aa8d16b95612","schema_version":"1.0","event_id":"sha256:f8884225cdeb42fc089b01b222a0850f7d4aa55756d7a4cfad85aa8d16b95612"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/THX45SYMGZF2RLKMZZ6PAVEULJ/bundle.json","state_url":"https://pith.science/pith/THX45SYMGZF2RLKMZZ6PAVEULJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/THX45SYMGZF2RLKMZZ6PAVEULJ/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-11T01:04:55Z","links":{"resolver":"https://pith.science/pith/THX45SYMGZF2RLKMZZ6PAVEULJ","bundle":"https://pith.science/pith/THX45SYMGZF2RLKMZZ6PAVEULJ/bundle.json","state":"https://pith.science/pith/THX45SYMGZF2RLKMZZ6PAVEULJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/THX45SYMGZF2RLKMZZ6PAVEULJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:THX45SYMGZF2RLKMZZ6PAVEULJ","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":"187c63f6090a9241307df139be418f37d89eb3a552f028dee4fbc468f169fe57","cross_cats_sorted":["cs.DC","cs.SY","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-10T14:52:15Z","title_canon_sha256":"c029da803d7e32e11cbe3b7a0a777b08990735939049c8218c204aca765ef87b"},"schema_version":"1.0","source":{"id":"1309.3151","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3151","created_at":"2026-05-18T03:13:32Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3151v1","created_at":"2026-05-18T03:13:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3151","created_at":"2026-05-18T03:13:32Z"},{"alias_kind":"pith_short_12","alias_value":"THX45SYMGZF2","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"THX45SYMGZF2RLKM","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"THX45SYM","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:f8884225cdeb42fc089b01b222a0850f7d4aa55756d7a4cfad85aa8d16b95612","target":"graph","created_at":"2026-05-18T03:13:32Z","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 study, we propose an algorithm for computing the network size of communicating agents. The algorithm is distributed: a) it does not require a leader selection; b) it only requires local exchange of information, and; c) its design can be implemented using local information only, without any global information about the network. It is privacy-preserving, namely it does not require to propagate identifying labels. This algorithm is based on system identification, and more precisely on the identification of the order of a suitably-constructed discrete-time linear time-invariant system over","authors_text":"Federica Garin (INRIA Grenoble Rh\\^one-Alpes / Gipsa-lab, GIPSA-lab), Ye Yuan","cross_cats":["cs.DC","cs.SY","math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-10T14:52:15Z","title":"Distributed privacy-preserving network size computation: A system-identification based method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3151","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:442a21683510e6babc1e783c71204110a90344152e287cf0e6e46fa1c1766864","target":"record","created_at":"2026-05-18T03:13:32Z","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":"187c63f6090a9241307df139be418f37d89eb3a552f028dee4fbc468f169fe57","cross_cats_sorted":["cs.DC","cs.SY","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-09-10T14:52:15Z","title_canon_sha256":"c029da803d7e32e11cbe3b7a0a777b08990735939049c8218c204aca765ef87b"},"schema_version":"1.0","source":{"id":"1309.3151","kind":"arxiv","version":1}},"canonical_sha256":"99efcecb0c364ba8ad4cce7cf054945a79e40794882b2344152d09a73a5134bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99efcecb0c364ba8ad4cce7cf054945a79e40794882b2344152d09a73a5134bb","first_computed_at":"2026-05-18T03:13:32.690151Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:32.690151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SO7St41ENVAta3FS2IGk0Exb8PqXPjdjXYJSRdQ2lvPUmTt9z4tU9YB3kQOecPeQDQGJnmadhhtTTlxcIS7pCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:32.690907Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.3151","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:442a21683510e6babc1e783c71204110a90344152e287cf0e6e46fa1c1766864","sha256:f8884225cdeb42fc089b01b222a0850f7d4aa55756d7a4cfad85aa8d16b95612"],"state_sha256":"f1e2170e7312653510e0bfe045c1bb01b1057ab6a4bd2349fee7af6ffe9f9fb3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RmFx7IkBklpmlWStMWX8RWZzqr09qNNQBNtGPtSd1lJqU8nenzPqJBa/I/Z9pPaBmD0IY19J3fM86iuJ3PqgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:04:55.385128Z","bundle_sha256":"b961b2976de41dced811779aafc3c186660598d061fff2a9858823239c25f9bc"}}