{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:O5EE6FEW53OOGM47JO3YZS7SOY","short_pith_number":"pith:O5EE6FEW","schema_version":"1.0","canonical_sha256":"77484f1496eedce3339f4bb78ccbf27613bffcc0dade6c7270db679d6c9888a4","source":{"kind":"arxiv","id":"1302.2787","version":4},"attestation_state":"computed","paper":{"title":"Acquaintance Time of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SI","math.CO"],"primary_cat":"cs.CC","authors_text":"Gilad Tsur, Igor Shinkar, Itai Benjamini","submitted_at":"2013-02-12T13:34:52Z","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 "},"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":"1302.2787","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-02-12T13:34:52Z","cross_cats_sorted":["cs.DS","cs.SI","math.CO"],"title_canon_sha256":"67b7953cef005b04662e51f4c89ad580155c51a68f10da651a00df4553abc70c","abstract_canon_sha256":"61d103cfb4975a7d6d7bfac41efc80e8b5a42ce592a56b9fb2cbb6933af4f25d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:32.814170Z","signature_b64":"KSJjEA1+VUILRJ6MSlW5eJepMxfjRHlv0OcxI3emHrNZCxgNz4ySxUwdQaCxe1VYcpRQr0LDWOGQFgOG6vUlBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77484f1496eedce3339f4bb78ccbf27613bffcc0dade6c7270db679d6c9888a4","last_reissued_at":"2026-05-18T02:56:32.813353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:32.813353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Acquaintance Time of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.SI","math.CO"],"primary_cat":"cs.CC","authors_text":"Gilad Tsur, Igor Shinkar, Itai Benjamini","submitted_at":"2013-02-12T13:34:52Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.2787","kind":"arxiv","version":4},"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":"1302.2787","created_at":"2026-05-18T02:56:32.813482+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.2787v4","created_at":"2026-05-18T02:56:32.813482+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.2787","created_at":"2026-05-18T02:56:32.813482+00:00"},{"alias_kind":"pith_short_12","alias_value":"O5EE6FEW53OO","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"O5EE6FEW53OOGM47","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"O5EE6FEW","created_at":"2026-05-18T12:27:54.935989+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/O5EE6FEW53OOGM47JO3YZS7SOY","json":"https://pith.science/pith/O5EE6FEW53OOGM47JO3YZS7SOY.json","graph_json":"https://pith.science/api/pith-number/O5EE6FEW53OOGM47JO3YZS7SOY/graph.json","events_json":"https://pith.science/api/pith-number/O5EE6FEW53OOGM47JO3YZS7SOY/events.json","paper":"https://pith.science/paper/O5EE6FEW"},"agent_actions":{"view_html":"https://pith.science/pith/O5EE6FEW53OOGM47JO3YZS7SOY","download_json":"https://pith.science/pith/O5EE6FEW53OOGM47JO3YZS7SOY.json","view_paper":"https://pith.science/paper/O5EE6FEW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.2787&json=true","fetch_graph":"https://pith.science/api/pith-number/O5EE6FEW53OOGM47JO3YZS7SOY/graph.json","fetch_events":"https://pith.science/api/pith-number/O5EE6FEW53OOGM47JO3YZS7SOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O5EE6FEW53OOGM47JO3YZS7SOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O5EE6FEW53OOGM47JO3YZS7SOY/action/storage_attestation","attest_author":"https://pith.science/pith/O5EE6FEW53OOGM47JO3YZS7SOY/action/author_attestation","sign_citation":"https://pith.science/pith/O5EE6FEW53OOGM47JO3YZS7SOY/action/citation_signature","submit_replication":"https://pith.science/pith/O5EE6FEW53OOGM47JO3YZS7SOY/action/replication_record"}},"created_at":"2026-05-18T02:56:32.813482+00:00","updated_at":"2026-05-18T02:56:32.813482+00:00"}