{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:U4ZB37FKLQDHGEYCWA4FNDF57I","short_pith_number":"pith:U4ZB37FK","schema_version":"1.0","canonical_sha256":"a7321dfcaa5c06731302b038568cbdfa155d50d4d23a691c5202634ed5d567b4","source":{"kind":"arxiv","id":"1308.1911","version":1},"attestation_state":"computed","paper":{"title":"Social optimum in Social Groups with Give-and-Take criterion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NI","authors_text":"Joy Kuri, Rahul Vaze, Saurabh Aggarwal","submitted_at":"2013-08-08T17:35:58Z","abstract_excerpt":"We consider a \"Social Group\" of networked nodes, seeking a \"universe\" of segments. Each node has subset of the universe, and access to an expensive resource for downloading data. Alternatively, nodes can also acquire the universe by exchanging segments among themselves, at low cost, using a local network interface. While local exchanges ensure minimum cost, \"free riders\" in the group can exploit the system. To prohibit free riding, we propose the \"Give-and-Take\" criterion, where exchange is allowed if each node has segments unavailable with the other. Under this criterion, we consider the prob"},"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":"1308.1911","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2013-08-08T17:35:58Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"ab914f5afa630f02964910b59d888d0dad286285274c2c8b6e87cdb5f0aab2dc","abstract_canon_sha256":"c91042bd22d06df3e4d330db6893554f3c58eb64ee888874c5646de9311d8e56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:16:27.423691Z","signature_b64":"QD0aq+VNNXMcZzPkcSQNy3R9qkkvHBm/1/8O1bC31c6RNvrQMREz2zSCsyU3qw+6j7wrqhKNMVFR3sZDwqzOAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7321dfcaa5c06731302b038568cbdfa155d50d4d23a691c5202634ed5d567b4","last_reissued_at":"2026-05-18T03:16:27.423245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:16:27.423245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Social optimum in Social Groups with Give-and-Take criterion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.NI","authors_text":"Joy Kuri, Rahul Vaze, Saurabh Aggarwal","submitted_at":"2013-08-08T17:35:58Z","abstract_excerpt":"We consider a \"Social Group\" of networked nodes, seeking a \"universe\" of segments. Each node has subset of the universe, and access to an expensive resource for downloading data. Alternatively, nodes can also acquire the universe by exchanging segments among themselves, at low cost, using a local network interface. While local exchanges ensure minimum cost, \"free riders\" in the group can exploit the system. To prohibit free riding, we propose the \"Give-and-Take\" criterion, where exchange is allowed if each node has segments unavailable with the other. Under this criterion, we consider the prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.1911","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":"1308.1911","created_at":"2026-05-18T03:16:27.423309+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.1911v1","created_at":"2026-05-18T03:16:27.423309+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.1911","created_at":"2026-05-18T03:16:27.423309+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4ZB37FKLQDH","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4ZB37FKLQDHGEYC","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4ZB37FK","created_at":"2026-05-18T12:28:02.375192+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/U4ZB37FKLQDHGEYCWA4FNDF57I","json":"https://pith.science/pith/U4ZB37FKLQDHGEYCWA4FNDF57I.json","graph_json":"https://pith.science/api/pith-number/U4ZB37FKLQDHGEYCWA4FNDF57I/graph.json","events_json":"https://pith.science/api/pith-number/U4ZB37FKLQDHGEYCWA4FNDF57I/events.json","paper":"https://pith.science/paper/U4ZB37FK"},"agent_actions":{"view_html":"https://pith.science/pith/U4ZB37FKLQDHGEYCWA4FNDF57I","download_json":"https://pith.science/pith/U4ZB37FKLQDHGEYCWA4FNDF57I.json","view_paper":"https://pith.science/paper/U4ZB37FK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.1911&json=true","fetch_graph":"https://pith.science/api/pith-number/U4ZB37FKLQDHGEYCWA4FNDF57I/graph.json","fetch_events":"https://pith.science/api/pith-number/U4ZB37FKLQDHGEYCWA4FNDF57I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4ZB37FKLQDHGEYCWA4FNDF57I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4ZB37FKLQDHGEYCWA4FNDF57I/action/storage_attestation","attest_author":"https://pith.science/pith/U4ZB37FKLQDHGEYCWA4FNDF57I/action/author_attestation","sign_citation":"https://pith.science/pith/U4ZB37FKLQDHGEYCWA4FNDF57I/action/citation_signature","submit_replication":"https://pith.science/pith/U4ZB37FKLQDHGEYCWA4FNDF57I/action/replication_record"}},"created_at":"2026-05-18T03:16:27.423309+00:00","updated_at":"2026-05-18T03:16:27.423309+00:00"}