{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ZLKK23L4H2LL36DMIYSPNUSHNM","short_pith_number":"pith:ZLKK23L4","schema_version":"1.0","canonical_sha256":"cad4ad6d7c3e96bdf86c4624f6d2476b093a36f28f30b4241956d1906bf1ba50","source":{"kind":"arxiv","id":"1512.03927","version":1},"attestation_state":"computed","paper":{"title":"Game of collusions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"K. Kulakowski (AGH-Ust), K. Malarz","submitted_at":"2015-12-12T16:10:47Z","abstract_excerpt":"A new model of collusions in an organization is proposed. Each actor $a_{i=1,\\cdots,N}$ disposes one unique good $g_{j=1,\\cdots,N}$. Each actor $a_i$ has also a list of other goods which he/she needs, in order from desired most to those desired less. Finally, each actor $a_i$ has also a list of other agents, initially ordered at random. The order in the last list means the order of the access of the actors to the good $g_j$. A pair after a pair of agents tries to make a transaction. This transaction is possible if each of two actors can be shifted upwards in the list of actors possessed by the"},"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":"1512.03927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2015-12-12T16:10:47Z","cross_cats_sorted":[],"title_canon_sha256":"de1fae4b0520ab78933e70c90f27c234bfa339843626e8873d4e8920136dd926","abstract_canon_sha256":"25377f2324a8584e2d25a746fe88a61a19db5167dc5103d61eacf63bdf5fb8e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:55.111914Z","signature_b64":"79lZytLt77M6hiCXzV5k0yB/UfmUZZwK009vPo/x3iG8VE+IzZfQJkzvNbDweT5hyMO/1OjgiB79GwXpEmOPCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cad4ad6d7c3e96bdf86c4624f6d2476b093a36f28f30b4241956d1906bf1ba50","last_reissued_at":"2026-05-18T01:12:55.111569Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:55.111569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Game of collusions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"K. Kulakowski (AGH-Ust), K. Malarz","submitted_at":"2015-12-12T16:10:47Z","abstract_excerpt":"A new model of collusions in an organization is proposed. Each actor $a_{i=1,\\cdots,N}$ disposes one unique good $g_{j=1,\\cdots,N}$. Each actor $a_i$ has also a list of other goods which he/she needs, in order from desired most to those desired less. Finally, each actor $a_i$ has also a list of other agents, initially ordered at random. The order in the last list means the order of the access of the actors to the good $g_j$. A pair after a pair of agents tries to make a transaction. This transaction is possible if each of two actors can be shifted upwards in the list of actors possessed by the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03927","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":"1512.03927","created_at":"2026-05-18T01:12:55.111624+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.03927v1","created_at":"2026-05-18T01:12:55.111624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03927","created_at":"2026-05-18T01:12:55.111624+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZLKK23L4H2LL","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZLKK23L4H2LL36DM","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZLKK23L4","created_at":"2026-05-18T12:29:52.810259+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/ZLKK23L4H2LL36DMIYSPNUSHNM","json":"https://pith.science/pith/ZLKK23L4H2LL36DMIYSPNUSHNM.json","graph_json":"https://pith.science/api/pith-number/ZLKK23L4H2LL36DMIYSPNUSHNM/graph.json","events_json":"https://pith.science/api/pith-number/ZLKK23L4H2LL36DMIYSPNUSHNM/events.json","paper":"https://pith.science/paper/ZLKK23L4"},"agent_actions":{"view_html":"https://pith.science/pith/ZLKK23L4H2LL36DMIYSPNUSHNM","download_json":"https://pith.science/pith/ZLKK23L4H2LL36DMIYSPNUSHNM.json","view_paper":"https://pith.science/paper/ZLKK23L4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.03927&json=true","fetch_graph":"https://pith.science/api/pith-number/ZLKK23L4H2LL36DMIYSPNUSHNM/graph.json","fetch_events":"https://pith.science/api/pith-number/ZLKK23L4H2LL36DMIYSPNUSHNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZLKK23L4H2LL36DMIYSPNUSHNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZLKK23L4H2LL36DMIYSPNUSHNM/action/storage_attestation","attest_author":"https://pith.science/pith/ZLKK23L4H2LL36DMIYSPNUSHNM/action/author_attestation","sign_citation":"https://pith.science/pith/ZLKK23L4H2LL36DMIYSPNUSHNM/action/citation_signature","submit_replication":"https://pith.science/pith/ZLKK23L4H2LL36DMIYSPNUSHNM/action/replication_record"}},"created_at":"2026-05-18T01:12:55.111624+00:00","updated_at":"2026-05-18T01:12:55.111624+00:00"}