{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NNOTJGV7AUYTJVLBGM5AKTLBHU","short_pith_number":"pith:NNOTJGV7","schema_version":"1.0","canonical_sha256":"6b5d349abf053134d561333a054d613d238550a89fab53f563cf13952c4b5704","source":{"kind":"arxiv","id":"1511.01372","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.01372","created_at":"2026-05-18T01:24:24.103892+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.01372v1","created_at":"2026-05-18T01:24:24.103892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01372","created_at":"2026-05-18T01:24:24.103892+00:00"},{"alias_kind":"pith_short_12","alias_value":"NNOTJGV7AUYT","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NNOTJGV7AUYTJVLB","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NNOTJGV7","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NNOTJGV7AUYTJVLBGM5AKTLBHU","json":"https://pith.science/pith/NNOTJGV7AUYTJVLBGM5AKTLBHU.json","graph_json":"https://pith.science/api/pith-number/NNOTJGV7AUYTJVLBGM5AKTLBHU/graph.json","events_json":"https://pith.science/api/pith-number/NNOTJGV7AUYTJVLBGM5AKTLBHU/events.json","paper":"https://pith.science/paper/NNOTJGV7"},"agent_actions":{"view_html":"https://pith.science/pith/NNOTJGV7AUYTJVLBGM5AKTLBHU","download_json":"https://pith.science/pith/NNOTJGV7AUYTJVLBGM5AKTLBHU.json","view_paper":"https://pith.science/paper/NNOTJGV7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.01372&json=true","fetch_graph":"https://pith.science/api/pith-number/NNOTJGV7AUYTJVLBGM5AKTLBHU/graph.json","fetch_events":"https://pith.science/api/pith-number/NNOTJGV7AUYTJVLBGM5AKTLBHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NNOTJGV7AUYTJVLBGM5AKTLBHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NNOTJGV7AUYTJVLBGM5AKTLBHU/action/storage_attestation","attest_author":"https://pith.science/pith/NNOTJGV7AUYTJVLBGM5AKTLBHU/action/author_attestation","sign_citation":"https://pith.science/pith/NNOTJGV7AUYTJVLBGM5AKTLBHU/action/citation_signature","submit_replication":"https://pith.science/pith/NNOTJGV7AUYTJVLBGM5AKTLBHU/action/replication_record"}},"created_at":"2026-05-18T01:24:24.103892+00:00","updated_at":"2026-05-18T01:24:24.103892+00:00"}