{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NNOTJGV7AUYTJVLBGM5AKTLBHU","short_pith_number":"pith:NNOTJGV7","canonical_record":{"source":{"id":"1511.01372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-04T15:34:50Z","cross_cats_sorted":[],"title_canon_sha256":"dd625d2920145f54bfae9d99d62dedbe70cc271345a1588f27a0070128657506","abstract_canon_sha256":"2e91fee81d0b23a262d744e6191815e26e2b4c8951add822aa8d4036f5a0cd58"},"schema_version":"1.0"},"canonical_sha256":"6b5d349abf053134d561333a054d613d238550a89fab53f563cf13952c4b5704","source":{"kind":"arxiv","id":"1511.01372","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01372","created_at":"2026-05-18T01:24:24Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01372v1","created_at":"2026-05-18T01:24:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01372","created_at":"2026-05-18T01:24:24Z"},{"alias_kind":"pith_short_12","alias_value":"NNOTJGV7AUYT","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NNOTJGV7AUYTJVLB","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NNOTJGV7","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NNOTJGV7AUYTJVLBGM5AKTLBHU","target":"record","payload":{"canonical_record":{"source":{"id":"1511.01372","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-04T15:34:50Z","cross_cats_sorted":[],"title_canon_sha256":"dd625d2920145f54bfae9d99d62dedbe70cc271345a1588f27a0070128657506","abstract_canon_sha256":"2e91fee81d0b23a262d744e6191815e26e2b4c8951add822aa8d4036f5a0cd58"},"schema_version":"1.0"},"canonical_sha256":"6b5d349abf053134d561333a054d613d238550a89fab53f563cf13952c4b5704","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:24.104499Z","signature_b64":"ykhDfI7ziQnXxRedRp+Wrj7ayppPQQz+4mDJIxYkfS6mxh/OLdCw6vHv5OUywJvu3FeZFwIDNT1o1VWg+QN2Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b5d349abf053134d561333a054d613d238550a89fab53f563cf13952c4b5704","last_reissued_at":"2026-05-18T01:24:24.103777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:24.103777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.01372","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-18T01:24:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RYA3JUlgih3L14BIw6fh8Jrx6cgY6243CMYa5OHL9TIB/VqXd0/63M0hLhqodwehc3JE7DSPgaEWUxrtobnwBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:19:18.493771Z"},"content_sha256":"4ff4a2506f365c12e1923bc36e8e9712efd9be0bb934d95a70eb7b12684a6a2f","schema_version":"1.0","event_id":"sha256:4ff4a2506f365c12e1923bc36e8e9712efd9be0bb934d95a70eb7b12684a6a2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NNOTJGV7AUYTJVLBGM5AKTLBHU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A counterexample to a result on the tree graph of a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ana Paulina Figueroa, Eduardo Rivera-Campo","submitted_at":"2015-11-04T15:34:50Z","abstract_excerpt":"Given a set of cycles C of a graph G, the tree graph of G defined by C is the graph T(G,C) whose vertices are the spanning trees of G and in which two trees R and S are adjacent if the union of R and S contains exactly one cycle and this cycle lies in C. Li et al [Discrete Math 271 (2003), 303--310] proved that if the graph T(G,C) is connected, then C cyclically spans the cycle space of G. Later, Yumei Hu [Proceedings of the 6th International Conference on Wireless Communications Networking and Mobile Computing (2010), 1--3] proved that if C is an arboreal family of cycles of G which cyclicall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01372","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-18T01:24:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E34FZNHDZ3n7UmghtT/0a09OPpPcl3B6m91GczIpM6EYc2vxPkfJRoTTChSUJwXewuPSLxEqGENUEJfXf2mhBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:19:18.494120Z"},"content_sha256":"8b29e20bc7bee3cb97ad558ac9d331d14554bcb290c0bca29f2c710c2e1d3d78","schema_version":"1.0","event_id":"sha256:8b29e20bc7bee3cb97ad558ac9d331d14554bcb290c0bca29f2c710c2e1d3d78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NNOTJGV7AUYTJVLBGM5AKTLBHU/bundle.json","state_url":"https://pith.science/pith/NNOTJGV7AUYTJVLBGM5AKTLBHU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NNOTJGV7AUYTJVLBGM5AKTLBHU/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-26T01:19:18Z","links":{"resolver":"https://pith.science/pith/NNOTJGV7AUYTJVLBGM5AKTLBHU","bundle":"https://pith.science/pith/NNOTJGV7AUYTJVLBGM5AKTLBHU/bundle.json","state":"https://pith.science/pith/NNOTJGV7AUYTJVLBGM5AKTLBHU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NNOTJGV7AUYTJVLBGM5AKTLBHU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NNOTJGV7AUYTJVLBGM5AKTLBHU","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":"2e91fee81d0b23a262d744e6191815e26e2b4c8951add822aa8d4036f5a0cd58","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-04T15:34:50Z","title_canon_sha256":"dd625d2920145f54bfae9d99d62dedbe70cc271345a1588f27a0070128657506"},"schema_version":"1.0","source":{"id":"1511.01372","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01372","created_at":"2026-05-18T01:24:24Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01372v1","created_at":"2026-05-18T01:24:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01372","created_at":"2026-05-18T01:24:24Z"},{"alias_kind":"pith_short_12","alias_value":"NNOTJGV7AUYT","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NNOTJGV7AUYTJVLB","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NNOTJGV7","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:8b29e20bc7bee3cb97ad558ac9d331d14554bcb290c0bca29f2c710c2e1d3d78","target":"graph","created_at":"2026-05-18T01:24:24Z","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":"Given a set of cycles C of a graph G, the tree graph of G defined by C is the graph T(G,C) whose vertices are the spanning trees of G and in which two trees R and S are adjacent if the union of R and S contains exactly one cycle and this cycle lies in C. Li et al [Discrete Math 271 (2003), 303--310] proved that if the graph T(G,C) is connected, then C cyclically spans the cycle space of G. Later, Yumei Hu [Proceedings of the 6th International Conference on Wireless Communications Networking and Mobile Computing (2010), 1--3] proved that if C is an arboreal family of cycles of G which cyclicall","authors_text":"Ana Paulina Figueroa, Eduardo Rivera-Campo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-04T15:34:50Z","title":"A counterexample to a result on the tree graph of a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01372","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:4ff4a2506f365c12e1923bc36e8e9712efd9be0bb934d95a70eb7b12684a6a2f","target":"record","created_at":"2026-05-18T01:24:24Z","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":"2e91fee81d0b23a262d744e6191815e26e2b4c8951add822aa8d4036f5a0cd58","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-11-04T15:34:50Z","title_canon_sha256":"dd625d2920145f54bfae9d99d62dedbe70cc271345a1588f27a0070128657506"},"schema_version":"1.0","source":{"id":"1511.01372","kind":"arxiv","version":1}},"canonical_sha256":"6b5d349abf053134d561333a054d613d238550a89fab53f563cf13952c4b5704","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b5d349abf053134d561333a054d613d238550a89fab53f563cf13952c4b5704","first_computed_at":"2026-05-18T01:24:24.103777Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:24:24.103777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ykhDfI7ziQnXxRedRp+Wrj7ayppPQQz+4mDJIxYkfS6mxh/OLdCw6vHv5OUywJvu3FeZFwIDNT1o1VWg+QN2Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:24:24.104499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01372","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ff4a2506f365c12e1923bc36e8e9712efd9be0bb934d95a70eb7b12684a6a2f","sha256:8b29e20bc7bee3cb97ad558ac9d331d14554bcb290c0bca29f2c710c2e1d3d78"],"state_sha256":"e2772b7a7ac37405f25f4faf6b5f1a3f784055a0d5f2c57ecc57218fc3d5c046"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wd9SD+LLcaL0m7dgct5MVqparTtX3Oxu1W9CziWgHqMb45OLoaCW9wjrB957y+sm+QNNCU89CUms7aAA4qZIAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T01:19:18.495987Z","bundle_sha256":"213ab553ea7930d7314460dfb4d57a2d97ee0da719279870926158a24b0da49e"}}