{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:KEQE7AYPN4OYO6LMOXLSOTNV2F","short_pith_number":"pith:KEQE7AYP","canonical_record":{"source":{"id":"2506.18788","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-23T15:58:12Z","cross_cats_sorted":[],"title_canon_sha256":"23619433c2f22094264a9ad7169880e30fa96313a5c038d74782deaa65d40430","abstract_canon_sha256":"a1f40d21254168a0fc45082a3688e3f6f6683037b20bdc4f2a30ebb6f80efb19"},"schema_version":"1.0"},"canonical_sha256":"51204f830f6f1d87796c75d7274db5d14e518f7051558e5c1a6b4deea7a6d0f4","source":{"kind":"arxiv","id":"2506.18788","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.18788","created_at":"2026-07-05T11:25:56Z"},{"alias_kind":"arxiv_version","alias_value":"2506.18788v1","created_at":"2026-07-05T11:25:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.18788","created_at":"2026-07-05T11:25:56Z"},{"alias_kind":"pith_short_12","alias_value":"KEQE7AYPN4OY","created_at":"2026-07-05T11:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"KEQE7AYPN4OYO6LM","created_at":"2026-07-05T11:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"KEQE7AYP","created_at":"2026-07-05T11:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:KEQE7AYPN4OYO6LMOXLSOTNV2F","target":"record","payload":{"canonical_record":{"source":{"id":"2506.18788","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-23T15:58:12Z","cross_cats_sorted":[],"title_canon_sha256":"23619433c2f22094264a9ad7169880e30fa96313a5c038d74782deaa65d40430","abstract_canon_sha256":"a1f40d21254168a0fc45082a3688e3f6f6683037b20bdc4f2a30ebb6f80efb19"},"schema_version":"1.0"},"canonical_sha256":"51204f830f6f1d87796c75d7274db5d14e518f7051558e5c1a6b4deea7a6d0f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:25:56.050426Z","signature_b64":"aOTN2NRBPV7dKHd4C5YuteJNlSIcIwbwMh2o6L3+lfv+4AnsQTcqaL7rtwkfrwurS5981b8IyBYfEpgnwrs9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51204f830f6f1d87796c75d7274db5d14e518f7051558e5c1a6b4deea7a6d0f4","last_reissued_at":"2026-07-05T11:25:56.049914Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:25:56.049914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.18788","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-07-05T11:25:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GB/Z5WEpYDwXVGcNvas3dVLFgctqiJ8EENSTctnxr5m1mMtYcVhlk3T9k6CU2T1yHJrAU9tRXGF7NB2Mu7SoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:23:52.137614Z"},"content_sha256":"b232561473ddba1f4a475373a24c0a73705234b2e09ccf6a180770bf22cecbe2","schema_version":"1.0","event_id":"sha256:b232561473ddba1f4a475373a24c0a73705234b2e09ccf6a180770bf22cecbe2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:KEQE7AYPN4OYO6LMOXLSOTNV2F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph theoretic properties of Speyer's matroid polynomial $g_M(t)$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Erik Panzer","submitted_at":"2025-06-23T15:58:12Z","abstract_excerpt":"We prove relations between the number of $k$-connected components of a graph, Crapo's invariant $\\beta(M)$ of a matroid, and Speyer's polynomial $g_M(t)$. These yield a simple interpretation of $g_M'(-1)$ when $M$ is graphic or cographic. Furthermore, we improve Ferroni's algorithm to compute $g_M(t)$ and provide an implementation and an extensive data set. These calculations reveal a large number of graph theoretic constraints on the second derivative $g_M''(-1)$, which we thus advertise as an intriguing new invariant of graphs. We also propose a relation between the flow polynomial and $g_M'"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.18788","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.18788/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:25:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ctb0eSyUcLZQ6sKvBTASax3kWlYUbrf4f1sCteh0b/hoIAGpf/XgQRr2QFG7GgycQg2uAI08Zx7iYH1arBMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:23:52.138148Z"},"content_sha256":"df3d63cc3fcccbce4e77591211662c444e031a92faba51832ec97d99146928cd","schema_version":"1.0","event_id":"sha256:df3d63cc3fcccbce4e77591211662c444e031a92faba51832ec97d99146928cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KEQE7AYPN4OYO6LMOXLSOTNV2F/bundle.json","state_url":"https://pith.science/pith/KEQE7AYPN4OYO6LMOXLSOTNV2F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KEQE7AYPN4OYO6LMOXLSOTNV2F/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-08-16T05:23:52Z","links":{"resolver":"https://pith.science/pith/KEQE7AYPN4OYO6LMOXLSOTNV2F","bundle":"https://pith.science/pith/KEQE7AYPN4OYO6LMOXLSOTNV2F/bundle.json","state":"https://pith.science/pith/KEQE7AYPN4OYO6LMOXLSOTNV2F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KEQE7AYPN4OYO6LMOXLSOTNV2F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:KEQE7AYPN4OYO6LMOXLSOTNV2F","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":"a1f40d21254168a0fc45082a3688e3f6f6683037b20bdc4f2a30ebb6f80efb19","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-23T15:58:12Z","title_canon_sha256":"23619433c2f22094264a9ad7169880e30fa96313a5c038d74782deaa65d40430"},"schema_version":"1.0","source":{"id":"2506.18788","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.18788","created_at":"2026-07-05T11:25:56Z"},{"alias_kind":"arxiv_version","alias_value":"2506.18788v1","created_at":"2026-07-05T11:25:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.18788","created_at":"2026-07-05T11:25:56Z"},{"alias_kind":"pith_short_12","alias_value":"KEQE7AYPN4OY","created_at":"2026-07-05T11:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"KEQE7AYPN4OYO6LM","created_at":"2026-07-05T11:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"KEQE7AYP","created_at":"2026-07-05T11:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:df3d63cc3fcccbce4e77591211662c444e031a92faba51832ec97d99146928cd","target":"graph","created_at":"2026-07-05T11:25:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2506.18788/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove relations between the number of $k$-connected components of a graph, Crapo's invariant $\\beta(M)$ of a matroid, and Speyer's polynomial $g_M(t)$. These yield a simple interpretation of $g_M'(-1)$ when $M$ is graphic or cographic. Furthermore, we improve Ferroni's algorithm to compute $g_M(t)$ and provide an implementation and an extensive data set. These calculations reveal a large number of graph theoretic constraints on the second derivative $g_M''(-1)$, which we thus advertise as an intriguing new invariant of graphs. We also propose a relation between the flow polynomial and $g_M'","authors_text":"Erik Panzer","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-23T15:58:12Z","title":"Graph theoretic properties of Speyer's matroid polynomial $g_M(t)$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.18788","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:b232561473ddba1f4a475373a24c0a73705234b2e09ccf6a180770bf22cecbe2","target":"record","created_at":"2026-07-05T11:25:56Z","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":"a1f40d21254168a0fc45082a3688e3f6f6683037b20bdc4f2a30ebb6f80efb19","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-06-23T15:58:12Z","title_canon_sha256":"23619433c2f22094264a9ad7169880e30fa96313a5c038d74782deaa65d40430"},"schema_version":"1.0","source":{"id":"2506.18788","kind":"arxiv","version":1}},"canonical_sha256":"51204f830f6f1d87796c75d7274db5d14e518f7051558e5c1a6b4deea7a6d0f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51204f830f6f1d87796c75d7274db5d14e518f7051558e5c1a6b4deea7a6d0f4","first_computed_at":"2026-07-05T11:25:56.049914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:25:56.049914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aOTN2NRBPV7dKHd4C5YuteJNlSIcIwbwMh2o6L3+lfv+4AnsQTcqaL7rtwkfrwurS5981b8IyBYfEpgnwrs9DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:25:56.050426Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.18788","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b232561473ddba1f4a475373a24c0a73705234b2e09ccf6a180770bf22cecbe2","sha256:df3d63cc3fcccbce4e77591211662c444e031a92faba51832ec97d99146928cd"],"state_sha256":"3c5594227eb94e2f981baefb2f59bfdba5491cdf8686fd6f906425fd7d3313a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O40nwL+fYafxH5s44t7Ck+UzUWmyHbkF1VcV7loSS1ztzsABsMAkWOP8/ROt7SfvYh7vTR542bCjT87z42aRDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T05:23:52.142894Z","bundle_sha256":"cc23c0be791d61a68cf0f2cd818cbd0ea1fcc8353ccc49b9d80015c3a74e5a15"}}