{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ESO4S4ZTCYVA2BUHAE6XLFFOG7","short_pith_number":"pith:ESO4S4ZT","schema_version":"1.0","canonical_sha256":"249dc97333162a0d0687013d7594ae37c787e35e4cba26ad4b719c819816ee0d","source":{"kind":"arxiv","id":"1207.5215","version":2},"attestation_state":"computed","paper":{"title":"Density Functions subject to a Co-Matroid Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Natwar Modani, Sambuddha Roy, Sivaramakrishnan R. Natarajan, Venkatesan T. Chakaravarthy, Yogish Sabharwal","submitted_at":"2012-07-22T11:01:33Z","abstract_excerpt":"In this paper we consider the problem of finding the {\\em densest} subset subject to {\\em co-matroid constraints}. We are given a {\\em monotone supermodular} set function $f$ defined over a universe $U$, and the density of a subset $S$ is defined to be $f(S)/\\crd{S}$. This generalizes the concept of graph density. Co-matroid constraints are the following: given matroid $\\calM$ a set $S$ is feasible, iff the complement of $S$ is {\\em independent} in the matroid. Under such constraints, the problem becomes $\\np$-hard. The specific case of graph density has been considered in literature under spe"},"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":"1207.5215","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-07-22T11:01:33Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e1e402a532ec6ee833ea159d5952b29a7278576bf77b139236707cf37e9d47ae","abstract_canon_sha256":"8ee2e84070e368761faa1e56de37adcec732817796b2dd5470d354a0a7642914"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:57.694586Z","signature_b64":"TLbbopc3QAdPiHs55Fl/FKnxr9l9ZLNUKi7QHVhXacPjH+Ux/e65ZudiLavg7DVktqhS4gRZb5+FmgoqHUVVAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"249dc97333162a0d0687013d7594ae37c787e35e4cba26ad4b719c819816ee0d","last_reissued_at":"2026-05-18T03:49:57.693934Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:57.693934Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Density Functions subject to a Co-Matroid Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Natwar Modani, Sambuddha Roy, Sivaramakrishnan R. Natarajan, Venkatesan T. Chakaravarthy, Yogish Sabharwal","submitted_at":"2012-07-22T11:01:33Z","abstract_excerpt":"In this paper we consider the problem of finding the {\\em densest} subset subject to {\\em co-matroid constraints}. We are given a {\\em monotone supermodular} set function $f$ defined over a universe $U$, and the density of a subset $S$ is defined to be $f(S)/\\crd{S}$. This generalizes the concept of graph density. Co-matroid constraints are the following: given matroid $\\calM$ a set $S$ is feasible, iff the complement of $S$ is {\\em independent} in the matroid. Under such constraints, the problem becomes $\\np$-hard. The specific case of graph density has been considered in literature under spe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5215","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":"1207.5215","created_at":"2026-05-18T03:49:57.694028+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.5215v2","created_at":"2026-05-18T03:49:57.694028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5215","created_at":"2026-05-18T03:49:57.694028+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESO4S4ZTCYVA","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESO4S4ZTCYVA2BUH","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESO4S4ZT","created_at":"2026-05-18T12:27:04.183437+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/ESO4S4ZTCYVA2BUHAE6XLFFOG7","json":"https://pith.science/pith/ESO4S4ZTCYVA2BUHAE6XLFFOG7.json","graph_json":"https://pith.science/api/pith-number/ESO4S4ZTCYVA2BUHAE6XLFFOG7/graph.json","events_json":"https://pith.science/api/pith-number/ESO4S4ZTCYVA2BUHAE6XLFFOG7/events.json","paper":"https://pith.science/paper/ESO4S4ZT"},"agent_actions":{"view_html":"https://pith.science/pith/ESO4S4ZTCYVA2BUHAE6XLFFOG7","download_json":"https://pith.science/pith/ESO4S4ZTCYVA2BUHAE6XLFFOG7.json","view_paper":"https://pith.science/paper/ESO4S4ZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.5215&json=true","fetch_graph":"https://pith.science/api/pith-number/ESO4S4ZTCYVA2BUHAE6XLFFOG7/graph.json","fetch_events":"https://pith.science/api/pith-number/ESO4S4ZTCYVA2BUHAE6XLFFOG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESO4S4ZTCYVA2BUHAE6XLFFOG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESO4S4ZTCYVA2BUHAE6XLFFOG7/action/storage_attestation","attest_author":"https://pith.science/pith/ESO4S4ZTCYVA2BUHAE6XLFFOG7/action/author_attestation","sign_citation":"https://pith.science/pith/ESO4S4ZTCYVA2BUHAE6XLFFOG7/action/citation_signature","submit_replication":"https://pith.science/pith/ESO4S4ZTCYVA2BUHAE6XLFFOG7/action/replication_record"}},"created_at":"2026-05-18T03:49:57.694028+00:00","updated_at":"2026-05-18T03:49:57.694028+00:00"}