{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KPTSB2GSRPR7MZYBER6FO7QEUA","short_pith_number":"pith:KPTSB2GS","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"},"canonical_sha256":"53e720e8d28be3f66701247c577e04a0343db81640fb768f5f4e4ff184743d13","source":{"kind":"arxiv","id":"1303.2564","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2564","created_at":"2026-05-18T03:31:18Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2564v1","created_at":"2026-05-18T03:31:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2564","created_at":"2026-05-18T03:31:18Z"},{"alias_kind":"pith_short_12","alias_value":"KPTSB2GSRPR7","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KPTSB2GSRPR7MZYB","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KPTSB2GS","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KPTSB2GSRPR7MZYBER6FO7QEUA","target":"record","payload":{"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"},"canonical_sha256":"53e720e8d28be3f66701247c577e04a0343db81640fb768f5f4e4ff184743d13","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"},"source_kind":"arxiv","source_id":"1303.2564","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:31:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aRbjYItSNgXWusezOgX9BxjEhL482gS2NeH3XwyT7Ib0bV9O0GDkqkj+JNVFBNyIfUPk8wNc+fHr+DRSI0H8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:52:19.661311Z"},"content_sha256":"13f38d7d27f67324549afcdfc7887fb2aaf7612ad329cb5c5b11173e6b39d825","schema_version":"1.0","event_id":"sha256:13f38d7d27f67324549afcdfc7887fb2aaf7612ad329cb5c5b11173e6b39d825"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KPTSB2GSRPR7MZYBER6FO7QEUA","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:31:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XFyj0sZzw/abIHG2fuEiUrz6/BqiEmJlPWwZob4hep07PWlaCadTubjz42ClvFKAdceQEvzKJ2UPHrgVsr07BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:52:19.662030Z"},"content_sha256":"d866c6666dc24a16f0d9b8e0f24c538884b1587dc4925fc50ec896fe7f8485f3","schema_version":"1.0","event_id":"sha256:d866c6666dc24a16f0d9b8e0f24c538884b1587dc4925fc50ec896fe7f8485f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KPTSB2GSRPR7MZYBER6FO7QEUA/bundle.json","state_url":"https://pith.science/pith/KPTSB2GSRPR7MZYBER6FO7QEUA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KPTSB2GSRPR7MZYBER6FO7QEUA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T19:52:19Z","links":{"resolver":"https://pith.science/pith/KPTSB2GSRPR7MZYBER6FO7QEUA","bundle":"https://pith.science/pith/KPTSB2GSRPR7MZYBER6FO7QEUA/bundle.json","state":"https://pith.science/pith/KPTSB2GSRPR7MZYBER6FO7QEUA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KPTSB2GSRPR7MZYBER6FO7QEUA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KPTSB2GSRPR7MZYBER6FO7QEUA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a721f94abd4f7ce20b1020cf9f4213109e92957d07bda32952160956d884891b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-11T16:15:07Z","title_canon_sha256":"84896032a526608ce995d1aaaf972dcf88a5e6824ca95865028f50a39893d28a"},"schema_version":"1.0","source":{"id":"1303.2564","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.2564","created_at":"2026-05-18T03:31:18Z"},{"alias_kind":"arxiv_version","alias_value":"1303.2564v1","created_at":"2026-05-18T03:31:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.2564","created_at":"2026-05-18T03:31:18Z"},{"alias_kind":"pith_short_12","alias_value":"KPTSB2GSRPR7","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KPTSB2GSRPR7MZYB","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KPTSB2GS","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:d866c6666dc24a16f0d9b8e0f24c538884b1587dc4925fc50ec896fe7f8485f3","target":"graph","created_at":"2026-05-18T03:31:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Eugen Mandrescu, Vadim E. Levit","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-11T16:15:07Z","title":"On f-Symmetries of the Independence Polynomial"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2564","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:13f38d7d27f67324549afcdfc7887fb2aaf7612ad329cb5c5b11173e6b39d825","target":"record","created_at":"2026-05-18T03:31:18Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a721f94abd4f7ce20b1020cf9f4213109e92957d07bda32952160956d884891b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-03-11T16:15:07Z","title_canon_sha256":"84896032a526608ce995d1aaaf972dcf88a5e6824ca95865028f50a39893d28a"},"schema_version":"1.0","source":{"id":"1303.2564","kind":"arxiv","version":1}},"canonical_sha256":"53e720e8d28be3f66701247c577e04a0343db81640fb768f5f4e4ff184743d13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"53e720e8d28be3f66701247c577e04a0343db81640fb768f5f4e4ff184743d13","first_computed_at":"2026-05-18T03:31:18.621708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:18.621708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EDkLqjhBMja+bamGxHkgFhC8Au4pSQvZS+CLUr6u6TaKB2AYwaksdT6Q/BjiDFoAdYzMh4qRO02FpZasihwgCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:18.622350Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.2564","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13f38d7d27f67324549afcdfc7887fb2aaf7612ad329cb5c5b11173e6b39d825","sha256:d866c6666dc24a16f0d9b8e0f24c538884b1587dc4925fc50ec896fe7f8485f3"],"state_sha256":"4a70976cdad6f119f1cbbddf8cb2e0cde4e14b0e5bd5a4b5373571345a7ac7e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wbb46Io5WZlAboFN98iNnfp8MtrMfTSOam6HljBtKppc5isNY90bMKJBqD2F5MlV+4PddZHqdc4pNZvVLwVKBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:52:19.667120Z","bundle_sha256":"94f8397a3695c040e2f5dc9581300dc89916bfba332b67c972205fe3e02b6660"}}