{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HP4TBAIGH5OFE7VYKF4RF4BJBW","short_pith_number":"pith:HP4TBAIG","canonical_record":{"source":{"id":"1712.06496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-18T16:14:33Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"a1dea9250c1b1968df67cf477770b7bf3dd41c0041ff6ee4500aa496dbdd05bc","abstract_canon_sha256":"d6375941b10a5f7edec99257513592238cda106fc4fce37d17ceee701cd7394f"},"schema_version":"1.0"},"canonical_sha256":"3bf93081063f5c527eb8517912f0290db3d850925f7994f2d27ce8fe85f1a5ee","source":{"kind":"arxiv","id":"1712.06496","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06496","created_at":"2026-05-18T00:27:47Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06496v1","created_at":"2026-05-18T00:27:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06496","created_at":"2026-05-18T00:27:47Z"},{"alias_kind":"pith_short_12","alias_value":"HP4TBAIGH5OF","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HP4TBAIGH5OFE7VY","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HP4TBAIG","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HP4TBAIGH5OFE7VYKF4RF4BJBW","target":"record","payload":{"canonical_record":{"source":{"id":"1712.06496","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-18T16:14:33Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"a1dea9250c1b1968df67cf477770b7bf3dd41c0041ff6ee4500aa496dbdd05bc","abstract_canon_sha256":"d6375941b10a5f7edec99257513592238cda106fc4fce37d17ceee701cd7394f"},"schema_version":"1.0"},"canonical_sha256":"3bf93081063f5c527eb8517912f0290db3d850925f7994f2d27ce8fe85f1a5ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:47.684485Z","signature_b64":"DSF6AIlGc0+Hr/BpW1tOh/0XX9GC+5Bar6ZMzI/5nm3TI5cpQFZNk9tNzvdnCWdT/aw/4b8bkte6fC+AlTD6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bf93081063f5c527eb8517912f0290db3d850925f7994f2d27ce8fe85f1a5ee","last_reissued_at":"2026-05-18T00:27:47.684084Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:47.684084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.06496","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:27:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ivKAKXOD+IZrwji1vPGIlck1/HOs4eeMtENXgy5U7AWGsysM2++YmvT257O0QSJkDDvLBDbcHJ4B6nzsuZO1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T22:50:37.926547Z"},"content_sha256":"8a697fe0a2c14b48647ec18e54ddc2ba69300a99c70f096a29f8ca7488ac8337","schema_version":"1.0","event_id":"sha256:8a697fe0a2c14b48647ec18e54ddc2ba69300a99c70f096a29f8ca7488ac8337"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HP4TBAIGH5OFE7VYKF4RF4BJBW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Consensus in Self-similar Hierarchical Graphs and Sierpi\\'nski Graphs: Convergence Speed, Delay Robustness, and Coherence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.SY","authors_text":"Huan Li, Yi Qi, Yuhao Yi, Zhongzhi Zhang","submitted_at":"2017-12-18T16:14:33Z","abstract_excerpt":"The hierarchical graphs and Sierpi\\'nski graphs are constructed iteratively, which have the same number of vertices and edges at any iteration, but exhibit quite different structural properties: the hierarchical graphs are non-fractal and small-world, while the Sierpi\\'nski graphs are fractal and \"large-world\". Both graphs have found broad applications. In this paper, we study consensus problems in hierarchical graphs and Sierpi\\'nski graphs, focusing on three important quantities of consensus problems, that is, convergence speed, delay robustness, and coherence for first-order (and second-ord"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06496","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:27:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kipm4mbkbc4Rlm36wN/3qs91ihNq6HJiyOfhenLKlAOaGGvSPCd5lpTy9jFBw8i3QGKPqDIt0pjST1zp3mypBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T22:50:37.926891Z"},"content_sha256":"143af0fee266f360f04e368cd8a76d646da6a9db05b06e7cb74e8c8cb694ff05","schema_version":"1.0","event_id":"sha256:143af0fee266f360f04e368cd8a76d646da6a9db05b06e7cb74e8c8cb694ff05"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HP4TBAIGH5OFE7VYKF4RF4BJBW/bundle.json","state_url":"https://pith.science/pith/HP4TBAIGH5OFE7VYKF4RF4BJBW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HP4TBAIGH5OFE7VYKF4RF4BJBW/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-07-02T22:50:37Z","links":{"resolver":"https://pith.science/pith/HP4TBAIGH5OFE7VYKF4RF4BJBW","bundle":"https://pith.science/pith/HP4TBAIGH5OFE7VYKF4RF4BJBW/bundle.json","state":"https://pith.science/pith/HP4TBAIGH5OFE7VYKF4RF4BJBW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HP4TBAIGH5OFE7VYKF4RF4BJBW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HP4TBAIGH5OFE7VYKF4RF4BJBW","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":"d6375941b10a5f7edec99257513592238cda106fc4fce37d17ceee701cd7394f","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-18T16:14:33Z","title_canon_sha256":"a1dea9250c1b1968df67cf477770b7bf3dd41c0041ff6ee4500aa496dbdd05bc"},"schema_version":"1.0","source":{"id":"1712.06496","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.06496","created_at":"2026-05-18T00:27:47Z"},{"alias_kind":"arxiv_version","alias_value":"1712.06496v1","created_at":"2026-05-18T00:27:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.06496","created_at":"2026-05-18T00:27:47Z"},{"alias_kind":"pith_short_12","alias_value":"HP4TBAIGH5OF","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HP4TBAIGH5OFE7VY","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HP4TBAIG","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:143af0fee266f360f04e368cd8a76d646da6a9db05b06e7cb74e8c8cb694ff05","target":"graph","created_at":"2026-05-18T00:27:47Z","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":"The hierarchical graphs and Sierpi\\'nski graphs are constructed iteratively, which have the same number of vertices and edges at any iteration, but exhibit quite different structural properties: the hierarchical graphs are non-fractal and small-world, while the Sierpi\\'nski graphs are fractal and \"large-world\". Both graphs have found broad applications. In this paper, we study consensus problems in hierarchical graphs and Sierpi\\'nski graphs, focusing on three important quantities of consensus problems, that is, convergence speed, delay robustness, and coherence for first-order (and second-ord","authors_text":"Huan Li, Yi Qi, Yuhao Yi, Zhongzhi Zhang","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-18T16:14:33Z","title":"Consensus in Self-similar Hierarchical Graphs and Sierpi\\'nski Graphs: Convergence Speed, Delay Robustness, and Coherence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.06496","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:8a697fe0a2c14b48647ec18e54ddc2ba69300a99c70f096a29f8ca7488ac8337","target":"record","created_at":"2026-05-18T00:27:47Z","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":"d6375941b10a5f7edec99257513592238cda106fc4fce37d17ceee701cd7394f","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-12-18T16:14:33Z","title_canon_sha256":"a1dea9250c1b1968df67cf477770b7bf3dd41c0041ff6ee4500aa496dbdd05bc"},"schema_version":"1.0","source":{"id":"1712.06496","kind":"arxiv","version":1}},"canonical_sha256":"3bf93081063f5c527eb8517912f0290db3d850925f7994f2d27ce8fe85f1a5ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bf93081063f5c527eb8517912f0290db3d850925f7994f2d27ce8fe85f1a5ee","first_computed_at":"2026-05-18T00:27:47.684084Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:47.684084Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DSF6AIlGc0+Hr/BpW1tOh/0XX9GC+5Bar6ZMzI/5nm3TI5cpQFZNk9tNzvdnCWdT/aw/4b8bkte6fC+AlTD6AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:47.684485Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.06496","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a697fe0a2c14b48647ec18e54ddc2ba69300a99c70f096a29f8ca7488ac8337","sha256:143af0fee266f360f04e368cd8a76d646da6a9db05b06e7cb74e8c8cb694ff05"],"state_sha256":"d0bbc9ebef5189999d97763a927d330067d5217d54f63e3654647b1500ec532d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YusoB/eusVwQgxONo/eqwyeMD9JdXK/HcIfMIfW1led+VnO1fSi7sSIFV7KZWtbk0ERg1EjfE8tcNx9G+hCbCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T22:50:37.928846Z","bundle_sha256":"e1c5196638ab198b58f0bb5a52533e3cbaec752f9dec2b29de3a41c014fb95dc"}}