{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:C7P2FWLRLINURPBAKRFYIYX4CD","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":"ce80068bb52c4c31a4a3d853da1d5852fee462e58c45d873c505cd528b371971","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-09T09:16:31Z","title_canon_sha256":"53d73dbe200b771dc3e82871ab7dcee1d61023136097ac3f7914eaa00f0b3236"},"schema_version":"1.0","source":{"id":"1307.2376","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.2376","created_at":"2026-05-18T03:18:52Z"},{"alias_kind":"arxiv_version","alias_value":"1307.2376v1","created_at":"2026-05-18T03:18:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2376","created_at":"2026-05-18T03:18:52Z"},{"alias_kind":"pith_short_12","alias_value":"C7P2FWLRLINU","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"C7P2FWLRLINURPBA","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"C7P2FWLR","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:7d0b40262ccfe222b68ea06f967c0847e9331f29779e11edac9f8b4c1158a916","target":"graph","created_at":"2026-05-18T03:18:52Z","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":"For any graph $G$ of order $n$, the spanning tree packing number \\emph{$STP(G)$}, is the maximum number of edge-disjoint spanning trees contained in $G$. In this paper, we obtain some sharp lower bounds for the spanning tree numbers of Cartesian product graphs and Lexicographic product graphs.","authors_text":"Hengzhe Li, Jun Yue, Xueliang Li, Yaping Mao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-09T09:16:31Z","title":"Lower bounds for the spanning tree numbers of two graph products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2376","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:356f6ef27612feb65719dcee85084bba1f6fb56741e4be3471e99fa72df20f4c","target":"record","created_at":"2026-05-18T03:18:52Z","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":"ce80068bb52c4c31a4a3d853da1d5852fee462e58c45d873c505cd528b371971","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-09T09:16:31Z","title_canon_sha256":"53d73dbe200b771dc3e82871ab7dcee1d61023136097ac3f7914eaa00f0b3236"},"schema_version":"1.0","source":{"id":"1307.2376","kind":"arxiv","version":1}},"canonical_sha256":"17dfa2d9715a1b48bc20544b8462fc10ff7c3ff3b343c0143df4f2e71fa3f788","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17dfa2d9715a1b48bc20544b8462fc10ff7c3ff3b343c0143df4f2e71fa3f788","first_computed_at":"2026-05-18T03:18:52.704200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:52.704200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aHyLSFeBWhZvqxeUPh+ruLUlIJ4Dhdi0cs6tPi7nkMIDMNXxrp/PQ0xJ1peX6NSDN8ue/9MfRD4Hv4aOAs+nBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:52.704923Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.2376","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:356f6ef27612feb65719dcee85084bba1f6fb56741e4be3471e99fa72df20f4c","sha256:7d0b40262ccfe222b68ea06f967c0847e9331f29779e11edac9f8b4c1158a916"],"state_sha256":"fa8ae67c97365f1ea0b32a5735368e28fc1b9cf54b5e38db60321eb879f0e7a5"}