{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:N7VK7FMR3Y4BOTK7Y2FACV7NSC","short_pith_number":"pith:N7VK7FMR","canonical_record":{"source":{"id":"1501.05579","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-01-22T17:29:18Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"19efa2ffc3d0bee3c483feebece4c46f25590b91c63e7cc4aaa38be4c417aa0e","abstract_canon_sha256":"713a60d030c03ea479c942bfe81e98a246e75ce373d2ea2b83dab99f2022b98a"},"schema_version":"1.0"},"canonical_sha256":"6feaaf9591de38174d5fc68a0157ed9082ea5d208e9044f9120e12372256e562","source":{"kind":"arxiv","id":"1501.05579","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05579","created_at":"2026-05-18T01:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05579v2","created_at":"2026-05-18T01:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05579","created_at":"2026-05-18T01:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"N7VK7FMR3Y4B","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N7VK7FMR3Y4BOTK7","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N7VK7FMR","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:N7VK7FMR3Y4BOTK7Y2FACV7NSC","target":"record","payload":{"canonical_record":{"source":{"id":"1501.05579","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-01-22T17:29:18Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"19efa2ffc3d0bee3c483feebece4c46f25590b91c63e7cc4aaa38be4c417aa0e","abstract_canon_sha256":"713a60d030c03ea479c942bfe81e98a246e75ce373d2ea2b83dab99f2022b98a"},"schema_version":"1.0"},"canonical_sha256":"6feaaf9591de38174d5fc68a0157ed9082ea5d208e9044f9120e12372256e562","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:32.679955Z","signature_b64":"2RA9zTma8E5tzXBo3rwROZYDQt8gc8rOmh60BFIzo5xgseTNvtGe4sJXkIO2fQ8/V/gkqZtZMvIekle/88BSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6feaaf9591de38174d5fc68a0157ed9082ea5d208e9044f9120e12372256e562","last_reissued_at":"2026-05-18T01:15:32.679214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:32.679214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.05579","source_version":2,"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:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UJ6ZLJ+Gq+Z10otcli+wC+fc41ScqtOr1ofL9Dt6UIFqIgC9KOJSOLBXa+tl+mRa3q7Z5uN+Q1G7RSbPF7T9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:22:22.794163Z"},"content_sha256":"88d5dee0e9d009c3cbe9e7b1a6cea733359339e4740e0496ac3060a4b4d9edcd","schema_version":"1.0","event_id":"sha256:88d5dee0e9d009c3cbe9e7b1a6cea733359339e4740e0496ac3060a4b4d9edcd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:N7VK7FMR3Y4BOTK7Y2FACV7NSC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.GR","authors_text":"Alexei G. Myasnikov, Armin Wei{\\ss}, Volker Diekert","submitted_at":"2015-01-22T17:29:18Z","abstract_excerpt":"In various occasions the conjugacy problem in finitely generated amalgamated products and HNN extensions can be decided efficiently for elements which cannot be conjugated into the base groups. This observation asks for a bound on how many such elements there are. Such bounds can be derived using the theory of amenable graphs:\n  In this work we examine Schreier graphs of amalgamated products and HNN extensions. For an amalgamated product $G = H *_A K $ with $[H:A] \\geq [K:A] \\geq 2$, the Schreier graph with respect to $H$ or $K$ turns out to be non-amenable if and only if $[H:A] \\geq 3$. Moreo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05579","kind":"arxiv","version":2},"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:15:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XeqQ9MMBRVMaUUU6wGL04Mgt0aL3Q1fyumFATZh4ZxllxWLmZdm63BnJcT7fQsR92ZkhvXfKmnJjaDBg7efTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:22:22.794659Z"},"content_sha256":"a8aba003f9a106856727d88741927657b932fb9c773ccb6d7cc0374de8a9e4dd","schema_version":"1.0","event_id":"sha256:a8aba003f9a106856727d88741927657b932fb9c773ccb6d7cc0374de8a9e4dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N7VK7FMR3Y4BOTK7Y2FACV7NSC/bundle.json","state_url":"https://pith.science/pith/N7VK7FMR3Y4BOTK7Y2FACV7NSC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N7VK7FMR3Y4BOTK7Y2FACV7NSC/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-05-27T03:22:22Z","links":{"resolver":"https://pith.science/pith/N7VK7FMR3Y4BOTK7Y2FACV7NSC","bundle":"https://pith.science/pith/N7VK7FMR3Y4BOTK7Y2FACV7NSC/bundle.json","state":"https://pith.science/pith/N7VK7FMR3Y4BOTK7Y2FACV7NSC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N7VK7FMR3Y4BOTK7Y2FACV7NSC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:N7VK7FMR3Y4BOTK7Y2FACV7NSC","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":"713a60d030c03ea479c942bfe81e98a246e75ce373d2ea2b83dab99f2022b98a","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-01-22T17:29:18Z","title_canon_sha256":"19efa2ffc3d0bee3c483feebece4c46f25590b91c63e7cc4aaa38be4c417aa0e"},"schema_version":"1.0","source":{"id":"1501.05579","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05579","created_at":"2026-05-18T01:15:32Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05579v2","created_at":"2026-05-18T01:15:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05579","created_at":"2026-05-18T01:15:32Z"},{"alias_kind":"pith_short_12","alias_value":"N7VK7FMR3Y4B","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"N7VK7FMR3Y4BOTK7","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"N7VK7FMR","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:a8aba003f9a106856727d88741927657b932fb9c773ccb6d7cc0374de8a9e4dd","target":"graph","created_at":"2026-05-18T01:15:32Z","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":"In various occasions the conjugacy problem in finitely generated amalgamated products and HNN extensions can be decided efficiently for elements which cannot be conjugated into the base groups. This observation asks for a bound on how many such elements there are. Such bounds can be derived using the theory of amenable graphs:\n  In this work we examine Schreier graphs of amalgamated products and HNN extensions. For an amalgamated product $G = H *_A K $ with $[H:A] \\geq [K:A] \\geq 2$, the Schreier graph with respect to $H$ or $K$ turns out to be non-amenable if and only if $[H:A] \\geq 3$. Moreo","authors_text":"Alexei G. Myasnikov, Armin Wei{\\ss}, Volker Diekert","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-01-22T17:29:18Z","title":"Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05579","kind":"arxiv","version":2},"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:88d5dee0e9d009c3cbe9e7b1a6cea733359339e4740e0496ac3060a4b4d9edcd","target":"record","created_at":"2026-05-18T01:15:32Z","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":"713a60d030c03ea479c942bfe81e98a246e75ce373d2ea2b83dab99f2022b98a","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-01-22T17:29:18Z","title_canon_sha256":"19efa2ffc3d0bee3c483feebece4c46f25590b91c63e7cc4aaa38be4c417aa0e"},"schema_version":"1.0","source":{"id":"1501.05579","kind":"arxiv","version":2}},"canonical_sha256":"6feaaf9591de38174d5fc68a0157ed9082ea5d208e9044f9120e12372256e562","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6feaaf9591de38174d5fc68a0157ed9082ea5d208e9044f9120e12372256e562","first_computed_at":"2026-05-18T01:15:32.679214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:32.679214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2RA9zTma8E5tzXBo3rwROZYDQt8gc8rOmh60BFIzo5xgseTNvtGe4sJXkIO2fQ8/V/gkqZtZMvIekle/88BSDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:32.679955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.05579","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88d5dee0e9d009c3cbe9e7b1a6cea733359339e4740e0496ac3060a4b4d9edcd","sha256:a8aba003f9a106856727d88741927657b932fb9c773ccb6d7cc0374de8a9e4dd"],"state_sha256":"3ab532a81644e20a9d7a033c1b26eea1523127be8c3423711b90998d19c11a52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ThAY8fpBXCxNrFfxgFQWoTZb28XAEXgWSPE/7rQJEBzSpVjDVaBRTIxXcfAsEu/EzD275+hLK9oN/70OVmOoCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:22:22.798135Z","bundle_sha256":"8c3845ca831f0da94e875394ccd7e5d78b86f5aba6f7738d523b112c72b4f59f"}}