{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:V43PFFNM2EVU5QVHVDHXTCHZCL","short_pith_number":"pith:V43PFFNM","schema_version":"1.0","canonical_sha256":"af36f295acd12b4ec2a7a8cf7988f912ff672dd67c7cf216a2fa47fd746559de","source":{"kind":"arxiv","id":"0810.4666","version":2},"attestation_state":"computed","paper":{"title":"Computing inclusions of Schur modules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Steven V Sam","submitted_at":"2008-10-26T06:23:31Z","abstract_excerpt":"We describe a software package for constructing minimal free resolutions of GL_n(Q)-equivariant graded modules M over Q[x_1, ..., x_n] such that for all i, the ith syzygy module of M is generated in a single degree. We do so by describing some algorithms for manipulating polynomial representations of the general linear group GL_n(Q) following ideas of Olver and Eisenbud-Floystad-Weyman."},"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":"0810.4666","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2008-10-26T06:23:31Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"55b6e9cc3aa1e86d46ffcfcd8a022ea84cdca6c8fa45d07fb9a0fc8054278a30","abstract_canon_sha256":"733d854a47ff643ba938dbd60d492e534e0e1eba5737cd3141be14086cd4d6db"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:22.013896Z","signature_b64":"G+dhaerc5B5Z9SXgxhvryyh7xme0BRPfWReh8F4Ae5j00TJaMUYS74tN0PO+s0kg3hkXRNVZYTa3jVbs+1sdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af36f295acd12b4ec2a7a8cf7988f912ff672dd67c7cf216a2fa47fd746559de","last_reissued_at":"2026-05-18T01:37:22.013357Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:22.013357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing inclusions of Schur modules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Steven V Sam","submitted_at":"2008-10-26T06:23:31Z","abstract_excerpt":"We describe a software package for constructing minimal free resolutions of GL_n(Q)-equivariant graded modules M over Q[x_1, ..., x_n] such that for all i, the ith syzygy module of M is generated in a single degree. We do so by describing some algorithms for manipulating polynomial representations of the general linear group GL_n(Q) following ideas of Olver and Eisenbud-Floystad-Weyman."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0810.4666","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":"0810.4666","created_at":"2026-05-18T01:37:22.013440+00:00"},{"alias_kind":"arxiv_version","alias_value":"0810.4666v2","created_at":"2026-05-18T01:37:22.013440+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0810.4666","created_at":"2026-05-18T01:37:22.013440+00:00"},{"alias_kind":"pith_short_12","alias_value":"V43PFFNM2EVU","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_16","alias_value":"V43PFFNM2EVU5QVH","created_at":"2026-05-18T12:25:58.018023+00:00"},{"alias_kind":"pith_short_8","alias_value":"V43PFFNM","created_at":"2026-05-18T12:25:58.018023+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/V43PFFNM2EVU5QVHVDHXTCHZCL","json":"https://pith.science/pith/V43PFFNM2EVU5QVHVDHXTCHZCL.json","graph_json":"https://pith.science/api/pith-number/V43PFFNM2EVU5QVHVDHXTCHZCL/graph.json","events_json":"https://pith.science/api/pith-number/V43PFFNM2EVU5QVHVDHXTCHZCL/events.json","paper":"https://pith.science/paper/V43PFFNM"},"agent_actions":{"view_html":"https://pith.science/pith/V43PFFNM2EVU5QVHVDHXTCHZCL","download_json":"https://pith.science/pith/V43PFFNM2EVU5QVHVDHXTCHZCL.json","view_paper":"https://pith.science/paper/V43PFFNM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0810.4666&json=true","fetch_graph":"https://pith.science/api/pith-number/V43PFFNM2EVU5QVHVDHXTCHZCL/graph.json","fetch_events":"https://pith.science/api/pith-number/V43PFFNM2EVU5QVHVDHXTCHZCL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V43PFFNM2EVU5QVHVDHXTCHZCL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V43PFFNM2EVU5QVHVDHXTCHZCL/action/storage_attestation","attest_author":"https://pith.science/pith/V43PFFNM2EVU5QVHVDHXTCHZCL/action/author_attestation","sign_citation":"https://pith.science/pith/V43PFFNM2EVU5QVHVDHXTCHZCL/action/citation_signature","submit_replication":"https://pith.science/pith/V43PFFNM2EVU5QVHVDHXTCHZCL/action/replication_record"}},"created_at":"2026-05-18T01:37:22.013440+00:00","updated_at":"2026-05-18T01:37:22.013440+00:00"}