{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:O5EE6FEW53OOGM47JO3YZS7SOY","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":"61d103cfb4975a7d6d7bfac41efc80e8b5a42ce592a56b9fb2cbb6933af4f25d","cross_cats_sorted":["cs.DS","cs.SI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-12T13:34:52Z","title_canon_sha256":"67b7953cef005b04662e51f4c89ad580155c51a68f10da651a00df4553abc70c"},"schema_version":"1.0","source":{"id":"1302.2787","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.2787","created_at":"2026-05-18T02:56:32Z"},{"alias_kind":"arxiv_version","alias_value":"1302.2787v4","created_at":"2026-05-18T02:56:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2787","created_at":"2026-05-18T02:56:32Z"},{"alias_kind":"pith_short_12","alias_value":"O5EE6FEW53OO","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"O5EE6FEW53OOGM47","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"O5EE6FEW","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:eccd7512a57e3f9b3b81cc71a43b6b731568ac38f0d1340cefe1a76c1b48c656","target":"graph","created_at":"2026-05-18T02:56: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":"We define the following parameter of connected graphs. For a given graph $G$ we place one agent in each vertex of $G$. Every pair of agents sharing a common edge is declared to be acquainted. In each round we choose some matching of $G$ (not necessarily a maximal matching), and for each edge in the matching the agents on this edge swap places. After the swap, again, every pair of agents sharing a common edge become acquainted, and the process continues. We define the \\emph{acquaintance time} of a graph $G$, denoted by $AC(G)$, to be the minimal number of rounds required until every two agents ","authors_text":"Gilad Tsur, Igor Shinkar, Itai Benjamini","cross_cats":["cs.DS","cs.SI","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-12T13:34:52Z","title":"Acquaintance Time of a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2787","kind":"arxiv","version":4},"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:eeb8f683225e05409392fc08ec204eb6e517c41829b0c3c7ed16c231532bfa4d","target":"record","created_at":"2026-05-18T02:56: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":"61d103cfb4975a7d6d7bfac41efc80e8b5a42ce592a56b9fb2cbb6933af4f25d","cross_cats_sorted":["cs.DS","cs.SI","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-12T13:34:52Z","title_canon_sha256":"67b7953cef005b04662e51f4c89ad580155c51a68f10da651a00df4553abc70c"},"schema_version":"1.0","source":{"id":"1302.2787","kind":"arxiv","version":4}},"canonical_sha256":"77484f1496eedce3339f4bb78ccbf27613bffcc0dade6c7270db679d6c9888a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77484f1496eedce3339f4bb78ccbf27613bffcc0dade6c7270db679d6c9888a4","first_computed_at":"2026-05-18T02:56:32.813353Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:32.813353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KSJjEA1+VUILRJ6MSlW5eJepMxfjRHlv0OcxI3emHrNZCxgNz4ySxUwdQaCxe1VYcpRQr0LDWOGQFgOG6vUlBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:32.814170Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.2787","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eeb8f683225e05409392fc08ec204eb6e517c41829b0c3c7ed16c231532bfa4d","sha256:eccd7512a57e3f9b3b81cc71a43b6b731568ac38f0d1340cefe1a76c1b48c656"],"state_sha256":"9d51fc69ed22c5b85b92c8236d1d4710ff428245e4128d0453f48d4d5e8a3d2f"}