{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:KPTSB2GSRPR7MZYBER6FO7QEUA","short_pith_number":"pith:KPTSB2GS","schema_version":"1.0","canonical_sha256":"53e720e8d28be3f66701247c577e04a0343db81640fb768f5f4e4ff184743d13","source":{"kind":"arxiv","id":"1303.2564","version":1},"attestation_state":"computed","paper":{"title":"On f-Symmetries of the Independence Polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Eugen Mandrescu, Vadim E. Levit","submitted_at":"2013-03-11T16:15:07Z","abstract_excerpt":"An independent set in a graph is a set of pairwise non-adjacent vertices, and a(G) is the size of a maximum independent set in the graph G. If s_{k} is the number of independent sets of cardinality k in G, then I(G;x)=s_0+s_1*x+s_2*x^2+...+s_a*x^a,a=a(G), is called the independence polynomial of G (I. Gutman and F. Harary, 1983). If s_{a-i}=f(i)*s_{i} holds for every i, then I(G;x) is called f-symmetric (f-palindromic). If f(i)=1, then I(G;x) is symmetric (palindromic). The corona of the graphs G and H is the graph G*H obtained by joining each vertex of G to all the vertices of a copy of H. In"},"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":"1303.2564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-11T16:15:07Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"84896032a526608ce995d1aaaf972dcf88a5e6824ca95865028f50a39893d28a","abstract_canon_sha256":"a721f94abd4f7ce20b1020cf9f4213109e92957d07bda32952160956d884891b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:18.622350Z","signature_b64":"EDkLqjhBMja+bamGxHkgFhC8Au4pSQvZS+CLUr6u6TaKB2AYwaksdT6Q/BjiDFoAdYzMh4qRO02FpZasihwgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53e720e8d28be3f66701247c577e04a0343db81640fb768f5f4e4ff184743d13","last_reissued_at":"2026-05-18T03:31:18.621708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:18.621708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On f-Symmetries of the Independence Polynomial","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Eugen Mandrescu, Vadim E. Levit","submitted_at":"2013-03-11T16:15:07Z","abstract_excerpt":"An independent set in a graph is a set of pairwise non-adjacent vertices, and a(G) is the size of a maximum independent set in the graph G. If s_{k} is the number of independent sets of cardinality k in G, then I(G;x)=s_0+s_1*x+s_2*x^2+...+s_a*x^a,a=a(G), is called the independence polynomial of G (I. Gutman and F. Harary, 1983). If s_{a-i}=f(i)*s_{i} holds for every i, then I(G;x) is called f-symmetric (f-palindromic). If f(i)=1, then I(G;x) is symmetric (palindromic). The corona of the graphs G and H is the graph G*H obtained by joining each vertex of G to all the vertices of a copy of H. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2564","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":"1303.2564","created_at":"2026-05-18T03:31:18.621795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.2564v1","created_at":"2026-05-18T03:31:18.621795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2564","created_at":"2026-05-18T03:31:18.621795+00:00"},{"alias_kind":"pith_short_12","alias_value":"KPTSB2GSRPR7","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"KPTSB2GSRPR7MZYB","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"KPTSB2GS","created_at":"2026-05-18T12:27:51.066281+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/KPTSB2GSRPR7MZYBER6FO7QEUA","json":"https://pith.science/pith/KPTSB2GSRPR7MZYBER6FO7QEUA.json","graph_json":"https://pith.science/api/pith-number/KPTSB2GSRPR7MZYBER6FO7QEUA/graph.json","events_json":"https://pith.science/api/pith-number/KPTSB2GSRPR7MZYBER6FO7QEUA/events.json","paper":"https://pith.science/paper/KPTSB2GS"},"agent_actions":{"view_html":"https://pith.science/pith/KPTSB2GSRPR7MZYBER6FO7QEUA","download_json":"https://pith.science/pith/KPTSB2GSRPR7MZYBER6FO7QEUA.json","view_paper":"https://pith.science/paper/KPTSB2GS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.2564&json=true","fetch_graph":"https://pith.science/api/pith-number/KPTSB2GSRPR7MZYBER6FO7QEUA/graph.json","fetch_events":"https://pith.science/api/pith-number/KPTSB2GSRPR7MZYBER6FO7QEUA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KPTSB2GSRPR7MZYBER6FO7QEUA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KPTSB2GSRPR7MZYBER6FO7QEUA/action/storage_attestation","attest_author":"https://pith.science/pith/KPTSB2GSRPR7MZYBER6FO7QEUA/action/author_attestation","sign_citation":"https://pith.science/pith/KPTSB2GSRPR7MZYBER6FO7QEUA/action/citation_signature","submit_replication":"https://pith.science/pith/KPTSB2GSRPR7MZYBER6FO7QEUA/action/replication_record"}},"created_at":"2026-05-18T03:31:18.621795+00:00","updated_at":"2026-05-18T03:31:18.621795+00:00"}