{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4QAE3WJDO3BZMBRD34ZLS3VGYD","short_pith_number":"pith:4QAE3WJD","schema_version":"1.0","canonical_sha256":"e4004dd92376c3960623df32b96ea6c0c3b2a1412e40984ee9762e915a5972c5","source":{"kind":"arxiv","id":"1211.7343","version":1},"attestation_state":"computed","paper":{"title":"Persistence and periodicity in a dynamic proximity network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"physics.data-an","authors_text":"Aaron Clauset, Nathan Eagle","submitted_at":"2012-11-30T19:15:12Z","abstract_excerpt":"The topology of social networks can be understood as being inherently dynamic, with edges having a distinct position in time. Most characterizations of dynamic networks discretize time by converting temporal information into a sequence of network \"snapshots\" for further analysis. Here we study a highly resolved data set of a dynamic proximity network of 66 individuals. We show that the topology of this network evolves over a very broad distribution of time scales, that its behavior is characterized by strong periodicities driven by external calendar cycles, and that the conversion of inherentl"},"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":"1211.7343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2012-11-30T19:15:12Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"87527a6084fd642518aa3270b4356cb7b9c26dd1fc1ad18f5db3428f6cae1aca","abstract_canon_sha256":"3f1b83f7ce7bec079cd94cd9507c089bd5ec4d75f68507a6f9c31147159bab86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:30.866690Z","signature_b64":"GveNy2fAGkiqjzCZSnIGDVXqsYJMYD288kBORbF1pmwHCDzWEDkKx8AKPwrfa5MWasP3lUgB59uL3T/5ay5eCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4004dd92376c3960623df32b96ea6c0c3b2a1412e40984ee9762e915a5972c5","last_reissued_at":"2026-05-18T03:39:30.866045Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:30.866045Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Persistence and periodicity in a dynamic proximity network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"physics.data-an","authors_text":"Aaron Clauset, Nathan Eagle","submitted_at":"2012-11-30T19:15:12Z","abstract_excerpt":"The topology of social networks can be understood as being inherently dynamic, with edges having a distinct position in time. Most characterizations of dynamic networks discretize time by converting temporal information into a sequence of network \"snapshots\" for further analysis. Here we study a highly resolved data set of a dynamic proximity network of 66 individuals. We show that the topology of this network evolves over a very broad distribution of time scales, that its behavior is characterized by strong periodicities driven by external calendar cycles, and that the conversion of inherentl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.7343","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":"1211.7343","created_at":"2026-05-18T03:39:30.866137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1211.7343v1","created_at":"2026-05-18T03:39:30.866137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.7343","created_at":"2026-05-18T03:39:30.866137+00:00"},{"alias_kind":"pith_short_12","alias_value":"4QAE3WJDO3BZ","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4QAE3WJDO3BZMBRD","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4QAE3WJD","created_at":"2026-05-18T12:26:53.410803+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11873","citing_title":"Maximizing Reachability via Shifting of Temporal Paths","ref_index":222,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4QAE3WJDO3BZMBRD34ZLS3VGYD","json":"https://pith.science/pith/4QAE3WJDO3BZMBRD34ZLS3VGYD.json","graph_json":"https://pith.science/api/pith-number/4QAE3WJDO3BZMBRD34ZLS3VGYD/graph.json","events_json":"https://pith.science/api/pith-number/4QAE3WJDO3BZMBRD34ZLS3VGYD/events.json","paper":"https://pith.science/paper/4QAE3WJD"},"agent_actions":{"view_html":"https://pith.science/pith/4QAE3WJDO3BZMBRD34ZLS3VGYD","download_json":"https://pith.science/pith/4QAE3WJDO3BZMBRD34ZLS3VGYD.json","view_paper":"https://pith.science/paper/4QAE3WJD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1211.7343&json=true","fetch_graph":"https://pith.science/api/pith-number/4QAE3WJDO3BZMBRD34ZLS3VGYD/graph.json","fetch_events":"https://pith.science/api/pith-number/4QAE3WJDO3BZMBRD34ZLS3VGYD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4QAE3WJDO3BZMBRD34ZLS3VGYD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4QAE3WJDO3BZMBRD34ZLS3VGYD/action/storage_attestation","attest_author":"https://pith.science/pith/4QAE3WJDO3BZMBRD34ZLS3VGYD/action/author_attestation","sign_citation":"https://pith.science/pith/4QAE3WJDO3BZMBRD34ZLS3VGYD/action/citation_signature","submit_replication":"https://pith.science/pith/4QAE3WJDO3BZMBRD34ZLS3VGYD/action/replication_record"}},"created_at":"2026-05-18T03:39:30.866137+00:00","updated_at":"2026-05-18T03:39:30.866137+00:00"}