{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7VWSVEQPW52MKHCRTKK4WCCJ2L","short_pith_number":"pith:7VWSVEQP","schema_version":"1.0","canonical_sha256":"fd6d2a920fb774c51c519a95cb0849d2f40ed55cf6f739af57a2d66186c46ad5","source":{"kind":"arxiv","id":"1111.3515","version":1},"attestation_state":"computed","paper":{"title":"Automorphisms of trivalent graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Riccardo Piergallini, Silvia Benvenuti","submitted_at":"2011-11-15T12:21:14Z","abstract_excerpt":"Let $G_{g,b}$ be the set of all uni/trivalent graphs representing the combinatorial structures of pant decompositions of the oriented surface of genus $g$ with $b$ boundary components. We describe the set $A_{g,b}$ of all automorphisms of graphs in $G_{g,b}$ showing that, up to suitable moves changing the graph within $G_{g,b}$, any such automorphism can be reduced to elementary switches of adjacent edges."},"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":"1111.3515","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GT","submitted_at":"2011-11-15T12:21:14Z","cross_cats_sorted":[],"title_canon_sha256":"2f9b244f571cedd0a6e695fe309716cc312539cff5e2e244c9c1bf6b5d5a190d","abstract_canon_sha256":"8599c3f66d2c274c6eb655b615dbc987b440fa56d7244bef002b5ef797ed9f69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:13.995856Z","signature_b64":"weItyywJ1b5brLuqy0FRmH6u1B0X1rYSrNMIVPVCdfN1atig2NOX9HRkwQLJqzi4XBhvpRl18lM/HoOEF05lBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd6d2a920fb774c51c519a95cb0849d2f40ed55cf6f739af57a2d66186c46ad5","last_reissued_at":"2026-05-18T04:08:13.995419Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:13.995419Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automorphisms of trivalent graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GT","authors_text":"Riccardo Piergallini, Silvia Benvenuti","submitted_at":"2011-11-15T12:21:14Z","abstract_excerpt":"Let $G_{g,b}$ be the set of all uni/trivalent graphs representing the combinatorial structures of pant decompositions of the oriented surface of genus $g$ with $b$ boundary components. We describe the set $A_{g,b}$ of all automorphisms of graphs in $G_{g,b}$ showing that, up to suitable moves changing the graph within $G_{g,b}$, any such automorphism can be reduced to elementary switches of adjacent edges."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3515","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":"1111.3515","created_at":"2026-05-18T04:08:13.995500+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.3515v1","created_at":"2026-05-18T04:08:13.995500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3515","created_at":"2026-05-18T04:08:13.995500+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VWSVEQPW52M","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VWSVEQPW52MKHCR","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VWSVEQP","created_at":"2026-05-18T12:26:22.705136+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/7VWSVEQPW52MKHCRTKK4WCCJ2L","json":"https://pith.science/pith/7VWSVEQPW52MKHCRTKK4WCCJ2L.json","graph_json":"https://pith.science/api/pith-number/7VWSVEQPW52MKHCRTKK4WCCJ2L/graph.json","events_json":"https://pith.science/api/pith-number/7VWSVEQPW52MKHCRTKK4WCCJ2L/events.json","paper":"https://pith.science/paper/7VWSVEQP"},"agent_actions":{"view_html":"https://pith.science/pith/7VWSVEQPW52MKHCRTKK4WCCJ2L","download_json":"https://pith.science/pith/7VWSVEQPW52MKHCRTKK4WCCJ2L.json","view_paper":"https://pith.science/paper/7VWSVEQP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.3515&json=true","fetch_graph":"https://pith.science/api/pith-number/7VWSVEQPW52MKHCRTKK4WCCJ2L/graph.json","fetch_events":"https://pith.science/api/pith-number/7VWSVEQPW52MKHCRTKK4WCCJ2L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VWSVEQPW52MKHCRTKK4WCCJ2L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VWSVEQPW52MKHCRTKK4WCCJ2L/action/storage_attestation","attest_author":"https://pith.science/pith/7VWSVEQPW52MKHCRTKK4WCCJ2L/action/author_attestation","sign_citation":"https://pith.science/pith/7VWSVEQPW52MKHCRTKK4WCCJ2L/action/citation_signature","submit_replication":"https://pith.science/pith/7VWSVEQPW52MKHCRTKK4WCCJ2L/action/replication_record"}},"created_at":"2026-05-18T04:08:13.995500+00:00","updated_at":"2026-05-18T04:08:13.995500+00:00"}