{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OOLQQYZOVOOZOZN7OKNUQY77MR","short_pith_number":"pith:OOLQQYZO","canonical_record":{"source":{"id":"1510.09025","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-30T09:37:44Z","cross_cats_sorted":["cs.CY","cs.DM","cs.GT","cs.MA"],"title_canon_sha256":"474a2e037f3fc5d4e742f81c03d575092cc703a735dd2f8405a2bb846eade68f","abstract_canon_sha256":"b252a75dfb9fa4d120ec7110370d34966c320d95f1ca63d725853becf9344b85"},"schema_version":"1.0"},"canonical_sha256":"739708632eab9d9765bf729b4863ff647bebb5859810db436291a21f799744e7","source":{"kind":"arxiv","id":"1510.09025","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.09025","created_at":"2026-05-18T01:16:33Z"},{"alias_kind":"arxiv_version","alias_value":"1510.09025v2","created_at":"2026-05-18T01:16:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.09025","created_at":"2026-05-18T01:16:33Z"},{"alias_kind":"pith_short_12","alias_value":"OOLQQYZOVOOZ","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OOLQQYZOVOOZOZN7","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OOLQQYZO","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OOLQQYZOVOOZOZN7OKNUQY77MR","target":"record","payload":{"canonical_record":{"source":{"id":"1510.09025","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-30T09:37:44Z","cross_cats_sorted":["cs.CY","cs.DM","cs.GT","cs.MA"],"title_canon_sha256":"474a2e037f3fc5d4e742f81c03d575092cc703a735dd2f8405a2bb846eade68f","abstract_canon_sha256":"b252a75dfb9fa4d120ec7110370d34966c320d95f1ca63d725853becf9344b85"},"schema_version":"1.0"},"canonical_sha256":"739708632eab9d9765bf729b4863ff647bebb5859810db436291a21f799744e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:33.113992Z","signature_b64":"2dyZyZXilAkZ6BrGJ92x/Xl/yd6+tVPeqcYJJmt6rdfEg8ci3xDsdgqNONwO6COeSCeTjHWt71B9RyXfl1RhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"739708632eab9d9765bf729b4863ff647bebb5859810db436291a21f799744e7","last_reissued_at":"2026-05-18T01:16:33.113249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:33.113249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.09025","source_version":2,"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-18T01:16:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rdrI/3z/YJoF/iYTg5kHB3lRGfTFl2vwRbuyndHxoL/m17Za5UhgbqYpw+MgjTPlrXVhZqCF0gulvstfnWtrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:00:11.726573Z"},"content_sha256":"8823e8f259bc592450806b858b66477bb0e6df1ee3223a7258691a43c9cc721b","schema_version":"1.0","event_id":"sha256:8823e8f259bc592450806b858b66477bb0e6df1ee3223a7258691a43c9cc721b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OOLQQYZOVOOZOZN7OKNUQY77MR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Model for Social Network Formation: Efficiency, Stability and Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","cs.DM","cs.GT","cs.MA"],"primary_cat":"cs.SI","authors_text":"Aida Sadat Mousavifar, L. Elisa Celis","submitted_at":"2015-10-30T09:37:44Z","abstract_excerpt":"We introduce a simple network formation model for social networks. Agents are nodes, connecting to another agent by building a directed edge (or accepting a connection from another agent) has a cost, and reaching (or being reached by) other agents via short directed paths has a benefit; in effect, an agent wants to reach others quickly, but without the cost of directly connecting each and every one. We prove that asynchronous edge dynamics always converge to a stable network; in fact, for nontrivial ranges of parameters this convergence is fast. Moreover, the set of fixed points of the dynamic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.09025","kind":"arxiv","version":2},"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-18T01:16:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HGEDZ6vv8GJ+XoKhsuGuUi05EZqnuYD4Q+va5tTww/VgkhX3QB2NDgOJuxjQ4R8ztlGgGQw1OX4v6L1efUEwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:00:11.727226Z"},"content_sha256":"3a6c5a9942c5c1c142f1bb365ec2eeae8fd66cc45ae876fda4988326272564de","schema_version":"1.0","event_id":"sha256:3a6c5a9942c5c1c142f1bb365ec2eeae8fd66cc45ae876fda4988326272564de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OOLQQYZOVOOZOZN7OKNUQY77MR/bundle.json","state_url":"https://pith.science/pith/OOLQQYZOVOOZOZN7OKNUQY77MR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OOLQQYZOVOOZOZN7OKNUQY77MR/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-05-27T14:00:11Z","links":{"resolver":"https://pith.science/pith/OOLQQYZOVOOZOZN7OKNUQY77MR","bundle":"https://pith.science/pith/OOLQQYZOVOOZOZN7OKNUQY77MR/bundle.json","state":"https://pith.science/pith/OOLQQYZOVOOZOZN7OKNUQY77MR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OOLQQYZOVOOZOZN7OKNUQY77MR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OOLQQYZOVOOZOZN7OKNUQY77MR","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":"b252a75dfb9fa4d120ec7110370d34966c320d95f1ca63d725853becf9344b85","cross_cats_sorted":["cs.CY","cs.DM","cs.GT","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-30T09:37:44Z","title_canon_sha256":"474a2e037f3fc5d4e742f81c03d575092cc703a735dd2f8405a2bb846eade68f"},"schema_version":"1.0","source":{"id":"1510.09025","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.09025","created_at":"2026-05-18T01:16:33Z"},{"alias_kind":"arxiv_version","alias_value":"1510.09025v2","created_at":"2026-05-18T01:16:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.09025","created_at":"2026-05-18T01:16:33Z"},{"alias_kind":"pith_short_12","alias_value":"OOLQQYZOVOOZ","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OOLQQYZOVOOZOZN7","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OOLQQYZO","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:3a6c5a9942c5c1c142f1bb365ec2eeae8fd66cc45ae876fda4988326272564de","target":"graph","created_at":"2026-05-18T01:16:33Z","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 introduce a simple network formation model for social networks. Agents are nodes, connecting to another agent by building a directed edge (or accepting a connection from another agent) has a cost, and reaching (or being reached by) other agents via short directed paths has a benefit; in effect, an agent wants to reach others quickly, but without the cost of directly connecting each and every one. We prove that asynchronous edge dynamics always converge to a stable network; in fact, for nontrivial ranges of parameters this convergence is fast. Moreover, the set of fixed points of the dynamic","authors_text":"Aida Sadat Mousavifar, L. Elisa Celis","cross_cats":["cs.CY","cs.DM","cs.GT","cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-30T09:37:44Z","title":"A Model for Social Network Formation: Efficiency, Stability and Dynamics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.09025","kind":"arxiv","version":2},"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:8823e8f259bc592450806b858b66477bb0e6df1ee3223a7258691a43c9cc721b","target":"record","created_at":"2026-05-18T01:16:33Z","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":"b252a75dfb9fa4d120ec7110370d34966c320d95f1ca63d725853becf9344b85","cross_cats_sorted":["cs.CY","cs.DM","cs.GT","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-10-30T09:37:44Z","title_canon_sha256":"474a2e037f3fc5d4e742f81c03d575092cc703a735dd2f8405a2bb846eade68f"},"schema_version":"1.0","source":{"id":"1510.09025","kind":"arxiv","version":2}},"canonical_sha256":"739708632eab9d9765bf729b4863ff647bebb5859810db436291a21f799744e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"739708632eab9d9765bf729b4863ff647bebb5859810db436291a21f799744e7","first_computed_at":"2026-05-18T01:16:33.113249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:33.113249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2dyZyZXilAkZ6BrGJ92x/Xl/yd6+tVPeqcYJJmt6rdfEg8ci3xDsdgqNONwO6COeSCeTjHWt71B9RyXfl1RhCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:33.113992Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.09025","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8823e8f259bc592450806b858b66477bb0e6df1ee3223a7258691a43c9cc721b","sha256:3a6c5a9942c5c1c142f1bb365ec2eeae8fd66cc45ae876fda4988326272564de"],"state_sha256":"27da3a94834eadf0100102cb6bc73b5c20059dc029e0f7adc9a841eaa76101cc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VgT5JbxE4kMcHqwoKPKfH9A1YrOfWwV1C28WA91jgSqq/9qkEtGsLdhrhn4Y1kKyeJXpfRVxJz8QtGmWSbPTBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:00:11.730534Z","bundle_sha256":"bb2bffded036b2d5e73e6442804cb89ada8e138eec72a6b1819711794b9eea30"}}