{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:PPVKBIT2VO46SO4D6DLB3U3BYW","short_pith_number":"pith:PPVKBIT2","schema_version":"1.0","canonical_sha256":"7beaa0a27aabb9e93b83f0d61dd361c5a7598b318349dabd5f66ef0956c7eb8d","source":{"kind":"arxiv","id":"0805.0181","version":1},"attestation_state":"computed","paper":{"title":"Nondiscriminatory Propagation on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.CO","authors_text":"Simone Severini","submitted_at":"2008-05-02T15:30:45Z","abstract_excerpt":"We consider a discrete-time dynamical process on graphs, firstly introduced in connection with a protocol for controlling large networks of spin 1/2 quantum mechanical particles [Phys. Rev. Lett. 99, 100501 (2007)]. A description is as follows: each vertex of an initially selected set has a packet of information (the same for every element of the set), which will be distributed among vertices of the graph; a vertex v can pass its packet to an adjacent vertex w only if w is its only neighbour without the information. By mean of examples, we describe some general properties, mainly concerning ho"},"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":"0805.0181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2008-05-02T15:30:45Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"04d98603f479ff904963a397f2dd4b369577d20e1f61781c2fe8bc119d7ee7d8","abstract_canon_sha256":"41253cc4bd1c306c2ca3ecf92a6b7853bfac6dbd36bde83bf6fbbe874b571248"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:22.240895Z","signature_b64":"NmazyZjHRFRafBxaBOTvhrTvO/d1PTCrPFi3PCTrfZVZgMoTFwmvTjYQ8hsNI90LpkRrpsPr6IgVTL17taP3CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7beaa0a27aabb9e93b83f0d61dd361c5a7598b318349dabd5f66ef0956c7eb8d","last_reissued_at":"2026-05-18T03:13:22.240286Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:22.240286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nondiscriminatory Propagation on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"math.CO","authors_text":"Simone Severini","submitted_at":"2008-05-02T15:30:45Z","abstract_excerpt":"We consider a discrete-time dynamical process on graphs, firstly introduced in connection with a protocol for controlling large networks of spin 1/2 quantum mechanical particles [Phys. Rev. Lett. 99, 100501 (2007)]. A description is as follows: each vertex of an initially selected set has a packet of information (the same for every element of the set), which will be distributed among vertices of the graph; a vertex v can pass its packet to an adjacent vertex w only if w is its only neighbour without the information. By mean of examples, we describe some general properties, mainly concerning ho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0805.0181","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0805.0181","created_at":"2026-05-18T03:13:22.240379+00:00"},{"alias_kind":"arxiv_version","alias_value":"0805.0181v1","created_at":"2026-05-18T03:13:22.240379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0805.0181","created_at":"2026-05-18T03:13:22.240379+00:00"},{"alias_kind":"pith_short_12","alias_value":"PPVKBIT2VO46","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"PPVKBIT2VO46SO4D","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"PPVKBIT2","created_at":"2026-05-18T12:25:57.157939+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/PPVKBIT2VO46SO4D6DLB3U3BYW","json":"https://pith.science/pith/PPVKBIT2VO46SO4D6DLB3U3BYW.json","graph_json":"https://pith.science/api/pith-number/PPVKBIT2VO46SO4D6DLB3U3BYW/graph.json","events_json":"https://pith.science/api/pith-number/PPVKBIT2VO46SO4D6DLB3U3BYW/events.json","paper":"https://pith.science/paper/PPVKBIT2"},"agent_actions":{"view_html":"https://pith.science/pith/PPVKBIT2VO46SO4D6DLB3U3BYW","download_json":"https://pith.science/pith/PPVKBIT2VO46SO4D6DLB3U3BYW.json","view_paper":"https://pith.science/paper/PPVKBIT2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0805.0181&json=true","fetch_graph":"https://pith.science/api/pith-number/PPVKBIT2VO46SO4D6DLB3U3BYW/graph.json","fetch_events":"https://pith.science/api/pith-number/PPVKBIT2VO46SO4D6DLB3U3BYW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PPVKBIT2VO46SO4D6DLB3U3BYW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PPVKBIT2VO46SO4D6DLB3U3BYW/action/storage_attestation","attest_author":"https://pith.science/pith/PPVKBIT2VO46SO4D6DLB3U3BYW/action/author_attestation","sign_citation":"https://pith.science/pith/PPVKBIT2VO46SO4D6DLB3U3BYW/action/citation_signature","submit_replication":"https://pith.science/pith/PPVKBIT2VO46SO4D6DLB3U3BYW/action/replication_record"}},"created_at":"2026-05-18T03:13:22.240379+00:00","updated_at":"2026-05-18T03:13:22.240379+00:00"}