{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:R6NZRD6U3HZF5QJO3MXLTIJVTU","short_pith_number":"pith:R6NZRD6U","schema_version":"1.0","canonical_sha256":"8f9b988fd4d9f25ec12edb2eb9a1359d031681d0701977b369eca96bc03d4dd4","source":{"kind":"arxiv","id":"1311.5927","version":1},"attestation_state":"computed","paper":{"title":"Small clique number graphs with three trivial critical ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"Carlos A. Alfaro, Carlos E. Valencia","submitted_at":"2013-11-22T23:03:40Z","abstract_excerpt":"The critical ideals of a graph are the determinantal ideals of the generalized Laplacian matrix associated to a graph. In this article we provide a set of minimal forbidden graphs for the set of graphs with at most three trivial critical ideals. Then we use these forbidden graphs to characterize the graphs with at most three trivial critical ideals and clique number equal to 2 and 3."},"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":"1311.5927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-22T23:03:40Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"acd2047eacb286dec129479c22940ef8e9cb0cede807b348611ed142536ecd2e","abstract_canon_sha256":"8ae3a840f46c6a29fc70d8f6ef4f5737392666803d2e3c86676ed1c64926a5eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:21.071641Z","signature_b64":"gr5Krz+WTmFlnam+wkIB5rmcVN3SlPKWKr9u+N2fSXkfZGBHuO1rzMfe2zTah61GK2ERP7YHmP0ha7L0aygHBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f9b988fd4d9f25ec12edb2eb9a1359d031681d0701977b369eca96bc03d4dd4","last_reissued_at":"2026-05-18T03:06:21.070907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:21.070907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Small clique number graphs with three trivial critical ideals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.CO","authors_text":"Carlos A. Alfaro, Carlos E. Valencia","submitted_at":"2013-11-22T23:03:40Z","abstract_excerpt":"The critical ideals of a graph are the determinantal ideals of the generalized Laplacian matrix associated to a graph. In this article we provide a set of minimal forbidden graphs for the set of graphs with at most three trivial critical ideals. Then we use these forbidden graphs to characterize the graphs with at most three trivial critical ideals and clique number equal to 2 and 3."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.5927","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":"1311.5927","created_at":"2026-05-18T03:06:21.071023+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.5927v1","created_at":"2026-05-18T03:06:21.071023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.5927","created_at":"2026-05-18T03:06:21.071023+00:00"},{"alias_kind":"pith_short_12","alias_value":"R6NZRD6U3HZF","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"R6NZRD6U3HZF5QJO","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"R6NZRD6U","created_at":"2026-05-18T12:27:57.521954+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/R6NZRD6U3HZF5QJO3MXLTIJVTU","json":"https://pith.science/pith/R6NZRD6U3HZF5QJO3MXLTIJVTU.json","graph_json":"https://pith.science/api/pith-number/R6NZRD6U3HZF5QJO3MXLTIJVTU/graph.json","events_json":"https://pith.science/api/pith-number/R6NZRD6U3HZF5QJO3MXLTIJVTU/events.json","paper":"https://pith.science/paper/R6NZRD6U"},"agent_actions":{"view_html":"https://pith.science/pith/R6NZRD6U3HZF5QJO3MXLTIJVTU","download_json":"https://pith.science/pith/R6NZRD6U3HZF5QJO3MXLTIJVTU.json","view_paper":"https://pith.science/paper/R6NZRD6U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.5927&json=true","fetch_graph":"https://pith.science/api/pith-number/R6NZRD6U3HZF5QJO3MXLTIJVTU/graph.json","fetch_events":"https://pith.science/api/pith-number/R6NZRD6U3HZF5QJO3MXLTIJVTU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R6NZRD6U3HZF5QJO3MXLTIJVTU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R6NZRD6U3HZF5QJO3MXLTIJVTU/action/storage_attestation","attest_author":"https://pith.science/pith/R6NZRD6U3HZF5QJO3MXLTIJVTU/action/author_attestation","sign_citation":"https://pith.science/pith/R6NZRD6U3HZF5QJO3MXLTIJVTU/action/citation_signature","submit_replication":"https://pith.science/pith/R6NZRD6U3HZF5QJO3MXLTIJVTU/action/replication_record"}},"created_at":"2026-05-18T03:06:21.071023+00:00","updated_at":"2026-05-18T03:06:21.071023+00:00"}