{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:RZSBE33XSEH3LH5N2Z6FH2KSYZ","short_pith_number":"pith:RZSBE33X","schema_version":"1.0","canonical_sha256":"8e64126f77910fb59fadd67c53e952c66cc0bbee615fff35e69c586e16b9e32d","source":{"kind":"arxiv","id":"1206.1300","version":1},"attestation_state":"computed","paper":{"title":"The Minor inequalities in the description of the Set Covering Polyhedron of Circulant Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Graciela L. Nasini, Paola B. Tolomei, Silvia M. Bianchi","submitted_at":"2012-06-06T19:02:38Z","abstract_excerpt":"In this work we give a complete description of the set covering polyhedron of circulant matrices $C^k_{sk}$ with $s = 2,3$ and $k\\geq 3 $ by linear inequalities. In particular, we prove that every non boolean facet defining inequality is associated with a circulant minor of the matrix. We also give a polynomial time separation algorithm for inequalities involved in the description."},"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":"1206.1300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-06-06T19:02:38Z","cross_cats_sorted":[],"title_canon_sha256":"eea286198aa89790bacc91a06468db40a3292853a36f06a080bde644e370c3cf","abstract_canon_sha256":"0b407348d2afe3fa072197261582c127c837c91739a894beb918bbec31cc8b7b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:06.505342Z","signature_b64":"KrVwQiunHHbVCYQpIpC87Xbe2KtkPrtY2XXQwjPZfPcKSdxdKg7u6oDa61iEP9m2WORGdnusYD+GyJxeNjlxCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e64126f77910fb59fadd67c53e952c66cc0bbee615fff35e69c586e16b9e32d","last_reissued_at":"2026-05-18T03:54:06.504725Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:06.504725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Minor inequalities in the description of the Set Covering Polyhedron of Circulant Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Graciela L. Nasini, Paola B. Tolomei, Silvia M. Bianchi","submitted_at":"2012-06-06T19:02:38Z","abstract_excerpt":"In this work we give a complete description of the set covering polyhedron of circulant matrices $C^k_{sk}$ with $s = 2,3$ and $k\\geq 3 $ by linear inequalities. In particular, we prove that every non boolean facet defining inequality is associated with a circulant minor of the matrix. We also give a polynomial time separation algorithm for inequalities involved in the description."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1300","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":"1206.1300","created_at":"2026-05-18T03:54:06.504844+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.1300v1","created_at":"2026-05-18T03:54:06.504844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1300","created_at":"2026-05-18T03:54:06.504844+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZSBE33XSEH3","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZSBE33XSEH3LH5N","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZSBE33X","created_at":"2026-05-18T12:27:20.899486+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/RZSBE33XSEH3LH5N2Z6FH2KSYZ","json":"https://pith.science/pith/RZSBE33XSEH3LH5N2Z6FH2KSYZ.json","graph_json":"https://pith.science/api/pith-number/RZSBE33XSEH3LH5N2Z6FH2KSYZ/graph.json","events_json":"https://pith.science/api/pith-number/RZSBE33XSEH3LH5N2Z6FH2KSYZ/events.json","paper":"https://pith.science/paper/RZSBE33X"},"agent_actions":{"view_html":"https://pith.science/pith/RZSBE33XSEH3LH5N2Z6FH2KSYZ","download_json":"https://pith.science/pith/RZSBE33XSEH3LH5N2Z6FH2KSYZ.json","view_paper":"https://pith.science/paper/RZSBE33X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.1300&json=true","fetch_graph":"https://pith.science/api/pith-number/RZSBE33XSEH3LH5N2Z6FH2KSYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/RZSBE33XSEH3LH5N2Z6FH2KSYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZSBE33XSEH3LH5N2Z6FH2KSYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZSBE33XSEH3LH5N2Z6FH2KSYZ/action/storage_attestation","attest_author":"https://pith.science/pith/RZSBE33XSEH3LH5N2Z6FH2KSYZ/action/author_attestation","sign_citation":"https://pith.science/pith/RZSBE33XSEH3LH5N2Z6FH2KSYZ/action/citation_signature","submit_replication":"https://pith.science/pith/RZSBE33XSEH3LH5N2Z6FH2KSYZ/action/replication_record"}},"created_at":"2026-05-18T03:54:06.504844+00:00","updated_at":"2026-05-18T03:54:06.504844+00:00"}