{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QAEM3YZ4JA5GVQ7WKOIPQJ5RAZ","short_pith_number":"pith:QAEM3YZ4","canonical_record":{"source":{"id":"1307.8425","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-31T18:59:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6bec5d80fe4917e3e5b7413c69e11ad5158c157df4fce674efc867ed69ce8b09","abstract_canon_sha256":"c5f36cb82d33eef663fda885428ae7d088e37cced9f66dbd7d74572922f3606f"},"schema_version":"1.0"},"canonical_sha256":"8008cde33c483a6ac3f65390f827b1064a4c400025849b8be5b53bb5335000b3","source":{"kind":"arxiv","id":"1307.8425","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8425","created_at":"2026-05-18T02:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8425v4","created_at":"2026-05-18T02:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8425","created_at":"2026-05-18T02:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"QAEM3YZ4JA5G","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QAEM3YZ4JA5GVQ7W","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QAEM3YZ4","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QAEM3YZ4JA5GVQ7WKOIPQJ5RAZ","target":"record","payload":{"canonical_record":{"source":{"id":"1307.8425","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-31T18:59:00Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6bec5d80fe4917e3e5b7413c69e11ad5158c157df4fce674efc867ed69ce8b09","abstract_canon_sha256":"c5f36cb82d33eef663fda885428ae7d088e37cced9f66dbd7d74572922f3606f"},"schema_version":"1.0"},"canonical_sha256":"8008cde33c483a6ac3f65390f827b1064a4c400025849b8be5b53bb5335000b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:42.253641Z","signature_b64":"/mzOL+61k8W9Dr1ApKrt5dY0r9fPm86gLqsbLOAhx3i79hJMJRsv4IO93EwNq8rTJxoz1JYEp+XBfkjM40nPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8008cde33c483a6ac3f65390f827b1064a4c400025849b8be5b53bb5335000b3","last_reissued_at":"2026-05-18T02:41:42.252966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:42.252966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.8425","source_version":4,"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-18T02:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E8qQjpY3NfF8JUBkYXrvkpF5P/a1ySaZfQ/S2uRakMZwo3gCaQEphug1k30OJ49PJvos9LckyYQcXqSyut5HDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:25:06.544706Z"},"content_sha256":"656b89bba8e7f39f72e304406c032f235977dba277de1a6c2f8acb380a5a91af","schema_version":"1.0","event_id":"sha256:656b89bba8e7f39f72e304406c032f235977dba277de1a6c2f8acb380a5a91af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QAEM3YZ4JA5GVQ7WKOIPQJ5RAZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subtraction-free complexity, cluster transformations, and spanning trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.CO","authors_text":"Dima Grigoriev, Gleb Koshevoy, Sergey Fomin","submitted_at":"2013-07-31T18:59:00Z","abstract_excerpt":"Subtraction-free computational complexity is the version of arithmetic circuit complexity that allows only three operations: addition, multiplication, and division.\n  We use cluster transformations to design efficient subtraction-free algorithms for computing Schur functions and their skew, double, and supersymmetric analogues, thereby generalizing earlier results by P. Koev.\n  We develop such algorithms for computing generating functions of spanning trees, both directed and undirected. A comparison to the lower bound due to M. Jerrum and M. Snir shows that in subtraction-free computations, \"d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8425","kind":"arxiv","version":4},"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-18T02:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zz+MPLS6ELb54nKy1hTyEAJIq/BEhHevrZG2JpNaSxEcB42asEI+scLWV2F/NrdGJPNefcanLgEmp8oRUYp0AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:25:06.545424Z"},"content_sha256":"2d4d9125a6cf733db0ccbc8803b8c6dc9299c7d4fd65c3209f00cf2eeeff76c1","schema_version":"1.0","event_id":"sha256:2d4d9125a6cf733db0ccbc8803b8c6dc9299c7d4fd65c3209f00cf2eeeff76c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QAEM3YZ4JA5GVQ7WKOIPQJ5RAZ/bundle.json","state_url":"https://pith.science/pith/QAEM3YZ4JA5GVQ7WKOIPQJ5RAZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QAEM3YZ4JA5GVQ7WKOIPQJ5RAZ/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-31T16:25:06Z","links":{"resolver":"https://pith.science/pith/QAEM3YZ4JA5GVQ7WKOIPQJ5RAZ","bundle":"https://pith.science/pith/QAEM3YZ4JA5GVQ7WKOIPQJ5RAZ/bundle.json","state":"https://pith.science/pith/QAEM3YZ4JA5GVQ7WKOIPQJ5RAZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QAEM3YZ4JA5GVQ7WKOIPQJ5RAZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QAEM3YZ4JA5GVQ7WKOIPQJ5RAZ","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":"c5f36cb82d33eef663fda885428ae7d088e37cced9f66dbd7d74572922f3606f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-31T18:59:00Z","title_canon_sha256":"6bec5d80fe4917e3e5b7413c69e11ad5158c157df4fce674efc867ed69ce8b09"},"schema_version":"1.0","source":{"id":"1307.8425","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.8425","created_at":"2026-05-18T02:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1307.8425v4","created_at":"2026-05-18T02:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.8425","created_at":"2026-05-18T02:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"QAEM3YZ4JA5G","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QAEM3YZ4JA5GVQ7W","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QAEM3YZ4","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:2d4d9125a6cf733db0ccbc8803b8c6dc9299c7d4fd65c3209f00cf2eeeff76c1","target":"graph","created_at":"2026-05-18T02:41:42Z","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":"Subtraction-free computational complexity is the version of arithmetic circuit complexity that allows only three operations: addition, multiplication, and division.\n  We use cluster transformations to design efficient subtraction-free algorithms for computing Schur functions and their skew, double, and supersymmetric analogues, thereby generalizing earlier results by P. Koev.\n  We develop such algorithms for computing generating functions of spanning trees, both directed and undirected. A comparison to the lower bound due to M. Jerrum and M. Snir shows that in subtraction-free computations, \"d","authors_text":"Dima Grigoriev, Gleb Koshevoy, Sergey Fomin","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-31T18:59:00Z","title":"Subtraction-free complexity, cluster transformations, and spanning trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.8425","kind":"arxiv","version":4},"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:656b89bba8e7f39f72e304406c032f235977dba277de1a6c2f8acb380a5a91af","target":"record","created_at":"2026-05-18T02:41:42Z","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":"c5f36cb82d33eef663fda885428ae7d088e37cced9f66dbd7d74572922f3606f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-31T18:59:00Z","title_canon_sha256":"6bec5d80fe4917e3e5b7413c69e11ad5158c157df4fce674efc867ed69ce8b09"},"schema_version":"1.0","source":{"id":"1307.8425","kind":"arxiv","version":4}},"canonical_sha256":"8008cde33c483a6ac3f65390f827b1064a4c400025849b8be5b53bb5335000b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8008cde33c483a6ac3f65390f827b1064a4c400025849b8be5b53bb5335000b3","first_computed_at":"2026-05-18T02:41:42.252966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:42.252966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/mzOL+61k8W9Dr1ApKrt5dY0r9fPm86gLqsbLOAhx3i79hJMJRsv4IO93EwNq8rTJxoz1JYEp+XBfkjM40nPBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:42.253641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.8425","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:656b89bba8e7f39f72e304406c032f235977dba277de1a6c2f8acb380a5a91af","sha256:2d4d9125a6cf733db0ccbc8803b8c6dc9299c7d4fd65c3209f00cf2eeeff76c1"],"state_sha256":"f77aed4e2599054e11af453396268072749316c4ee52ae807e7fd068d2c18ae2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NtP78Wfwga1KgHIXSVoTIv8TxbDVCE9tgGEWlRHq167zRhysR/PkBGCLL6Op/90i/TffPer8iYV7HbwMCgBODg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:25:06.549040Z","bundle_sha256":"5edd822c5a175d52b2a6b96b6ba83e6098f2b9c3d09f610b9fe5c6bbdf344284"}}