{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4XUJBF4EVED4D7KVXR4NNFK6RY","short_pith_number":"pith:4XUJBF4E","schema_version":"1.0","canonical_sha256":"e5e8909784a907c1fd55bc78d6955e8e1deee5fb308ead094930d935eb3923f7","source":{"kind":"arxiv","id":"1603.01331","version":1},"attestation_state":"computed","paper":{"title":"Hypergraphs with high projective dimension and 1-dimensional Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Kuei-Nuan Lin, Paolo Mantero","submitted_at":"2016-03-04T02:07:50Z","abstract_excerpt":"We prove a sufficient and a necessary condition for a square-free monomial ideal $J$ associated to a (dual) hypergraph to have projective dimension equal to the minimal number of generators of $J$ minus 2. We also provide an effective explicit procedure to compute the projective dimension of 1-dimensional hypergraphs $\\mathcal{H}$ when each connected component contains at most one cycle. An algorithm to compute the projective dimension is also included. Applications of these results are given; they include, for instance, computing the projective dimension of monomial ideals whose associated hy"},"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":"1603.01331","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2016-03-04T02:07:50Z","cross_cats_sorted":[],"title_canon_sha256":"c4fb5efb57a9f2739832b9a4612c53a4c7cd4217d5fd2311695926cf4ac74832","abstract_canon_sha256":"1c1e0ad0a6bc45dcd9af5cfd704e3f619c8be6bf5316c8c91c54f5c16d9b3253"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:37.910873Z","signature_b64":"pGUJkywQ732ebGe6KHBAbq/ftXi2CQOF54dN1hInD1JG4QCZQP8yjzknz1zuOlp7oArCaftaPIOPuA9M2CQlDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5e8909784a907c1fd55bc78d6955e8e1deee5fb308ead094930d935eb3923f7","last_reissued_at":"2026-05-18T01:19:37.910194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:37.910194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hypergraphs with high projective dimension and 1-dimensional Hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.AC","authors_text":"Kuei-Nuan Lin, Paolo Mantero","submitted_at":"2016-03-04T02:07:50Z","abstract_excerpt":"We prove a sufficient and a necessary condition for a square-free monomial ideal $J$ associated to a (dual) hypergraph to have projective dimension equal to the minimal number of generators of $J$ minus 2. We also provide an effective explicit procedure to compute the projective dimension of 1-dimensional hypergraphs $\\mathcal{H}$ when each connected component contains at most one cycle. An algorithm to compute the projective dimension is also included. Applications of these results are given; they include, for instance, computing the projective dimension of monomial ideals whose associated hy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01331","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":"1603.01331","created_at":"2026-05-18T01:19:37.910291+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.01331v1","created_at":"2026-05-18T01:19:37.910291+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01331","created_at":"2026-05-18T01:19:37.910291+00:00"},{"alias_kind":"pith_short_12","alias_value":"4XUJBF4EVED4","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4XUJBF4EVED4D7KV","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4XUJBF4E","created_at":"2026-05-18T12:29:58.707656+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/4XUJBF4EVED4D7KVXR4NNFK6RY","json":"https://pith.science/pith/4XUJBF4EVED4D7KVXR4NNFK6RY.json","graph_json":"https://pith.science/api/pith-number/4XUJBF4EVED4D7KVXR4NNFK6RY/graph.json","events_json":"https://pith.science/api/pith-number/4XUJBF4EVED4D7KVXR4NNFK6RY/events.json","paper":"https://pith.science/paper/4XUJBF4E"},"agent_actions":{"view_html":"https://pith.science/pith/4XUJBF4EVED4D7KVXR4NNFK6RY","download_json":"https://pith.science/pith/4XUJBF4EVED4D7KVXR4NNFK6RY.json","view_paper":"https://pith.science/paper/4XUJBF4E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.01331&json=true","fetch_graph":"https://pith.science/api/pith-number/4XUJBF4EVED4D7KVXR4NNFK6RY/graph.json","fetch_events":"https://pith.science/api/pith-number/4XUJBF4EVED4D7KVXR4NNFK6RY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4XUJBF4EVED4D7KVXR4NNFK6RY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4XUJBF4EVED4D7KVXR4NNFK6RY/action/storage_attestation","attest_author":"https://pith.science/pith/4XUJBF4EVED4D7KVXR4NNFK6RY/action/author_attestation","sign_citation":"https://pith.science/pith/4XUJBF4EVED4D7KVXR4NNFK6RY/action/citation_signature","submit_replication":"https://pith.science/pith/4XUJBF4EVED4D7KVXR4NNFK6RY/action/replication_record"}},"created_at":"2026-05-18T01:19:37.910291+00:00","updated_at":"2026-05-18T01:19:37.910291+00:00"}