{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:63IK6JWRBEDDCGHS3G6OYROTFS","short_pith_number":"pith:63IK6JWR","schema_version":"1.0","canonical_sha256":"f6d0af26d109063118f2d9bcec45d32c8d99a233654824657326c26dbeb15a0a","source":{"kind":"arxiv","id":"1504.00576","version":1},"attestation_state":"computed","paper":{"title":"The Method of Constructing Models of Peer to Peer Protocols","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"A. V. Demidova, A. V. Korolkova, D. S. Kulyabov, L. A. Sevastyanov","submitted_at":"2015-04-02T14:48:07Z","abstract_excerpt":"The models of peer to peer protocols are presented with the help of one-step processes. On the basis of this presentation and the method of randomization of one-step processes described method for constructing models of peer to peer protocols. As specific implementations of proposed method the models of FastTrack and Bittorrent protocols are studied."},"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":"1504.00576","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.NI","submitted_at":"2015-04-02T14:48:07Z","cross_cats_sorted":[],"title_canon_sha256":"46251e4f047ca647c8ff99359ec673bb3dd8b9ef5f25107660a736dae87e4821","abstract_canon_sha256":"b00370becaa58c3e31658341aa96035694cab883cd8cc6832c0ecd4ca477d34b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:43.072958Z","signature_b64":"lZavI2/EZBvB1j45gMHIwbtkRoz0bZecwdPOo24t5y2Nahd/OX8sD0rs1T6Z0bpLALWk+QPEeHR7oI7lN4BDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6d0af26d109063118f2d9bcec45d32c8d99a233654824657326c26dbeb15a0a","last_reissued_at":"2026-05-18T02:19:43.072549Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:43.072549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Method of Constructing Models of Peer to Peer Protocols","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"A. V. Demidova, A. V. Korolkova, D. S. Kulyabov, L. A. Sevastyanov","submitted_at":"2015-04-02T14:48:07Z","abstract_excerpt":"The models of peer to peer protocols are presented with the help of one-step processes. On the basis of this presentation and the method of randomization of one-step processes described method for constructing models of peer to peer protocols. As specific implementations of proposed method the models of FastTrack and Bittorrent protocols are studied."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.00576","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":"1504.00576","created_at":"2026-05-18T02:19:43.072614+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.00576v1","created_at":"2026-05-18T02:19:43.072614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.00576","created_at":"2026-05-18T02:19:43.072614+00:00"},{"alias_kind":"pith_short_12","alias_value":"63IK6JWRBEDD","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"63IK6JWRBEDDCGHS","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"63IK6JWR","created_at":"2026-05-18T12:29:07.941421+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/63IK6JWRBEDDCGHS3G6OYROTFS","json":"https://pith.science/pith/63IK6JWRBEDDCGHS3G6OYROTFS.json","graph_json":"https://pith.science/api/pith-number/63IK6JWRBEDDCGHS3G6OYROTFS/graph.json","events_json":"https://pith.science/api/pith-number/63IK6JWRBEDDCGHS3G6OYROTFS/events.json","paper":"https://pith.science/paper/63IK6JWR"},"agent_actions":{"view_html":"https://pith.science/pith/63IK6JWRBEDDCGHS3G6OYROTFS","download_json":"https://pith.science/pith/63IK6JWRBEDDCGHS3G6OYROTFS.json","view_paper":"https://pith.science/paper/63IK6JWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.00576&json=true","fetch_graph":"https://pith.science/api/pith-number/63IK6JWRBEDDCGHS3G6OYROTFS/graph.json","fetch_events":"https://pith.science/api/pith-number/63IK6JWRBEDDCGHS3G6OYROTFS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/63IK6JWRBEDDCGHS3G6OYROTFS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/63IK6JWRBEDDCGHS3G6OYROTFS/action/storage_attestation","attest_author":"https://pith.science/pith/63IK6JWRBEDDCGHS3G6OYROTFS/action/author_attestation","sign_citation":"https://pith.science/pith/63IK6JWRBEDDCGHS3G6OYROTFS/action/citation_signature","submit_replication":"https://pith.science/pith/63IK6JWRBEDDCGHS3G6OYROTFS/action/replication_record"}},"created_at":"2026-05-18T02:19:43.072614+00:00","updated_at":"2026-05-18T02:19:43.072614+00:00"}