{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:X2DFIIHSD2ZIWD5FYJ2SAVDLMY","short_pith_number":"pith:X2DFIIHS","schema_version":"1.0","canonical_sha256":"be865420f21eb28b0fa5c27520546b662695f9929e6e4c6c6bf97e3b67db1d47","source":{"kind":"arxiv","id":"1104.2412","version":2},"attestation_state":"computed","paper":{"title":"Stanley depth and complete $k$-partite hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Muhammad Imran Qureshi, Muhammad Ishaq","submitted_at":"2011-04-13T08:31:16Z","abstract_excerpt":"We give an upper bound for the Stanley depth of the edge ideal of a complete $k$-partite hypergraph and as an application we give an upper bound for the Stanley depth of a monomial ideal in a polynomial ring $S$. We also give a lower and an upper bound for the cyclic module $S/I$ associated to the complete $k$-partite hypergraph."},"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":"1104.2412","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2011-04-13T08:31:16Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f6423fcf0e2d61bf15e8ad55f039ce3c605b6c0686c17575938c2d0ce6c53d41","abstract_canon_sha256":"bc17251c366ff5776d9021ffb26d8c7c27f87c0f64e16b649558348412ba463b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:23.776005Z","signature_b64":"bfbf1nU7qUxGupgFhIWPm+LCJ67ql7V4TZyRu1hMPV4UmQnPDvOgXetGY9IxMV+WOo4cOkhhKjDxELbjYw1UDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be865420f21eb28b0fa5c27520546b662695f9929e6e4c6c6bf97e3b67db1d47","last_reissued_at":"2026-05-18T04:01:23.775518Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:23.775518Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stanley depth and complete $k$-partite hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Muhammad Imran Qureshi, Muhammad Ishaq","submitted_at":"2011-04-13T08:31:16Z","abstract_excerpt":"We give an upper bound for the Stanley depth of the edge ideal of a complete $k$-partite hypergraph and as an application we give an upper bound for the Stanley depth of a monomial ideal in a polynomial ring $S$. We also give a lower and an upper bound for the cyclic module $S/I$ associated to the complete $k$-partite hypergraph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2412","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":"1104.2412","created_at":"2026-05-18T04:01:23.775595+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.2412v2","created_at":"2026-05-18T04:01:23.775595+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2412","created_at":"2026-05-18T04:01:23.775595+00:00"},{"alias_kind":"pith_short_12","alias_value":"X2DFIIHSD2ZI","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"X2DFIIHSD2ZIWD5F","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"X2DFIIHS","created_at":"2026-05-18T12:26:44.992195+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/X2DFIIHSD2ZIWD5FYJ2SAVDLMY","json":"https://pith.science/pith/X2DFIIHSD2ZIWD5FYJ2SAVDLMY.json","graph_json":"https://pith.science/api/pith-number/X2DFIIHSD2ZIWD5FYJ2SAVDLMY/graph.json","events_json":"https://pith.science/api/pith-number/X2DFIIHSD2ZIWD5FYJ2SAVDLMY/events.json","paper":"https://pith.science/paper/X2DFIIHS"},"agent_actions":{"view_html":"https://pith.science/pith/X2DFIIHSD2ZIWD5FYJ2SAVDLMY","download_json":"https://pith.science/pith/X2DFIIHSD2ZIWD5FYJ2SAVDLMY.json","view_paper":"https://pith.science/paper/X2DFIIHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.2412&json=true","fetch_graph":"https://pith.science/api/pith-number/X2DFIIHSD2ZIWD5FYJ2SAVDLMY/graph.json","fetch_events":"https://pith.science/api/pith-number/X2DFIIHSD2ZIWD5FYJ2SAVDLMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X2DFIIHSD2ZIWD5FYJ2SAVDLMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X2DFIIHSD2ZIWD5FYJ2SAVDLMY/action/storage_attestation","attest_author":"https://pith.science/pith/X2DFIIHSD2ZIWD5FYJ2SAVDLMY/action/author_attestation","sign_citation":"https://pith.science/pith/X2DFIIHSD2ZIWD5FYJ2SAVDLMY/action/citation_signature","submit_replication":"https://pith.science/pith/X2DFIIHSD2ZIWD5FYJ2SAVDLMY/action/replication_record"}},"created_at":"2026-05-18T04:01:23.775595+00:00","updated_at":"2026-05-18T04:01:23.775595+00:00"}