{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YZSUQRG623KR7RJWAJ3ZER6OEG","short_pith_number":"pith:YZSUQRG6","schema_version":"1.0","canonical_sha256":"c6654844ded6d51fc53602779247ce21b96e88c4ffce14582693a6cf19ac02f8","source":{"kind":"arxiv","id":"1807.05755","version":1},"attestation_state":"computed","paper":{"title":"2-dimensional vertex decomposable circulant graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Francesco Romeo, Giancarlo Rinaldo","submitted_at":"2018-07-16T09:33:49Z","abstract_excerpt":"Let $G$ be the circulant graph $C_n(S)$ with $S\\subseteq\\{ 1,\\ldots,\\left \\lfloor\\frac{n}{2}\\right \\rfloor\\}$ and let $\\Delta$ be its independence complex. We describe the well-covered circulant graphs with 2-dimensional $\\Delta$ and construct an infinite family of vertex-decomposable circulant graphs within this family."},"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":"1807.05755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2018-07-16T09:33:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"604ba6599b1133050aae5063588ac9f492c896487f2f2efb3d39c12593ed8b57","abstract_canon_sha256":"b2077d398046433c4eb4c9e5f9be7977c151b3e7ae34b5b541bb1060220272bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:42.629861Z","signature_b64":"/FWNIF0lL1m90HTbcFL9qUMipjLr5nUefR1ZM37emU7hS8/NnWINStW4m142/YVHEiIOHr/aVLWK1jWMWw/GDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6654844ded6d51fc53602779247ce21b96e88c4ffce14582693a6cf19ac02f8","last_reissued_at":"2026-05-18T00:10:42.629218Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:42.629218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"2-dimensional vertex decomposable circulant graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.AC","authors_text":"Francesco Romeo, Giancarlo Rinaldo","submitted_at":"2018-07-16T09:33:49Z","abstract_excerpt":"Let $G$ be the circulant graph $C_n(S)$ with $S\\subseteq\\{ 1,\\ldots,\\left \\lfloor\\frac{n}{2}\\right \\rfloor\\}$ and let $\\Delta$ be its independence complex. We describe the well-covered circulant graphs with 2-dimensional $\\Delta$ and construct an infinite family of vertex-decomposable circulant graphs within this family."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05755","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":"1807.05755","created_at":"2026-05-18T00:10:42.629329+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.05755v1","created_at":"2026-05-18T00:10:42.629329+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05755","created_at":"2026-05-18T00:10:42.629329+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZSUQRG623KR","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZSUQRG623KR7RJW","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZSUQRG6","created_at":"2026-05-18T12:33:04.347982+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/YZSUQRG623KR7RJWAJ3ZER6OEG","json":"https://pith.science/pith/YZSUQRG623KR7RJWAJ3ZER6OEG.json","graph_json":"https://pith.science/api/pith-number/YZSUQRG623KR7RJWAJ3ZER6OEG/graph.json","events_json":"https://pith.science/api/pith-number/YZSUQRG623KR7RJWAJ3ZER6OEG/events.json","paper":"https://pith.science/paper/YZSUQRG6"},"agent_actions":{"view_html":"https://pith.science/pith/YZSUQRG623KR7RJWAJ3ZER6OEG","download_json":"https://pith.science/pith/YZSUQRG623KR7RJWAJ3ZER6OEG.json","view_paper":"https://pith.science/paper/YZSUQRG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.05755&json=true","fetch_graph":"https://pith.science/api/pith-number/YZSUQRG623KR7RJWAJ3ZER6OEG/graph.json","fetch_events":"https://pith.science/api/pith-number/YZSUQRG623KR7RJWAJ3ZER6OEG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZSUQRG623KR7RJWAJ3ZER6OEG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZSUQRG623KR7RJWAJ3ZER6OEG/action/storage_attestation","attest_author":"https://pith.science/pith/YZSUQRG623KR7RJWAJ3ZER6OEG/action/author_attestation","sign_citation":"https://pith.science/pith/YZSUQRG623KR7RJWAJ3ZER6OEG/action/citation_signature","submit_replication":"https://pith.science/pith/YZSUQRG623KR7RJWAJ3ZER6OEG/action/replication_record"}},"created_at":"2026-05-18T00:10:42.629329+00:00","updated_at":"2026-05-18T00:10:42.629329+00:00"}