{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LTZV45H7O2KPAPM3M36LPBUR5K","short_pith_number":"pith:LTZV45H7","schema_version":"1.0","canonical_sha256":"5cf35e74ff7694f03d9b66fcb78691eaacc223378ec88d805bf4c156e0827777","source":{"kind":"arxiv","id":"1110.0105","version":1},"attestation_state":"computed","paper":{"title":"Multi-Agent Programming Contest 2011 - The Python-DTU Team","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"J{\\o}rgen Villadsen, Mikko Berggren Ettienne, Steen Vester","submitted_at":"2011-10-01T15:03:52Z","abstract_excerpt":"We provide a brief description of the Python-DTU system, including the overall design, the tools and the algorithms that we plan to use in the agent contest."},"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":"1110.0105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2011-10-01T15:03:52Z","cross_cats_sorted":[],"title_canon_sha256":"de67da168b024e4a36f8ee68fec73f8f4d9c1f85e0e5ed820e3870c7b3648889","abstract_canon_sha256":"3a229956a07df7edbf7c9d8deb2f796a3155df5ba4e25aa03d8b0cf571399134"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:50.759969Z","signature_b64":"M2GI6CEZvKWUybcb8hatJRrZ/pnkrQ9WguTs6o4I76ab7ISEl/8NSZspUH6AgkTlQIxmWrGwB9SYQ5Lys46jDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cf35e74ff7694f03d9b66fcb78691eaacc223378ec88d805bf4c156e0827777","last_reissued_at":"2026-05-18T04:11:50.759199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:50.759199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Agent Programming Contest 2011 - The Python-DTU Team","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"J{\\o}rgen Villadsen, Mikko Berggren Ettienne, Steen Vester","submitted_at":"2011-10-01T15:03:52Z","abstract_excerpt":"We provide a brief description of the Python-DTU system, including the overall design, the tools and the algorithms that we plan to use in the agent contest."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0105","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":"1110.0105","created_at":"2026-05-18T04:11:50.759335+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.0105v1","created_at":"2026-05-18T04:11:50.759335+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0105","created_at":"2026-05-18T04:11:50.759335+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTZV45H7O2KP","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTZV45H7O2KPAPM3","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTZV45H7","created_at":"2026-05-18T12:26:34.985390+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/LTZV45H7O2KPAPM3M36LPBUR5K","json":"https://pith.science/pith/LTZV45H7O2KPAPM3M36LPBUR5K.json","graph_json":"https://pith.science/api/pith-number/LTZV45H7O2KPAPM3M36LPBUR5K/graph.json","events_json":"https://pith.science/api/pith-number/LTZV45H7O2KPAPM3M36LPBUR5K/events.json","paper":"https://pith.science/paper/LTZV45H7"},"agent_actions":{"view_html":"https://pith.science/pith/LTZV45H7O2KPAPM3M36LPBUR5K","download_json":"https://pith.science/pith/LTZV45H7O2KPAPM3M36LPBUR5K.json","view_paper":"https://pith.science/paper/LTZV45H7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.0105&json=true","fetch_graph":"https://pith.science/api/pith-number/LTZV45H7O2KPAPM3M36LPBUR5K/graph.json","fetch_events":"https://pith.science/api/pith-number/LTZV45H7O2KPAPM3M36LPBUR5K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTZV45H7O2KPAPM3M36LPBUR5K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTZV45H7O2KPAPM3M36LPBUR5K/action/storage_attestation","attest_author":"https://pith.science/pith/LTZV45H7O2KPAPM3M36LPBUR5K/action/author_attestation","sign_citation":"https://pith.science/pith/LTZV45H7O2KPAPM3M36LPBUR5K/action/citation_signature","submit_replication":"https://pith.science/pith/LTZV45H7O2KPAPM3M36LPBUR5K/action/replication_record"}},"created_at":"2026-05-18T04:11:50.759335+00:00","updated_at":"2026-05-18T04:11:50.759335+00:00"}