{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LUN66YRQKQJYWXMWLYZXFXKQVI","short_pith_number":"pith:LUN66YRQ","canonical_record":{"source":{"id":"1309.4020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-16T16:13:41Z","cross_cats_sorted":[],"title_canon_sha256":"a22cf52e6d357cf581256d78d32073c30d07754ddcdbc3e352da3c157ae7b802","abstract_canon_sha256":"a8162e33277a2f6769ec42835418f5cd012024dc46d9cf66075b0ec42a8bb431"},"schema_version":"1.0"},"canonical_sha256":"5d1bef623054138b5d965e3372dd50aa382b924bbe46685ee6bf50930b6b01d9","source":{"kind":"arxiv","id":"1309.4020","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4020","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4020v1","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4020","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"pith_short_12","alias_value":"LUN66YRQKQJY","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LUN66YRQKQJYWXMW","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LUN66YRQ","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LUN66YRQKQJYWXMWLYZXFXKQVI","target":"record","payload":{"canonical_record":{"source":{"id":"1309.4020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-16T16:13:41Z","cross_cats_sorted":[],"title_canon_sha256":"a22cf52e6d357cf581256d78d32073c30d07754ddcdbc3e352da3c157ae7b802","abstract_canon_sha256":"a8162e33277a2f6769ec42835418f5cd012024dc46d9cf66075b0ec42a8bb431"},"schema_version":"1.0"},"canonical_sha256":"5d1bef623054138b5d965e3372dd50aa382b924bbe46685ee6bf50930b6b01d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:11.476829Z","signature_b64":"9J2PN5StHfhLzyb2lu26WjVz0FOZmVQXHooU8je62kt2IKER/u2arAuUe6K5iZcwwImvzT94T/v/Z4Bl25JKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d1bef623054138b5d965e3372dd50aa382b924bbe46685ee6bf50930b6b01d9","last_reissued_at":"2026-05-18T03:13:11.476134Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:11.476134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.4020","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:13:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5MnkX+7wtNPJpcxTdUuyjufoH0Op+4HBYFec2eqLFAkYcOnpngasTH3jTUdxY6Y84KisY6XCDJGjKQBY5R2eDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:13:24.056607Z"},"content_sha256":"0ca365310899fdea4c31e8e8d2bc27035ea84d9ba2293f1ef0fc35d2a9f6ceb0","schema_version":"1.0","event_id":"sha256:0ca365310899fdea4c31e8e8d2bc27035ea84d9ba2293f1ef0fc35d2a9f6ceb0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LUN66YRQKQJYWXMWLYZXFXKQVI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recurrence Relations for Graph Polynomials on Bi-iterative Families of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Johann A. Makowsky, Tomer Kotek","submitted_at":"2013-09-16T16:13:41Z","abstract_excerpt":"We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear recurrence relations. We give explicit applications to the Tutte polynomial and the independence polynomial. Furthermore, we get that for any sequence $a_{n}$ satisfying a linear recurrence with constant coefficients, the sub-sequence corresponding to square indices $a_{n^{2}}$ and related sub-sequences satisfy recurrences with recurrent coefficients."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4020","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:13:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ARP3phFp/CGxNlZjeGayRCmsOlDOHCGNs6S7/+AXsEyNE8+NynOM1lTpi0NBHs5HXyZQTjnUmJuJ99YJQ7BDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T00:13:24.057235Z"},"content_sha256":"8ded856c15e882f9efae8094dfe40d06b1cc9dc63a8c5d47ba6f5752af7f12bf","schema_version":"1.0","event_id":"sha256:8ded856c15e882f9efae8094dfe40d06b1cc9dc63a8c5d47ba6f5752af7f12bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LUN66YRQKQJYWXMWLYZXFXKQVI/bundle.json","state_url":"https://pith.science/pith/LUN66YRQKQJYWXMWLYZXFXKQVI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LUN66YRQKQJYWXMWLYZXFXKQVI/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-06-12T00:13:24Z","links":{"resolver":"https://pith.science/pith/LUN66YRQKQJYWXMWLYZXFXKQVI","bundle":"https://pith.science/pith/LUN66YRQKQJYWXMWLYZXFXKQVI/bundle.json","state":"https://pith.science/pith/LUN66YRQKQJYWXMWLYZXFXKQVI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LUN66YRQKQJYWXMWLYZXFXKQVI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LUN66YRQKQJYWXMWLYZXFXKQVI","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":"a8162e33277a2f6769ec42835418f5cd012024dc46d9cf66075b0ec42a8bb431","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-16T16:13:41Z","title_canon_sha256":"a22cf52e6d357cf581256d78d32073c30d07754ddcdbc3e352da3c157ae7b802"},"schema_version":"1.0","source":{"id":"1309.4020","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4020","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4020v1","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4020","created_at":"2026-05-18T03:13:11Z"},{"alias_kind":"pith_short_12","alias_value":"LUN66YRQKQJY","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LUN66YRQKQJYWXMW","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LUN66YRQ","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:8ded856c15e882f9efae8094dfe40d06b1cc9dc63a8c5d47ba6f5752af7f12bf","target":"graph","created_at":"2026-05-18T03:13:11Z","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":"We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear recurrence relations. We give explicit applications to the Tutte polynomial and the independence polynomial. Furthermore, we get that for any sequence $a_{n}$ satisfying a linear recurrence with constant coefficients, the sub-sequence corresponding to square indices $a_{n^{2}}$ and related sub-sequences satisfy recurrences with recurrent coefficients.","authors_text":"Johann A. Makowsky, Tomer Kotek","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-16T16:13:41Z","title":"Recurrence Relations for Graph Polynomials on Bi-iterative Families of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4020","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:0ca365310899fdea4c31e8e8d2bc27035ea84d9ba2293f1ef0fc35d2a9f6ceb0","target":"record","created_at":"2026-05-18T03:13:11Z","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":"a8162e33277a2f6769ec42835418f5cd012024dc46d9cf66075b0ec42a8bb431","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-16T16:13:41Z","title_canon_sha256":"a22cf52e6d357cf581256d78d32073c30d07754ddcdbc3e352da3c157ae7b802"},"schema_version":"1.0","source":{"id":"1309.4020","kind":"arxiv","version":1}},"canonical_sha256":"5d1bef623054138b5d965e3372dd50aa382b924bbe46685ee6bf50930b6b01d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d1bef623054138b5d965e3372dd50aa382b924bbe46685ee6bf50930b6b01d9","first_computed_at":"2026-05-18T03:13:11.476134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:11.476134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9J2PN5StHfhLzyb2lu26WjVz0FOZmVQXHooU8je62kt2IKER/u2arAuUe6K5iZcwwImvzT94T/v/Z4Bl25JKCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:11.476829Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.4020","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ca365310899fdea4c31e8e8d2bc27035ea84d9ba2293f1ef0fc35d2a9f6ceb0","sha256:8ded856c15e882f9efae8094dfe40d06b1cc9dc63a8c5d47ba6f5752af7f12bf"],"state_sha256":"16dc555d0ea5c90a83cd3fd193c1dc5e123586833c4fd0b036245a4c8f4b4664"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T07i+3xR2noPclyQYi6UjL4ovV3eGAXeb5LXVXexXh58gHAbl6VYfTpFs+McVQjQy327tAb5fiFqGbjE6kLrAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T00:13:24.060986Z","bundle_sha256":"c95cb7b332ac668f6573961fda2eaf8638f9ebf7f7268d2f1ab1f5a5d1333275"}}