{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:HNJA7JORMM5CUSNBUF4Y5ABOVJ","short_pith_number":"pith:HNJA7JOR","schema_version":"1.0","canonical_sha256":"3b520fa5d1633a2a49a1a1798e802eaa762294f4cb4be8b4a2372ba218df1be4","source":{"kind":"arxiv","id":"1010.0145","version":1},"attestation_state":"computed","paper":{"title":"Multi-Agent Programming Contest 2010 - The Jason-DTU Team","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Andreas Schmidt Jensen, J{\\o}rgen Villadsen, Niklas Skamriis Boss, Steen Vester","submitted_at":"2010-10-01T12:37:26Z","abstract_excerpt":"We provide a brief description of the Jason-DTU system, including the methodology, the tools and the team strategy 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":"1010.0145","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2010-10-01T12:37:26Z","cross_cats_sorted":[],"title_canon_sha256":"4aeebdeede120d3ffee5ce2e24da1b391813f5611fe75eed837eeb942b419682","abstract_canon_sha256":"77bd82decc047f2c27e5a42fa8355f6580eaa995ca3b07bfba37dcfe8fdd812f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:00.196691Z","signature_b64":"sflxRwbar30j59jrM6OLuP/TptirJfPypaE5DwMNdzqauTKB+wdk42/jGZtYLFR38JUCyJwMt6T1T8RqMIIgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b520fa5d1633a2a49a1a1798e802eaa762294f4cb4be8b4a2372ba218df1be4","last_reissued_at":"2026-05-18T04:40:00.196259Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:00.196259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Agent Programming Contest 2010 - The Jason-DTU Team","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Andreas Schmidt Jensen, J{\\o}rgen Villadsen, Niklas Skamriis Boss, Steen Vester","submitted_at":"2010-10-01T12:37:26Z","abstract_excerpt":"We provide a brief description of the Jason-DTU system, including the methodology, the tools and the team strategy that we plan to use in the agent contest."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.0145","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":"1010.0145","created_at":"2026-05-18T04:40:00.196322+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.0145v1","created_at":"2026-05-18T04:40:00.196322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.0145","created_at":"2026-05-18T04:40:00.196322+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNJA7JORMM5C","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNJA7JORMM5CUSNB","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNJA7JOR","created_at":"2026-05-18T12:26:07.630475+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/HNJA7JORMM5CUSNBUF4Y5ABOVJ","json":"https://pith.science/pith/HNJA7JORMM5CUSNBUF4Y5ABOVJ.json","graph_json":"https://pith.science/api/pith-number/HNJA7JORMM5CUSNBUF4Y5ABOVJ/graph.json","events_json":"https://pith.science/api/pith-number/HNJA7JORMM5CUSNBUF4Y5ABOVJ/events.json","paper":"https://pith.science/paper/HNJA7JOR"},"agent_actions":{"view_html":"https://pith.science/pith/HNJA7JORMM5CUSNBUF4Y5ABOVJ","download_json":"https://pith.science/pith/HNJA7JORMM5CUSNBUF4Y5ABOVJ.json","view_paper":"https://pith.science/paper/HNJA7JOR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.0145&json=true","fetch_graph":"https://pith.science/api/pith-number/HNJA7JORMM5CUSNBUF4Y5ABOVJ/graph.json","fetch_events":"https://pith.science/api/pith-number/HNJA7JORMM5CUSNBUF4Y5ABOVJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNJA7JORMM5CUSNBUF4Y5ABOVJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNJA7JORMM5CUSNBUF4Y5ABOVJ/action/storage_attestation","attest_author":"https://pith.science/pith/HNJA7JORMM5CUSNBUF4Y5ABOVJ/action/author_attestation","sign_citation":"https://pith.science/pith/HNJA7JORMM5CUSNBUF4Y5ABOVJ/action/citation_signature","submit_replication":"https://pith.science/pith/HNJA7JORMM5CUSNBUF4Y5ABOVJ/action/replication_record"}},"created_at":"2026-05-18T04:40:00.196322+00:00","updated_at":"2026-05-18T04:40:00.196322+00:00"}