{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GGQP6JWCKVJMBINMOO3UGGRKQU","short_pith_number":"pith:GGQP6JWC","schema_version":"1.0","canonical_sha256":"31a0ff26c25552c0a1ac73b7431a2a850dda86f8105eb215b9a78c14a70c40c0","source":{"kind":"arxiv","id":"1309.1290","version":3},"attestation_state":"computed","paper":{"title":"Logspace computations in graph products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jonathan Kausch, Volker Diekert","submitted_at":"2013-09-05T09:30:51Z","abstract_excerpt":"We consider three important and well-studied algorithmic problems in group theory: the word, geodesic, and conjugacy problem. We show transfer results from individual groups to graph products. We concentrate on logspace complexity because the challenge is actually in small complexity classes, only. The most difficult transfer result is for the conjugacy problem. We have a general result for graph products, but even in the special case of a graph group the result is new. Graph groups are closely linked to the theory of Mazurkiewicz traces which form an algebraic model for concurrent processes. "},"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":"1309.1290","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-09-05T09:30:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1aa91591dc1922dbbbac884fea4ab5b725f1fd05fc860bdb80ae179b8c9b2a9c","abstract_canon_sha256":"72f2a3d0ded4c0d9fa6df223155d18079c73bacbe63a5f3a9149c4bc43dc37b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:48.590308Z","signature_b64":"dnsqM7Gt9kXTzKrtwt/ReRPszp97TblKgWIVVQVnZlB10GUIliJ+/nq1Jqz31MWxQfS5MUU9bhvLI7HHbO44Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31a0ff26c25552c0a1ac73b7431a2a850dda86f8105eb215b9a78c14a70c40c0","last_reissued_at":"2026-05-18T02:51:48.589817Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:48.589817Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logspace computations in graph products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Jonathan Kausch, Volker Diekert","submitted_at":"2013-09-05T09:30:51Z","abstract_excerpt":"We consider three important and well-studied algorithmic problems in group theory: the word, geodesic, and conjugacy problem. We show transfer results from individual groups to graph products. We concentrate on logspace complexity because the challenge is actually in small complexity classes, only. The most difficult transfer result is for the conjugacy problem. We have a general result for graph products, but even in the special case of a graph group the result is new. Graph groups are closely linked to the theory of Mazurkiewicz traces which form an algebraic model for concurrent processes. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1290","kind":"arxiv","version":3},"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":"1309.1290","created_at":"2026-05-18T02:51:48.589901+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.1290v3","created_at":"2026-05-18T02:51:48.589901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1290","created_at":"2026-05-18T02:51:48.589901+00:00"},{"alias_kind":"pith_short_12","alias_value":"GGQP6JWCKVJM","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"GGQP6JWCKVJMBINM","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"GGQP6JWC","created_at":"2026-05-18T12:27:45.050594+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/GGQP6JWCKVJMBINMOO3UGGRKQU","json":"https://pith.science/pith/GGQP6JWCKVJMBINMOO3UGGRKQU.json","graph_json":"https://pith.science/api/pith-number/GGQP6JWCKVJMBINMOO3UGGRKQU/graph.json","events_json":"https://pith.science/api/pith-number/GGQP6JWCKVJMBINMOO3UGGRKQU/events.json","paper":"https://pith.science/paper/GGQP6JWC"},"agent_actions":{"view_html":"https://pith.science/pith/GGQP6JWCKVJMBINMOO3UGGRKQU","download_json":"https://pith.science/pith/GGQP6JWCKVJMBINMOO3UGGRKQU.json","view_paper":"https://pith.science/paper/GGQP6JWC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.1290&json=true","fetch_graph":"https://pith.science/api/pith-number/GGQP6JWCKVJMBINMOO3UGGRKQU/graph.json","fetch_events":"https://pith.science/api/pith-number/GGQP6JWCKVJMBINMOO3UGGRKQU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GGQP6JWCKVJMBINMOO3UGGRKQU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GGQP6JWCKVJMBINMOO3UGGRKQU/action/storage_attestation","attest_author":"https://pith.science/pith/GGQP6JWCKVJMBINMOO3UGGRKQU/action/author_attestation","sign_citation":"https://pith.science/pith/GGQP6JWCKVJMBINMOO3UGGRKQU/action/citation_signature","submit_replication":"https://pith.science/pith/GGQP6JWCKVJMBINMOO3UGGRKQU/action/replication_record"}},"created_at":"2026-05-18T02:51:48.589901+00:00","updated_at":"2026-05-18T02:51:48.589901+00:00"}