{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:3VAQONX3W2T5TIRJXKZ5NI3OLY","short_pith_number":"pith:3VAQONX3","schema_version":"1.0","canonical_sha256":"dd410736fbb6a7d9a229bab3d6a36e5e3518adb9eb8e34925a0421de263b0a33","source":{"kind":"arxiv","id":"1605.02956","version":1},"attestation_state":"computed","paper":{"title":"Projective dimension of (hyper)graphs and the Castelnuovo-Mumford regularity of bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"T\\\"urker B{\\i}y{\\i}ko\\u{g}lu, Yusuf Civan","submitted_at":"2016-05-10T11:46:44Z","abstract_excerpt":"We prove that the projective dimension of any (hyper)graph can be bounded from above by the (Castelnuovo-Mumford) regularity of its Levi graph (or incidence bipartite graph). This in particular brings the use of regularity's upper bounds on the calculation of projective dimension of (hyper)graphs. When G is just a (simple) graph, we prove that there exists an induced subgraph H of G such that prod-dim(G)=reg(S(H)), where S(H) is the subdivision graph of H. Moreover, we show that known upper bounds on prod-dim(G) involving domination parameters are in fact upper bounds to reg(S(G))."},"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":"1605.02956","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-10T11:46:44Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"f4c01799e69d87f82d9b7f44a4ab3128912b566ec8c414f171f02c95cd231866","abstract_canon_sha256":"e9980b1824be2b92d5b56234b74741ce3e0e0ce458ed4ecaf9cb1570b97154bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:08.085002Z","signature_b64":"7e5bpHDzGVNg43FLOQZqWYq4Our2W2kRh7IXIdHQVgwNvSJ4xZClVW7b8FHe6SJFahIiRjsoFyO5aP5kJtNdBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd410736fbb6a7d9a229bab3d6a36e5e3518adb9eb8e34925a0421de263b0a33","last_reissued_at":"2026-05-18T01:15:08.084129Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:08.084129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Projective dimension of (hyper)graphs and the Castelnuovo-Mumford regularity of bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"T\\\"urker B{\\i}y{\\i}ko\\u{g}lu, Yusuf Civan","submitted_at":"2016-05-10T11:46:44Z","abstract_excerpt":"We prove that the projective dimension of any (hyper)graph can be bounded from above by the (Castelnuovo-Mumford) regularity of its Levi graph (or incidence bipartite graph). This in particular brings the use of regularity's upper bounds on the calculation of projective dimension of (hyper)graphs. When G is just a (simple) graph, we prove that there exists an induced subgraph H of G such that prod-dim(G)=reg(S(H)), where S(H) is the subdivision graph of H. Moreover, we show that known upper bounds on prod-dim(G) involving domination parameters are in fact upper bounds to reg(S(G))."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02956","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":"1605.02956","created_at":"2026-05-18T01:15:08.084280+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.02956v1","created_at":"2026-05-18T01:15:08.084280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02956","created_at":"2026-05-18T01:15:08.084280+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VAQONX3W2T5","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VAQONX3W2T5TIRJ","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VAQONX3","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/3VAQONX3W2T5TIRJXKZ5NI3OLY","json":"https://pith.science/pith/3VAQONX3W2T5TIRJXKZ5NI3OLY.json","graph_json":"https://pith.science/api/pith-number/3VAQONX3W2T5TIRJXKZ5NI3OLY/graph.json","events_json":"https://pith.science/api/pith-number/3VAQONX3W2T5TIRJXKZ5NI3OLY/events.json","paper":"https://pith.science/paper/3VAQONX3"},"agent_actions":{"view_html":"https://pith.science/pith/3VAQONX3W2T5TIRJXKZ5NI3OLY","download_json":"https://pith.science/pith/3VAQONX3W2T5TIRJXKZ5NI3OLY.json","view_paper":"https://pith.science/paper/3VAQONX3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.02956&json=true","fetch_graph":"https://pith.science/api/pith-number/3VAQONX3W2T5TIRJXKZ5NI3OLY/graph.json","fetch_events":"https://pith.science/api/pith-number/3VAQONX3W2T5TIRJXKZ5NI3OLY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VAQONX3W2T5TIRJXKZ5NI3OLY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VAQONX3W2T5TIRJXKZ5NI3OLY/action/storage_attestation","attest_author":"https://pith.science/pith/3VAQONX3W2T5TIRJXKZ5NI3OLY/action/author_attestation","sign_citation":"https://pith.science/pith/3VAQONX3W2T5TIRJXKZ5NI3OLY/action/citation_signature","submit_replication":"https://pith.science/pith/3VAQONX3W2T5TIRJXKZ5NI3OLY/action/replication_record"}},"created_at":"2026-05-18T01:15:08.084280+00:00","updated_at":"2026-05-18T01:15:08.084280+00:00"}