{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2BWT5LERRJRTZO6TZGXBNCM7NR","short_pith_number":"pith:2BWT5LER","schema_version":"1.0","canonical_sha256":"d06d3eac918a633cbbd3c9ae16899f6c5085ec2b78ebeddba9c2c1f6fe89408a","source":{"kind":"arxiv","id":"1101.3932","version":1},"attestation_state":"computed","paper":{"title":"Doubly biased Maker-Breaker Connectivity game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dan Hefetz, Milo\\v{s} Stojakovi\\'c, Mirjana Raki\\'c","submitted_at":"2011-01-20T15:31:56Z","abstract_excerpt":"In this paper we study the (a : b) Maker-Breaker Connectivity game, played on the edge-set of the complete graph on n vertices. We determine the winner for almost all values of a and b."},"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":"1101.3932","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-20T15:31:56Z","cross_cats_sorted":[],"title_canon_sha256":"fcfb217817fce411f2c3cef881d388b8bdbc7651b4fba7a53e20667c93e36dd1","abstract_canon_sha256":"07d9814b1939cbc0da565e8f9fa907aff36be7deee81b946899597d6e2bc5113"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:25.879218Z","signature_b64":"MfW7wVTrofw5EC4HE8Fb6VEB/jgZnT+soHfRy1y7UzZgBABlATvU72ywjF91/9e81jxyPjnVSRSVlY/hH8lzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d06d3eac918a633cbbd3c9ae16899f6c5085ec2b78ebeddba9c2c1f6fe89408a","last_reissued_at":"2026-05-18T01:09:25.878597Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:25.878597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Doubly biased Maker-Breaker Connectivity game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dan Hefetz, Milo\\v{s} Stojakovi\\'c, Mirjana Raki\\'c","submitted_at":"2011-01-20T15:31:56Z","abstract_excerpt":"In this paper we study the (a : b) Maker-Breaker Connectivity game, played on the edge-set of the complete graph on n vertices. We determine the winner for almost all values of a and b."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.3932","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":"1101.3932","created_at":"2026-05-18T01:09:25.878680+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.3932v1","created_at":"2026-05-18T01:09:25.878680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.3932","created_at":"2026-05-18T01:09:25.878680+00:00"},{"alias_kind":"pith_short_12","alias_value":"2BWT5LERRJRT","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2BWT5LERRJRTZO6T","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2BWT5LER","created_at":"2026-05-18T12:26:18.847500+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/2BWT5LERRJRTZO6TZGXBNCM7NR","json":"https://pith.science/pith/2BWT5LERRJRTZO6TZGXBNCM7NR.json","graph_json":"https://pith.science/api/pith-number/2BWT5LERRJRTZO6TZGXBNCM7NR/graph.json","events_json":"https://pith.science/api/pith-number/2BWT5LERRJRTZO6TZGXBNCM7NR/events.json","paper":"https://pith.science/paper/2BWT5LER"},"agent_actions":{"view_html":"https://pith.science/pith/2BWT5LERRJRTZO6TZGXBNCM7NR","download_json":"https://pith.science/pith/2BWT5LERRJRTZO6TZGXBNCM7NR.json","view_paper":"https://pith.science/paper/2BWT5LER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.3932&json=true","fetch_graph":"https://pith.science/api/pith-number/2BWT5LERRJRTZO6TZGXBNCM7NR/graph.json","fetch_events":"https://pith.science/api/pith-number/2BWT5LERRJRTZO6TZGXBNCM7NR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2BWT5LERRJRTZO6TZGXBNCM7NR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2BWT5LERRJRTZO6TZGXBNCM7NR/action/storage_attestation","attest_author":"https://pith.science/pith/2BWT5LERRJRTZO6TZGXBNCM7NR/action/author_attestation","sign_citation":"https://pith.science/pith/2BWT5LERRJRTZO6TZGXBNCM7NR/action/citation_signature","submit_replication":"https://pith.science/pith/2BWT5LERRJRTZO6TZGXBNCM7NR/action/replication_record"}},"created_at":"2026-05-18T01:09:25.878680+00:00","updated_at":"2026-05-18T01:09:25.878680+00:00"}