{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LPKAVAR5FRFJCB6PJXNWMCSS3T","short_pith_number":"pith:LPKAVAR5","schema_version":"1.0","canonical_sha256":"5bd40a823d2c4a9107cf4ddb660a52dce5522750b03807dc10f9a8ba64fd2e52","source":{"kind":"arxiv","id":"1107.5726","version":2},"attestation_state":"computed","paper":{"title":"Kac's Theorem for equipped graphs and for maximal rank representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RT","authors_text":"William Crawley-Boevey","submitted_at":"2011-07-28T14:36:48Z","abstract_excerpt":"We give two generalizations of Kac's Theorem on representations of quivers. One is to representations of equipped graphs by relations, in the sense of Gelfand and Ponomarev. The other is to representations of quivers in which certain of the linear maps are required to have maximal rank."},"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":"1107.5726","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RT","submitted_at":"2011-07-28T14:36:48Z","cross_cats_sorted":[],"title_canon_sha256":"bcc3bf23ab6f3a1e8fac328caf57312c7b0599eab5f320cb9bbd8183d82a748e","abstract_canon_sha256":"968575932c46b2fdb4d85dd18367798c0143ade4c7b1d5e01495323c89d0bea9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:13:46.751396Z","signature_b64":"/ZyETfFUnsYJt7+FDUpw8b9WQcliwJxGTlgvg8o3ib+7Ryd+cgH2+snPLYhjf+G/GR5zS4mHsVv4SFKDbRLnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bd40a823d2c4a9107cf4ddb660a52dce5522750b03807dc10f9a8ba64fd2e52","last_reissued_at":"2026-05-18T04:13:46.750998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:13:46.750998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kac's Theorem for equipped graphs and for maximal rank representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RT","authors_text":"William Crawley-Boevey","submitted_at":"2011-07-28T14:36:48Z","abstract_excerpt":"We give two generalizations of Kac's Theorem on representations of quivers. One is to representations of equipped graphs by relations, in the sense of Gelfand and Ponomarev. The other is to representations of quivers in which certain of the linear maps are required to have maximal rank."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5726","kind":"arxiv","version":2},"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":"1107.5726","created_at":"2026-05-18T04:13:46.751061+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.5726v2","created_at":"2026-05-18T04:13:46.751061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5726","created_at":"2026-05-18T04:13:46.751061+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPKAVAR5FRFJ","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPKAVAR5FRFJCB6P","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPKAVAR5","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/LPKAVAR5FRFJCB6PJXNWMCSS3T","json":"https://pith.science/pith/LPKAVAR5FRFJCB6PJXNWMCSS3T.json","graph_json":"https://pith.science/api/pith-number/LPKAVAR5FRFJCB6PJXNWMCSS3T/graph.json","events_json":"https://pith.science/api/pith-number/LPKAVAR5FRFJCB6PJXNWMCSS3T/events.json","paper":"https://pith.science/paper/LPKAVAR5"},"agent_actions":{"view_html":"https://pith.science/pith/LPKAVAR5FRFJCB6PJXNWMCSS3T","download_json":"https://pith.science/pith/LPKAVAR5FRFJCB6PJXNWMCSS3T.json","view_paper":"https://pith.science/paper/LPKAVAR5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.5726&json=true","fetch_graph":"https://pith.science/api/pith-number/LPKAVAR5FRFJCB6PJXNWMCSS3T/graph.json","fetch_events":"https://pith.science/api/pith-number/LPKAVAR5FRFJCB6PJXNWMCSS3T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPKAVAR5FRFJCB6PJXNWMCSS3T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPKAVAR5FRFJCB6PJXNWMCSS3T/action/storage_attestation","attest_author":"https://pith.science/pith/LPKAVAR5FRFJCB6PJXNWMCSS3T/action/author_attestation","sign_citation":"https://pith.science/pith/LPKAVAR5FRFJCB6PJXNWMCSS3T/action/citation_signature","submit_replication":"https://pith.science/pith/LPKAVAR5FRFJCB6PJXNWMCSS3T/action/replication_record"}},"created_at":"2026-05-18T04:13:46.751061+00:00","updated_at":"2026-05-18T04:13:46.751061+00:00"}